First Page | Document Content | |
---|---|---|
Date: 2017-07-21 11:03:15Theoretical computer science Mathematics Formal methods Mathematical logic Logic in computer science Electronic design automation NP-complete problems Boolean algebra Satisfiability modulo theories Coq Solver Proof assistant | SMTCoq: A plug-in for integrating SMT solvers into Coq? Burak Ekici1 , Alain Mebsout1 , Cesare Tinelli1 , Chantal Keller2 , Guy Katz3 , Andrew Reynolds1 , and Clark Barrett3 tAdd to Reading ListSource URL: mebsout.github.ioDownload Document from Source WebsiteFile Size: 231,02 KBShare 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 |