TY - JOUR
T1 - Symbolic model checking with rich assertional languages
AU - Kesten, Y.
AU - Maler, O.
AU - Marcus, M.
AU - Pnueli, A.
AU - Shahar, E.
N1 - Funding Information:
This research was supported in part by a gift from Intel, and an Infrastructure grant from the Israeli Ministry of Science and the Arts. ∗Corresponding author. E-mail address: amir@wisdom.weizmann.ac.il (A. Pnueli).
PY - 2001/8/1
Y1 - 2001/8/1
N2 - The paper shows that, by an appropriate choice of a rich assertional language, it is possible to extend the utility of symbolic model checking beyond the realm of BDD-represented finite-state systems into the domain of infinite-state systems, leading to a powerful technique for uniform verification of unbounded (parameterized) process networks. The main contributions of the paper are a formulation of a general framework for symbolic model checking of infinite-state systems, a demonstration that many individual examples of uniformly verified parameterized designs that appear in the literature are special cases of our general approach, verifying the correctness of the Futurebus+ design for all single-bus configurations, and extending the technique to tree architectures.
AB - The paper shows that, by an appropriate choice of a rich assertional language, it is possible to extend the utility of symbolic model checking beyond the realm of BDD-represented finite-state systems into the domain of infinite-state systems, leading to a powerful technique for uniform verification of unbounded (parameterized) process networks. The main contributions of the paper are a formulation of a general framework for symbolic model checking of infinite-state systems, a demonstration that many individual examples of uniformly verified parameterized designs that appear in the literature are special cases of our general approach, verifying the correctness of the Futurebus+ design for all single-bus configurations, and extending the technique to tree architectures.
KW - Parametric systems
KW - Regular expressions
KW - Symbolic model checking
KW - Tree automata
UR - http://www.scopus.com/inward/record.url?scp=0034923607&partnerID=8YFLogxK
U2 - 10.1016/S0304-3975(00)00103-1
DO - 10.1016/S0304-3975(00)00103-1
M3 - Article
AN - SCOPUS:0034923607
SN - 0304-3975
VL - 256
SP - 93
EP - 112
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - 1-2
ER -