The reduced relative power operation on abstract domains

DOI10.1016/S0304-3975(98)00194-7zbMATH Open0914.68129MaRDI QIDQ1285656FDOQ1285656

Francesco Ranzato, Roberto Giacobazzi

Publication date: 28 April 1999

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

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

zbMATH Keywords

abstract interpretationabstract domainlogic program analysis and semanticsreduced relative powerseparated abstract domain

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Cites Work

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

Cited In (8)

• Transforming semantics by abstract interpretation
• Widening and narrowing operators for abstract interpretation
• The powerset operator on abstract interpretations
• Title not available (Why is that?)
• Conjunctive Abstract Interpretation Using Paramodulation
• Pair-independence and freeness analysis through linear refinement.
• Abstract interpretation of resolution-based semantics
• Clustered relational thread-modular abstract interpretation with local traces

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)