An incremental algorithm to check satisfiability for bounded model checking

MaRDI QIDQ2849595zbMATH OpenFDO

Authors Hoonsang Jin, Fabio Somenzi

Publication date 20 September 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066105000903

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 1852147
• scientific article; zbMATH DE number 1670796
• Accelerating bounded model checking of safety properties
• Parallel SAT solving in bounded model checking
• SAT-Based Model Checking

Cited in

(11)

• Incremental bounded model checking for embedded software
• Improving saturation-based bounded model checking
• A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic
• Incremental preprocessing methods for use in BMC
• scientific article; zbMATH DE number 1852147 (Why is no real title available?)
• scientific article; zbMATH DE number 7297863 (Why is no real title available?)
• Implementing efficient All solutions SAT solvers
• Correct Hardware Design and Verification Methods
• Tools and Algorithms for the Construction and Analysis of Systems
• Theory and Applications of Satisfiability Testing
• HySAT: An efficient proof engine for bounded model checking of hybrid systems

Describes a project that uses

Uses Software

• CirCUs

This page was built for publication: An incremental algorithm to check satisfiability for bounded model checking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849595)