Abstract
In this paper, we present an approach for algorithmic verification of infinite-state systems with a parameterized tree topology. Our work is a generalization of regular model checking, where we extend the work done with strings toward trees. States are represented by trees over a finite alphabet, and transition relations by regular, structure preserving relations on trees. We use an automata theoretic method to compute the transitive closure of such a transition relation. Although the method is incomplete, we present sufficient conditions to ensure termination. We have implemented a prototype for our algorithm and show the result of its application on a number of examples.
This work was supported in part by the European Commission (FET project ADVANCE, contract No IST-1999-29082).
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. Alur, R.K. Brayton, T.A. Henzinger, S. Qadeer, and S.K. Rajamani. Partial-order reduction in symbolic state space exploration. In O. Grumberg, editor, Proc. 9 th Int. Conf. on Computer Aided Verification, volume 1254, pages 340–351, Haifa, Israel, 1997. Springer Verlag.
Parosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson, and Marcus Nilsson. Handling global conditions in parameterized system verification. In Proc. 11 th Int. Conf. on Computer Aided Verification, volume 1633 of Lecture Notes in Computer Science, pages 134–145, 1999.
T. Arons, A. Pnueli, S. Ruah, J. Xu, and L. Zuck. Parameterized verification with automatically computed inductive assertions. In Proc. 13 th Int. Conf. on Computer Aided Verification, pages 221–234, 2001.
J.R. Burch, E.M. Clarke, K.L. McMillan, and D.L. Dill. Symbolic model checking: 1020 states and beyond. Information and Computation, 98:142–170, 1992.
A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili. Regular model checking. In Emerson and Sistla, editors, Proc. 12th Int. Conf. on Computer Aided Verification, volume 1855 of Lecture Notes in Computer Science, pages 403–418, 2000.
A. Bouajjani, A. Muscholl, and T. Touili. Permutation rewriting and al-gorithmic verification. In Proc. LICS’ 01 17 th IEEE Int. Symp. on Logic in Computer Science. IEEE, 2001.
H. Common, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. October 1999.
D. Dams, Y. Lakhnech, and M. Steffen. Iterating transducers. In G. Berry, H. Comon, and A. Finkel, editors, Computer Aided Verification, volume 2102 of Lecture Notes in Computer Science, 2001.
Dana Fisman and Amir Pnueli. Beyond regular model checking. In Proc. 21th Conference on the Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, December 2001.
Bengt Jonsson and Marcus Nilsson. Transitive closures of regular relations for verifying infinite-state systems. In S. Graf and M. Schwartzbach, editors, Proc. TACAS’ 00, 6 th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 1785 of Lecture Notes in Computer Science, 2000.
Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. In O. Grumberg, editor, Proc. 9th Int. Conf. on Computer Aided Verification, volume 1254, pages 424–435, Haifa, Israel, 1997. Springer Verlag.
Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. Theoretical Computer Science, 256:93–112, 2001.
M. Maidl. A unifying model checking approach for safety properties of parameterized systems. In Proc. 13 th Int. Conf. on Computer Aided Verification, pages 324–336, 2001.
K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
A. Pnueli, S. Ruah, and L. Zuck. Automatic deductive verification with invisible invariants. In Proc. TACAS’ 01, 7 th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 2031, pages 82–97, 2001.
A. Pnueli and E. Shahar. Liveness and acceleration in parameterized verification. In Proc. 12 th Int. Conf. on Computer Aided Verification, volume 1855 of Lecture Notes in Computer Science, pages 328–343, 2000.
T. Touili. Regular Model Checking using Widening Techniques. Electronic Notes in Theoretical Computer Science, 50(4), 2001. Proc. Workshop on Verification of Parametrized Systems (VEPAS’01), Crete, July, 2001.
Pierre Wolper and Bernard Boigelot. Verifying systems with infinite but regular state spaces. In Proc. 10th Int. Conf. on Computer Aided Verifi-cation, volume 1427 of Lecture Notes in Computer Science, pages 88–97, Vancouver, July 1998. Springer Verlag.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abdulla, P.A., Jonsson, B., Mahata, P., d’Orso, J. (2002). Regular Tree Model Checking. In: Brinksma, E., Larsen, K.G. (eds) Computer Aided Verification. CAV 2002. Lecture Notes in Computer Science, vol 2404. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45657-0_47
Download citation
DOI: https://doi.org/10.1007/3-540-45657-0_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43997-4
Online ISBN: 978-3-540-45657-5
eBook Packages: Springer Book Archive