UU - PDFSEARCH.IO - Document Search Engine

UU
Results: 9000

#	Item
31	Introduction Core Features Selected Extensions Conclusion Isabelle/HOL: Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2007-02-23 07:52:45 Theoretical computer science Proof assistants Logic in computer science Mathematics Mathematical logic Formal methods Isabelle HOL Automated theorem proving Ordinal number Theorem
32	Institutionsnamnet Motivering för omprövning av betyg på examen Namn: ____________________________________________________________________________ Kurskod: _________________ Kursnamn: _________________________________ Add to Reading List Source URL: www.teknat.uu.se - Date: 2017-09-13 09:11:46
33	Protocol log analysis with constraint programming Mats Carlsson Olga Grinchtein Justin Pearson Add to Reading List Source URL: smt2014.it.uu.se Language: English - Date: 2014-07-18 15:02:20 LTE Technology Mobile technology Wireless Software-defined radio Mobile telecommunications ENodeB System Architecture Evolution Telecommunications E-UTRA User equipment Mobility management
34	The C/C++ Memory Model: Overview and Formalization Mark Batty Jasmin Blanchette Susmit Sarkar Peter Sewell Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2015-05-22 10:51:47 Computing Software engineering Concurrent computing Concurrency control C++ Parallel computing Transaction processing Concurrency Linearizability C++11 Thread POSIX Threads
35	Better Answers to Real Questions Thomas Sturm, Joint Work with M. Košta and A. Dolzmann SMT 2014, Vienna, 18 Julyhttp://www.mpi-inf.mpg.de/~sturm/ Add to Reading List Source URL: smt2014.it.uu.se Language: English - Date: 2014-07-18 15:01:43
36	Using a SAT Solver as a Fast Decision Procedure for Propositional Logic in an LCF-style Theorem Prover Tjark Weber Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2005-09-13 07:36:36 Theoretical computer science NP-complete problems Formal methods Boolean algebra Boolean satisfiability problem Electronic design automation Logic in computer science Isabelle Constructible universe LCF Mathematics (SAT -UNSAT)
37	Bounded Model Generation for Isabelle/HOL and Related Applications of SAT Solvers in Interactive Theorem Proving Tjark Weber Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2005-09-13 07:36:16 Computability theory Lambda calculus Theoretical computer science Model theory Higher-order logic Constructible universe Metaphilosophy Mathematics
38	Validating QBF Validity in HOL4 Ramana Kumar and Tjark Weber ITPBerg en Dal) August 25, 2011 Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2011-09-01 13:37:03 Mathematical logic Constructible universe Model theory Mathematics Predicate logic Generalizations of the derivative Smooth functions Logic operator Original proof of Gdel's completeness theorem
39	A SAT-based Sudoku Solver Tjark Weber LPAR’05, December 3rd, 2005 Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2005-11-29 11:04:14 Logic puzzles Sudoku Recreational mathematics Abstract strategy games NP-complete problems Mathematics Logic
40	11th International Satisfiability Modulo Theories Competition SMT-COMPSylvain Conchon Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2016-07-02 05:15:08 Computing Theoretical computer science Constraint programming Electronic design automation Logic in computer science Satisfiability modulo theories Benchmark Standard Performance Evaluation Corporation K computer

UPDATE