Testing a Saturation-Based Theorem Prover: Experiences and Challenges Giles Reger1 , Martin Suda2 , and Andrei Voronkov1,2 1 School of Computer Science, University of Manchester, UK

First Page		Document Content
Date: 2017-07-31 12:00:20 Theoretical computer science Formal methods Mathematical logic School of Computer Science University of Manchester Mathematics Logic in computer science Automated theorem proving Formal verification SPASS Andrei Voronkov Vampire First-order logic		Testing a Saturation-Based Theorem Prover: Experiences and Challenges Giles Reger1 , Martin Suda2 , and Andrei Voronkov1,2 1 School of Computer Science, University of Manchester, UK Add to Reading List Source URL: www.cs.man.ac.uk Download Document from Source Website File Size: 3,37 MB Share Document on Facebook

	A Story of Parametric Trace Slicing, Garbage and Static Analysis Giles Reger School of Computer Science, University of Manchester, UK PrePost 2017 DocID: 1xW3e - View Document
	A Pattern-Based Approach to Parametric Specification Mining Giles Reger, Howard Barringer, and David Rydeheard University of Manchester, UK Abstract. This paper presents a technique for mining parametric temporal specifi DocID: 1xVZ6 - View Document
	Cooperating Proof Attempts Giles Reger, Dmitry Tishkovsky, and Andrei Voronkov ? University of Manchester, Manchester, UK Abstract. This paper introduces a pseudo-concurrent architecture for first-order saturation-based DocID: 1xVvH - View Document
	AVATAR Modulo Theories Nikolaj Bjøner1 Giles Reger2 Martin Suda3 Andrei Voronkov2,4,5 1 Microsoft Research, Redmond, USA University of Manchester, Manchester, UK DocID: 1xVvf - View Document
	Considering Typestate Verification for Quantified Event Automata Giles Reger University of Manchester, Manchester, UK ISoLa 2016 – Corfu, October 13, 2016 DocID: 1xVfi - View Document