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

	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
	Rule Formats for Nominal Operational Semantics A very short and informal introduction Luca Aceto Gran Sasso Science Institute, L’Aquila, and ICE-TCS, School of Computer Science, Reykjavik University DocID: 1xVWR - View Document
	Stochastic Model Checking? Marta Kwiatkowska, Gethin Norman, and David Parker School of Computer Science, University of Birmingham Edgbaston, Birmingham B15 2TT, United Kingdom Abstract. This tutorial presents an overvi DocID: 1xVOF - View Document
	Operator Counting Heuristics for Probabilistic Planning Felipe Trevizan, Sylvie Thi´ebaux, Patrik Haslum Data61, CSIRO and Research School of Computer Science, Australian National University Abstr DocID: 1xVMg - View Document
	Data Preference Matters: A New Perspective of Safety Data Dissemination in Vehicular Ad Hoc Networks Qiao Xiang1 , Xi Chen1, Linghe Kong1 , Lei Rao2 , Xue Liu1 1 School of Computer Science, McGill University, Canada, 2 DocID: 1xVdq - View Document