Abstract
We present a model-checker for boolean programs with (possibly recursive) procedures and the temporal logic LTL. The checker is guaranteed to terminate even for (usually faulty) programs in which the depth of the recursion is not bounded. The algorithm uses automata to finitely represent possibly infinite sets of stack contents and BDDs to compactly represent finite sets of values of boolean variables. We illustrate the checker on some examples and compare it with the Bebop tool of Ball and Rajamani.
Cite
CITATION STYLE
Esparza, J., & Schwoon, S. (2001). A BDD-based model checker for recursive programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2102, pp. 324–336). Springer Verlag. https://doi.org/10.1007/3-540-44585-4_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
