@inproceedings{5463318350be449e9bd6d67c2c89e2a1,
title = "A BDD-based model checker for recursive programs",
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.",
author = "Javier Esparza and Stefan Schwoon",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 13th International Conference on Computer Aided Verification, CAV 2001 ; Conference date: 18-07-2001 Through 22-07-2001",
year = "2001",
doi = "10.1007/3-540-44585-4_30",
language = "English",
isbn = "3540423451",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "324--336",
editor = "Hubert Comon and Alain Finkel and G{\'e}rard Berry",
booktitle = "Computer Aided Verification - 13th International Conference, CAV 2001, Proceedings",
}