UU - PDFSEARCH.IO - Document Search Engine

UU
Results: 9000

#	Item
1	Outline SMT: Where Do We Go From Here? Clark Barrett, New York University SMT Workshop, July 17, 2014 Add to Reading List Source URL: smt2014.it.uu.se Language: English - Date: 2014-07-21 06:41:07 Theoretical computer science Mathematics Computational complexity theory Logic in computer science NP-complete problems Electronic design automation Formal methods Constraint programming Satisfiability modulo theories Boolean satisfiability problem Solver Automated reasoning
2	Introduction Background, Theory Validating Squolem’s Certificates in HOL4 Evaluation Conclusions Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2010-06-02 16:25:19 Logic Mathematical logic Mathematics Boolean algebra Complexity classes Metalogic Model theory True quantified Boolean formula Satisfiability FO PSPACE-complete Well-formed formula
3	Introduction Translation Caveats Conclusions SMT Solvers: New Oracles for the Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2009-11-02 16:44:58
4	Introduction Translation Caveats Conclusions SMT Solvers: New Oracles for the Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2009-11-14 10:24:00 Theoretical computer science Mathematical logic Logic Logic in computer science Formal methods Automated theorem proving Model theory NP-complete problems Satisfiability modulo theories Proof assistant First-order logic Solver
5	Leveraging Linear and Mixed Integer Programming for SMT Tim King1 Clark Barrett1 1 New Add to Reading List Source URL: smt2014.it.uu.se Language: English - Date: 2014-07-20 11:35:02
6	Bounded Model Generation for Isabelle/HOL Using a SAT Solver Tjark Weber Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2005-09-13 07:35:24 Mathematical logic Type theory Computability theory Lambda calculus Theoretical computer science Model theory Higher-order logic Constructible universe Mathematics
7	Introduction System Description Evaluation Conclusions, Future Work Efficiently Checking Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2006-11-16 07:15:36 Proof assistants Logic in computer science Theoretical computer science Mathematical logic Isabelle HOL Logic for Computable Functions
8	C/C++ Concurrency: Formalization and Model Finding Mark Batty Jasmin Blanchette Susmit Sarkar Peter Sewell Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2013-09-25 05:49:39 Computing Computer programming Concurrent computing Concurrency control Parallel computing Thread Linearizability C++11 POSIX Threads Lock Concurrency Go
9	Integrating a SAT Solver with an LCF-style Theorem Prover A Fast Decision Procedure for Propositional Logic for the Isabelle System Tjark Weber Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2005-09-13 07:36:26 Proof assistants Theoretical computer science Logic in computer science Mathematical logic Isabelle Logic for Computable Functions Mathematics Resolution Constructible universe Theorem prover LCF Formal methods
10	raSAT: SMT for Polynomial Inequality To Van Khanh (UET/VNU-HN) Vu Xuan Tung, Mizuhito Ogawa (JAIST Add to Reading List Source URL: smt2014.it.uu.se Language: English - Date: 2014-07-19 03:22:32 Algebra Polynomial RASAT Inequality NP-complete problems