An Application of Abstract Interpretation of Logic Programs: Occur Check Reduction

Trailing Analysis for HAL

ICLP '02 Proceedings of the 18th International Conference on Logic Programming

Boolean Functions for Finite-Tree Dependencies

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming

A Model for Inter-module Analysis and Optimizing Compilation

LOPSTR '00 Selected Papers form the 10th International Workshop on Logic Based Program Synthesis and Transformation

Finite-Tree Analysis for Constraint Logic-Based Languages

SAS '01 Proceedings of the 8th International Symposium on Static Analysis

Pair-independence and freeness analysis through linear refinement

Information and Computation

A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages

Theory and Practice of Logic Programming

Finite-tree analysis for constraint logic-based languages

Information and Computation

Enhanced sharing analysis techniques: a comprehensive evaluation

Theory and Practice of Logic Programming

Inverting abstract unification for set-sharing

PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming

Deriving escape analysis by abstract interpretation

Higher-Order and Symbolic Computation

Collapsing closures

ICLP'06 Proceedings of the 22nd international conference on Logic Programming