Prolog and its performance: exploiting independent and-parallelism
Logic programming
Proceedings of the eighth international conference on Logic programming
Proceedings of the eighth international conference on 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
Freeness analysis for logic programs—and correctness?
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Combinations of abstract domains for logic programming
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the eleventh international conference on Logic programming
Effectiveness of global analysis in strict independence-based automatic parallelization
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Two classes of Boolean functions for dependency analysis
Science of Computer Programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Sharing and groundness dependencies in logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Enhanced sharing analysis techniques: a comprehensive evaluation
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Set-sharing is redundant for pair-sharing
Theoretical Computer Science
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An Application of Abstract Interpretation of Logic Programs: Occur Check Reduction
ESOP '86 Proceedings of the European Symposium on Programming
A Synergistic Analysis for Sharing and Groundness with Traces Linearity
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Comparison of Abstract Interpretations
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Freeness, Sharing, Linearity and Correctness - All at Once
WSA '93 Proceedings of the Third International Workshop on Static Analysis
A Comparison of Three Occur-Check Analysers
SAS '96 Proceedings of the Third International Symposium on Static Analysis
Set-Sharing is Redundant for Pair-Sharing
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
Abstract Domains for Sharing Analysis by Optimal Semantics
SAS '00 Proceedings of the 7th International Symposium on Static Analysis
A Note on Two Simple Transformations for Improving the Efficiency of an ILP System
ILP '00 Proceedings of the 10th International Conference on Inductive Logic Programming
Advanced techniques for approximating variable aliasing in logic programs
Advanced techniques for approximating variable aliasing in logic programs
Finite-tree analysis for constraint logic-based languages
Information and Computation
Inverting abstract unification for set-sharing
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Optimality in goal-dependent analysis of sharing
Theory and Practice of Logic Programming
FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Hi-index | 0.00 |
$\textup{\textsf{Sharing}}$, an abstract domain developed by D. Jacobs and A. Langen for the analysis of logic programs, derives useful aliasing information. It is well-known that a commonly used core of techniques, such as the integration of $\textup{\textsf{Sharing}}$ with freeness and linearity information, can significantly improve the precision of the analysis. However, a number of other proposals for refined domain combinations have been circulating for years. One feature that is common to these proposals is that they do not seem to have undergone a thorough experimental evaluation even with respect to the expected precision gains. In this paper we experimentally evaluate: helping $\textup{\textsf{Sharing}}$ with the definitely ground variables found using $\textit{Pos}$, the domain of positive Boolean formulas; the incorporation of explicit structural information; a full implementation of the reduced product of $\textup{\textsf{Sharing}}$ and $\textit{Pos}$; the issue of reordering the bindings in the computation of the abstract $\mgu$; an original proposal for the addition of a new mode recording the set of variables that are deemed to be ground or free; a refined way of using linearity to improve the analysis; the recovery of hidden information in the combination of $\textup{\textsf{Sharing}}$ with freeness information. Finally, we discuss the issue of whether tracking compoundness allows the computation of more sharing information.