First Page | Document Content | |
---|---|---|
Date: 2017-07-31 12:00:20Theoretical 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, UKAdd to Reading ListSource URL: www.cs.man.ac.ukDownload Document from Source WebsiteFile Size: 3,37 MBShare Document on Facebook |
Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of viewDocID: 1xVR3 - View Document | |
Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗DocID: 1xUAX - View Document | |
Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcsDocID: 1xUr4 - View Document | |
Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingenDocID: 1xTuz - View Document | |
CS 153 Current Topics in Theoretical Computer Science Spring 2016DocID: 1vryF - View Document |