Testing a Saturation-Based Theorem Prover: Experiences and Challenges? Giles Reger1 , Martin Suda2 , and Andrei Voronkov1,3,4 1 3

First Page		Document Content
Date: 2017-07-31 05:29:21 Theoretical computer science Formal methods Mathematics Logic in computer science Mathematical logic Automated theorem proving School of Computer Science University of Manchester Automated reasoning Formal verification E theorem prover IP Satisfiability modulo theories		Testing a Saturation-Based Theorem Prover: Experiences and Challenges? Giles Reger1 , Martin Suda2 , and Andrei Voronkov1,3,4 1 3 Add to Reading List Source URL: www.cs.man.ac.uk Download Document from Source Website File Size: 163,27 KB Share Document on Facebook

	Model-Based API Testing for SMT Solvers∗ Aina Niemetz, Mathias Preiner, and Armin Biere Institute for Formal Models and Verification Johannes Kepler University, Linz, Austria Abstract DocID: 1xVj1 - View Document
	Randomized Differential Testing as a Prelude to Formal Verification Alex Groce, Gerard Holzmann, and Rajeev Joshi Laboratory for Reliable Software ∗ Jet Propulsion Laboratory California Institute of Technology Pasadena DocID: 1xVf0 - View Document
	Formal Methods in System Design manuscript No. (will be inserted by the editor) Automatic Verification of Competitive Stochastic Systems Taolue Chen · Vojtˇ DocID: 1xUrV - View Document
	Verification of Annotated Models from Executions ABSTRACT Simulations can help enhance confidence in system designs but they provide almost no formal guarantees. In this paper, we present a simulation-based verification DocID: 1xTNp - View Document
	Verifiable Autonomy Michael Fisher University of Liverpool, 11th September 2015 Formal Verification DocID: 1xTyY - View Document