The powerset operator on abstract interpretations

DOI10.1016/S0304-3975(98)00007-3zbMath0930.68033OpenAlexW1979603971MaRDI QIDQ1960538

Francesco Ranzato, Gilberto File

Publication date: 12 January 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00007-3

zbMATH Keywords

abstract interpretationpowerset operatorlogic program ground-dependency

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items

Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements ⋮ The reduced relative power operation on abstract domains ⋮ Logical optimality of groundness analysis

Cites Work

• ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
• Declarative modeling of the operational behavior of logic languages
• Strictness analysis for higher-order functions
• Bottom-up abstract interpretation of logic programs
• Two classes of Boolean functions for dependency analysis
• Optimal domains for disjunctive abstract interpretation
• Complementing logic program semantics
• Optimal groundness analysis using propositional logic
• On derived dependencies and connected databases
• Abstract interpretation and application to logic programs
• Comparison of abstract interpretations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item