Bebop: A Symbolic Model Checker for Boolean Programs

  • Thomas Ball
  • Sriram K. Rajamani
Conference paper

DOI: 10.1007/10722468_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1885)
Cite this paper as:
Ball T., Rajamani S.K. (2000) Bebop: A Symbolic Model Checker for Boolean Programs. In: Havelund K., Penix J., Visser W. (eds) SPIN Model Checking and Software Verification. SPIN 2000. Lecture Notes in Computer Science, vol 1885. Springer, Berlin, Heidelberg

Abstract

We present the design, implementation and empirical evaluation of Bebop—a symbolic model checker for boolean programs. Bebop represents control flow explicitly, and sets of states implicitly using BDDs. By harnessing the inherent modularity in procedural abstraction and exploiting the locality of variable scoping, Bebop is able to model check boolean programs with several thousand lines of code, hundreds of procedures, and several thousand variables in a few minutes.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Thomas Ball
    • 1
  • Sriram K. Rajamani
    • 1
  1. 1.Software Productivity ToolsMicrosoft Research 

Personalised recommendations