Journal of Symbolic Computation
Automatically proving the correctness of compiler optimizations
PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
AI Communications - CASC
Efficient conflict analysis for finding all satisfying assignments of a boolean circuit
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
AI Communications
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
Fast congruence closure and extensions
Information and Computation
The Challenges of Building Advanced Mechatronic Systems
FOSE '07 2007 Future of Software Engineering
Visualizing SAT Instances and Runs of the DPLL Algorithm
Journal of Automated Reasoning
Automated Test Generation and Verified Software
Verified Software: Theories, Tools, Experiments
Ranking and Reputation Systems in the QBF Competition
AI*IA '07 Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing
Automated deduction for verification
ACM Computing Surveys (CSUR)
Temporal preference optimization as weighted constraint satisfaction
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
veriT: An Open, Trustable and Efficient SMT-Solver
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Unit Testing of Flash Memory Device Driver through a SAT-Based Model Checker
ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering
The TPTP Problem Library and Associated Infrastructure
Journal of Automated Reasoning
A benchmark- and competition-based approach to software engineering research
Proceedings of the FSE/SDP workshop on Future of software engineering research
On the modelling and optimization of preferences in constraint-based temporal reasoning
Artificial Intelligence
Exploiting symmetry in SMT problems
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Checking safety of neural networks with SMT solvers: a comparative evaluation
AI*IA'11 Proceedings of the 12th international conference on Artificial intelligence around man and beyond
Splitting on demand in SAT modulo theories
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Decision procedures for SAT, SAT modulo theories and beyond. the barcelogictools
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
SMT techniques for fast predicate abstraction
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
The heuristic theorem prover: yet another SMT modulo theorem prover
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
CASC-J3 the 3rd IJCAR ATP system competition
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Lemma learning in SMT on linear constraints
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
On SAT modulo theories and optimization problems
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
A progressive simplifier for satisfiability modulo theories
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Bounded model checking of software using SMT solvers instead of SAT solvers
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
SMTInterpol: an interpolating SMT solver
SPIN'12 Proceedings of the 19th international conference on Model Checking Software
| Hi-index | 0.00 |
Decision procedures for checking satisfiability of logical formulas are crucial for many verification applications (e.g., [2,6,3]). Of particular recent interest are solvers for Satisfiability Modulo Theories (SMT). SMT solvers decide logical satisfiability (or dually, validity) with respect to a background theory in classical first-order logic with equality. Background theories useful for verification are supported, like equality and uninterpreted functions (EUF), real or integer arithmetic, and theories of bitvectors and arrays. Input formulas are often syntactically restricted; for example, to be quantifier-free or to involve only difference constraints. Some solvers support a combination of theories, or quantifiers.