An application of abstract interpretation of logic programs: occur check reduction
Proc. of the European symposium on programming on ESOP 86
Abstract interpretation and application to logic programs
Journal of Logic Programming
Static analysis of logic programs for independent and parallelism
Journal of Logic Programming
Global flow analysis as a practical compilation tool
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
Proceedings of the eleventh international conference on Logic programming
A unifying view of abstract domain design
ACM Computing Surveys (CSUR)
The quotient of an abstract interpretation
Theoretical Computer Science
A logical model for relational abstract domains
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Synergistic Analysis for Sharing and Groundness with Traces Linearity
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
Freeness, Sharing, Linearity and Correctness - All at Once
WSA '93 Proceedings of the Third International Workshop on Static Analysis
A Freeness and Sharing Analysis of Logic Programs Based on a Pre-interpretation
SAS '96 Proceedings of the Third International Symposium on Static Analysis
Logical Optimality of Groundness Analysis
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
Set-Sharing is Redundant for Pair-Sharing
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
Advanced techniques for approximating variable aliasing in logic programs
Advanced techniques for approximating variable aliasing in logic programs
Abstract Compilation for Sharing Analysis
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
Pair-independence and freeness analysis through linear refinement
Information and Computation
Non-strict independence-based program parallelization using sharing and freeness information
Theoretical Computer Science
Static analysis, abstract interpretation and verification in (constraint logic) programming
A 25-year perspective on logic programming
| Hi-index | 0.00 |
Linear refinement is a technique for systematically constructing abstract domains for program analysis directly from a basic domain representing just the property of interest. This paper uses linear refinement to construct a domain for non pair-sharing and freeness analysis. The resulting domain is strictly more precise than the domain for sharing and freeness analysis defined by Jacobs and Langen. Moreover, it can be used for abstract compilation, while Jacobs and Langen's domain can only be used for abstract interpretation. We provide a representation of the domain, together with algorithms for the abstract operations.