Global analysis of constraint logic programs

Authors:
M. Garcia de la Banda;M. Hermenegildo;M. Bruynooghe;V. Dumortier;G. Janssens;W. Simoens
Affiliations:
Univ. Polite´cnica de Madrid, Madrid, Spain;Univ. Polite´cnica de Madrid, Madrid, Spain;Katholieke Univ. Leuven, Leuven, Belgium;Katholieke Univ. Leuven, Leuven, Belgium;Katholieke Univ. Leuven, Leuven, Belgium;Katholieke Univ. Leuven, Leuven, Belgium
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
1996

Citing 45
Cited 20

Abstract interpretation of Prolog programs

Proceedings on Third international conference on logic programming
Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Constraint logic programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Strictness analysis and denotational abstract interpretation

Information and Computation
Constraint satisfaction in logic programming

Constraint satisfaction in logic programming
Static inference of modes and data dependencies in logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
An introduction to Prolog III

Communications of the ACM
Prolog and its performance: exploiting independent and-parallelism

Logic programming
Analysis of shared data structures for compile-time garbage collection in logic programs

Logic programming
A practical framework for the abstract interpretation of logic programs

Journal of Logic Programming
Analysis of constraint logic programs

Proceedings of the 1990 North American conference on Logic programming
High-Performance Logic Programming with the Aquarius Prolog Compiler

Computer
A canonical form for generalized linear constraints

Journal of Symbolic Computation
Abstract interpretation and application to logic programs

Journal of Logic Programming
Deriving descriptions of possible values of program variables by means of abstract interpretation

Journal of Logic Programming
Static analysis of logic programs for independent and parallelism

Journal of Logic Programming
Compile-time derivation of variable dependency using abstract interpretation

Journal of Logic Programming
An abstract machine for CLP(R)

PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
Efficient dataflow analysis of logic programs

Journal of the ACM (JACM)
Frameworks for abstract interpretation

Acta Informatica
The 3 R's of optimizing constraint logic programs: refinement, removal and reordering

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Analysis of nonlinear constraints in CLP( R )

ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Freeness analysis in the presence of numerical constraints

ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Experimental evaluation of a generic abstract interpretation algorithm for PROLOG

ACM Transactions on Programming Languages and Systems (TOPLAS)
Live-structure dataflow analysis for Prolog

ACM Transactions on Programming Languages and Systems (TOPLAS)
The art of Prolog (2nd ed.): advanced programming techniques

The art of Prolog (2nd ed.): advanced programming techniques
Analyzing logic programs with dynamic scheduling

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Backtracking without trailing in CLP (RLin)

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Redundancy of variables in CLD R

ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Independence in constraint logic programs

ILPS '93 Proceedings of the 1993 international symposium on Logic programming
A practical approach to the global analysis of CLP programs

ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Towards a practical full mode inference system for CLP (H,N)

Proceedings of the eleventh international conference on Logic programming
An abstract interpretation framework which accurately handles prolog search-rule and the cut

ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Effectiveness of global analysis in strict independence-based automatic parallelization

ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Approximating interaction between linear arithmetic constraints

ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Improving abstract interpretations by combining domains

ACM Transactions on Programming Languages and Systems (TOPLAS)
On the complexity of dataflow analysis of logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
An Efficient Unification Algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Live Data Structures in Logic Programs

Live Data Structures in Logic Programs
Systematic design of program analysis frameworks

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Propagation: A New Operation in a Framework for Abstract Interpretation of Logic Programs

META-92 Proceedings of the 3rd International Workshop on Meta-Programming in Logic
Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation

PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
Generic Abstract Interpretation Algorithms For Prolog: Tow Optimization Techniques and Their Experimental Evaluation

PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
LSign Reordered

SAS '95 Proceedings of the Second International Symposium on Static Analysis

Some challenges for constraint programming

ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Optimizing compilation of CLP( R )

ACM Transactions on Programming Languages and Systems (TOPLAS)
Constraint Programming: Strategic Directions

Constraints
Some Challenges for Constraint Programming

Constraints
Implementing Groundness Analysis with Definite Boolean Functions

ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Positive Boolean Functions as Multiheaded Clauses

Proceedings of the 17th International Conference on Logic Programming
Program Debugging and Validation Using Semantic Approximations and Partial Specifications

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Quotienting Share for Dependency Analysis

ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
When do bounds and domain propagation lead to the same search space

Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Efficient groundness analysis in Prolog

Theory and Practice of Logic Programming
When do bounds and domain propagation lead to the same search space?

ACM Transactions on Programming Languages and Systems (TOPLAS)
Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)

Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
A practical type analysis for verification of modular prolog programs

PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Typing Linear Constraints for Moding CLP(${\cal R}$) Programs

SAS '08 Proceedings of the 15th international symposium on Static Analysis
Experimental analysis of optimization techniques on the road passenger transportation problem

Engineering Applications of Artificial Intelligence
Typing linear constraints

ACM Transactions on Programming Languages and Systems (TOPLAS)
Program development using abstract interpretation (and the ciao system preprocessor)

SAS'03 Proceedings of the 10th international conference on Static analysis
Abstract verification and debugging of constraint logic programs

ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
Context-sensitive multivariant assertion checking in modular programs

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Proofs you can believe in: proving equivalences between Prolog semantics in Coq

Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article presents and illustrates a practical approach to the dataflow analysis of constraint logic programming languages using abstract interpretation. It is first argued that, from the framework point of view, it suffices to propose relatively simple extensions of traditional analysis methods which have already been proved useful and practical and for which efficient fixpoint algorithms exist. This is shown by proposing a simple extension of Bruynooghe's traditional framework which allows it to analyze constraint logic programs. Then, and using this generalized framework, two abstract domains and their required abstract functions are presented: the first abstract domain approximates definiteness information and the second one freeness. Finally, an approach for combining those domains is proposed. The two domains and their combination have been implemented and used in the analysis of CLP(R) and Prolog-III applications. Results form this implementation showing its performance and accuracy are also presented.