Computing over-approximations with bounded model checking

MaRDI QIDQ2848683zbMATH OpenFDO

Authors Daniel Kroening

Publication date 26 September 2013

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

Mathematics Subject Classification ID

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

Recommendations

• Verification, Model Checking, and Abstract Interpretation
• Accelerating bounded model checking of safety properties
• SAT-Based Model Checking
• Bounded model checking of infinite state systems
• Computer Aided Verification

Cited in

(8)

• Formally verified algorithms for upper-bounding state space diameters
• Deciding Bit-Vector Formulas with mcSAT
• SAT-Based Model Checking
• Proving safety with trace automata and bounded model checking
• Proof-Guided Underapproximation Widening for Bounded Model Checking
• AI Planning Languages Semantics
• Verified SAT-Based AI Planning
• Upper Bounding Diameters of State Spaces of Factored Transition Systems

This page was built for publication: Computing over-approximations with bounded model checking

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