Pruning techniques for the SAT-based bounded model checking problem

DOI10.1007/3-540-44798-9_4MaRDI QIDQ4787213zbMATH OpenFDO

Authors O. Shtrichman

Publication date 9 January 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/2144/21440058

Mathematics Subject Classification ID

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

Recommendations

• Tuning SAT checkers for bounded model checking
• Accelerating bounded model checking of safety properties
• Theory and Applications of Models of Computation
• SAT-Based Model Checking
• An incremental algorithm to check satisfiability for bounded model checking

Cited in

(11)

• A framework for satisfiability modulo theories
• Incremental bounded model checking for embedded software
• A BMC-formulation for the scheduling problem in highly constrained hardware systems
• An incremental algorithm to check satisfiability for bounded model checking
• Bounded model checking with parametric data structures
• Exact Incremental Analysis of Timed Automata with an SMT-Solver
• Mining backbone literals in incremental SAT. A new kind of incremental data
• Accelerated deletion-based extraction of minimal unsatisfiable cores
• On using incremental encodings in unsatisfiability-based MaxSAT solving
• On enumerating short projected models
• Unsatisfiability-based algorithms for multi-objective combinatorial optimization

This page was built for publication: Pruning techniques for the SAT-based bounded model checking problem

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