## Global Analysis of Constraint Logic Programs (1996)

### Cached

### Download Links

- [www.cs.kuleuven.ac.be]
- [www.cs.mu.oz.au]
- [clip.dia.fi.upm.es]
- [www.clip.dia.fi.upm.es]
- [clip.dia.fi.upm.es]
- [www.clip.dia.fi.upm.es]
- [www.clip.dia.fi.upm.es]
- DBLP

### Other Repositories/Bibliography

Citations: | 81 - 42 self |

### BibTeX

@MISC{Banda96globalanalysis,

author = {Maria Garcia de la Banda and M. Hermenegildo and Maurice Bruynooghe and V. Dumortier and Gerda Janssens and W. Simoens},

title = {Global Analysis of Constraint Logic Programs},

year = {1996}

}

### Years of Citing Articles

### OpenURL

### Abstract

### Citations

1890 |
Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints
- Cousot, Cousot
- 1977
(Show Context)
Citation Context ...menegildo et al. 1992; Van Roy and Despain 1992; Muthukumar and Hermenegildo 1992; Santos-Costa et al. 1991; Bueno et al. 1994]. The underlying theory, formalized in terms of abstract interpretation [=-=Cousot and Cousot 1977-=-], and the related implementation techniques are well understood for several general types of analysis and, in particular, for top-down analysis of Prolog [Debray 1989; 1992; Bruynooghe 1991; Muthukum... |

1856 | Foundations of Logic Programming - Lloyd - 1987 |

997 | Depth-first search and linear graph algorithms
- Tarjan
- 1972
(Show Context)
Citation Context ...invocation of the fixed-point algorithm a step is performed in which the set of predicates in the program is split into the SCCs based on the call graph of the program found using Tarjan’s algorithm [=-=Tarjan 1972-=-]. This information, among other things, allows determining which predicates and which rules of a predicate are recursive. PLAI (and its incremental extensions) also incorporates some additional optim... |

786 | Constraint logic programming - Jaffar, Lassez - 1987 |

769 | Constraint logic programming: A survey - Jaffar, Maher - 1994 |

635 | Systematic design of program analysis frameworks
- Cousot, Cousot
(Show Context)
Citation Context ...correctly describe the contribution of each remaining rule. This approach is obviously inaccurate but simple. 4.1 Refinement More accuracy can be obtained by applying a strategy similar to narrowing [=-=Cousot and Cousot 1979-=-]. Narrowing is a generic fixed-point approximation technique in which analysis proceeds from above the least fixed point and iterates downward until a fixed point (not necessarily the least fixed poi... |

617 | The Art of Prolog - Sterling, Shapiro - 1986 |

384 | Incremental constraint satisfaction in logic programming - Hentenryck - 1989 |

344 | Programming with Constraints: An Introduction - Marriott, Stuckey - 1997 |

333 | An efficient unification algorithm - Martelli, Montanari - 1982 |

289 | An introduction to PROLOG-III - Colmerauer - 1990 |

287 | Abstract Interpretation and Applications to Logic Programs - Cousot, Cousot - 1992 |

193 |
A practical framework for the abstract interpretation of logic progams
- Bruynooghe
- 1987
(Show Context)
Citation Context ...n [Cousot and Cousot 1977], and the related implementation techniques are well understood for several general types of analysis and, in particular, for top-down analysis of Prolog [Debray 1989; 1992; =-=Bruynooghe 1991-=-; Muthukumar and Hermenegildo 1992; Marriott et al. 1994; Charlier and Van Hentenryck 1994]. Several generic analysis engines, such as PLAI [Muthukumar and Hermenegildo 1992; 1990], GAIA [Charlier and... |

136 | Abstract interpretation: a unied lattice model for static analysis of programs by construction or approximation of xpoints - Cousot, Cousot - 1977 |

131 | ndergaard. Analysis of constraint logic programs - Marriott, S - 1990 |

120 | Deriving descriptions of possible values of program variables by means of abstract interpretation - Janssens, Bruynooghe - 1992 |

117 | Compile-time derivation of variable dependency using abstract interpretation
- Muthukumar, Hermenegildo
- 1992
(Show Context)
Citation Context ... in which information about calls, answers, and the effect of the constraint store on variables at different program points is computed statically [Hermenegildo et al. 1992; Van Roy and Despain 1992; =-=Muthukumar and Hermenegildo 1992-=-; Santos-Costa et al. 1991; Bueno et al. 1994]. The underlying theory, formalized in terms of abstract interpretation [Cousot and Cousot 1977], and the related implementation techniques are well under... |

101 | Experimental evaluation of a generic abstract interpretation algorithm for Prolog - Charlier, Hentenryck - 1994 |

91 | Static analysis of logic programs for independent and parallelism - Jacobs, Langen - 1992 |

87 | Static inference of modes and data dependencies in logic programs
- Debray
- 1989
(Show Context)
Citation Context ...tract interpretation [Cousot and Cousot 1977], and the related implementation techniques are well understood for several general types of analysis and, in particular, for top-down analysis of Prolog [=-=Debray 1989-=-; 1992; Bruynooghe 1991; Muthukumar and Hermenegildo 1992; Marriott et al. 1994; Charlier and Van Hentenryck 1994]. Several generic analysis engines, such as PLAI [Muthukumar and Hermenegildo 1992; 19... |

83 |
Combined determination of sharing and freeness of program variables through abstract interpretation
- Muthukumar, Hermenegildo
(Show Context)
Citation Context ...ce the algorithms have been implemented using the same technology, with many data structures in common. They also share the domain-dependent functions, which are those of the sharing+freeness domain [=-=Muthukumar and Hermenegildo 1991-=-] in all the experiments. The whole system is implemented in Prolog and has been compiled using Ciao Prolog 0.9 [Bueno et al. 1997] with compilation to bytecode. 5 All of 4 PLAI is currently integrate... |

82 | An interval-based approach to exhaustive and incremental interprocedural dataflow analysis - Burke - 1990 |

77 | Prolog and its Performance: Exploiting Independent AndParallelism - Hermenegildo, Greene - 1990 |

76 | Global flow analysis as a practical compilation tool
- Hermenegildo, Warren, et al.
- 1992
(Show Context)
Citation Context ...actical tool in constraint logic program compilation in which information about calls, answers, and the effect of the constraint store on variables at different program points is computed statically [=-=Hermenegildo et al. 1992-=-; Van Roy and Despain 1992; Muthukumar and Hermenegildo 1992; Santos-Costa et al. 1991; Bueno et al. 1994]. The underlying theory, formalized in terms of abstract interpretation [Cousot and Cousot 197... |

72 |
The &-Prolog System: Exploiting Independent And-Parallelism
- Hermenegildo, Greene
- 1991
(Show Context)
Citation Context ...zed, and the analysis results written out. Despite the obvious progress made in global program analysis, most logic program and CLP compilers still perform only local analysis (although the &-Prolog [=-=Hermenegildo and Greene 1991-=-], Aquarius [Van Roy and Despain 1992], Andorra-I [Santos-Costa et al. 1991], and CLP(R) [Kelly et al. 1998a] systems are notable exceptions). We believe that an important contributing factor to this ... |

72 |
Denotational abstract interpretation of logic programs
- Marriott, Søndergaard, et al.
- 1994
(Show Context)
Citation Context ...ntation techniques are well understood for several general types of analysis and, in particular, for top-down analysis of Prolog [Debray 1989; 1992; Bruynooghe 1991; Muthukumar and Hermenegildo 1992; =-=Marriott et al. 1994-=-; Charlier and Van Hentenryck 1994]. Several generic analysis engines, such as PLAI [Muthukumar and Hermenegildo 1992; 1990], GAIA [Charlier and Van Hentenryck 1994], and the CLP(R) analyzer [Kelly et... |

71 | Abstract interpretation of Prolog programs - Mellish |

69 | High-performance logic programming with the Aquarius Prolog compiler - Roy, Despain - 1992 |

68 | A compositional semantics for logic programs
- Bossi, Gabbrielli, et al.
- 1994
(Show Context)
Citation Context ...ugh the only kind of incremental change they consider is incremental addition. Several researchers have looked at compositional analysis of modules in (constraint) logic programs [Codish et al. 1993; =-=Bossi et al. 1994-=-], but this does not consider incremental analysis at the level of rules. Also, preliminary studies of full modular analysis of (constraint) logic programs [Puebla and Hermenegildo 2000] indicate that... |

64 | Strict and Non-Strict Independent And-Parallelism
- Hermenegildo, Rossi
- 1995
(Show Context)
Citation Context ...urs in a way which is more amenable to systematic study: within the &-Prolog compiler. 8 The &-Prolog system is capable of executing, in parallel, goals which are independent [Conery and Kibler 1981; =-=Hermenegildo and Rossi 1995-=-]. The &-Prolog compiler includes an automatic parallelizer which replaces some conjunctions of literals in the body of rules which are possibly independent with parallel expressions [Bueno et al. 199... |

57 | Improving abstract interpretations by combining domains - Codish, Mulkers, et al. - 1995 |

55 | Compositional Analysis of Modular Logic Programs
- Codish, Debray, et al.
- 1993
(Show Context)
Citation Context ...mental analysis, though the only kind of incremental change they consider is incremental addition. Several researchers have looked at compositional analysis of modules in (constraint) logic programs [=-=Codish et al. 1993-=-; Bossi et al. 1994], but this does not consider incremental analysis at the level of rules. Also, preliminary studies of full modular analysis of (constraint) logic programs [Puebla and Hermenegildo ... |

51 | On the Practicality of Global Flow Analysis of Logic Programs - Warren, Hermenegildo - 1988 |

50 | P.J.: The 3 r’s of optimizing constraint logic programs: Refinement, removal and reordering - Marriott, Stuckey - 1993 |

49 | An efficient hybrid algorithm for incremental data flow analysis - Marlowe, Ryder - 1990 |

46 |
Effectiveness of global analysis in strict independence-based automatic parallelization
- BUENO, BANDA, et al.
- 1994
(Show Context)
Citation Context ...f the constraint store on variables at different program points is computed statically [Hermenegildo et al. 1992; Van Roy and Despain 1992; Muthukumar and Hermenegildo 1992; Santos-Costa et al. 1991; =-=Bueno et al. 1994-=-]. The underlying theory, formalized in terms of abstract interpretation [Cousot and Cousot 1977], and the related implementation techniques are well understood for several general types of analysis a... |

46 | Incremental data-flow analysis algorithms - Ryder, Paull - 1988 |

45 | An incremental version of iterative data flow analysis - Pollock, So↵a - 1989 |

44 | A categorized bibliography on incremental computation - Ramalingam, Reps - 1993 |

43 |
Boolean functions for dependency analysis: Algebraic properties and efficient representation
- Armstrong, Marriott, et al.
- 1994
(Show Context)
Citation Context ...m. Different description domains may be used which capture different properties with different accuracy and cost. The description domain that we use in our examples is the definite Boolean functions [=-=Armstrong et al. 1994-=-], denoted Def . The key idea in this description is to use implication to capture groundness dependencies. The reading of the function x → y is “if the program variable x is (becomes) ground, so is (... |

41 | Hentenryck A generic abstract interpretation algorithm and its complexity analysis - Charlier, Musumbu, et al. |

40 |
The Andorra-I Preprocessor: Supporting Full Prolog on the Basic Andorra Model
- Costa, Warren, et al.
- 1991
(Show Context)
Citation Context ... answers, and the effect of the constraint store on variables at different program points is computed statically [Hermenegildo et al. 1992; Van Roy and Despain 1992; Muthukumar and Hermenegildo 1992; =-=Santos-Costa et al. 1991-=-; Bueno et al. 1994]. The underlying theory, formalized in terms of abstract interpretation [Cousot and Cousot 1977], and the related implementation techniques are well understood for several general ... |

38 | Generalized Semantics and Abstract Interpretation for Constraint Logic Programs - Giacobazzi, Debray, et al. - 1995 |

37 | Global Analysis of Standard Prolog Programs
- Bueno, Cabeza, et al.
- 1996
(Show Context)
Citation Context ... algorithm. Also it is only defined for pure CLP programs. However, standard analysis techniques for handling constructs such as cuts, not, and -> and other built-ins can be added without difficulty [=-=Bueno et al. 1996-=-]; indeed the implementation actually handles (almost) full ISO-Prolog. We first introduce some notation. CP, possibly subscripted, stands for a description (in the abstract domain). AP, possibly subs... |

37 | Efficient computation of flow insensitive interprocedural summary information - Cooper, Kennedy - 1984 |

37 | Program Analysis, Debugging and Optimization Using the Ciao System Preprocessor
- Hermenegildo, Bueno, et al.
- 1999
(Show Context)
Citation Context ...eration of prototypes. Incremental analysis is especially important when the system uses analysis information in order to perform compile-time correctness checking of the program [Puebla et al. 2000; =-=Hermenegildo et al. 1999-=-b]. —The third reason is to better handle the optimization of programs in which rules are asserted (added) to or retracted (removed) from the program at runtime. Clearly, if we modify a program the ex... |

36 | Analyzing Logic Programs with Dynamic Scheduling - Marriott, Banda, et al. - 1994 |

35 | Efficient Dataflow Analysis of Logic Programs - Debray - 1988 |

33 | Optimized Algorithms for Incremental Analysis of Logic Programs - Puebla, Hermenegildo - 1996 |

33 |
Multiple specialization using minimal-function graph semantics
- Winsborough
- 1992
(Show Context)
Citation Context ...ze cycle. This is inefficient if the analysis starts from scratch each time. Such analyzetransform cycles may occur for example when program optimization and multivariant specialization are combined [=-=Winsborough 1992-=-; Puebla and Hermenegildo 1995; 1999]. This is used, for instance, in program parallelization, where an initial analysis is used to introduce specialized predicate definitions with run-time paralleliz... |