Details

Autor(en) / Beteiligte

• Mostowski, Wojciech
• Boreale, Michele
• Beyer, Dirk

Titel

A Case Study in Formal Verification Using Multiple Explicit Heaps

Ist Teil von

• Formal Techniques for Distributed Systems, p.20-34

Ort / Verlag

Berlin, Heidelberg: Springer Berlin Heidelberg

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• In the context of the KeY program verifier and the associated Dynamic Logic for Java we discuss the first instance of applying a generalised approach to the treatment of memory heaps in verification. Namely, we allow verified programs to simultaneously modify several different, but possibly location sharing, heaps. In this paper we detail this approach using the Java Card atomic transactions mechanism, the modelling of which requires two heaps to be considered simultaneously – the basic and the transaction backup heap. Other scenarios where multiple heaps emerge are verification of real-time Java programs, verification of distributed systems, modelling of multi-core systems, or modelling of permissions in concurrent reasoning that we currently investigate for KeY. On the implementation side, we modified the KeY verifier to provide a general framework for dealing with multiple heaps, and we used that framework to implement the formalisation of Java Card atomic transactions. Commonly, a formal specification language, such as JML, hides the notion of the heap from the user. In our approach the heap becomes a first class parameter (yet transparent in the default verification scenarios) also on the level of specifications.