Automatic Validation of Transformation Rules for Java Verification against a Rewriting Semantics
Paper i proceeding, 2005

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.

program logic

programming language semantics

Java

Författare

Wolfgang Ahrendt

Chalmers, Data- och informationsteknik, Datavetenskap

Andreas Roth

Karlsruher Institut für Technologie (KIT)

Ralf Sasse

University of Illinois

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. LNCS 3835 412 - 426

Ämneskategorier

Datavetenskap (datalogi)

DOI

10.1007/11591191_29

ISBN

3-540-30553-X

Mer information

Senast uppdaterat

2018-07-04