On the public citation graph

Generalised flowcharts and games

https://doi.org/10.1007/bfb0055067
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-57887-0_87openalex-snapshot
Full Abstraction for PCF (extended abstract)
inferredcites →https://doi.org/10.1007/978-1-4612-4118-8_11openalex-snapshot
Syntactic Control of Interference
inferredcites →https://doi.org/10.1007/978-1-4612-4118-8_4openalex-snapshot
The Essence of Algol
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-662-03811-6openalex-snapshot
Principles of Program Analysis
inferredcites →https://doi.org/10.1007/bfb0026425openalex-snapshot
A new approach to control flow analysis
inferredcites →https://doi.org/10.1109/lics.1996.561456openalex-snapshot
Game semantics and abstract machines
inferredcites →https://doi.org/10.1145/199448.199536openalex-snapshot
A unified treatment of flow analysis in higher-order languages
inferredcites →https://doi.org/10.1145/222124.222146openalex-snapshot
Demand interprocedural dataflow analysis
inferredcites →https://doi.org/10.1145/263699.263745openalex-snapshot
Infinitary control flow analysis
inferredcites →https://doi.org/10.1145/512760.512766openalex-snapshot
Syntactic control of interference

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11539452_8openalex-snapshot
A Game Semantics of the Asynchronous π-Calculus
inferred← citeshttps://doi.org/10.1007/11547662_9openalex-snapshot
Data-Abstraction Refinement: A Game Semantic Approach
inferred← citeshttps://doi.org/10.1007/11691372_20openalex-snapshot
Compositional Model Extraction for Higher-Order Concurrent Programs
inferred← citeshttps://doi.org/10.1007/11944836_38openalex-snapshot
Game Semantics for Higher-Order Concurrency
inferred← citeshttps://doi.org/10.1007/3-540-26494-9_6openalex-snapshot
Tool support for UMLsec
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-24730-2_32openalex-snapshot
Applying Game Semantics to Compositional Software Modeling and Verification
inferred← citeshttps://doi.org/10.1007/s10009-010-0143-0openalex-snapshot
Data-abstraction refinement: a game semantic approach
inferred← citeshttps://doi.org/10.1016/j.apal.2016.10.011openalex-snapshot
Combining control effects and their models: Game semantics for a hierarchy of static, dynamic and delimited control effects
inferred← citeshttps://doi.org/10.1016/j.entcs.2003.05.006openalex-snapshot
A–maze–ing Esterel
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.011openalex-snapshot
Definability and Full Abstraction
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.032openalex-snapshot
Syntactic control of concurrency
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.1016/s1571-0661(04)80958-7openalex-snapshot
Regular-Language Semantics for a Call-by-Value Programming Language
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.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/333580.333584openalex-snapshot
Program analysis games
inferred← citeshttps://doi.org/10.1145/507382.507385openalex-snapshot
Probabilistic game semantics
inferred← citeshttps://doi.org/10.4204/eptcs.127.8openalex-snapshot
Combining and Relating Control Effects and their Semantics
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.