A Program Logic for Handling Java Card's Transaction Mechanism
Paper i proceeding, 2003

In this paper we extend a program logic for verifying Java Card applications by introducing a "throughout" operator that allows us to prove "strong" invariants. Strong invariants can be used to ensure "rip out" properties of Java Card programs (properties that are to be maintained in case of unexpected termination of the program). Along with introducing the "throughout" operator, we show how to handle the Java Card transaction mechanism (and, thus, conditional assignments) in our logic. We present sequent calculus rules for the extended logic.

Java Card

formal verification

object-oriented programming

atomic transactions

Dynamic Logic

Java

formal specification

Författare

Bernhard Beckert

Wojciech Mostowski

Chalmers, Institutionen för datavetenskap

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 2621 246-260

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1007/3-540-36578-8_18

ISBN

3-540-00899-3

Mer information

Skapat

2017-10-06