The following pages link to Computer Aided Verification (Q5312909):
Displaying 8 items.
- M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures (Q862395) (← links)
- An approach for extracting a small unsatisfiable core (Q1028724) (← links)
- Efficient theory combination via Boolean search (Q2432765) (← links)
- Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem (Q2938540) (← links)
- SAT-Based Model Checking (Q3176368) (← links)
- Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic (Q3608775) (← links)
- (Q4427902) (← links)
- A sound and complete abstraction for reasoning about parallel prefix sums (Q5408435) (← links)