On the public citation graph
A denotational framework for data flow analysis
0 signed · 86 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/bf00290339openalex-snapshot
Monotone data flow analysis frameworks
inferredcites →https://doi.org/10.1016/0096-0551(83)90036-xopenalex-snapshot
Denotational semantics: The scott-strachey approach to programming language theory
inferredcites →https://doi.org/10.1145/567752.567778openalex-snapshot
Systematic design of program analysis frameworks
inferredcites →https://doi.org/10.7146/dpb.v10i131.7585openalex-snapshot
Semantic Foundations of Data Flow Analysis
inferredcites →https://doi.org/10.7146/dpb.v10i140.7415openalex-snapshot
Program Transformations in a Denotational Setting
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-12925-1_40openalex-snapshot
Optimized combinatoric code for applicative language implementation
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-16442-1_25openalex-snapshot
An application of abstract interpretation of logic programs: Occur check reduction
inferred← citeshttps://doi.org/10.1007/3-540-18508-9_32openalex-snapshot
A category of Galois connections
inferred← citeshttps://doi.org/10.1007/3-540-45309-1_4openalex-snapshot
Secure Information Flow and CPS
inferred← citeshttps://doi.org/10.1007/3-540-49727-7_22openalex-snapshot
Program Analysis as Model Checking of Abstract Interpretations
inferred← citeshttps://doi.org/10.1007/3-540-54415-1_54openalex-snapshot
Data flow analysis as model checking
inferred← citeshttps://doi.org/10.1007/3-540-57264-3_28openalex-snapshot
Fast abstract interpretation using sequential algorithms
inferred← citeshttps://doi.org/10.1007/3-540-60360-3_28openalex-snapshot
Natural-semantics-based abstract interpretation (preliminary version)
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_4openalex-snapshot
A uniform approach for compile-time and run-time specialization
inferred← citeshttps://doi.org/10.1007/3540543961_24openalex-snapshot
For a better support of static data flow
inferred← citeshttps://doi.org/10.1007/978-1-4471-3503-6_19openalex-snapshot
Continuation Passing Transformation and Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-642-24690-6_11openalex-snapshot
A Dataflow Analysis to Improve SAT-Based Bounded Program Verification
inferred← citeshttps://doi.org/10.1007/bf01019462openalex-snapshot
Reasoning about programs in continuation-passing style
inferred← citeshttps://doi.org/10.1007/bf01178576openalex-snapshot
Frameworks for abstract interpretation
inferred← citeshttps://doi.org/10.1007/bf03180570openalex-snapshot
A security flow control algorithm and its denotational semantics correctness proof
inferred← citeshttps://doi.org/10.1007/bfb0032757openalex-snapshot
Abstract interpretation: A theory of approximate computation
inferred← citeshttps://doi.org/10.1007/bfb0036935openalex-snapshot
Strong abstract interpretation using power domains
inferred← citeshttps://doi.org/10.1007/s10270-014-0401-9openalex-snapshot
TacoFlow: optimizing SAT program verification using dataflow analysis
inferred← citeshttps://doi.org/10.1007/s10559-013-9569-1openalex-snapshot
Program Verification: State of the Art, Problems, and Results. I
inferred← citeshttps://doi.org/10.1007/s10559-014-9588-6openalex-snapshot
Program Verification: State of the Art, Problems, and Results. II1
inferred← citeshttps://doi.org/10.1016/0167-6423(91)90021-oopenalex-snapshot
Correctness of static flow analysis in continuation semantics
inferred← citeshttps://doi.org/10.1016/0167-6423(93)90003-8openalex-snapshot
Generating data flow analysis algorithms from modal specifications
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90301-hopenalex-snapshot
Static semantics, types, and binding time 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/0890-5401(89)90052-7openalex-snapshot
Incorporating static analysis in a combinator-based compiler
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.082openalex-snapshot
Abstract Interpretation From a Denotational-semantics Perspective
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.002openalex-snapshot
Inverse-limit and topological aspects of abstract interpretation
inferred← citeshttps://doi.org/10.1016/s0167-6423(96)00044-5openalex-snapshot
An abstract interpretation for estimating uncaught exceptions in Standard ML programs
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00376-6openalex-snapshot
An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations
inferred← citeshttps://doi.org/10.1017/s0956796802004379openalex-snapshot
Syntactic accidents in program analysis: on the impact of the CPS transformation
inferred← citeshttps://doi.org/10.1017/s0956796802004513openalex-snapshot
CPS transformation of flow information
inferred← citeshttps://doi.org/10.1017/s0960129597002405openalex-snapshot
A computational formalization for partial evaluation
inferred← citeshttps://doi.org/10.1023/a:1010066127644openalex-snapshot
Induction, Domains, Calculi: Strachey's Contributions to Programming-Language Engineering
inferred← citeshttps://doi.org/10.1023/a:1020843229247openalex-snapshot
Secure Information Flow via Linear Continuations
inferred← citeshttps://doi.org/10.1023/b:lisp.0000029444.99264.c0openalex-snapshot
Compiler Optimization Correctness by Temporal Logic
inferred← citeshttps://doi.org/10.1093/comjnl/32.2.152openalex-snapshot
An Optimising Compiler for a Modern Functional Language
inferred← citeshttps://doi.org/10.1093/jigpal/10.5.501openalex-snapshot
A Simple CPS Transformation of Control-Flow Information
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/32.129219openalex-snapshot
SPARE: a development environment for program analysis algorithms
inferred← citeshttps://doi.org/10.1109/iccsse.1997.599881openalex-snapshot
Formal development of static program analysers
inferred← citeshttps://doi.org/10.1145/103135.103139openalex-snapshot
Collecting interpretations of expressions
inferred← citeshttps://doi.org/10.1145/141471.141563openalex-snapshot
Reasoning about programs in continuation-passing style.
inferred← citeshttps://doi.org/10.1145/143165.143184openalex-snapshot
Inductive definitions, semantics and abstract interpretations
inferred← citeshttps://doi.org/10.1145/158511.158613openalex-snapshot
Separating stages in the continuation-passing style transformation
inferred← citeshttps://doi.org/10.1145/177492.177650openalex-snapshot
Denotational abstract interpretation of logic programs
inferred← citeshttps://doi.org/10.1145/178243.178244openalex-snapshot
Is continuation-passing useful for data flow analysis?
inferred← citeshttps://doi.org/10.1145/234528.234744openalex-snapshot
Structural operational semantics as a basis for static program analysis
inferred← citeshttps://doi.org/10.1145/265943.265966openalex-snapshot
Disjunctive program analysis for algebraic data types
inferred← citeshttps://doi.org/10.1145/268946.268950openalex-snapshot
Data flow analysis is model checking of abstract interpretations
inferred← citeshttps://doi.org/10.1145/351240.351260openalex-snapshot
Syntactic accidents in program analysis
inferred← citeshttps://doi.org/10.1145/357766.351260openalex-snapshot
Syntactic accidents in program analysis
inferred← citeshttps://doi.org/10.1145/3916.3917openalex-snapshot
Program transformations in a denotational setting
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/503272.503299openalex-snapshot
Proving correctness of compiler optimizations by temporal logic
inferred← citeshttps://doi.org/10.1145/512644.512672openalex-snapshot
Data flow analysis of applicative programs using minimal function graphs
inferred← citeshttps://doi.org/10.1145/565816.503299openalex-snapshot
Proving correctness of compiler optimizations by temporal logic
inferred← citeshttps://doi.org/10.1145/73141.74819openalex-snapshot
A framework for construction and evaluation of high-level specifications for program analysis techniques
inferred← citeshttps://doi.org/10.1145/73560.73570openalex-snapshot
A collecting interpretation of expressions
inferred← citeshttps://doi.org/10.1145/73560.73578openalex-snapshot
Correct flow analysis in continuation semantics
inferred← citeshttps://doi.org/10.1145/74818.74819openalex-snapshot
A framework for construction and evaluation of high-level specifications for program analysis techniques
inferred← citeshttps://doi.org/10.1145/773473.178244openalex-snapshot
Is continuation-passing useful for data flow analysis?
inferred← citeshttps://doi.org/10.31274/rtd-180813-11624openalex-snapshot
Detection of single-threading properties in combinator notations
inferred← citeshttps://doi.org/10.3166/ria.20.31-62openalex-snapshot
Abstraction de réseaux de contraintes
inferred← citeshttps://doi.org/10.4204/eptcs.387.8openalex-snapshot
Deriving Abstract Interpreters from Skeletal Semantics
inferred← citeshttps://doi.org/10.5281/zenodo.171856openalex-snapshot
FIGURE 3. Ilyarachna zachsi Gurjanova, 1933. A, D–H, female 2, R.V. Vitjaz, stn. 6647 in Redescription of Ilyarachna zachsi Gurjanova, 1933 (Crustacea: Isopoda: Munnopsidae) from the Sea of Japan, with the synonymisation of I. starokadomskii Gurjanova, 1933
inferred← citeshttps://doi.org/10.7146/brics.v3i34.20015openalex-snapshot
A Computational Formalization for Partial Evaluation (Extended Version)
inferred← citeshttps://doi.org/10.7146/brics.v4i2.18781openalex-snapshot
Abstract Interpretation in the Operational Semantics Hierarchy
inferred← citeshttps://doi.org/10.7146/brics.v8i54.21715openalex-snapshot
Syntactic Accidents in Program Analysis: On the Impact of the CPS Transformation
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.