A Freeness and Sharing Analysis of Logic Programs Based on a Pre-interpretation

Non pair-sharing and freeness analysis through linear refinement

PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation

Set-sharing is redundant for pair-sharing

Theoretical Computer Science

Abstract Compilation for Sharing Analysis

FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming

PAN: a portable, parallel prolog: Its design, realisation and performance

New Generation Computing

Pair-independence and freeness analysis through linear refinement

Information and Computation

Meta-circular abstract interpretation in prolog

The essence of computation

Automated termination proofs for logic programs by term rewriting

ACM Transactions on Computational Logic (TOCL)

Lazy set-sharing analysis

FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming