1405.3623v1.pdf (374.59 kB)
Download file

Mining state-based models from proof corpora

Download (374.59 kB)
conference contribution
posted on 07.10.2014, 14:53 by Thomas Gransden, Neil Walkinshaw, Rajeev Raman
Interactive theorem provers have been used extensively to reason about various software/hardware systems and mathematical theorems. The key challenge when using an interactive prover is finding a suitable sequence of proof steps that will lead to a successful proof requires a significant amount of human intervention. This paper presents an automated technique that takes as input examples of successful proofs and infers an Extended Finite State Machine as output. This can in turn be used to generate proofs of new conjectures. Our preliminary experiments show that the inferred models are generally accurate (contain few false-positive sequences) and that representing existing proofs in such a way can be very useful when guiding new ones.

History

Citation

Proceeding of CICM 2014, Coimbra, Portugal, July 7-11, 2014, Lecture Notes in Computer Science (Intelligent Computer Mathematics) 8543 LNAI, pp. 282-297

Author affiliation

/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer Science

Source

International Conference, CICM 2014, Coimbra, Portugal, July 7-11, 2014.

Version

AM (Accepted Manuscript)

Published in

Proceeding of CICM 2014

Publisher

Springer International Publishing

issn

0302-9743

isbn

978-3-319-08433-6;978-3-319-08434-3

Copyright date

2014

Available date

01/07/2015

Publisher version

http://link.springer.com/chapter/10.1007/978-3-319-08434-3_21

Language

en

Usage metrics

Categories

Keywords

Exports