Date: 2017-07-31 05:29:21Theoretical 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 3Add to Reading ListSource URL: www.cs.man.ac.ukDownload Document from Source Website File Size: 163,27 KBShare Document on Facebook
|