The following pages link to (Q4804887):
Displaying 22 items.
- Fast congruence closure and extensions (Q876046) (← links)
- A framework for verifying bit-level pipelined machines based on automated deduction and decision procedures (Q877828) (← links)
- Word level bitwidth reduction for unbounded hardware model checking (Q1039855) (← links)
- Data compression for proof replay (Q1040776) (← links)
- Theory decision by decomposition (Q1041591) (← links)
- Zero, successor and equality in BDDs (Q1772774) (← links)
- The small model property: How small can it be? (Q1854568) (← links)
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
- MedleySolver: online SMT algorithm selection (Q2118336) (← links)
- Algorithms for computing minimal unsatisfiable subsets of constraints (Q2471741) (← links)
- Building small equality graphs for deciding equality logic with uninterpreted functions (Q2490118) (← links)
- Embedded software verification using symbolic execution and uninterpreted functions (Q2506297) (← links)
- Parameterised Boolean equation systems (Q2571204) (← links)
- Modeling for Verification (Q3176361) (← links)
- Satisfiability Modulo Theories (Q3176369) (← links)
- Approximate Invariant Property Checking Using Term-Height Reduction for a Subset of First-Order Logic (Q3540082) (← links)
- Satisfiability Procedures for Combination of Theories Sharing Integer Offsets (Q3617773) (← links)
- Variant-Based Satisfiability in Initial Algebras (Q4686604) (← links)
- Declarative Parameterized Verification of Distributed Protocols via the Cubicle Model Checker (Q4991929) (← links)
- What’s Decidable About Program Verification Modulo Axioms? (Q5164172) (← links)
- Local Search for SMT on Linear Integer Arithmetic (Q6487338) (← links)
- Exploiting functional constraints in automatic dominance breaking for constraint optimization (Q6488814) (← links)
