Set-sharing is redundant for pair-sharing
From MaRDI portal
Publication:1605223
DOI10.1016/S0304-3975(00)00312-1zbMath0997.68021OpenAlexW2035032795MaRDI QIDQ1605223
Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
Publication date: 15 July 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00312-1
Related Items
Pair-independence and freeness analysis through linear refinement., The role of linearity in sharing analysis, Optimality in goal-dependent analysis of Sharing, Design of abstract domains using first-order logic, Exploiting linearity in sharing analysis of object-oriented programs, On the interaction between sharing and linearity, Set-sharing is redundant for pair-sharing, Finite-tree analysis for constraint logic-based languages
Cites Work
- The occur-check problem in Prolog
- The quotient of an abstract interpretation
- Enumeration of success patterns in logic programs
- A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages
- Combinations of abstract domains for logic programming: Open product and generic pattern construction
- Set-sharing is redundant for pair-sharing
- Two classes of Boolean functions for dependency analysis
- The closure operators of a lattice
- Generalized semantics and abstract interpretation for constraint logic programs
- Some global optimizations for a PROLOG compiler
- Static analysis of logic programs for independent and parallelism
- Compile-time derivation of variable dependency using abstract interpretation
- Soundness, idempotence and commutativity of set-sharing
- A freeness and sharing analysis of logic programs based on a pre-interpretation
- Comparison of abstract interpretations
- Abstract Interpretation Frameworks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
