Reducing model checking of the many to the few

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1831, Issue , 2000, Pages 236-254

  Emerson, E Allen ^a   Kahlon, Vineet ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; COMPUTABILITY AND DECIDABILITY; SYSTEMS ANALYSIS; THEOREM PROVING;

ARBITRARY NUMBER; ASYNCHRONOUS SYSTEM; CLASS TEMPLATES; CORRECTNESS PROPERTIES; GENERIC PROCESS; PARAMETERIZED MODEL CHECKING; PROCESS TEMPLATE; TEMPORAL PROPERTY;

MODEL CHECKING;

EID: 84937416737     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/10721959_19     Document Type: Conference Paper

References (22)

1. K. Apt and D. Kozen. Limits for automatic verification of finite-state concurrent systems. Information Processing Letters, 15, pages 307-309, 1986.
2. P.C. Attie and E.A. Emerson. Synthesis of Concurrent Systems with Many Similar Processes. ACM Transactions on Programming Languages and Systems, Vol. 20, No. 1, January 1998, pages 51-115.
3. M.C. Browne, E.M. Clarke and O. Grumberg. Reasoning about Networks with Many Identical Finite State Processes. Information and Control, 81 (1), pages 13-31, April 1989.
4. E.M. Clarke and O. Grumberg. Avoiding the State Explosion Problem in Tempo-ral Logic Model Checking Algorithms. In Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, pages 294-303, 1987.
5. E.M. Clarke, O. Grumberg and S. Jha. Verifying Parameterized Networks using Abstracion and Regular Languages. In CONCUR '95: Concurrency Theory, Pro-ceedings of the 6th International Conference, LNCS 962, pages 395-407, Springer-Verlag, 1995.
6. E.A. Emerson and K.S. Namjoshi. Reasoning about Rings. In Conference Record of POPL '95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Pro-gramming Languages, pages 85-94, 1995.
7. E.A. Emerson and K.S. Namjoshi. Automatic Verification of Parameterized Syn-chronous Systems. In Computer Aided Verification, Proceedings of the 8th Inter-national Conference. LNCS, Springer-Verlag, 1996.
8. E.A. Emerson and A.P. Sistla. Symmetry and Model Checking. In Computer Aided Verification, Proceedings of the 5th International Conference. LNCS 697, Springer-Verlag, 1993.
9. E. Emerson and R. Trefler, Parametric Quantitative Temporal Reasoning. LICS 1999, 336-343.
10. S.M. German and A.P. Sistla. Reasoning about Systems with Many Processes. J. ACM, 39 (3), July 1992.
11. C. Ip and D. Dill. Better verification through symmetry. In Proceedings of the 11th International Symposium on Computer Hardware Description Languages and their Applications.1993.
12. C. Ip and D. Dill, Verifying Systems with Replicated Components in Murphi, pp. 147-158 CAV 1996.
13. R.P. Kurshan and L. McMillan. A Structural Induction Theorem for Processes. In Proceedings of the Eight Annual ACM Symposium on Principles of Distributed Computing, pages 239-247, 1989.
14. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specifications. In Conference Record of POPL '85: 12nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 97-107, 1985.
15. B. Lubachevsky. An Approach to Automating the Verification of Compact Parallel Coordination Programs I.Acta Informatica 21, 1984.
16. K. McMillan, Verification of Infinite State Systems by Compositional Model Check-ing, CHARME'99.
17. A. Pnueli. The Temporal Logic of Programs. In Proceedings of the eighteenth Sym-posium on Foundations of Computer Science. 1977.
18. F. Pong and M. Dubois. A New Approach for the Verification of Cache Coherence Protocols. IEEE Transactions on Parallel and Distributed Systems, August 1995.
19. A. P. Sistla, Parameterized Verification of Linear Networks Using Automata as Invariants, CAV, 1997, 412-423.
20. M. Vardi and P. Wolper. An Automata-Theoretic Approach to Automatic Program Verification. In Proceedings, Symposium on Logic in Computer Science, pages 332-344, 1986.
21. I. Vernier. Specification and Verification of Parameterized Parallel Programs. In Proceedings of the 8th International Symposium on Computer and Information Sciences, Istanbul, Turkey, pages 622-625,1993.
22. P. Wolper and V. Lovinfosse. Verifying Properties of Large Sets of Processes with Network Invariants. In J. Sifakis (ed) Automatic VerificationMetods for Finite State Systems, Springer-Verlag, LNCS 407, 1989.