Testing a Saturation-Based Theorem Prover: Experiences and Challenges

@article{Reger2017TestingAS,
  title={Testing a Saturation-Based Theorem Prover: Experiences and Challenges},
  author={Giles Reger and Martin Suda and Andrei Voronkov},
  journal={ArXiv},
  year={2017},
  volume={abs/1704.03391}
}
  • Giles Reger, Martin Suda, Andrei Voronkov
  • Published 2017
  • Computer Science
  • ArXiv
  • 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. 

    Figures and Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-2 OF 2 CITATIONS

    Checkable Proofs for First-Order Theorem Proving

    VIEW 1 EXCERPT
    CITES METHODS

    References

    Publications referenced by this paper.