Abstract Interpretation of Logic Programs: An Abstract Domain for Groundness, Sharing, Freeness and Compoundness Analysis

Interpretation of logic programs: an abstract domain for groundless, sharing, freeness and compoundness analysis Agostino Cortesi and Gilberto Fi16 Dept. of Mathematics University of Padova Via Belzoni 7, 1-35131 Padova ITALY matOl@unipad.infn .it Abstract: An abstract domain for the Abstract Interpretation of logic programs is presented. This domain synthesizes the following properties of substitutions: groundless, sharing, freeness, covering, equivalence and compoundness of variables. The soundness of the domain together with the corresponding abstract unification is formally proven. An abstract domain for the Abstract Interpretation of logic programs is presented. This domain synthesizes the following properties of substitutions: groundless, sharing, freeness, covering, equivalence and compoundness of variables. The soundness of the domain together with the corresponding abstract unification is formally proven.

[1]  Krzysztof R. Apt,et al.  Introduction to Logic Programming , 1988 .

[2]  Manuel V. Hermenegildo,et al.  Combined Determination of Sharing and Freeness of Program Variables through Abstract Interpretation , 1991, ICLP.

[3]  Tadashi Kanamori,et al.  Abstract Interpretation based on OLDT Resolution , 1993, J. Log. Program..

[4]  Agostino Cortesi,et al.  Abstract interpretation of logic programs: an abstract domain for groundness, sharing, freeness and compoundness analysis , 1991, PEPM '91.

[5]  Philippe Codognet,et al.  Abstract Interpretation for Concurrent Logic Languages , 1990, NACLP.

[6]  Neil D. Jones,et al.  Data flow analysis of applicative programs using minimal function graphs , 1986, POPL '86.

[7]  William H. Winsborough,et al.  Multiple Specialization using Minimal-Function Graph Semantics , 1992, J. Log. Program..

[8]  Andrew Taylor.  Removal of Dereferencing and Trailing in Prolog Compilation , 1989, ICLP.

[9]  A. Cortesi,et al.  Prop revisited: propositional formula as abstract domain for groundness analysis , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[10]  Kim Marriott,et al.  Analysis of Constraint Logic Programs , 1990, NACLP.

[11]  Saumya K. Debray,et al.  Automatic Mode Inference for Logic Programs , 1988, J. Log. Program..

[12]  Doug DeGroot,et al.  AND-Parallelism of Logic Programs Based on a Static Data Dependency Analysis , 1985, COMPCON.

[13]  Saumya K. Debray,et al.  Static inference of modes and data dependencies in logic programs , 1989, TOPL.

[14]  Kim Marriott,et al.  Notes for a Tutorial on Abstract Interpretation of Logic Programs , 1989 .

[15]  Alberto Pettorossi,et al.  Decidability Results and Characterization of Strategies for the Development of Logic Programs , 1989, ICLP.

[16]  Dean Jacobs,et al.  Accurate and Efficient Approximation of Variable Aliasing in Logic Programs , 1989, NACLP.

[17]  Alvin M. Despain,et al.  Semi-Intelligent Backtracking of Prolog Based on Static Data Dependency Analysis , 1985, SLP.

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