Industrial Model Checking Based on Satisfiability Solvers
暂无分享,去创建一个
Until recently, symbolic model checking was synonymous with fix-point calculations using Binary Decision Diagrams (BDDs). However, today there are a number of approaches to symbolic model checking that avoid the use of BDDs altogether.One of the most successful of these new approaches is model checking using satisfiability solvers (SAT-solvers). Although the body of literature on SAT-based model checking is small, it is already clear that this approach makes it possible to achieve order of magnitude performance improvements compared to BDD-based model checking, even when relatively unsophisticated algorithms are used.