Optimizing symbolic model checking for constraint-rich models

DOI10.1007/3-540-48683-6_29MaRDI QIDQ4818801zbMATH OpenFDO

Authors Bwolen Yang, Reid G. Simmons, Randal E. Bryant, David R. O'Hallaron

Publication date 24 September 2004

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

Full work available at URL https://doi.org/10.1007/3-540-48683-6_29

Mathematics Subject Classification ID

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

Recommendations

• Symbolic model checking with rich assertional languages
• Reformulation and approximation in model checking
• BDD vs. constraint-based model checking: An experiment evaluation for asynchronous concurrent systems
• An optimized symbolic bounded model checking engine
• The automatic verification using symbolic model-checking

Cited in

(3)

• Constraint logic programming for local and symbolic model-checking
• Correct Hardware Design and Verification Methods
• Mining definitions in Kissat with Kittens

This page was built for publication: Optimizing symbolic model checking for constraint-rich models

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