Inductive Theorem Proving by Program Specialisation: Generating Proofs for Isabelle Using Ecce

Abstract In this paper we discuss the similarities between program specialisation and inductive theorem proving, and then show how program specialisation can be used to perform inductive theorem proving. We then study this relationship in more detail for a particular class of problems (verifying infinite state Petri nets) in order to establish a clear link between program specialisation and inductive theorem proving. In particular, we use the program specialiser ecce to generate specifications, hypotheses and proof scripts in the theory format of the proof assistant Isabelle. Then, in many cases, Isabelle can automatically execute these proof scripts and thereby verify the soundness of ecce ’s verification process and of the correspondence between program specialisation and inductive theorem proving.

Authors

• Helko Lehmann
• Michael Leuschel

Keywords

No keywords are indexed for this paper.