scientific article; zbMATH DE number 1956569
From MaRDI portal
Publication:4417909
zbMath1031.68520MaRDI QIDQ4417909
Publication date: 30 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2619/26190002.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
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 ⋮ A unifying view on SMT-based software verification ⋮ Resolution proof transformation for compression and interpolation ⋮ Property-directed incremental invariant generation ⋮ Faster Extraction of High-Level Minimal Unsatisfiable Cores ⋮ Efficient SAT-based bounded model checking for software verification ⋮ SMT-based model checking for recursive programs ⋮ Underapproximation for model-checking based on universal circuits ⋮ Compositional SCC analysis for language emptiness ⋮ Partial predicate abstraction and counter-example guided refinement ⋮ Efficient generation of small interpolants in CNF ⋮ An approach for extracting a small unsatisfiable core ⋮ Abstract Counterexamples for Non-disjunctive Abstractions ⋮ Efficient Combination of Decision Procedures for MUS Computation ⋮ An interpolating theorem prover ⋮ Interpolant Learning and Reuse in SAT-Based Model Checking ⋮ Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores
