Industrial model checking based on satisfiability solvers

DOI10.1007/3-540-46017-9_19MaRDI QIDQ4738483zbMATH OpenFDO

Authors Per Bjesse

Publication date 11 August 2004

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/2318/23180240.htm

Mathematics Subject Classification ID

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

Recommendations

• SAT-Based Model Checking
• Symbolic reachability analysis based on SAT-solvers
• Correct Hardware Design and Verification Methods
• Bounded model checking using satisfiability solving
• Model checking with Boolean Satisfiability

Cited in

(18)

• Symbolic reachability analysis based on SAT-solvers
• A View from the Engine Room: Computational Support for Symbolic Model Checking
• Model checking with Boolean Satisfiability
• Improved SAT-based reachability analysis with observability don't cares
• Benefits of bounded model checking at an industrial setting
• Finding bugs in an alpha microprocessor using satisfiability solvers
• Integrating BDD-based and SAT-based symbolic model checking
• SAT solver management strategies in IC3: an experimental approach
• Computer Aided Verification
• Formal Methods in Computer-Aided Design
• Correct Hardware Design and Verification Methods
• Tools and Algorithms for the Construction and Analysis of Systems
• Efficient distributed SAT and SAT-based distributed bounded model checking
• Hardware and Software, Verification and Testing
• Model Checking Software
• Formal Methods for Hardware Verification
• Bounded model checking using satisfiability solving
• Level-up -- from bits to words

This page was built for publication: Industrial model checking based on satisfiability solvers

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