Algorithmic improvements in regular model checking

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

Volumn 2725, Issue , 2003, Pages 236-248

  Abdulla, Parosh Aziz ^a   Jonsson, Bengt ^a   Nilsson, Marcus ^a   D'Orso, Julien ^a  

^a Dept of Information Technology ^*  (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER AIDED ANALYSIS; TRANSDUCERS;

EQUIVALENCE RELATIONS; FINITE ALPHABET; INFINITE STATE SYSTEMS; REGULAR MODEL CHECKING; SYMBOLIC MODEL CHECKING; THEORETICAL FRAMEWORK; TRANSITION RELATIONS; TRANSITIVE CLOSURE;

MODEL CHECKING;

EID: 35248870161     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45069-6_25     Document Type: Article

References (17)

1. th Int. Conf. on Computer Aided Verification, volume 1633 of Lecture Notes in Computer Science, pages 134-145, 1999.
2. th Int. Conf. on Computer Aided Verification, volume 2404 of Lecture Notes in Computer Science, 2002.
3. th Int. Conf. on Concurrency Theory, volume 2421 of Lecture Notes in Computer Science, pages 116-130, 2002.
4. Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, and Julien d'Orso. Algorithmic improvements in regular model checking. Technical Report 2003-024, Department of Information Technology, Uppsala University, April 2003.
5. 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.
6. 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. Springer Verlag, 2000.
7. th IEEE Int. Symp. on Logic in Computer Science. IEEE, 2001.
8. Ahmed Bouajjani and Tayssir Touili. Extrapolating Tree Transformations. In Proc. 14th Int. Conf. on Computer Aided Verification, volume 2404 of Lecture Notes in Computer Science, 2002.
9. 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.
10. th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 1019 of Lecture Notes in Computer Science, 1996.
11. O. H. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM, 25:116-133, 1978.
12. 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.
13. D.E. Knuth and P.B. Bendix. Simple word problems in universal algebra. In Computational Problems in Abstract Algebra, pages 263-297. Pergamon press, 1970.
14. 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.
15. T. Touili. Regular Model Checking using Widening Techniques. Electronic Notes in Theoretical Computer Science, 50(4), 2001.
16. Proc. Workshop on Verification of Parametrized Systems (VEPAS'01), Crete, July, 2001.
17. 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.