A BDD-based model checker for recursive programs
J Esparza, S Schwoon - … : 13th International Conference, CAV 2001 Paris …, 2001 - Springer
J Esparza, S Schwoon
Computer Aided Verification: 13th International Conference, CAV 2001 Paris …, 2001•SpringerWe 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.
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.
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.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果