Ensuring the Correctness of Lightweight Tactics for JavaCard Dynamic Logic

Authors:
Richard Bubel;Andreas Roth;Philipp Rümmer
Affiliations:
Institut für Logik, Komplexität und Deduktionssysteme, Universität Karlsruhe, Germany;Institut für Logik, Komplexität und Deduktionssysteme, Universität Karlsruhe, Germany;Department of Computer Science and Engineering, Chalmers University of Technology & Gööteborg University, Sweden
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 5
Cited 0

Reasoning about Java classes: preliminary report

Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Proof Reuse for Deductive Program Verification

SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Proving Correctness of JavaCard DL Taclets using Bali

SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Taclets and the KeY Prover

Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic validation of transformation rules for java verification against a rewriting semantics

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

The interactive theorem prover developed in the KeY project, which implements a sequent calculus for JavaCard Dynamic Logic (JavaCardDL) is based on taclets. Taclets are lightweight tactics with easy to master syntax and semantics. Adding new taclets to the calculus is quite simple, but poses correctness problems. We present an approach how derived (non-axiomatic) taclets for JavaCardDL can be proven sound in JavaCardDL itself. Together with proof management facilities, our concept allows the safe introduction of new derived taclets while preserving the soundness of the calculus.