๐ฎ
๐ฎ
The Ethereal
Testing a Saturation-Based Theorem Prover: Experiences and Challenges (Extended Version)
April 11, 2017 ยท The Ethereal ยท ๐ TAP@STAF
"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 Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Logic in CS
๐ฎ
๐ฎ
The Ethereal
Safe Reinforcement Learning via Shielding
๐ฎ
๐ฎ
The Ethereal
Formal Verification of Piece-Wise Linear Feed-Forward Neural Networks
๐ฎ
๐ฎ
The Ethereal
Heterogeneous substitution systems revisited
๐ฎ
๐ฎ
The Ethereal
Omega-Regular Objectives in Model-Free Reinforcement Learning
๐ฎ
๐ฎ
The Ethereal