On the public citation graph

Set-sharing is redundant for pair-sharing

https://doi.org/10.1007/bfb0032733
0 signed · 56 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-16442-1_25openalex-snapshot
An application of abstract interpretation of logic programs: Occur check reduction
inferredcites →https://doi.org/10.1007/3-540-49727-7_6openalex-snapshot
The Correctness of Set-Sharing
inferredcites →https://doi.org/10.1007/3-540-55719-9_101openalex-snapshot
Comparison of abstract interpretations
inferredcites →https://doi.org/10.1007/3-540-57264-3_37openalex-snapshot
Freeness, sharing, linearity and correctness — All at once
inferredcites →https://doi.org/10.1007/3-540-57880-3_24openalex-snapshot
A synergistic analysis for sharing and groundness which traces linearity
inferredcites →https://doi.org/10.1007/3-540-58402-1_30openalex-snapshot
Abstracting s-semantics using a model-theoretic approach
inferredcites →https://doi.org/10.1007/3-540-61739-6_38openalex-snapshot
A freeness and sharing analysis of logic programs based on a pre-interpretation
inferredcites →https://doi.org/10.1007/3-540-61739-6_40openalex-snapshot
A comparison of three occur-check analysers
inferredcites →https://doi.org/10.1007/3-540-61756-6_79openalex-snapshot
Annotated structure shape graphs for abstract analysis of Prolog
inferredcites →https://doi.org/10.1007/978-3-642-67678-9openalex-snapshot
A Compendium of Continuous Lattices
inferredcites →https://doi.org/10.1007/bf03037324openalex-snapshot
The occur-check problem in Prolog
inferredcites →https://doi.org/10.1007/bfb0000474openalex-snapshot
Completeness in abstract interpretation: A domain perspective
inferredcites →https://doi.org/10.1007/bfb0032734openalex-snapshot
An algebraic approach to sharing analysis of logic programs
inferredcites →https://doi.org/10.1007/bfb0055786openalex-snapshot
Complete abstract interpretations made constructive
inferredcites →https://doi.org/10.1016/0304-3975(84)90119-1openalex-snapshot
Enumeration of success patterns in logic programs
inferredcites →https://doi.org/10.1016/0743-1066(85)90004-4openalex-snapshot
Some global optimizations for a PROLOG compiler
inferredcites →https://doi.org/10.1016/0743-1066(92)90034-zopenalex-snapshot
Static analysis of logic programs for independent and parallelism
inferredcites →https://doi.org/10.1016/0743-1066(92)90035-2openalex-snapshot
Compile-time derivation of variable dependency using abstract interpretation
inferredcites →https://doi.org/10.1016/0743-1066(92)90053-6openalex-snapshot
Global flow analysis as a practical compilation tool
inferredcites →https://doi.org/10.1016/0743-1066(95)00038-0openalex-snapshot
Generalized semantics and abstract interpretation for constraint logic programs
inferredcites →https://doi.org/10.1016/s0167-6423(96)00039-1openalex-snapshot
Two classes of Boolean functions for dependency analysis
inferredcites →https://doi.org/10.1093/logcom/2.4.511openalex-snapshot
Abstract Interpretation Frameworks
inferredcites →https://doi.org/10.1109/lics.1991.151656openalex-snapshot
Prop revisited: propositional formula as abstract domain for groundness analysis
inferredcites →https://doi.org/10.1145/174675.177880openalex-snapshot
Combinations of abstract domains for logic programming
inferredcites →https://doi.org/10.1145/200994.200998openalex-snapshot
Improving abstract interpretations by combining domains
inferredcites →https://doi.org/10.1145/232706.232734openalex-snapshot
Global analysis of constraint logic programs
inferredcites →https://doi.org/10.1145/239912.239914openalex-snapshot
Complementation in abstract interpretation
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation
inferredcites →https://doi.org/10.1145/65979.65983openalex-snapshot
Static inference of modes and data dependencies in logic programs
inferredcites →https://doi.org/10.21236/ada173122openalex-snapshot
Parallel Unification Scheduling in Prolog
inferredcites →https://doi.org/10.22028/d291-25805openalex-snapshot
Efficient and precise sharing domains for logic programs
inferredcites →https://doi.org/10.2307/1968865openalex-snapshot
The Closure Operators of a Lattice
inferredcites →https://doi.org/10.7551/mitpress/4316.003.0055openalex-snapshot
Depth-k Sharing and Freeness

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/10704567_25openalex-snapshot
Widening Sharing
inferred← citeshttps://doi.org/10.1007/3-540-44716-4_20openalex-snapshot
Abstract Compilation for Sharing Analysis
inferred← citeshttps://doi.org/10.1007/3-540-46425-5_10openalex-snapshot
Abstract Domains for Universal and Existential Properties
inferred← citeshttps://doi.org/10.1007/3-540-48294-6_5openalex-snapshot
Decomposing Non-redundant Sharing by Complementation
inferred← citeshttps://doi.org/10.1007/3-540-49099-x_5openalex-snapshot
Quotienting Share for Dependency Analysis
inferred← citeshttps://doi.org/10.1007/3-540-49727-7_6openalex-snapshot
The Correctness of Set-Sharing
inferred← citeshttps://doi.org/10.1007/978-3-540-24754-8_10openalex-snapshot
Set-Sharing Is Not Always Redundant for Pair-Sharing
inferred← citeshttps://doi.org/10.1007/bfb0055786openalex-snapshot
Complete abstract interpretations made constructive
inferred← citeshttps://doi.org/10.1007/bfb0056609openalex-snapshot
The Boolean logic of set sharing analysis
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00312-1openalex-snapshot
Set-sharing is redundant for pair-sharing
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00231-xopenalex-snapshot
Design of abstract domains using first-order logic
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10026-2openalex-snapshot
Sharing is optimal
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00007-2openalex-snapshot
An algebraic approach to sharing analysis of logic programs
inferred← citeshttps://doi.org/10.1017/s1471068401001338openalex-snapshot
Soundness, idempotence and commutativity of set-sharing
inferred← citeshttps://doi.org/10.1017/s1471068401001351openalex-snapshot
Decomposing non-redundant sharing by complementation
inferred← citeshttps://doi.org/10.1017/s1471068403001868openalex-snapshot
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages
inferred← citeshttps://doi.org/10.1017/s1471068404001978openalex-snapshot
Enhanced sharing analysis techniques: a comprehensive evaluation
inferred← citeshttps://doi.org/10.1145/328690.328699openalex-snapshot
Non pair-sharing and freeness analysis through linear refinement
inferred← citeshttps://doi.org/10.1145/328691.328699openalex-snapshot
Non pair-sharing and freeness analysis through linear refinement
inferred← citeshttps://doi.org/10.1145/330249.330252openalex-snapshot
Sharing and groundness dependencies in logic programs
inferred← citeshttps://doi.org/10.1145/333979.333989openalex-snapshot
Making abstract interpretations complete
inferred← citeshttps://doi.org/10.1145/571157.571168openalex-snapshot
Precise pair-sharing analysis of logic programs
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0508112openalex-snapshot
A study of set-sharing analysis via cliques
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.