Decomposing non-redundant sharing by complementation

DOI10.1017/S1471068401001351MaRDI QIDQ4452616zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Enea Zaffanella, Patricia M. Hill, Roberto Bagnara

Publication date 1 March 2004

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL http://journals.cambridge.org/action/displayIssue?jid=TLP&volumeId=2&issueId=02

zbMATH Keywords

domain decompositioncomplementationsharing analysisAbstract interpretation

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 1487850
• Set-sharing is redundant for pair-sharing
• scientific article; zbMATH DE number 1617334
• scientific article; zbMATH DE number 1953028
• Complementing logic program semantics

Cited in

(3)

• Functional and Logic Programming
• Combinatorial Message Sharing and a New Achievable Region for Multiple Descriptions
• Finite-tree analysis for constraint logic-based languages

This page was built for publication: Decomposing non-redundant sharing by complementation

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