A Program Logic for Handling Java Card's Transaction Mechanism
Paper in 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

Author

Bernhard Beckert

Wojciech Mostowski

Chalmers, Department of Computing Science

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 2621 246-260
3-540-00899-3 (ISBN)

Subject Categories

Computer and Information Science

DOI

10.1007/3-540-36578-8_18

ISBN

3-540-00899-3

More information

Created

10/6/2017