Extending Sledgehammer with SMT Solvers Jasmin Christian Blanchette1,? , Sascha Böhme1 , and Lawrence C. Paulson2 1 Institut für Informatik, Technische Universität München, Germany 2 Computer Laboratory, University o

First Page		Document Content
Date: 2013-06-03 12:43:37 Logic in computer science Automated theorem proving Formal methods Constraint programming Reasoning Satisfiability Modulo Theories Proof assistant E theorem prover Isabelle Theoretical computer science Applied mathematics Mathematics		Extending Sledgehammer with SMT Solvers Jasmin Christian Blanchette1,? , Sascha Böhme1 , and Lawrence C. Paulson2 1 Institut für Informatik, Technische Universität München, Germany 2 Computer Laboratory, University o Add to Reading List Source URL: www21.in.tum.de Download Document from Source Website File Size: 146,73 KB Share Document on Facebook

	Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of view DocID: 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/tcs DocID: 1xUr4 - View Document
	Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingen DocID: 1xTuz - View Document
	CS 153 Current Topics in Theoretical Computer Science Spring 2016 DocID: 1vryF - View Document