Justifying proofs using memo tables

Proceedings of the 2nd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn , Issue , 2000, Pages 178-189

  Roychoudhury, Abhik ^a   Ramakrishnan, C R ^a   Ramakrishnan, I V ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ENCODING (SYMBOLS); PROGRAM DEBUGGING; SEMANTICS;

PROOF SYSTEMS;

LOGIC PROGRAMMING;

EID: 0034592744     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/351268.351290     Document Type: Conference Paper

References (34)

1. O. Agesen, D. Detlefs, A. Garthwaite, R. Knippel, Y. S. Ramakrishna, and D. White. An efficient meta-lock for implementing ubiquitous synchronization. In Proceedings of OOPSLA, 1999.
2. T. Arora, R. Ramakrishnan, W.G. Roth, P. Seshadri, and D. Srivastava. Explaining program executions in deductive systems. In Proceedings of DOOD, LNCS 760, 1993.
3. G. S. Bhat, R. Cleaveland, and O. Grumberg. Efficient on-the-fly model checking for CTL*. In LICS'95, pages 388-397, San Diego, July 1995. IEEE Computer Society Press.
4. J. C. Bradfield. Verifying Temporal Properties of Systems. Birkhauser, 1992.
5. M. Carro, L. Gomez, and M. Hermenegildo. Some paradigms for visualizing parallel execution of logic programs. In Intl. Conf. on Logic Programming, 1993.
6. W. Chen and D.S. Warren. Tabled evaluation with delaying for general logic programs. Journal of ACM, 43(1):20-74, 1996.
7. E. M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
8. 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.
9. Subrata K. Das. Deductive Databases and Logic Programming. Addison-Wesley, 1992.
10. T. Diaz and E. Lusk. A graphical tool for observing the behavior of parallel logic programs. In Symposium on Logic Programming, 1987.
11. D. L. Dill. The Mute verification system. In R. Alur and T. A. Henzinger, editors, Computer Aided Verification (CAV '96), volume 1102 of Lecture Notes in Computer Science, pages 390-393, New Brunswick, New Jersey, July 1996. Springer-Verlag.
12. Y. Dong, X. Du, Y. S. Ramakrishna, C. R. Ramakrishnan, I.V. Ramakrishnan, S. A. Smolka, O. Sokolsky, E. W. Stark, and D. S. Warren. Fighting livelock in the i-Protocol: A comparative study of verification tools. In TACAS, volume LNCS 1579, 1999.
13. E. A. Emerson. Temporal and Modal Logic - in Handbook of Theoretical Computer Science: Volume B, Formal Models and Semantics. North-Holland Pub. Co./MIT Press, 1990.
14. M. Fitting. Proof methods for modal and intuitionistic logics. Reidel, 1983.
15. M. Garey and D.S. Johnson. Computers and Intractability. Freeman, 1979.
16. A. Van Gelder, K.A. Ross, and J.S. Schlipf. Unfounded sets and well-founded semantics for general logic programs. Journal of the ACM, 38(3):620-650, 1991.
17. M. Gelfond and V. Lifshitz. The stable model semantics for logic programming. In International Conference and Symposium on Logic Programming, pages 1070 1080, 1988.
18. M. Hermenegildo, G. Puebla, and F. Bueno. Using Global Analysis, Partial Specifications, and an Extensible Assertion Language for Program Validation and Debugging, pages 161-192. 1999.
19. G. J. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279-295, May 1997.
20. J.W. Lloyd. Declarative error diagnosis. New Generation Computing, 5(2):133-154, 1987.
21. S. Mallet and M. Ducasse. Generating deductive database explanations. In Proceedings of ICLP, pages 154-168, 1999.
22. K. L. McMillan. Symbolic Model Checking. Kluwer Academic, 1993.
23. R. Milner. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989.
24. L. Naish, P.W. Dart, and J. Zobel. The NU-prolog debugging environment. In ICLP, pages 521-536, 1989.
25. Frank Pfenning. Logic Programming in the LF logical framework, pages 149-181. Cambridge University Press, 1991.
26. T.C. Przymusinski. Every logic program has a natural stratification and an iterated least fixed point model. In Principles of DataBase Systems, pages 11-21, 1989.
27. 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.
28. Ehud Y. Shapiro. Algorithmic program diagnosis. In POPL, 1982.
29. C.P. Stirling and D.J. Walker. Local model checking in the modal mu-calculus. In Proceedings of TAPSOFT, LNCS 351, pages 369-382, 1989.
30. H. Tamaki and T. Sato. OLDT resolution with tabulation. In International Conference on Logic Programming, pages 84-98, 1986.
31. R. Vaupel, E. Pontelli, and G. Gupta. Visualization of and/or-parallel execution of logic programs. In Intl. Conf. on Logic Programming, 1997.
32. D.S. Warren. Programming in Tabled Prolog. Draft Book: Available at http://www.cs.sunysb.edu/̃warren/xsbbook, 1999.
33. G. Winskel. Model checking the modal ν calculus. In Proceedings of ICALP, 1989.
34. XSB. The XSB logic programming system v2.2, 2000. Available from http://xsb.sourceforge.net/.