Automatic Validation of Transformation Rules for Java Verification against a Rewriting Semantics
Saved in:
| Title: | Automatic Validation of Transformation Rules for Java Verification against a Rewriting Semantics |
|---|---|
| Authors: | Ahrendt, Wolfgang, 1967, Roth, Andreas, Sasse, Ralf |
| Source: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). LNCS 3835:412-426 |
| Subject Terms: | program logic, programming language semantics, Java |
| Description: | 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. |
| Access URL: | https://research.chalmers.se/publication/10221 |
| Database: | SwePub |
Nájsť tento článok vo Web of Science | Abstract: | 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. |
|---|---|
| ISBN: | 354030553X 9783540305538 |
| ISSN: | 16113349 03029743 |
| DOI: | 10.1007/11591191_29 |