Bounded Model Checking for Timed Systems
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
A DPLL-Based Calculus for Ground Satisfiability Modulo Theories
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Verification of Timed Automata via Satisfiability Checking
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Integrating Boolean and Mathematical Solving: Foundations, Basic Algorithms, and Requirements
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
A hybrid SAT-based decision procedure for separation logic with uninterpreted functions
Proceedings of the 40th annual Design Automation Conference
Checking reachability properties for timed automata via SAT
Fundamenta Informaticae - Concurrency specification and programming
Arithmetic Reasoning in DPLL-Based SAT Solving
Proceedings of the conference on Design, automation and test in Europe - Volume 1
Normalization at the arithmetic bit level
Proceedings of the 42nd annual Design Automation Conference
Processes and continuous change in a SAT-based planner
Artificial Intelligence
Building small equality graphs for deciding equality logic with uninterpreted functions
Information and Computation
MathSAT: Tight Integration of SAT and Mathematical Decision Procedures
Journal of Automated Reasoning
The SAT-based Approach to Separation Logic
Journal of Automated Reasoning
Improvements in SAT-based Reachability Analysis for Timed Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Fast congruence closure and extensions
Information and Computation
HySAT: An efficient proof engine for bounded model checking of hybrid systems
Formal Methods in System Design
Bounded Model Checking with Parametric Data Structures
Electronic Notes in Theoretical Computer Science (ENTCS)
Generalizing DPLL and satisfiability for equalities
Information and Computation
From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
An approach for extracting a small unsatisfiable core
Formal Methods in System Design
A theory-based decision heuristic for DPLL(T)
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Access control policy combining: theory meets practice
Proceedings of the 14th ACM symposium on Access control models and technologies
Automated deduction for verification
ACM Computing Surveys (CSUR)
Continuous time in a SAT-based planner
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Processes and continuous change in a SAT-based planner
Artificial Intelligence
TSAT++: an Open Platform for Satisfiability Modulo Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
Verifying Industrial Hybrid Systems with MathSAT
Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient Proof Engines for Bounded Model Checking of Hybrid Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
An Efficient Nelson-Oppen Decision Procedure for Difference Constraints over Rationals
Electronic Notes in Theoretical Computer Science (ENTCS)
Reduced Functional Consistency of Uninterpreted Functions
Electronic Notes in Theoretical Computer Science (ENTCS)
Integrating a SAT Solver with an LCF-style Theorem Prover
Electronic Notes in Theoretical Computer Science (ENTCS)
Building small equality graphs for deciding equality logic with uninterpreted functions
Information and Computation
Parallel SAT solving in bounded model checking
FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
Deciding an interval logic with accumulated durations
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Combining equational reasoning
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Extending Clause Learning DPLL with Parity Reasoning
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Satisfiability modulo theories: introduction and applications
Communications of the ACM
Computing small unsatisfiable cores in satisfiability modulo theories
Journal of Artificial Intelligence Research
Stochastic local search for SMT: combining theory solvers with WalkSAT
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Designing safe, reliable systems using scade
ISoLA'04 Proceedings of the First international conference on Leveraging Applications of Formal Methods
Zap: automated theorem proving for software analysis
LPAR'05 Proceedings of the 12th 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
A SAT-based decision procedure for the boolean combination of difference constraints
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
A SAT-based decision procedure for mixed logical/integer linear problems
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A scalable method for solving satisfiability of integer linear arithmetic logic
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Optimizing bounded model checking for linear hybrid systems
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Decidability and undecidability results for nelson-oppen and rewrite-based decision procedures
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
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
An incremental and layered procedure for the satisfiability of linear arithmetic logic
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Decision procedures customized for formal verification
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Proof-producing congruence closure
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
An algebraic approach for the unsatisfiability of nonlinear constraints
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Building efficient decision procedures on top of SAT solvers
SFM'06 Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems
Challenging SMT solvers to verify neural networks
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
Improvements in SAT-based Reachability Analysis for Timed Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Checking Reachability Properties for Timed Automata via SAT
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2
COLIN: planning with continuous linear numeric change
Journal of Artificial Intelligence Research
Preface to the special issue "SI: Satisfiability Modulo Theories"
Formal Methods in System Design
| Hi-index | 0.02 |