Reexecution-Based Analysis of Logic Programs with Delay Declarations

A general semantics-based framework for the analysis of logic programs with delay declarations is presented. The framework incorporates well known refinement techniques based on reexecution. The concrete and abstract semantics express both deadlock information and qualified answers.

[1]  Pascal Van Hentenryck,et al.  Experimental evaluation of a generic abstract interpretation algorithm for PROLOG , 1994, TOPL.

[2]  Lee Naish,et al.  Negation and Control in Prolog , 1986, Lecture Notes in Computer Science.

[3]  Agostino Cortesi,et al.  Optimal Groundness Analysis Using Propositional Logic , 1996, J. Log. Program..

[4]  Maurice Bruynooghe,et al.  A Practical Framework for the Abstract Interpretation of Logic Programs , 1991, J. Log. Program..

[5]  Pascal Van Hentenryck,et al.  Evaluation of the Domain Prop , 1995, J. Log. Program..

[6]  Agostino Cortesi,et al.  Operational Semantics for Reexecution-based Analysis of Logic Programs with Delay Declarations , 2001, APPIA-GULP-PRODE.

[7]  Krzysztof R. Apt,et al.  Verification of Logic Programs with Delay Declarations , 1995, AMAST.

[8]  Pascal Van Hentenryck,et al.  Combinations of abstract domains for logic programming , 1994, POPL '94.

[9]  J. W. Lloyd,et al.  Foundations of logic programming; (2nd extended ed.) , 1987 .

[10]  Elena Marchiori,et al.  Proving Termination of Logic Programs with Delay Declarations , 1996, ILPS.

[11]  Peter J. Stuckey,et al.  Efficient Analysis of Logic Programs with Dynamic Scheduling , 1995, ILPS.

[12]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[13]  Katherine A. Yelick,et al.  Moded type systems for logic programming , 1989, POPL '89.

[14]  Kim Marriott,et al.  Analyzing logic programs with dynamic scheduling , 1994, POPL '94.

[15]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[16]  Patrick Cousot,et al.  Systematic design of program analysis frameworks , 1979, POPL.

[17]  Pascal Van Hentenryck,et al.  Combinations of abstract domains for logic programming: open product and generic pattern construction , 2000, Sci. Comput. Program..

[18]  Bart Demoen,et al.  Abstract Interpretation: Towards the Global Optimization of Prolog Programs , 1987, SLP.

[19]  Maurizio Gabbrielli,et al.  Constraint Logic Programming with Dynamic Scheduling: A Semantics Based on Closure Operators , 1997, Inf. Comput..

[20]  Mats Carlsson,et al.  SICStus Prolog User''s Manual , 1993 .