Testing a Saturation-Based Theorem Prover: Experiences and Challenges

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10375)

Abstract

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.

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.University of ManchesterManchesterUK
  2. 2.TU WienViennaAustria
  3. 3.Chalmers University of TechnologyGothenburgSweden

Personalised recommendations