Java Language Specification, Second Edition: The Java Series
Java Language Specification, Second Edition: The Java Series
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
A Dynamic Logic for the Formal Verification of Java Card Programs
JavaCard '00 Revised Papers from the First International Workshop on Java on Smart Cards: Programming and Security
Proving Correctness of JavaCard DL Taclets using Bali
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
The rewriting logic semantics project
Theoretical Computer Science
Java+ITP: A Verification Tool Based on Hoare Logic and Algebraic Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Ensuring the Correctness of Lightweight Tactics for JavaCard Dynamic Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
A rewriting logic approach to operational semantics
Information and Computation
Prototyping 3APL in the Maude term rewriting language
CLIMA VII'06 Proceedings of the 7th international conference on Computational logic in multi-agent systems
The rewriting logic semantics project: a progress report
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
The rewriting logic semantics project: A progress report
Information and Computation
Hi-index | 0.00 |
This paper presents a methodology for automatically validating program transformation rules that are part of a calculus for Java source code verification. We target the Java Dynamic Logic calculus which is implemented in the interactive prover of the KeY system. As a basis for validation, we take an existing SOS style rewriting logic semantics for Java, formalized in the input language of the Maude system. That semantics is ‘lifted’ to cope with schematic programs like the ones appearing in program transformation rules. The rewriting theory is further extended to generate valid initial states for involved program fragments, and to check the final states for equivalence. The result is used in frequent validation runs over the relevant fragment of the calculus in the KeY system.