Testing a saturation-based theorem prover: Experiences and challenges
Paper in proceedings, 2017

This paper attempts to address the question of how best to assure the correctness of saturation-based automated theorem provers using our experience with 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.

Author

G. Reger

University of Manchester

M. Suda

Vienna University of Technology

Andrei Voronkov

Chalmers, Computer Science and Engineering (Chalmers), Formal methods

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 10375 LNCS 152-161

Subject Categories

Computer and Information Science

DOI

10.1007/978-3-319-61467-0_10

More information

Latest update

1/15/2019