Verification of parameterized systems using logic program transformations

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

Volumn 1785 LNCS, Issue , 2000, Pages 172-187

  Roychoudhury, Abhik ^a   Kumar, K Narayan ^b   Ramakrishnan, C R ^a   Ramakrishnan, I V ^a   Smolka, Scott A ^a  

^a Stony Brook University   (United States)

^b CHENNAI MATHEMATICAL INSTITUTE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING; MODEL CHECKING; ALGORITHMS; ELECTRIC NETWORK TOPOLOGY; JOINT PROSTHESES;

ALGORITHMIC MODEL; BI-DIRECTIONAL; DEDUCTIVE VERIFICATION; LOGIC PROGRAMS; NETWORK TOPOLOGY; NEW THEORY; PARAMETERIZED SYSTEM; SEAMLESS INTEGRATION;

COMPUTER CIRCUITS; LOGIC PROGRAMMING;

EID: 84863927612     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46419-0_13     Document Type: Conference Paper

References (29)

1. R. Alur and T. A. Henzinger, editors. Computer Aided Verification (CAV '96), Volume 1102 of Lecture Notes in Computer Science, New Brunswick, New Jersey, July 1996. Springer-Verlag.
2. K. Apt and D. Kozen. Limits for automatic verification of finite-state systems. Information Processing Letters, 15:307-309, 1986. (Pubitemid 16589252)
3. M. Browne, E. Clarke, and O. Grumberg. Reasoning about networks with many identical finite-state processes. Information and Computation, 81(1):13-31, 1989.
4. S. Basu, S.A. Smolka, and O.R. Ward. Model checking the Java metalocking algorithm. In IEEE International Conference on the Engineering of Computer Based Systems. IEEE Press, April 2000.
5. E. Clarke, O. Grumberg, and S. Jha. Verifying parametrized networks using abstraction and regular languages. In CONCUR, LNCS 962, 1995.
6. D. L. Dill. The Murφ verification system. In Alur and Henzinger [AH96], pages 390-393.
7. G. Delzanno and A. Podelski. Model checking in CLP. In TACAS'99, Volume LNCS 1579, pages 74-88. Springer-Verlag, March 1999.
8. X. Du, C.R. Ramakrishnan, and S.A. Smolka. Tabled resolution + constraints: A recipe for model checking real-time systems. Technical report, Dept. of Computer Science, SUNY Stony Brook, http://www.cs.sunysb.edu/~vicdu/ papers, 1999.
9. X. Du, S. A. Smolka, and R. Cleaveland. Local model checking and protocol analysis. Software Tools for Technology Transfer, 1999.
10. E. Emerson and K.S. Namjoshi. Reasoning about rings. In POPL, pages 85-94, 1995.
11. S. Graf and H. Saidi. Verifying invariants using theorem proving. In Alur and Henzinger [AH96].
12. G. J. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279-295, May 1997. (Pubitemid 127828295)
13. C. N. Ip and D. L. Dill. Verifying systems with replicated components in Murφ. Formal Methods in System Design, 14(3), May 1999.
14. R.P. Kurshan and K. Mcmillan. A structural induction theorem for processes. Information and Computation, 117:1-11, 1995.
15. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model-checking with rich assertional languages. In CAV, LNCS 1254, 1997.
16. D. Lesens, N. Halbwachs, and P. Raymond. Automatic verification of parametrized linear networks of processes. In POPL, pages 346-357, 1997.
17. J.W. Lloyd. Foundations of Logic Programming, Second Edition. Springer-Verlag, 1993.
18. K. L. McMillan. Symbolic Model Checking. Kluwer Academic, 1993.
19. R. Milner. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989.
20. S. Owre, N. Shankar, and J. Rushby. PVS: A Prototype Verification System. Proceedings of CADE, 1992.
21. A. Pettorossi and M. Proietti. Synthesis and transformation of logic programs using unfold/fold proofs. Journal of Logic Programmi ng, 41, 1999.
22. A. Roychoudhury, K. Narayan Kumar, C.R. Ramakrishnan, and I.V. Ramakrishnan. Beyond Tamaki-Sato style unfold/fold transformations for normal logic programs. In ASIAN, LNCS 1742, pages 322-333, 1999.
23. A. Roychoudhury, K. Narayan Kumar, C.R. Ramakrishnan, and I.V. Ramakrishnan. A parameterized unfold/fold transformation framework for definite logic programs. In PPDP, LNCS 1702, pages 396-413, 1999.
24. A. Roychoudhury. Program transformations for automated verification of parameterized concurrent systems. Technical report, Department of Computer Science, State University of New York at Stony Brook, http://www.cs.sunysb.edu/ ~abhik/papers, 1999. Dissertation proposal.
25. Y.S. Ramakrishna, C.R. Ramakrishnan, I.V. Ramakrishnan, S.A. Smolka, T. Swift, and D.S. Warren. Efficient model checking using tabled resolution. In CAV, LNCS 1254, 1997.
26. S. Rajan, N. Shankar, and M. K. Srivas. An integration of model checking with automated proof checking. In CAV, LNCS 939, 1995.
27. L. Urbina. Analysis of hybrid systems in CLP(R). In Constraint Programming (CP'96), Volume LNCS 1102. Springer-Verlag, 1996.
28. P. Wolper and V. Lovinfosse. Verifying properties of large sets of processes with network invariants. In Automatic Verification Methods for Finite State Systems, LNCS 407, 1989.
29. The XSB logic programming system v2.01, 1999. Available by anonymous ftp from www.cs.sunysb.edu/~sbprolog.