SMT - PDFSEARCH.IO - Document Search Engine

SMT
Results: 999

#	Item
31	13th International Satisfiability Modulo Theories Competition SMT-COMPMatthias Heizmann Aina Niemetz Add to Reading List Source URL: smtcomp.sourceforge.net Language: English - Date: 2018-07-14 13:50:22 Theoretical computer science Logic in computer science Formal methods NP-complete problems Electronic design automation Constraint programming Satisfiability modulo theories Alt-Ergo Solver Benchmark SMT
32	LibPoly: A Library for Reasoning about Polynomials∗ Dejan Jovanovi´c and Bruno Dutertre SRI International Abstract LibPoly is a C library for computing with polynomials. It provides data structures to represent multiv Add to Reading List Source URL: smt-workshop.cs.uiowa.edu Language: English - Date: 2017-09-02 14:08:49 Algebra Mathematics Polynomials Abstract algebra Polynomial Irreducible polynomial Factorization of polynomials Resultant Algebraic geometry Factorization Polynomial greatest common divisor Permutation polynomial
33	Proving Non-termination Using Max-SMT? Daniel Larraz1 , Kaustubh Nimkar2 , Albert Oliveras1 , Enric Rodr´ıguez-Carbonell1 , and Albert Rubio1 1 Universitat Polit`ecnica de Catalunya, Barcelona Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2015-03-02 09:06:39 Mathematical analysis Ergodic theory Differential topology Mathematics Computability theory Lie algebras Non-associative algebras Hopf decomposition Orbifold
34	SMT-Based Nonlinear PDDL+ Planning Add to Reading List Source URL: scungao.github.io Language: English - Date: 2018-09-27 16:37:21 Theoretical computer science Mathematics Computational complexity theory Logic in computer science Electronic design automation Formal methods NP-complete problems Constraint programming Planning Domain Definition Language Boolean satisfiability problem Satisfiability modulo theories Hybrid system
35	Introduction Applications SMT Solver Use Algorithms Conclusion Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2012-01-21 06:40:38 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
36	SMT Techniques for Fast Predicate Abstraction Shuvendu K. Lahiri? , Robert Nieuwenhuis?? , and Albert Oliveras?? Abstract. Predicate abstraction is a technique for automatically extracting finite-state abstractions for s Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2006-06-09 05:24:28 Mathematical logic Mathematics Theoretical computer science Formal methods Electronic design automation Logic in computer science NP-complete problems Boolean algebra Satisfiability modulo theories Boolean satisfiability problem 120-cell Predicate
37	Scrambling and Descrambling SMT-LIB Benchmarks Tjark Weber Uppsala University, Sweden Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2016-07-01 09:29:03 Computer programming Declarative programming Theoretical computer science Logic in computer science Cryptography Satellite broadcasting Scrambler Telecommunications equipment Satisfiability modulo theories Scrambling Monad Benchmark
38	Cubicle: A Parallel SMT-based Model Checker for Parameterized Systems Tool Paper Sylvain Conchon1 , Amit Goel2 , Sava Krsti´c2 Alain Mebsout1 , and Fatiha Za¨ıdi1 1 Add to Reading List Source URL: cubicle.lri.fr Language: English - Date: 2013-07-31 06:15:38 Theoretical computer science Logic in computer science Temporal logic Constraint programming Electronic design automation Satisfiability modulo theories Alt-Ergo Computation tree logic Model theory
39	The SMT-LIBv2 Language and Tools: A Tutorial David R. Cok GrammaTech, Inc. VersionNovember 23, 2013 Add to Reading List Source URL: smtlib.github.io Language: English - Date: 2015-12-24 13:35:05 Theoretical computer science Software engineering Constraint programming Computing Formal methods Logic in computer science Electronic design automation NP-complete problems Satisfiability modulo theories Solver SMT Constraint satisfaction problem
40	Towards Conflict-Driven Learning for Virtual Substitution SMT Workshop ˇ Marek Kosta (joint work K. Korovin and T. Sturm) Add to Reading List Source URL: smt2014.it.uu.se Language: English - Date: 2014-07-18 18:47:15 Mathematical analysis Logic Theoretical computer science Automated theorem proving Logic programming Conflict-driven clause learning E Calculus Substitution Exponential function