Regular model checking for LTL(MSO)

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

Volumn 3114, Issue , 2004, Pages 348-360

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

^a Dept of Information Technology ^*  (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; COMPUTER CIRCUITS; PARAMETERIZATION; RECONFIGURABLE HARDWARE; TEMPORAL LOGIC;

AUTOMATA-THEORETIC APPROACH; FINITE ALPHABET; INFINITE STATE SYSTEMS; ITS APPLICATIONS; PARAMETERIZED ALGORITHM; REGULAR MODEL CHECKING; SYMBOLIC MODEL CHECKING; TEMPORAL PROPERTY;

MODEL CHECKING;

EID: 24644488257     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27813-9_27     Document Type: Article

References (20)

1. th Int. Conf. on Concurrency Theory, volume 2421 of Lecture Notes in Computer Science, pages 116-130, 2002.
2. Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, and Julien d'Orso. Algorithmic improvements in regular model checking. In Proc. 14th Int. Conf. on Computer Aided Verification, volume 2725 of Lecture Notes in Computer Science, 2003.
3. th Int. Conf. on Computer Aided Verification, volume 1855 of Lecture Notes in Computer Science, pages 403-418. Springer Verlag, 2000.
4. K. Baukus, Y. Lakhnech, and K. Stahl. Verification of parameterized networks. Journal of Universal Computer Science, 7(2), 2001.
5. th Int. Conf. on Computer Aided Verification, volume 2725 of Lecture Notes in Computer Science, pages 223-235, 2003.
6. th Int. Conf. on Computer Aided Verification, volume 1855 of Lecture Notes in Computer Science, pages 53-68. Springer Verlag, 2000.
7. E.A. Emerson and V. Kahlon. Reducing model checking of the many to the few. In Proc. 17th International Conference on Automated Deduction, volume 1831 of Lecture Notes in Computer Science, pages 236-254. Springer Verlag, 2000.
8. E.A. Emerson and V. Kahlon. Rapid parameterized model checking of snoopy cache coherence protocols. In Proc. TACAS '03, 9th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, 2003.
9. th ACM Symp. on Principles of Programming Languages, 1995.
10. D. Giammarresi and A. Restivo. Two-dimensional languages. In A. Salomaa and G. Rozenberg, editors, Handbook of Formal Languages, volume 3, Beyond Words, pages 215-267. Springer-Verlag, Berlin, 1997.
11. S. M. German and A. P. Sistla. Reasoning about systems with many processes. Journal of the ACM, 39(3):675-735, 1992.
12. th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 1019 of Lecture Notes in Computer Science, 1996.
13. th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 1785 of Lecture Notes in Computer Science, 2000.
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. L. Lamport. The temporal logic of actions. Technical report, DEC/SRC, 1991.
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. Springer Verlag, 2000.
17. th Int. Conf. on Computer Aided Verification, volume 2404 of Lecture Notes in Computer Science, pages 107-122. Springer Verlag, 2002.
18. th Int. Conf. on Computer Aided Verification, volume 1254 of Lecture Notes in Computer Science, pages 412-423, Haifa, Israel, 1997. Springer Verlag.
19. st IEEE Int. Symp. on Logic in Computer Science, pages 332-344, June 1986.
20. 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.