This paper describes SEPIA, a tool for automated proof generation in Coq. SEPIA combines model inference with interactive theorem proving. Existing proof corpora are modelled using state-based models inferred from tactic sequences. These can then be traversed automatically to identify proofs. The SEPIA system is described and its performance evaluated on three Coq datasets. Our results show that SEPIA provides a useful complement to existing automated tactics in Coq.
CITATION STYLE
Gransden, T., Walkinshaw, N., & Raman, R. (2015). SEPIA: Search for proofs using inferred automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9195, pp. 246–255). Springer Verlag. https://doi.org/10.1007/978-3-319-21401-6_16
Mendeley helps you to discover research relevant for your work.