An incremental algorithm to check satisfiability for bounded model checking

zbMATH Open1272.68262MaRDI QIDQ2849595FDOQ2849595

Authors: Hoonsang Jin, Fabio Somenzi 

Publication date: 20 September 2013

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

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

Mathematics Subject Classification ID

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

Cited In (11)

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

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)