Testing a Saturation-Based Theorem Prover: Experiences and Challenges (Extended Version)

April 11, 2017 ยท The Ethereal ยท ๐Ÿ› TAP@STAF

๐Ÿ”ฎ THE ETHEREAL: The Ethereal
Pure theory โ€” exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Giles Reger, Martin Suda, Andrei Voronkov arXiv ID 1704.03391 Category cs.LO: Logic in CS Cross-listed cs.SE Citations 5 Venue TAP@STAF Last Checked 5 months ago
Abstract
This paper attempts to address the question of how best to assure the correctness of saturation-based automated theorem provers using our experience developing the theorem prover Vampire. We describe the techniques we currently employ to ensure that Vampire is correct and use this to motivate future challenges that need to be addressed to make this process more straightforward and to achieve better correctness guarantees.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Logic in CS