The reduced relative power operation on abstract domains

DOI10.1016/S0304-3975(98)00194-7MaRDI QIDQ1285656zbMATH OpenFDO

Authors Roberto Giacobazzi, Francesco Ranzato

Publication date 28 April 1999

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

zbMATH Keywords

abstract interpretationabstract domainlogic program analysis and semanticsreduced relative powerseparated abstract domain

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Recommendations

• The powerset operator on abstract interpretations
• Complementing logic program semantics
• Optimal domains for disjunctive abstract interpretation
• Making abstract domains condensing
• Design of abstract domains using first-order logic

Cites work

• scientific article; zbMATH DE number 3168728 (Why is no real title available?)
• scientific article; zbMATH DE number 3175304 (Why is no real title available?)
• scientific article; zbMATH DE number 3817015 (Why is no real title available?)
• scientific article; zbMATH DE number 3942992 (Why is no real title available?)
• scientific article; zbMATH DE number 3956409 (Why is no real title available?)
• scientific article; zbMATH DE number 4030272 (Why is no real title available?)
• scientific article; zbMATH DE number 4053011 (Why is no real title available?)
• scientific article; zbMATH DE number 3735091 (Why is no real title available?)
• scientific article; zbMATH DE number 46487 (Why is no real title available?)
• scientific article; zbMATH DE number 176531 (Why is no real title available?)
• scientific article; zbMATH DE number 3598539 (Why is no real title available?)
• scientific article; zbMATH DE number 1231565 (Why is no real title available?)
• scientific article; zbMATH DE number 3204690 (Why is no real title available?)
• A compositional semantics for logic programs
• A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages
• Abstract interpretation and application to logic programs
• Declarative modeling of the operational behavior of logic languages
• Fully abstract compositional semantics for an algebra of logic programs
• Logical optimality of groundness analysis
• Observable behaviors and equivalences of logic programs
• On derived dependencies and connected databases
• Optimal domains for disjunctive abstract interpretation
• Quantales, observational logic and process semantics
• Refining and compressing abstract domains
• Resultant semantics for prolog
• The Semantics of Predicate Logic as a Programming Language
• The closure operators of a lattice
• The meaning of negative premises in transition system specifications
• The powerset operator on abstract interpretations
• The s-semantics approach: Theory and applications
• The structure of Galois connections
• The tensor product in Wadler's analysis of lists
• The tensor product of continuous lattices
• Two classes of Boolean functions for dependency analysis
• Two-level semantics and abstract interpretation
• Weak relative pseudo-complements of closure operators
• ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
• “Optimal” collecting semantics for analysis in a hierarchy of logic program semantics

Cited in

(8)

• Transforming semantics by abstract interpretation
• scientific article; zbMATH DE number 4182020 (Why is no real title available?)
• Conjunctive abstract interpretation using paramodulation
• The powerset operator on abstract interpretations
• Pair-independence and freeness analysis through linear refinement.
• Abstract interpretation of resolution-based semantics
• Clustered relational thread-modular abstract interpretation with local traces
• Widening and narrowing operators for abstract interpretation

This page was built for publication: The reduced relative power operation on abstract domains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1285656)