The following pages link to Computer Aided Verification (Q5312942):
Displaying 25 items.
- Equality detection for linear arithmetic constraints (Q621462) (← links)
- Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005) (Q861691) (← links)
- Deciding Boolean algebra with Presburger arithmetic (Q861705) (← links)
- The SAT-based approach to separation logic (Q862390) (← links)
- Applying SAT solving in classification of finite algebras (Q862393) (← links)
- M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures (Q862395) (← links)
- Automatic construction and verification of isotopy invariants (Q928664) (← links)
- Efficiently checking propositional refutations in HOL theorem provers (Q1006729) (← links)
- The RISC ProofNavigator: a proving assistant for program verification in the classroom (Q1019024) (← links)
- Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis (Q1037399) (← links)
- Parameterized synthesis for fragments of first-order logic over data words (Q2200816) (← links)
- Efficient theory combination via Boolean search (Q2432765) (← links)
- Processes and continuous change in a SAT-based planner (Q2457662) (← links)
- A randomized satisfiability procedure for arithmetic and uninterpreted function symbols (Q2486581) (← links)
- Embedded software verification using symbolic execution and uninterpreted functions (Q2506297) (← links)
- Rewrite-Based Decision Procedures (Q2864358) (← links)
- Bounded Model Checking with Parametric Data Structures (Q2864380) (← links)
- Mothers of Pipelines (Q2864521) (← links)
- An Abstract Decision Procedure for Satisfiability in the Theory of Recursive Data Types (Q2864522) (← links)
- Distributing the Workload in a Lazy Theorem-Prover (Q2870323) (← links)
- Linear Arithmetic with Stars (Q3512499) (← links)
- Model Checking Recursive Programs with Exact Predicate Abstraction (Q3540067) (← links)
- Efficient Well-Definedness Checking (Q3541692) (← links)
- Highly Automated Formal Proofs over Memory Usage of Assembly Code (Q5164171) (← links)
- Rocket-Fast Proof Checking for SMT Solvers (Q5458346) (← links)
