On the public citation graph

Complete abstract interpretations made constructive

https://doi.org/10.1007/bfb0055786
0 signed · 34 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-51486-4_95openalex-snapshot
Optimal data flow analysis via observational equivalence
inferredcites →https://doi.org/10.1007/3-540-63165-8_230openalex-snapshot
Refining and compressing abstract domains
inferredcites →https://doi.org/10.1007/bfb0000468openalex-snapshot
Abstract interpretation of algebraic polynomial systems (Extended abstract)
inferredcites →https://doi.org/10.1007/bfb0000474openalex-snapshot
Completeness in abstract interpretation: A domain perspective
inferredcites →https://doi.org/10.1007/bfb0032733openalex-snapshot
Set-sharing is redundant for pair-sharing
inferredcites →https://doi.org/10.1016/0096-0551(93)90003-jopenalex-snapshot
On the power of abstract interpretation
inferredcites →https://doi.org/10.1016/0167-6423(86)90010-9openalex-snapshot
Strictness analysis for higher-order functions
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/s0304-3975(97)00137-0openalex-snapshot
The quotient of an abstract interpretation
inferredcites →https://doi.org/10.1145/143165.143184openalex-snapshot
Inductive definitions, semantics and abstract interpretations
inferredcites →https://doi.org/10.1145/154630.154648openalex-snapshot
Completeness and predicate-based abstract interpretation
inferredcites →https://doi.org/10.1145/176454.176519openalex-snapshot
Precise and efficient groundness analysis for logic programs
inferredcites →https://doi.org/10.1145/258128.258212openalex-snapshot
On the power and limitations of strictness analysis
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation
inferredcites →https://doi.org/10.1145/567752.567778openalex-snapshot
Systematic design of program analysis frameworks
inferredcites →https://doi.org/10.7488/era/4239openalex-snapshot
Abstract interpretation and optimising transformations for applicative programs

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.1999.2801openalex-snapshot
Closures on CPOs Form Complete Lattices
inferred← citeshttps://doi.org/10.1007/3-540-44914-0_1openalex-snapshot
Partial Completeness of Abstract Fixpoint Checking
inferred← citeshttps://doi.org/10.1007/3-540-45499-3_14openalex-snapshot
Analysis of Downward Closed Properties of Logic Programs
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-49727-7_13openalex-snapshot
Building Complete Abstract Interpretations in a Linear Logic-Based Setting
inferred← citeshttps://doi.org/10.1007/978-3-540-45099-3_12openalex-snapshot
Abstract Interpretation of Game Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-02261-6_9openalex-snapshot
Observational Completeness on Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-981-19-9601-6_8openalex-snapshot
Local Completeness in Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/bfb0032733openalex-snapshot
Set-sharing is redundant for pair-sharing
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00312-1openalex-snapshot
Set-sharing is redundant for pair-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.1145/293677.293680openalex-snapshot
A logical model for relational abstract domains
inferred← citeshttps://doi.org/10.1145/325694.325699openalex-snapshot
Temporal abstract interpretation
inferred← citeshttps://doi.org/10.1145/333979.333989openalex-snapshot
Making abstract interpretations complete
inferred← citeshttps://doi.org/10.1145/3582267openalex-snapshot
A Correctness and Incorrectness Program Logic
inferred← citeshttps://doi.org/10.1145/3704882openalex-snapshot
The Best of Abstract Interpretations
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.