#### DMCA

## Bebop: A Symbolic Model Checker for Boolean Programs (2000)

### Cached

### Download Links

- [www.cs.utah.edu]
- [www.cs.sunysb.edu]
- [www.cs.purdue.edu]
- [swtv.kaist.ac.kr]
- DBLP

### Other Repositories/Bibliography

Citations: | 255 - 24 self |

### Citations

3516 | Graph-based algorithms for boolean function manipulation - Bryant - 1986 |

599 |
Symbolic Model Checking: An Approach to the State Explosion Problem
- McMillan
- 1993
(Show Context)
Citation Context ...itute, we believe that the running time of Bebop for T (N) will vary linearly with N . 5 Related Work Model checking forsnite state machines is a well studied problem, and several model checkers |SMV =-=[McM93]-=-, Mur [Dil96], SPIN [HP96], COSPAN [HHK96], VIS [BHSV + 96] and MOCHA [AHM + 98]| have been developed. Boolean programs implicitly have an unbounded stack, which makes them identical in expressive po... |

374 | Reachability analysis of pushdown automata: Application to model-checking
- Bouajjani, Esparza, et al.
- 1997
(Show Context)
Citation Context ...olean programs implicitly have an unbounded stack, which makes them identical in expressive power to pushdown automata. The model checking problem for pushdown automata has been studied before [SB92] =-=[BEM97]-=- [FWW97]. Model checkers for push down automata have also been written before [EHRS00]. However, unlike boolean programs, these approaches abstract away data, and concentrate only on control. As a res... |

323 | Reactive modules
- Alur, Henzinger
- 1999
(Show Context)
Citation Context ...rolsow and an implicit BDD-based representation of path edges and summary edges| is novel. Exploiting design modularity in model checking has been recognized as a key to scalability of model checking =-=[AH96]-=- [AG00] [McM97] [HQR98]. The idea of harnessing the inherent modularity in procedural abstraction, and exploiting locality of variable scoping for eÆciency in model checking software is new, though kn... |

185 | Efficient algorithms for model checking pushdown systems.
- Esparza, Hansel, et al.
- 2000
(Show Context)
Citation Context ...essive power to pushdown automata. The model checking problem for pushdown automata has been studied before [SB92] [BEM97] [FWW97]. Model checkers for push down automata have also been written before =-=[EHRS00]-=-. However, unlike boolean programs, these approaches abstract away data, and concentrate only on control. As a result spurious paths can arise in these models due to information loss about data correl... |

136 | A direct symbolic approach to model checking pushdown systems. In: Infinity.
- Finkel, Willems, et al.
- 1997
(Show Context)
Citation Context ...ograms implicitly have an unbounded stack, which makes them identical in expressive power to pushdown automata. The model checking problem for pushdown automata has been studied before [SB92] [BEM97] =-=[FWW97]-=-. Model checkers for push down automata have also been written before [EHRS00]. However, unlike boolean programs, these approaches abstract away data, and concentrate only on control. As a result spur... |

119 | You assume, we guarantee: Methodology and case studies
- Henzinger, Qadeer, et al.
- 1998
(Show Context)
Citation Context ... BDD-based representation of path edges and summary edges| is novel. Exploiting design modularity in model checking has been recognized as a key to scalability of model checking [AH96] [AG00] [McM97] =-=[HQR98]-=-. The idea of harnessing the inherent modularity in procedural abstraction, and exploiting locality of variable scoping for eÆciency in model checking software is new, though known in the area of data... |

102 | The interprocedural coincidence theorem.
- Knoop, Steffen
- 1992
(Show Context)
Citation Context ... model checking, data ow analysis and abstract interpretation have been explored before [Sch98] [CC00]. The RHS algorithm [RHS95,RHS96] builds on earlier work in interprocedural data ow analysis from =-=[KS92]-=- and [SP81]. We have shown how this algorithm can be generalized to work as a model checking procedure for boolean programs. Also, our choice of hybrid representation of the state space in Bebop|an ex... |

87 | Local model checking for context-free processes
- Hungar, Steffen
- 1993
(Show Context)
Citation Context ...ped. Boolean programs implicitly have an unbounded stack, which makes them identical in expressive power to pushdown automata. The model checking problem for pushdown automata has been studied before =-=[SB92]-=- [BEM97] [FWW97]. Model checkers for push down automata have also been written before [EHRS00]. However, unlike boolean programs, these approaches abstract away data, and concentrate only on control. ... |

78 | Boolean programs: A model and process for software analysis - Ball, Rajamani |

