Semi-formal bounded model checking

DOI10.1007/3-540-45657-0_21MaRDI QIDQ4804902zbMATH OpenFDO

Authors Jesse Bingham, Alan J. Hu

Publication date 1 May 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2404/24040280.htm

Mathematics Subject Classification ID

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

Recommendations

• Bounded model checking using satisfiability solving
• Semi-external LTL Model Checking
• Bounded model checking with QBF
• Bounded Model Checking for Partial Kripke Structures
• Bounded LTL model checking with stable models
• Abstraction refinement for bounded model checking

Cited in

(10)

• Bounded model checking with SNF, alternating automata, and Büchi automata
• Semi-external LTL Model Checking
• A probabilistic and approximated approach to circuit-based formal verification
• Benefits of bounded model checking at an industrial setting
• Simulator semantics for system level formal verification
• On Bridging Simulation and Formal Verification
• Bounded model checking for region automata
• Automated Technology for Verification and Analysis
• Bounded model checking with QBF
• An optimized symbolic bounded model checking engine

This page was built for publication: Semi-formal bounded model checking

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