Automatic Validation of Transformation Rules for Java Verification Against a Rewriting Semantics

  • Wolfgang Ahrendt
  • Andreas Roth
  • Ralf Sasse
Conference paper

DOI: 10.1007/11591191_29

Volume 3835 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Ahrendt W., Roth A., Sasse R. (2005) Automatic Validation of Transformation Rules for Java Verification Against a Rewriting Semantics. In: Sutcliffe G., Voronkov A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2005. Lecture Notes in Computer Science, vol 3835. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Wolfgang Ahrendt
    • 1
  • Andreas Roth
    • 2
  • Ralf Sasse
    • 3
  1. 1.Chalmers University of TechnologyGöteborgSweden
  2. 2.Universität KarlsruheGermany
  3. 3.University of Illinois at Urbana-ChampaignUSA