Summary: Automatic Validation of
Transformation Rules for Java Verification
against a Rewriting Semantics
Wolfgang Ahrendt1
, Andreas Roth2
, and Ralf Sasse3
1
Chalmers University of Technology, G¨oteborg, Sweden,
ahrendt@cs.chalmers.se
2
Universit¨at Karlsruhe, Germany,
aroth@ira.uka.de
3
University of Illinois at Urbana-Champaign, USA,
rsasse@uiuc.edu
Abstract. This paper presents a methodology for automatically val-
idating program transformation rules that are part of a calculus for
Java source code verification. We target the Java Dynamic Logic cal-
culus which is implemented in the interactive prover of the KeY system.
As a basis for validation, we take an existing SOS style rewriting logic

Source: Ahrendt, Wolfgang - Department of Computer Science and Engineering, Chalmers University of Technology

Collections: Computer Technologies and Information Sciences