UU - PDFSEARCH.IO - Document Search Engine

UU
Results: 9000

#	Item
41	Designing Proof Formats A User’s Perspective Sascha B¨ ohme Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2011-08-05 14:21:30 Mathematical logic Theoretical computer science Software Formal methods Proof assistants Automated theorem proving Mathematical proof First-order logic Proof True quantified Boolean formula Frama-C Type theory
42	Introduction Applications SMT Solver Use Algorithms Conclusion Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2012-01-31 09:21:20 Theoretical computer science Logic in computer science Formal methods Mathematics Electronic design automation NP-complete problems Satisfiability modulo theories Boolean satisfiability problem Solver Formal verification Model checking SMT
43	Satisfiability Modulo Theories Tjark Weber Oberseminar Statische Analyse November 11, 2004 Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2005-09-13 07:35:54 Theoretical computer science Logic Logic in computer science Mathematical logic Model theory Electronic design automation Formal methods NP-complete problems Satisfiability
44	Proposed Internal Kick-Off Meeting Agenda Add to Reading List Source URL: smt2014.it.uu.se Language: English - Date: 2014-07-19 03:53:29 Electronic design automation Formal methods Logic in computer science NP-complete problems
45	A SAT-based Sudoku Solver Tjark Weber Club2, November 23rd, 2005 Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2005-11-23 11:15:52 Logic puzzles Sudoku Recreational mathematics Abstract strategy games NP-complete problems Mathematics Logic
46	Introduction Thereand Back Again Conclusions Integration of SMT Solvers with ITPs — Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2010-05-06 15:21:08 Theoretical computer science Logic in computer science Logic Formal methods Mathematics Automated theorem proving Metalogic Proof assistants Satisfiability modulo theories Solver Z3 Satisfiability
47	Introduction SAT Solvers Satisfiability Modulo Theories Conclusions Integrating SAT and SMT Solvers Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2009-09-10 10:56:53 Theoretical computer science Logic Mathematics Formal methods Logic in computer science Boolean algebra Electronic design automation NP-complete problems Boolean satisfiability problem Satisfiability modulo theories Solver Propositional calculus
48	Satisfiability Modulo Theories and the SMT Competition Tjark Weber March 29, 2017 Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2017-04-04 10:36:24 Theoretical computer science Logic in computer science Computational complexity theory Mathematics Electronic design automation Formal methods NP-complete problems Combinatorial optimization Satisfiability modulo theories Boolean satisfiability problem Job shop scheduling SMT
49	TEKNATTeknisknaturvetenskaplig fakultets riktlinjer för omtentamina Add to Reading List Source URL: www.teknat.uu.se Language: Swedish - Date: 2017-09-26 02:54:21
50	Weakly Equivalent Arrays J¨ urgen Christ Jochen Hoenicke Add to Reading List Source URL: smt2014.it.uu.se Language: English - Date: 2014-07-19 03:23:04 Software engineering Computing Computer programming Array data type Array data structure D

UPDATE