Mining State-Based Models from Proof Corpora
Abstract
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.
Cite
@article{arxiv.1405.3623,
title = {Mining State-Based Models from Proof Corpora},
author = {Thomas Gransden and Neil Walkinshaw and Rajeev Raman},
journal= {arXiv preprint arXiv:1405.3623},
year = {2014}
}
Comments
To Appear at Conferences on Intelligent Computer Mathematics 2014