Java+ITP: A Verification Tool Based on Hoare Logic and Algebraic Semantics

Sasse, Ralf; Meseguer, José

Permalink

https://hdl.handle.net/2142/11159 Copy

Description

Title

Java+ITP: A Verification Tool Based on Hoare Logic and Algebraic Semantics

Author(s)

• Sasse, Ralf
• Meseguer, José

Issue Date

2006-02

Keyword(s)

programming languages

Abstract

Java+ITP is an experimental tool for the verification of properties of a sequential imperative subset of the Java language. It is based on an algebraic continuation passing style (CPS) semantics of this fragment as an equational theory in Maude. It supports compositional reasoning in a Hoare logic for this Java fragment that we propose and prove correct with respect to the algebraic semantics. After being decomposed, Hoare triples are translated into semantically equivalent first-order verification conditions (VCs) which are then sent to Maude's Inductive Theorem Prover (ITP) to be discharged. The long-term goal of this project is to use extensible and modular rewriting logic semantics of programming languages, for which CPS axiomatizations are indeed very useful, to develop similarly extensible and modular Hoare logics on which generic program verification tools can be based.

Type of Resource

text

Permalink

http://hdl.handle.net/2142/11159

Copyright and License Information

You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).

Owning Collections