On the public citation graph
Strong abstract interpretation using power domains
0 signed · 51 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-09526-8_8openalex-snapshot
Full abstraction for a simple parallel programming language
inferredcites →https://doi.org/10.1007/3-540-09981-6_19openalex-snapshot
The theory and practice of transforming call-by-need into call-by-value
inferredcites →https://doi.org/10.1007/3-540-10843-2_10openalex-snapshot
Flow analysis of lambda expressions
inferredcites →https://doi.org/10.1007/3-540-10843-2_38openalex-snapshot
A cook's tour of countable nondeterminism
inferredcites →https://doi.org/10.1007/3-540-10843-2_9openalex-snapshot
Data flow analysis of applicative programs
inferredcites →https://doi.org/10.1007/3-540-11494-7_13openalex-snapshot
Powerdomains and nondeterministic recursive definitions
inferredcites →https://doi.org/10.1007/bf00263194openalex-snapshot
A denotational framework for data flow analysis
inferredcites →https://doi.org/10.1007/bf00290339openalex-snapshot
Monotone data flow analysis frameworks
inferredcites →https://doi.org/10.1007/bfb0012788openalex-snapshot
A powerdomain for countable non-determinism
inferredcites →https://doi.org/10.1109/sfcs.1980.16openalex-snapshot
Complexity of flow analysis, inductive assertion synthesis and a language due to Dijkstra
inferredcites →https://doi.org/10.1137/0209001openalex-snapshot
An Efficient Test for Circular-Arc Graphs
inferredcites →https://doi.org/10.1145/512927.512945openalex-snapshot
A unified approach to global program optimization
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-15670-4_24openalex-snapshot
Abstract interpretation and indeterminacy
inferred← citeshttps://doi.org/10.1007/3-540-16078-7_61openalex-snapshot
Abstract interpretation of denotational definitions
inferred← citeshttps://doi.org/10.1007/3-540-16446-4_3openalex-snapshot
The theory of strictness analysis for higher order functions
inferred← citeshttps://doi.org/10.1007/3-540-16446-4_9openalex-snapshot
A relational framework for abstract interpretation
inferred← citeshttps://doi.org/10.1007/3-540-18317-5_24openalex-snapshot
Evaluation transformers — A model for the parallel evaluation of functional languages (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_95openalex-snapshot
Optimal data flow analysis via observational equivalence
inferred← citeshttps://doi.org/10.1007/3-540-53101-7_11openalex-snapshot
Abstract interpretation using attribute grammars
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_41openalex-snapshot
“Optimal” collecting semantics for analysis in a hierarchy of logic program semantics
inferred← citeshttps://doi.org/10.1007/3-540-61055-3_34openalex-snapshot
Compositional optimization of disjunctive abstract interpretations
inferred← citeshttps://doi.org/10.1007/3-540-61739-6_30openalex-snapshot
Semantics-directed program analysis: A tool-maker's perspective
inferred← citeshttps://doi.org/10.1007/3-540-62503-8_1openalex-snapshot
Logical and operational methods in the analysis of programs and systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3196-0_7openalex-snapshot
An Operational Model of Strictness Properties and its Abstractions
inferred← citeshttps://doi.org/10.1007/978-3-032-08187-2_5openalex-snapshot
The Contributions of Alan Mycroft to Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/bf01409744openalex-snapshot
Effect analysis in higher-order languages
inferred← citeshttps://doi.org/10.1007/bfb0033844openalex-snapshot
Intuitionistic implication in abstract interpretation
inferred← citeshttps://doi.org/10.1007/bfb0039703openalex-snapshot
Galois connection based abstract interpretations for strictness analysis
inferred← citeshttps://doi.org/10.1016/0167-6423(86)90010-9openalex-snapshot
Strictness analysis for higher-order functions
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90091-1openalex-snapshot
Two-level semantics and abstract interpretation
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90086-9openalex-snapshot
Type inference, abstract interpretation and strictness analysis
inferred← citeshttps://doi.org/10.1016/0890-5401(88)90041-7openalex-snapshot
Strictness analysis and denotational abstract interpretation
inferred← citeshttps://doi.org/10.1016/s0167-6423(97)00034-8openalex-snapshot
Optimal domains for disjunctive abstract interpretation
inferred← citeshttps://doi.org/10.1017/s0956796800000496openalex-snapshot
Abstract interpretation by dynamic partitioning
inferred← citeshttps://doi.org/10.1093/logcom/2.4.511openalex-snapshot
Abstract Interpretation Frameworks
inferred← citeshttps://doi.org/10.1093/oso/9780198537809.003.0005openalex-snapshot
Abstract interpretation: a semantics-based tool for program analysis
inferred← citeshttps://doi.org/10.1109/iccl.1994.288389openalex-snapshot
Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages)
inferred← citeshttps://doi.org/10.1145/141471.141520openalex-snapshot
Abstract interpretation in weak powerdomains
inferred← citeshttps://doi.org/10.1145/19530.19549openalex-snapshot
Formally based static analysis of microcode
inferred← citeshttps://doi.org/10.1145/19551.19549openalex-snapshot
Formally based static analysis of microcode
inferred← citeshttps://doi.org/10.1145/293677.293680openalex-snapshot
A logical model for relational abstract domains
inferred← citeshttps://doi.org/10.1145/41625.41636openalex-snapshot
Strictness analysis and denotational abstract interpretation
inferred← citeshttps://doi.org/10.1145/41625.41650openalex-snapshot
Computation of aliases and support sets
inferred← citeshttps://doi.org/10.1145/512644.512672openalex-snapshot
Data flow analysis of applicative programs using minimal function graphs
inferred← citeshttps://doi.org/10.14288/1.0302104openalex-snapshot
On an implementation of abstract interpretation
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.