Testing a saturation-based theorem prover: Experiences and challenges
Paper i proceeding, 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.

Författare

G. Reger

University of Manchester

M. Suda

Technische Universitat Wien

Andrei Voronkov

Formella metoder

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 10375 LNCS 152-161

Ämneskategorier

Data- och informationsvetenskap

DOI

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

ISBN

978-331961466-3