TY - GEN
T1 - Symbolic model checking with rich assertional languages
AU - Kesten, Y.
AU - Maler, O.
AU - Marcus, M.
AU - Pnueli, A.
AU - Shahar, E.
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1997.
PY - 1997/1/1
Y1 - 1997/1/1
N2 - The paper shows that, by an appropriate choice of a rich assertion at 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, extending the technique to tree architectures, and establishing that the presented method is a precise dual to the top-down invariant generation method used in deductive verification.
AB - The paper shows that, by an appropriate choice of a rich assertion at 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, extending the technique to tree architectures, and establishing that the presented method is a precise dual to the top-down invariant generation method used in deductive verification.
UR - http://www.scopus.com/inward/record.url?scp=84947424451&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84947424451
SN - 3540631666
SN - 9783540631668
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 424
EP - 435
BT - Computer Aided Verification - 9th International Conference, CAV 1997, Proceedings
A2 - Grumberg, Orna
PB - Springer Verlag
T2 - 9th International Conference on Computer-Aided Verification, CAV 1997
Y2 - 22 June 1997 through 25 June 1997
ER -