Specification-based automatic verification of prolog programs

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

Volumn 1207, Issue , 1997, Pages 38-57

  Cortesi, Agostino ^a   le Charlier, Baudouin ^b   Rossi, Sabina ^c  

^a Dipartimento di Matematica e Informatica   (Italy)

^b Institut d'Informatique   (Belgium)

^c Pura e Applicata   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FORMAL LOGIC; FORMAL SPECIFICATION; LOGIC PROGRAMMING; STATIC ANALYSIS;

A-PROLOG; AUTOMATIC VERIFICATION; COMPLEXITY ANALYSIS; INPUT/OUTPUT; PROGRAM TERMINATION; PROLOG PROGRAMS; VERIFICATION PROCESS;

PROLOG (PROGRAMMING LANGUAGE);

EID: 84949430993     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62718-9_3     Document Type: Conference Paper

References (19)

1. A. Bossi, N. Cocco, and M. Fabris. Norms on Terms and Their Use in Proving Universal Termination of a Logic Program, Theoretical Computer Science, 124:297-328, 1994.
2. C. Braem, B. Le Charlier, S. Modart, and P. Van Hentenryck. Cardinality Analysis of Prolog. In Proc. Int’l Logic Programming Symposium, (ILPS’94), Ithaca, NY. The MIT Press, Cambridge, Mass., 1994.
3. K.L. Clark. Negation as Failure. In H. Gallaire and J. Minker editors, Advances in Data Base Theory, Plenum Press, New York, pp. 293-322, 1978.
4. J. Cohen and J. Katcoff. Symbolic solution of finite-difference equations. ACM Transactions on Mathematical Software, 3(3):261-271, 1977.
5. A. Cortesi, B. Le Charlier and P. van Hentenryck, Conceptual and Software Support for Abstract Domain Design: Generic Structural Domain and Open Product. Technical Report CS-93-13, Brown University, 1993.
6. A. Cortesi, B. Le Charlier and P. van Hentenryck, Combinations of Abstract Domains for Logic Programming, In Proc. 21th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL’94), ACM-Press, New York, pp. 227-239, 1994.
7. P. De Boeck and B. Le Charlier. Static Type Analysis of Prolog Procedures for Ensuring Correctness. In P. Deransart and J. Maluszyński, editors, Proc. Second Int’l Symposium on Programming Language Implementation and Logic Programming, (PLILP’90), LNCS 456, Springer-Verlag, Berlin, 1990.
8. P. De Boeck and B. Le Charlier. Mechanical Transformation of Logic Definitions Augmented with Type Information into Prolog Procedures: Some Experiments. In Proc. Int’l Workshop on Logic Program Synthesis and Transformation, (LOP-STR’93). Springer Verlag, July 1993.
9. S. K. Debray and N, W. Lin. Cost analysis of logic programs. ACM Transactions on Programming Languages and Systems, 15(5):826-875, 1993.
10. D. De Schreye, K. Verschaetse, and M. Bruynooghe. A Framework for analyzing the termination of definite logic programs with respect to call patterns. In H. Tanaka, editor, FGCS’92, 1992.
11. Y. Deville. Logic Programming: Systematic Program Development. Addison-Wesley, 1990.
12. J. Henrard and B. Le Charlier. FOLON: An Environment for Declarative Construction of Logic Programs (extended abstract). In M. Bruynooghe and M. Wirsing, editors, Proc. Fourth Int’l Workshop on Programming Language Implementation and Logic Programming (PLILP’92), LNCS 631 Springer-Verlag, pp. 237-231, 1992.
13. J. Ivie. Some MACSYMA programs for solving recurrence relations. ACM Transactions on Mathematical Software, 4(1):24-33, 1978.
14. B. Le Charlier, and S. Rossi. Automatic Derivation of Totally Correct Prolog Procedures from Logic Descriptions. Research Report RP-95-009, University of Namur.
15. B. Le Charlier, S. Rossi, and P. Van Hentenryck. An Abstract Interpretation Framework which Accurately Handles Prolog Search-Rule and the Cut. In Proc. Int. Logic Programming Symposium, (ILPS’94), Ithaca, NY. The MIT Press, Cambridge, Mass., 1994.
16. B. Le Charlier and P. Van Hentenryck. Experimental evaluation of a generic abstract interpretation algorithm for Prolog. ACM Transactions on Programming Languages and Systems, 16(1), pp. 35-101, 1994.
17. C. Leclère and B. Le Charlier. Two Dual Abstract Operations to Duplicate, Eliminate, Equalize, Introduce and Rename Place-Holders Occurring Inside Abstract Descriptions. Research Paper N. RP-96-028, University of Namur, Belgium, September 1996.
18. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, 1987. Second edition.
19. P. van Hentenryck, A. Cortesi, and B. Le Charlier, Evaluation of the Domain Prop. The Journal of Logic Programming 23 (3):237-278, 1995.