Abstract diagnosis

Journal of Logic Programming

Volumn 39, Issue 1, 1999, Pages 43-93

  Comini, Marco ^a   Levi, Giorgio ^a   Meo, Maria Chiara ^b   Vitiello, Giuliana ^c  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF L'AQUILA   (Italy)

^c UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; PROGRAM DEBUGGING; PROGRAM DIAGNOSTICS;

ABSTRACT DIAGNOSIS; ABSTRACT INTERPRETATION; DECLARATIVE DIAGNOSIS;

LOGIC PROGRAMMING;

EID: 0032631541     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(98)10033-X     Document Type: Article

References (44)

1. K.R. Apt, Introduction to logic programming, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics, Elsevier,/ MIT Press, Amsterdam,/ Cambridge, MA, 1990, pp. 495-574.
2. K.R. Apt, From Logic Programming to Prolog, Prentice-Hall, Englewood Cliffs, NJ, 1997.
3. K.R. Apt, E. Marchiori, Reasoning about Prolog programs: From modes through types to assertions, Formal Aspects of Computing 6 (6A) (1994) 743-765.
4. K.R. Apt, D. Pedreschi, Reasoning about termination of pure PROLOG programs, Information and Computation 106 (1) (1993) 109-157.
5. T. Armstrong, K. Marriott, P. Schachte, H. Søndergaard, Boolean functions for dependency analysis: Algebraic properties and efficient representation, in: B. Le Charlier (Ed.), Proc. Static Analysis Symposium, SAS'94, Lecture Notes in Computer Science, vol. 864, Springer, Berlin, 1994, pp. 266-280.
6. A. Bossi, N. Cocco, Verifying correctness of logic programs, in: J. Diaz, F. Orejas (Eds.), Proc. TAPSOFT'89, 1989, pp. 96-110.
7. A. Bossi, M. Gabbrielli, G. Levi, M. Martelli, The s-semantics approach: Theory and applications, Journal of Logic Programming 19/20 (1994) 149-197.
8. A. Bossi, M. Gabbrielli, G. Levi, M.C. Meo, A compositional semantics for logic programs, Theoretical Computer Science 122 (1/2) (1994) 3-47.
9. K.L. Clark, Predicate logic as a computational formalism, Res. Report DOC 79/59, Imperial College, Department of Computing, London, 1979.
10. M. Codish, S.K. Debray, R. Giacobazzi, Compositional analysis of modular logic programs, in: Proceedings of the 20th Annual ACM Symposium on Principles of Programming Languages, ACM Press, New York, 1993, pp. 451-464.
11. M. Comini, Sources of the abstract diagnosis meta-interpreters, Available at http://www.di.unipi.it/ ∼comini/Projects/.
12. M. Comini, An abstract interpretation framework for semantics and diagnosis of logic programs, Ph.D. thesis, Dipartimento di Informatica, Universitè di Pisa, 1998.
13. M. Comini, G. Levi, An algebraic theory of observables, in: M. Bruynooghe (Ed.), Proceedings of the 1994 International Symposium on Logic Programming, MIT Press, Cambridge, MA, 1994, pp. 172-186.
14. M. Comini, G. Levi, M.C. Meo. Compositionality of SLD-derivations and their abstractions, in: J. Lloyd (Ed.), Proceedings of the 1995 International Symposium on Logic Programming, MIT Press, Cambridge, MA, 1995, pp. 561-575.
15. M. Comini, G. Levi, M.C. Meo, A theory of observables for logic programs, http://www.di.unipi.it/ ∼comini/Papers/, 1996 (submitted).
16. M. Comini, G. Levi, M.C. Meo, G. Vitiello, Proving properties of logic programs by abstract diagnosis, in: M. Dams (Ed.), Analysis and Verification of Multiple-Agent Languages, 5th LOMAPS Workshop, Lecture Notes in Computer Science, vol. 1192 Springer, Berlin, 1996, pp. 22-50.
17. M. Comini, G. Levi, G. Vitiello, Abstract debugging of logic programs, in: L. Fribourg, F. Turini (Eds.), Proc. Logic Program Synthesis and Transformation and Metaprogramming in Logic 1994, Lecture Notes in Computer Science, vol. 883, Springer, Berlin, 1994, pp. 440-450.
18. M. Comini, G. Levi, G. Vitiello, Declarative diagnosis revisited, in: J. Lloyd (Ed.), Proceedings of the 1995 International Symposium on Logic Programming, MIT Press, Cambridge, MA, 1995, pp. 275-287.
19. M. Comini, G. Levi, G. Vitiello, Efficient detection of incompleteness errors in the abstract debugging of logic programs, in: M. Ducassé (Ed.), Proceedings of the Second International Workshop on Automated and Algorithmic Debugging, AADEBUG'95, 1995.
20. M. Comini, M.C. Meo, Compositionality properties of SLD-derivations, Theoretical Computer Science, 211 (1999) 275-309.
21. A. Cortesi, G. Filè W. Winsborough, Prop revisited: Propositional formula as abstract domain for groundness analysis, in: Proceedings of the Sixth IEEE Symposium on Logic In Computer Science, IEEE Computer Soc. Press, Silver Spring, MD, 1991, pp. 322-327.
22. P. Cousot, R. Cousot, Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: Proceedings of the Fourth ACM Symposium on Principles of Programming Languages, 1977, pp. 238-252.
23. P. Cousot, R. Cousot, Systematic design of program analysis frameworks, in: Proceedings of the Sixth ACM Symposium on Principles of Programming Languages, 1979, pp. 269-282.
24. W. Drabent, J. Maluszynski, Inductive assertion method for logic programs, Theoretical Computer Science 59 (1) (1988) 133-155.
25. W. Drabent, S. Nadjm-Tehrani, J. Maluszynski, Algorithmic debugging with assertions, in: H. Abramson, M.H. Rogers (Eds.), Meta-Programming in Logic Programming, MIT Press, Cambridge, MA, 1989, pp. 383-398.
26. E. Eder, Properties of substitutions and unification, Journal of Symbolic Computation 1 (1985) 31-46.
27. M. Falaschi, G. Levi, M. Martelli, C. Palamidessi, Declarative modeling of the operational behavior of logic languages, Theoretical Computer Science 69 (3) (1989) 289-318.
28. G. Ferrand, Error diagnosis in logic programming, an adaptation of E.Y. Shapiro's method, Journal of Logic Programming 4 (1987) 177-198.
29. G. Ferrand, The notions of symptom and error in declarative diagnosis of logic programs, in: P.A. Fritzson (Ed.), Automated and Algorithmic Debugging, Proc. AADEBUG '93, Lecture Notes in Computer Science, vol. 749, Springer, Berlin, 1993, pp. 40-57.
30. R. Giacobazzi, F. Scozzari, Intuitionistic implication in abstract interpretation, in: H. Glaser, P. Hartel, H. Kuchen (Eds.), Proceedings of the Ninth International Symposium on Programming Languages, Implementations, Logics and Programs PLILP'97, Lecture Notes in Computer Science, Springer, vol. 1292. Berlin, 1997, pp. 175-189.
31. J.L. Lassez, M.J. Maher, K. Marriott, Unification revisited, in: J. Minker (Ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos, Ca, 1988, pp. 587-625.
32. G. Levi, F. Spoto, A denotational semantics for prolog, in: M. Falaschi, M. Navarro, A. Policriti (Eds.), Proceedings of the APPIA-GULP-PRODE'97 Joint Conference on Declarative Programming, 1997, pp. 201-212.
33. G. Levi, P. Volpe, A reconstruction of verification techniques by abstract interpretation, in: ILPS'97. Workshop on Verification, Model Checking and Abstract Interpretation, 1997.
34. Y. Lichtenstein, E.Y. Shapiro, Abstract algorithmic debugging, in: R.A. Kowalski, K.A. Bowen (Eds.), Proceedings of the Fifth International Conference and Symposium on Logic Programming, Seattle, 1988, pp. 512-531.
35. J.W. Lloyd, Declarative error diagnosis, New Generation Computing 5 (2) (1987) 133-154.
36. J.W. Lloyd, Foundations of Logic Programming, 2nd ed., Springer, Berlin, 1987.
37. P. Mancarella, D. Pedreschi, An algebra of logic programs, in: R.A. Kowalski, K.A. Bowen (Eds.), Proceedings of the Fifth International Conference on Logic Programming, MIT Press, Cambridge, MA, 1988, pp. 1006-1023.
38. K. Marriott, H. Søndergaard, Precise and efficient groundness analysis for logic programs, ACM Letters on Programming Languages and Systems 2 (1-4) (1993) 181-196.
39. L. Naish, Declarative diagnosis of missing answers, New Generation Computing 10 (1991) 255-285.
40. L.M. Pereira, Rational debugging in logic programming, in: E.Y. Shapiro (Ed.), Proceedings of the Third International Conference on Logic Programming, Lecture Notes in Computer Science, vol. 225, Springer, Berlin, 1986, pp. 203-210.
41. T. Sato, H. Tamaki, Enumeration of success patterns in logic programs, Theoretical Computer Science 34 (1984) 227-240.
42. F. Scozzari, Logical optimality of groundness analysis, in: P. Van Hentenryck (Ed.), Proceedings of International Static Analysis Symposium, SAS'97, Lecture Notes in Computer Science, vol. 1302, Springer, Berlin, 1997, pp. 83-97.
43. E.Y. Shapiro, Algorithmic program debugging, in: Proceedings of the Ninth Annual ACM Symposium on Principles of Programming Languages, ACM Press, New York, 1982, pp. 412-531.
44. L. Sterling, E.Y. Shapiro, The Art of Prolog, MIT Press, Cambridge, MA, 1986.