78 | Program analysis as model checking of abstract interpretations. In: Static Analysis Symposium.
- Schmidt, Steffen
- 1998
(Show Context)
Citation Context ...purious paths can arise in these models due to information loss about data correlations. The connections between model checking, data ow analysis and abstract interpretation have been explored before =-=[Sch98]-=- [CC00]. The RHS algorithm [RHS95,RHS96] builds on earlier work in interprocedural data ow analysis from [KS92] and [SP81]. We have shown how this algorithm can be generalized to work as a model check... |

66 |
CUDD: Colorado university decision diagram package. ftp://vlsi .colorado.edu/pub/.
- Somenzi
- 1996
(Show Context)
Citation Context ...sults. with N . Figure 4(b) shows how the peak memory usage of Bebop varies with N . The two curves in Figure 4(a) represent two dierent BDD packages: CU is the CUDD package from Colorado University =-=[Som98]-=- and CMU is the BDD package from Carnegie Mellon University [Lon93]. We note that the program T (800) has 2401 variables. Model checking of this program takes a minute and a half with the CMU package ... |

59 | The State of Spin
- Holzmann, Peled
(Show Context)
Citation Context ...unning time of Bebop for T (N) will vary linearly with N . 5 Related Work Model checking forsnite state machines is a well studied problem, and several model checkers |SMV [McM93], Mur [Dil96], SPIN =-=[HP96]-=-, COSPAN [HHK96], VIS [BHSV + 96] and MOCHA [AHM + 98]| have been developed. Boolean programs implicitly have an unbounded stack, which makes them identical in expressive power to pushdown automata. T... |

21 |
The Mur veri system
- Dill
(Show Context)
Citation Context ...eve that the running time of Bebop for T (N) will vary linearly with N . 5 Related Work Model checking forsnite state machines is a well studied problem, and several model checkers |SMV [McM93], Mur =-=[Dil96]-=-, SPIN [HP96], COSPAN [HHK96], VIS [BHSV + 96] and MOCHA [AHM + 98]| have been developed. Boolean programs implicitly have an unbounded stack, which makes them identical in expressive power to pushdow... |

21 |
Precise interprocedural data analysis via graph reachability
- Reps, Horwitz, et al.
- 1995
(Show Context)
Citation Context ... harnessing the inherent modularity in procedural abstraction, and exploiting locality of variable scoping for eÆciency in model checking software is new, though known in the area of data ow analysis =-=[RHS96]-=-. Existing model checkers neither support nor exploit procedural abstraction. As a result, existing approaches to extract models from software are forced to inline procedure denitions at their points... |

12 |
A compositional rule for hardware design re
- McMillan
- 1997
(Show Context)
Citation Context ...implicit BDD-based representation of path edges and summary edges| is novel. Exploiting design modularity in model checking has been recognized as a key to scalability of model checking [AH96] [AG00] =-=[McM97]-=- [HQR98]. The idea of harnessing the inherent modularity in procedural abstraction, and exploiting locality of variable scoping for eÆciency in model checking software is new, though known in the area... |

10 |
Two approaches to interprocedural data dalow analysis
- Sharir, Pnueli
- 1981
(Show Context)
Citation Context ...king, data ow analysis and abstract interpretation have been explored before [Sch98] [CC00]. The RHS algorithm [RHS95,RHS96] builds on earlier work in interprocedural data ow analysis from [KS92] and =-=[SP81]-=-. We have shown how this algorithm can be generalized to work as a model checking procedure for boolean programs. Also, our choice of hybrid representation of the state space in Bebop|an explicit repr... |

4 |
Modular re of hierarchic reactive modules
- Alur, Grosu
- 2000
(Show Context)
Citation Context ...and an implicit BDD-based representation of path edges and summary edges| is novel. Exploiting design modularity in model checking has been recognized as a key to scalability of model checking [AH96] =-=[AG00]-=- [McM97] [HQR98]. The idea of harnessing the inherent modularity in procedural abstraction, and exploiting locality of variable scoping for eÆciency in model checking software is new, though known in ... |

3 |
Cmu bdd package
- Long
- 1993
(Show Context)
Citation Context ...p varies with N . The two curves in Figure 4(a) represent two dierent BDD packages: CU is the CUDD package from Colorado University [Som98] and CMU is the BDD package from Carnegie Mellon University =-=[Lon93]-=-. We note that the program T (800) has 2401 variables. Model checking of this program takes a minute and a half with the CMU package and four and a half minutes with the CUDD package. Both times are q... |

1 |
Temporal abstract interpretation. In POPL 00: Principles of Programming Languages
- Cousot, Cousot
- 2000
(Show Context)
Citation Context ...paths can arise in these models due to information loss about data correlations. The connections between model checking, data ow analysis and abstract interpretation have been explored before [Sch98] =-=[CC00]-=-. The RHS algorithm [RHS95,RHS96] builds on earlier work in interprocedural data ow analysis from [KS92] and [SP81]. We have shown how this algorithm can be generalized to work as a model checking pro... |