2000 character limit reached
Testing a Saturation-Based Theorem Prover: Experiences and Challenges (Extended Version) (1704.03391v1)
Published 11 Apr 2017 in cs.LO and cs.SE
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.