An optimized symbolic bounded model checking engine (2003) [1 citations — 0 self]
Download:
|
|
by Rachel Tzoref, Mark Matusevich, Eli Berger, Ilan Beer
In CHARME
http://www.haifa.il.ibm.com/projects/verification/RB_Homepage/ps/new/paper28.ps
Add To MetaCart
Abstract:
Abstract. It has been shown that bounded model checking using a SAT solver can solve many verification problems that would cause BDD based symbolic model checking engines to explode. However, no single algorithmic solution has proven to be totally superior in resolving all types of model checking problems. We present an optimized bounded model checker based on BDDs and describe the advantages and drawbacks of this model checker as compared to BDD-based symbolic model checking and SAT-based model checking. We show that, in some cases, this engine solves verification problems that could not be solved by other methods. 1
Citations
| 1210 | Symbolic Model Checking – McMillan - 1993 |
| 668 | Chaff: Engineering an Efficient SAT Solver – Moskewicz, Madigan, et al. - 2001 |
| 497 | Symbolic model checking without BDDs – Biere, Cimatti, et al. - 1999 |
| 241 | GRASP: A Search Algorithm for Propositional Satisfiability – Marques-Silva, Sakallah - 1999 |
| 98 | Checking safety properties using induction and a sat-solver – Sheeran, Singh, et al. - 2000 |
| 59 | RuleBase: An industry-oriented formal verification tool – Beer, Ben-David, et al. - 1996 |
| 46 | Cosmos: A compiled simulator for mos circuits – Bryant, Beatty, et al. - 1987 |
| 36 | A methodology for hardware verification based on logic simulation – Bryant - 1991 |
| 30 | On-the-fly model checking of RCTL formulas – Beer, Ben-David, et al. - 1998 |
| 28 | Validating the intel pentium 4 microprocessor – Bentley - 2001 |
| 17 | Rulebase: Model checking at IBM – Beer, Ben-David, et al. - 1997 |
| 3 | Efficient state representation for symbolic simulation – Bertacco, Olukotun - 2002 |
