Regular tree model checking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2404, Issue , 2002, Pages 555-568

  Abdulla, Parosh Aziz ^a   Jonsson, Bengt ^a   Mahata, Pritha ^a   D’Orso, Julien ^a  

^a Department Of Computer Systems ^*  (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER AIDED ANALYSIS;

ALGORITHMIC VERIFICATION; FINITE ALPHABET; ITS APPLICATIONS; REGULAR MODEL CHECKING; STRUCTURE-PRESERVING; TRANSITION RELATIONS; TRANSITIVE CLOSURE; TREE TOPOLOGY;

MODEL CHECKING;

EID: 84937559190     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45657-0_47     Document Type: Article

References (18)

1. R. Alur, R.K. Brayton, T.A. Henzinger, S. Qadeer, and S.K. Rajamani. Partial-order reduction in symbolic state space exploration. In O. Grum-berg, editor, Proc. 9th Int. Conf. on Computer Aided Verification, volume 1254, pages 340-351, Haifa, Israel, 1997. Springer Verlag. 556, 567
2. Parosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson, and Marcus Nilsson. Handling global conditions in parameterized system verification. In Proc. 11th Int. Conf. on Computer Aided Verification, volume 1633 of Lecture Notes in Computer Science, pages 134-145, 1999. 556
3. T. Arons, A. Pnueli, S. Ruah, J. Xu, and L. Zuck. Parameterized verification with automatically computed inductive assertions. In Proc. 13th Int. Conf. on Computer Aided Verification, pages 221-234, 2001. 555, 556
4. 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. 555
5. 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. 555, 556
6. A. Bouajjani, A. Muscholl, and T. Touili. Permutation rewriting and algorithmic verification. In Proc. LICS’ 01 17th IEEE Int. Symp. on Logic in Computer Science. IEEE, 2001. 556
7. H. Common, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. October 1999. 557, 559, 564
8. 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. 556
9. 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. 555, 556
10. 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, 6th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 1785 of Lecture Notes in Computer Science, 2000. 555, 556
11. 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. 555, 556, 566
12. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. Theoreti cal Computer Sci ence, 256:93-112, 2001. 555, 556
13. M. Maidl. A unifying model checking approach for safety properties of parameterized systems. In Proc. 13th Int. Conf. on Computer Aided Verification, pages 324-336, 2001. 555
14. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993. 555
15. A. Pnueli, S. Ruah, and L. Zuck. Automatic deductive verification with invisible invariants. In Proc. TACAS’01, 7th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 2031, pages 82-97, 2001. 555, 556
16. A. Pnueli and E. Shahar. Liveness and acceleration in parameterized verification. In Proc. 12th Int. Conf. on Computer Aided Verification, volume 1855 of Lecture Notes in Computer Science, pages 328-343, 2000. 556
17. 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. 556
18. Pierre Wolper and Bernard Boigelot. Verifying systems with infinite but regular state spaces. In Proc. 10th Int. Conf. on Computer Aided Verification, volume 1427 of Lecture Notes in Computer Science, pages 88-97, Vancouver, July 1998. Springer Verlag. 555, 556