A Case Study in Formal Verification Using Multiple Explicit Heaps

In the context of the Key program verifier and the associated dynamic logic for Java the authors discuss the first instance of applying a generalized approach to the treatment of memory heaps in verification. Namely, they allow verified programs to simultaneously modify several different, but possibly location sharing, heaps. In this paper they detail this approach using the Java card atomic transactions mechanism, the modeling of which requires two heaps to be considered simultaneously - the basic and the transaction backup heap.

Provided by: IFIP Topic: Security Date Added: Apr 2013 Format: PDF

Find By Topic