Inductive theorem proving by program specialisation: Generating proofs for Isabelle using Ecce (Invited talk)

Lehmann, Helko and Leuschel, Michael (2003) Inductive theorem proving by program specialisation: Generating proofs for Isabelle using Ecce (Invited talk). Bruynooghe, Maurice (ed.) Symposium on Logic Based Program Synthesis and Transformation, LOPSTR 2003, , Uppsala, Sweden. pp. 1-18 .

Record type: Conference or Workshop Item (Paper)

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.

Text

itp_lopstr03.pdf - Other

Download (247kB)

Text

itp_lopstr03_final.pdf - Other

Download (274kB)

More information

Published date: 2003

Additional Information: Preproceedings published as KU Leuven Technical Report CW365, final proceedings to appear in LNCS, Springer-Verlag Event Dates: August 2003

Venue - Dates: Symposium on Logic Based Program Synthesis and Transformation, LOPSTR 2003, , Uppsala, Sweden, 2003-08-01

Keywords: Theorem Proving, Induction, Program Specialisation, Partial Evaluation, Logic Programming, Isabelle, Petri nets, Model Checking

Learn more about Electronics & Computer Science research