Pair-independence and freeness analysis through linear refinement.
From MaRDI portal
Publication:1873754
DOI10.1016/S0890-5401(02)00048-2zbMath1036.68020OpenAlexW2052117261MaRDI QIDQ1873754
Publication date: 27 May 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0890-5401(02)00048-2
Related Items
Optimality in goal-dependent analysis of Sharing ⋮ Optimal multibinding unification for sharing and linearity analysis ⋮ On the interaction between sharing and linearity ⋮ Non-strict independence-based program parallelization using sharing and freeness information
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The reduced relative power operation on abstract domains
- A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages
- Set-sharing is redundant for pair-sharing
- Logical optimality of groundness analysis
- Two classes of Boolean functions for dependency analysis
- Observable behaviors and equivalences of logic programs
- Generalized semantics and abstract interpretation for constraint logic programs
- Optimal groundness analysis using propositional logic
- On the design of a correct freeness analysis for logic programs
- Graph-Based Algorithms for Boolean Function Manipulation
- An Efficient Unification Algorithm
- Abstract interpretation and application to logic programs
- Static analysis of logic programs for independent and parallelism
- Differential methods in logic program analysis
- The s-semantics approach: Theory and applications
- Exploiting goal independence in the analysis of logic programs
- Refining and compressing abstract domains
- An algebraic approach to sharing analysis of logic programs
- A freeness and sharing analysis of logic programs based on a pre-interpretation
- Systematic design of program transformation frameworks by abstract interpretation
