On the public citation graph

A new approach to control flow analysis

https://doi.org/10.1007/bfb0026425
0 signed · 28 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-57887-0_87openalex-snapshot
Full Abstraction for PCF (extended abstract)
inferredcites →https://doi.org/10.1007/978-1-4757-3851-3_10openalex-snapshot
Linearity, Sharing and State: A Fully Abstract Game Semantics for Idealized Algol with Active Expressions
inferredcites →https://doi.org/10.1007/978-3-030-05156-3_1openalex-snapshot
Program Graphs
inferredcites →https://doi.org/10.1016/0167-6423(91)90035-vopenalex-snapshot
Automatic autoprojection of higher order recursive equations
inferredcites →https://doi.org/10.1090/conm/092/1003197openalex-snapshot
Towards a geometry of interaction
inferredcites →https://doi.org/10.1109/lics.1996.561456openalex-snapshot
Game semantics and abstract machines
inferredcites →https://doi.org/10.1145/182409.182495openalex-snapshot
Set-based analysis of ML programs
inferredcites →https://doi.org/10.1145/258948.258951openalex-snapshot
A modular, polyvariant and type-based closure analysis
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11547662_9openalex-snapshot
Data-Abstraction Refinement: A Game Semantic Approach
inferred← citeshttps://doi.org/10.1007/11575467_19openalex-snapshot
Termination Analysis of Higher-Order Functional Programs
inferred← citeshttps://doi.org/10.1007/3-540-36377-7_7openalex-snapshot
Flow Analysis: Games and Nets
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_10openalex-snapshot
Reasoning about Idealized ALGOL Using Regular Languages
inferred← citeshttps://doi.org/10.1007/978-3-030-41103-9openalex-snapshot
From Lambda Calculus to Cybersecurity Through Program Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-78739-6_23openalex-snapshot
Verification of Higher-Order Computation: A Game-Semantic Approach
inferred← citeshttps://doi.org/10.1007/bfb0055067openalex-snapshot
Generalised flowcharts and games
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.011openalex-snapshot
Definability and Full Abstraction
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00315-3openalex-snapshot
The regular-language semantics of second-order idealized ALGOL
inferred← citeshttps://doi.org/10.1109/lics.1999.782639openalex-snapshot
Non-deterministic games and program analysis: An application to security
inferred← citeshttps://doi.org/10.1109/lics.2000.855770openalex-snapshot
Probabilistic game semantics
inferred← citeshttps://doi.org/10.1109/lics.2008.24openalex-snapshot
Reachability Games and Game Semantics: Comparing Nondeterministic Programs
inferred← citeshttps://doi.org/10.1109/lics.2009.26openalex-snapshot
Applications of Game Semantics: From Program Analysis to Hardware Synthesis
inferred← citeshttps://doi.org/10.1109/lics.2009.48openalex-snapshot
Functional Reachability
inferred← citeshttps://doi.org/10.1145/1291151.1291165openalex-snapshot
Termination analysis and call graph construction for higher-order functional programs
inferred← citeshttps://doi.org/10.1145/2187671.2187672openalex-snapshot
Control-flow analysis of functional programs
inferred← citeshttps://doi.org/10.1145/507382.507385openalex-snapshot
Probabilistic game semantics
inferred← citeshttps://doi.org/10.1145/981009.981013openalex-snapshot
A survey of semantic description frameworks for programming languages
inferred← citeshttps://doi.org/10.7146/brics.v14i18.21936openalex-snapshot
Control-Flow Analysis of Functional Programs
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.