The following pages link to (Q4417909):
Displaying 21 items.
- Resolution proof transformation for compression and interpolation (Q479815) (← links)
- SMT-based model checking for recursive programs (Q518396) (← links)
- Efficient generation of small interpolants in CNF (Q746773) (← links)
- Property-directed incremental invariant generation (Q939166) (← links)
- Efficient SAT-based bounded model checking for software verification (Q947794) (← links)
- Underapproximation for model-checking based on universal circuits (Q963058) (← links)
- An approach for extracting a small unsatisfiable core (Q1028724) (← links)
- A unifying view on SMT-based software verification (Q1703012) (← links)
- Partial predicate abstraction and counter-example guided refinement (Q2291815) (← links)
- Compositional SCC analysis for language emptiness (Q2505627) (← links)
- An interpolating theorem prover (Q2575736) (← links)
- Interpolant Learning and Reuse in SAT-Based Model Checking (Q2864382) (← links)
- Faster Extraction of High-Level Minimal Unsatisfiable Cores (Q3007682) (← links)
- SAT-Based Model Checking (Q3176368) (← links)
- Abstraction and Abstraction Refinement (Q3176371) (← links)
- Interpolation and Model Checking (Q3176372) (← links)
- Transfer of Model Checking to Industrial Practice (Q3176381) (← links)
- Bounded Model Checking of Analog and Mixed-Signal Circuits Using an SMT Solver (Q3510788) (← links)
- Abstract Counterexamples for Non-disjunctive Abstractions (Q3646262) (← links)
- Efficient Combination of Decision Procedures for MUS Computation (Q3655210) (← links)
- Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores (Q5015593) (← links)
