On the verification of finite failure

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

Volumn 1702, Issue , 1999, Pages 311-327

  Gori, Roberta ^a   Levi, Giorgio ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Abstract interpretation; Finite failure; Logic programming; Program verification

Indexed keywords

SEMANTICS;

ABSTRACT INTERPRETATIONS; EFFECTIVE PROGRAMS; FINITE FAILURE; FIX-POINT SEMANTICS; FIXPOINTS; PROGRAM VERIFICATION; VERIFICATION METHOD;

LOGIC PROGRAMMING;

EID: 84978966689     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10704567_19     Document Type: Conference Paper

References (24)

1. K. R. Apt. Introduction to Logic Programming. In J. van Leeuwen, editor, Hand-book of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 495-574. Elsevier and The MIT Press, 1990. 312.
2. K. R. Apt and E. Marchiori. Reasoning about Prolog programs: from modes through types to assertions. Formal Aspects of Computing, 6(6A): 743-765, 1994. 311.
3. K. R. Apt and M. H. van Emden. Contributions to the theory of logic programming. Journal of the ACM, 29(3): 841-862, 1982. 312.
4. A. Bossi and N. Cocco. Verifying correctness of logic programs. In J. Diaz and F. Orejas, editors, Proc. TAPSOFT'89, pages 96-110, 1989. 311.
5. M. Bruynooghe, H. Vandecasteele, D. A. de Waal, and M. Denecker. Detecting unsolvable queries for definite logic programs. In Palamidessi, Glaser, and Meinke, editors, Proc. 10th Int'l Conf. and Symp. Principle of Declarative Programming, Lecture Notes in Computer Science, pages 118-133. Springer-Verlag, 1998. 312, 316.
6. F. Bueno, P. Deransart, W. Drabent, G. Ferrand, M. Hermenegildo, J. Maluszynsky, and G. Puebla. On the role of semantic approximations in validation and diagnosis of constraint logic programs. In Mariam Kamkar, editor, Proceedings of the Third International Workshop on Automatic Debugging, AADEBUG'97, 1997. 317.
7. M. Comini, G. Levi, M. C. Meo, and G. Vitiello. Abstract diagnosis. Journal of Logic Programming, 39(1-3): 43-93, 1999. 311, 323.
8. M. Comini and M. C. Meo. Compositionality properties of SLD-derivations. The-oretical Computer Science, 211(1-2): 275-309, 1999. 312.
9. P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Proc. Fourth ACM Symp. Principles of Programming Languages, pages 238-252, 1977. 311, 312.
10. P. Cousot and R. Cousot. Systematic Design of Program Analysis Frameworks. In Proc. Sixth ACM Symp. Principles of Programming Languages, pages 269-282, 1979. 311, 312.
11. W. Drabent and J. Maluszynski. Inductive Assertion Method for Logic Programs. Theoretical Computer Science, 59(1): 133-155, 1988. 311.
12. G. Ferrand. Error Diagnosis in Logic Programming, an Adaptation of E. Y. Shapiro's Method. Journal of Logic Programming, 4: 177-198, 1987. 311.
13. G. Ferrand. The notions of symptom and error in declarative diagnosis of logic programs. In P. A. Fritzson, editor, Automated and Algorithmic Debugging, Proc. AADEBUG '93, volume 749 of Lecture Notes in Computer Science, pages 40-57. Springer-Verlag, 1993. 311, 312, 316, 325, 325.
14. R. Gori and G. Levi. Finite failure is and-compositional. Journal of Logic and Computation, 7(6): 753-776, 1997. 312, 315, 319.
15. R. Gori and G. Levi. On finite failure. Technical report, Dipartimento di Infor-matica, Universitá di Pisa, 1997. 312.
16. G. Levi, M. Martelli, and C. Palamidessi. Failure and success made symmetric. In S. K. Debray and M. Hermenegildo, editors, Proc. North American Conf. on Logic Programming'90, pages 3-22. The MIT Press, 1990. 312, 315.
17. G. Levi and P. Volpe. Derivation of proof methods by abstract interpretation. In Palamidessi, Glaser, and Meinke, editors, Proc. 10th Int'l Conf. and Symp. Principle of Declarative Programming, Lecture Notes in Computer Science, pages 102-117. Springer-Verlag, 1998. 311, 325, 325.
18. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987. Second edition. 312.
19. K. Marriott and H. Sándergaard. On Describing Success Patterns of Logic Pro-grams. Technical Report 12, The University of Melbourne, 1988. 317.
20. T. Sato and H. Tamaki. Enumeration of Success Patterns in Logic Programs. Theoretical Computer Science, 34: 227-240, 1984. 318.
21. E. Y. Shapiro. Algorithmic program debugging. In Proc. Ninth Annual ACM Symp. on Principles of Programming Languages, pages 412-531. ACM Press, 1982. 311.
22. E. Y. Shapiro. Algorithmic Program Debugging. The MIT Press, 1983. 311.
23. P. Volpe. Derivation of proof methods for logic programs by abstract interpretation. PhD thesis, Universita' di Napoli, 1998. 311, 325, 325.
24. P. Volpe. A first-order language for expressing aliasing and type properties of logic programs. In G. Levi, editor, Proceeding of the Joint International Symposium SAS'98, 1998. 326.