Verifying parameterized networks using abstraction and regular languages

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

Volumn 962, Issue , 1995, Pages 395-407

  Clarke, E M ^a   Grumberg, O ^b   Jha, S ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING;

CONTEXT-FREE; NON-TRIVIAL; PARAMETERIZED; STATE TRANSITION SYSTEMS;

COMPUTATIONAL LINGUISTICS;

EID: 84947707419     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60218-6_30     Document Type: Conference Paper

References (21)

1. K. Apt and D. Kozen. Limits for automatic verification of finite-stute systems. IPL, 15:307-309, 1986.
2. M. Browne, E. Claxke, azd O. Grumberg. Reasoning about networks with many identical finite-state processes. Inf. and Computation, 81(1):13-311 Apr. 1989.
3. J. Butch, E. Claxke, K. McMillan, D. Dill, and L. Hwang. Symbolic model checking: 1020 states and beyond. InI. and Computation, 98(2):142-170, June 1992.
4. E. M. Clarke and E. A. Emerson. Synthesis of synchronization skeletons for branching time temporal logic. In Logic of Programs: Workshop, Yorktown Heights, NY, May 1981, volume 131 of LNCS. Springer-Verlag, 1981.
5. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Prog. Lang. Syst., 8(2):244--263, 1986.
6. E. M. Clarke, O. Grumberg, and D. E. Long. Model checking and abstraction. In Proc. 19th Ann. ACM Syrup. on Principles of Prog. Lang., Jan. 1992.
7. D. Dams, O. Grumberg, and R. Gerth. Abstract interpretation of reactive systems: Abstractions preserving ACTL*, ECTL*, and CTL*. In IFIP working conference and Programming Concepts, Methods and Calculi (PROCOMET'94), San Miniato, Italy, June 1994.
8. E. Dijkstra. lnvariance and non-determinacy. In C. Hoaxe and J. Sheperdson, editors, Mathematical Logic and Programming Languages. 1985.
9. E. Emerson and K. S. Namjoahi. Reasoning about rings. In Proc., 22nd Ann. ACM Syrup. on Principles of Prog. Lang., Jan. 1995.
10. S. German and A. Sistla. Reasoning about systems with many processes, J ACM, 39:675-735, 1992.
11. R. P. Kurshan and K. L. McMiUan. A structural induction theorem for processes. In Proc. 8th Ann. ACM Syrup. on Principles of Distributed Computing. ACM Press, Aug. 1989.
12. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proc. 12th Ann. ACM Syrup. on Principles of Prog. Lang., Jan. 1985.
13. R. MexelIy and O. Grumberg. GOKMEL---Grammar Oriented Model checker. Technical Report 697, The Technion, Oct. 1991.
14. R. Milner. An algebraic definition of simulation between programs. In In Proceedings oy the s International Joint Conference on Artificial Intelligence, pages 481-489, 1971.
15. R. Milner. A Calculus of Communicating Systems, volume 92 of LNCS. Springer-Verlag, 1980.
16. J. Qulelle and J. Sifakis. Specification and verification of concurrent systems in CESAR. In Proc. Fifth Int. Syrup. in Programming, 1981.
17. Z. Shtadler and O. Grumberg. Network grammars, communication behaviors and automatic verification. In Sifakis [18].
18. J. Sifakis, editor. Proc. 1989 Int. Workshop on Automatic Verification Methods for Finite State Systems, volume 407 of LNCS. Springer-Verlag, June 1989.
19. J. D. Ullman. Computational Aspects of VLSI. Computer Science Press, 1984.
20. I. Vernier. Parameterized evaluation of CTL-X formulae. In Workshop accompanying the Internation Conference on Temporal Logic (ICTL'94), 1994.
21. P. Wolper and V. Lovinfosse. Verifying properties of large sets of processes with network invariants. In Sifakis [18].