A Language Framework for Expressing Checkable Properties of Dynamic Software

Abstract. The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it easier to experiment with mechanized formal methods such as theorem provers, proof checkers and model checkers. In this paper we will attempt to give convincing arguments for why we believe it is time for the formal methods community to shift some of its attention towards the analysis of programs written in modern programming languages. In keeping with this philosophy we have developed a verification and testing environment for Java, called Java PathFinder (JPF), which integrates model checking, program analysis and testing. Part of this work has consisted of building a new Java Virtual Machine that interprets Java bytecode. JPF uses state compression to handle big states, and partial order and symmetry reduction, slicing, abstraction, and runtime analysis techniques to reduce the state space. JPF has been applied to a real-time avionics operating system developed at Honeywell, illustrating an intricate error, and to a model of a spacecraft controller, illustrating the combination of abstraction, runtime analysis, and slicing with model checking.

show abstract

“…In fact JPF supports all properties expressible in the BANDERA tool, the interested reader is referred to Corbett et al (2000b) for more detail.…”

Section: Language and Properties Supported The Jvmmentioning

confidence: 99%

Model checking programs

Visser

Havelund

Brat

et al. 2000

Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering

595

741

View full text Add to dashboard Cite

show abstract

“…To facilitate high-level formal reasoning, we introduce a collection of specification patterns, following the approach of the Bandera project [6].…”

Section: Specification Patternsmentioning

confidence: 99%

Compositional Verification of Secure Applet Interactions

Barthe

Gurov²,

Huisman

2002

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Abstract. Recent developments in mobile code and embedded systems have led to an increased interest in open platforms, i.e. platforms which enable different applications to interact in a dynamic environment. However, the flexibility of open platforms presents major difficulties for the (formal) verification of secure interaction between the different applications. To overcome these difficulties, compositional verification techniques are required. This paper presents a compositional approach to the specification and verification of secure applet interactions. This approach involves a compositional model of the interface behavior of applet interactions, a temporal logic property specification language, and a proof system for proving correctness of property decompositions. The usability of the approach is demonstrated on a realistic smartcard case study.

show abstract

“…A possible way to achieve this is to adopt some of the ideas discussed in [3], [6], [18], [19]. This will require an appropriate adaptation of the translation scheme.…”

Section: Discussionmentioning

confidence: 99%

“…This approach is used, for example, in a Statemate verification tool called ModelCertifier [16] that offers a rich library of pre-defined property patterns, where each pattern looks as a parameterized natural language sentence. Paper [6] introduces a language for pattern definition as a way to create extendable sets of property patterns. Sugar [19] provides several layers for property specification and verification; in particular, extended regular expressions are used to describe execution sequences on which temporal properties are checked.…”

Section: Introductionmentioning

confidence: 99%