scientific article; zbMATH DE number 1956569
From MaRDI portal
Publication:4417909
Recommendations
Cited in
(29)- An approach for extracting a small unsatisfiable core
- A unifying view on SMT-based software verification
- Partial predicate abstraction and counter-example guided refinement
- Compositional SCC analysis for language emptiness
- An interpolating theorem prover
- A satisfiability-based approach to abstraction refinement in model checking
- Interpolant learning and reuse in SAT-based model checking
- Faster Extraction of High-Level Minimal Unsatisfiable Cores
- SAT-Based Model Checking
- Abstraction and abstraction refinement
- Interpolation and model checking
- Transfer of model checking to industrial practice
- Bounded Model Checking of Analog and Mixed-Signal Circuits Using an SMT Solver
- Abstract Counterexamples for Non-disjunctive Abstractions
- Efficient combination of decision procedures for MUS computation
- Automatic Abstraction for Congruences
- scientific article; zbMATH DE number 65749 (Why is no real title available?)
- Resolution proof transformation for compression and interpolation
- Accelerated deletion-based extraction of minimal unsatisfiable cores
- SMT-based model checking for recursive programs
- Automatic abstraction of equations in a logic of equality
- Computer Aided Verification
- Combining Abstraction Refinement and SAT-Based Model Checking
- Proof-Guided Underapproximation Widening for Bounded Model Checking
- The modal logic of abstraction refinement
- Efficient generation of small interpolants in CNF
- Property-directed incremental invariant generation
- Efficient SAT-based bounded model checking for software verification
- Underapproximation for model-checking based on universal circuits
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4417909)
