SEPIA: search for proofs using inferred automata

From MaRDI portal
Publication:3454097

DOI10.1007/978-3-319-21401-6_16zbMATH Open1465.68284arXiv1505.07987OpenAlexW1581101260MaRDI QIDQ3454097FDOQ3454097


Authors: Thomas Gransden, Neil Walkinshaw, Rajeev Raman Edit this on Wikidata


Publication date: 2 December 2015

Published in: Automated Deduction - CADE-25 (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1505.07987




Recommendations




Cites Work


Cited In (10)

Uses Software





This page was built for publication: SEPIA: search for proofs using inferred automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454097)