Automated inductive verification of parameterized protocols

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

Volumn 2102, Issue , 2001, Pages 25-37

  Roychoudhury, Abhik ^a   Ramakrishnan, I V ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; LOCKS (FASTENERS); MULTIPROCESSING SYSTEMS;

BROADCAST PROTOCOLS; CONCURRENT SYSTEMS; FINITE STATE SYSTEMS; INDUCTION HYPOTHESIS; INDUCTIVE VERIFICATION; PARAMETERIZED CACHE COHERENCE PROTOCOLS; PARAMETERIZED SYSTEM; PROGRAM TRANSFORMATIONS;

PARAMETERIZATION;

EID: 84958743703     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44585-4_4     Document Type: Conference Paper

References (29)

1. O. Agesen et al. An efficient meta-lock for implementing ubiquitous synchronization. In ACM SIGPLAN International Conference on Object-Oriented Programming Systems, Languages and Applications (OOPSLA), 1999. Technical report available from http://www.sun.com/research/techrep/1999/abstract-76.html.
2. K. Apt and D. Kozen. Limits for automatic verification of finite-state systems. Information Processing Letters, 15:307-309, 1986.
3. J. Archibald and J.-L. Baer. Cache coherence protocols: Evaluation using a multi­processor simulation model. ACM Transactions on Computer Systems, 4, 1986.
4. S. Basu, S.A. Smolka, and O.R. Ward. Model checking the Java meta-locking algorithm. In IEEE International Conference on the Engineering of Computer Based Systems. IEEE Press, April 2000.
5. N. Bjorner, I.A. Browne, and Z. Manna. Automatic generation of invariants and intermediate assertions. Theoretical Computer Science, 173(1):49-87, 1997.
6. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2), 1986.
7. E.M. Clarke, O. Grumberg, and S. Jha. Verifying parameterized networks. ACM Transactions on Programming Languages and Systems, 19(5), 1997.
8. G. Delzanno. Automatic verification of parameterized cache coherence protocols. In Computer Aided Verification (CAV), LNCS 1855, 2000.
9. E.A. Emerson and K.S. Namjoshi. Reasoning about rings. In ACM SIGPLAN International Conference on Principles ofProgramming Languages (POPL), 1995.
10. E.A. Emerson and K.S. Namjoshi. Automated verification of parameterized syn­chronous systems. In Computer Aided Verification (CAV), LNCS 1102, 1996.
11. E.A. Emerson and K.S. Namjoshi. On model checking for non-deterministic infinite state systems. In IEEE Symposium on Logic in Computer Science (LICS), 1998.
12. J. Esparza, A. Finkel, and R. Mayr. On the verification of broadcast protocols. In IEEE Symposium on Logic in Computer Science (LICS), 1999.
13. S. German and A. Sistla. Reasoning about systems with many processes. Journal of the ACM, 39:675-735, 1992.
14. INRIA Rocquencourt, URL"http://pauillac.inria.fr/coq/doc/main.html", Paris, France. The Coq Proof Assistant: Reference Manual, 1999.
15. C. N. Ip and D. L. Dill. Verifying systems with replicated components in Mur. Formal Methods in System Design, 14(3), May 1999.
16. B. Jonsson and M. Nilsson. Transitive closures of regular relations for verifying infinite-state systems. In International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS), LNCS 1785, 2000.
17. M. Kaufmann, P. Manolis, and J.S. Moore. Computer-Aided Reasoning: An approach. Kluwer Academic, 2000.
18. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. In Computer Aided Verification (CAV), LNCS 1254, 1997.
19. R.P. Kurshan and K. Mcmillan. A structural induction theorem for processes. Information and Computation, 117:1-11, 1995.
20. D. Lesens, N. Halbwachs, and P. Raymond. Automatic verification of parameter­ized linear networks of processes. In ACM SIGPLAN International Conference on Principles of Programming Languages (POPL), pages 346-357, 1997.
21. O. Lichtenstein and A. Pnueli. Checking that inite state concurrent programs satisfy their linear speciication. In ACM SIGPLAN International Conference on Principles of Programming Languages (POPL), 1985.
22. S. Owre, N. Shankar, and J. Rushby. PVS: A Prototype Veriication System. In International Conference on Automated Deduction (CADE), 1992.
23. F. Pong and M. Dubois. A new approach for the veriication of cache coherence protocols. IEEE Transacations on Parallel and Distributed Systems, 6(8), 1995.
24. J.P. Queille and J. Sifakis. Specification and verification of concurrent programs in CESAR. In International Symposium on Programming, LNCS 137, 1982.
25. A. Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I.V. Ramakrishnan, and S. A. Smolka. Veriication of parameterized systems using logic program trans­formations. In International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS), LNCS 1785, pages 172-187, 2000.
26. A. Roychoudhury, K. Narayan Kumar, C.R. Ramakrishnan, and I.V. Ramakr-ishnan. A parameterized unfold/fold transformation framework for definite logic programs. In International Conference on Principles and Practice of Declarative Programming (PPDP), LNCS 1702, pages 396-413, 1999.
27. Abhik Roychoudhury. Program Transformations for Verifying Parameterized Sys­tems. PhD thesis, State University of New York at Stony Brook, Available from "http://www.cs.sunysb.edu/~abhik/papers", 2000.
28. P. Wolper and V. Lovinfosse. Verifying properties of large sets of processes with network invariants. In LNCS 407, 1989.
29. XSB. The XSB logic programming system v2.2, 2000. Available for downloading from "http://xsb.sourceforge.net/".