Selected publications by Stefan Schwoon

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.

   address = {Paris, France},
   author = {Esparza, Javier and Schwoon, Stefan},
   booktitle = {{P}roceedings of the 13th {I}nternational {C}onference on {C}omputer {A}ided {V}erification ({CAV}'01)},
   editor = {Berry, G{\'e}rard and Comon, Hubert and Finkel, Alain},
   month = jul,
   pages = {324-336},
   publisher = {Springer},
   series = {Lecture Notes in Computer Science},
   title = {A {BDD}-based Model Checker for Recursive Programs},
   url = {},
   volume = {2102},
   year = {2001},

About LSV