On the public citation graph

Global program analysis in constraint form

0 signed · 39 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.1006/inco.1995.1058openalex-snapshot
Safety Analysis versus Type Inference
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-47910-4_14openalex-snapshot
Type Inference of Self
inferredcites →https://doi.org/10.1007/bf01806105openalex-snapshot
SELF: The power of simplicity
inferredcites →https://doi.org/10.1016/0020-0190(92)90196-3openalex-snapshot
Safety analysis versus type inference for partial types
inferredcites →https://doi.org/10.1016/0167-6423(91)90002-fopenalex-snapshot
Automatic autoprojection of recursive equations with global variables and abstract data types
inferredcites →https://doi.org/10.1016/0167-6423(91)90035-vopenalex-snapshot
Automatic autoprojection of higher order recursive equations
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1017/s0956796800000769openalex-snapshot
Efficient analyses for realistic off-line partial evaluation
inferredcites →https://doi.org/10.1017/s0956796800000770openalex-snapshot
Correctness of binding-time analysis
inferredcites →https://doi.org/10.1109/iccl.1994.288372openalex-snapshot
Binding-time analysis: abstract interpretation versus type inference
inferredcites →https://doi.org/10.1109/lics.1988.5101openalex-snapshot
Characterization of typings in polymorphic type discipline
inferredcites →https://doi.org/10.1145/38765.38828openalex-snapshot
Self: The power of simplicity
inferredcites →https://doi.org/10.1145/91556.91668openalex-snapshot
Binding time analysis for high order untyped functional languages
inferredcites →https://doi.org/10.1145/99370.99374openalex-snapshot
Replacing function parameters by global variables
inferredcites →https://doi.org/10.1184/r1/6604622openalex-snapshot
Data-flow analysis and type recovery in Scheme
inferredcites →https://doi.org/10.7146/dpb.v21i389.6624openalex-snapshot
Safety Analysis versus Type Inference
inferredcites →https://doi.org/10.7146/dpb.v22i436.6753openalex-snapshot
Type Inference of SELF: Analysis of Objects with Dynamic and Multiple Inheritance

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-36377-7_7openalex-snapshot
Flow Analysis: Games and Nets
inferred← citeshttps://doi.org/10.1007/3-540-47993-7_22openalex-snapshot
Type-Safe Method Inlining
inferred← citeshttps://doi.org/10.1007/3-540-49099-x_3openalex-snapshot
Interprocedural Control Flow Analysis
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_220openalex-snapshot
Comparing flow-based binding-time analyses
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-60360-3_37openalex-snapshot
Optimizing lazy functional programs using flow inference
inferred← citeshttps://doi.org/10.1007/3-540-60360-3_41openalex-snapshot
Effective flow analysis for avoiding run-time checks
inferred← citeshttps://doi.org/10.1007/3-540-62501-1_36openalex-snapshot
Constraint databases and program analysis using abstract interpretation
inferred← citeshttps://doi.org/10.1007/3-540-62503-8_4openalex-snapshot
Abstract interpretation of small-step semantics
inferred← citeshttps://doi.org/10.1007/bfb0032746openalex-snapshot
Exact flow analysis
inferred← citeshttps://doi.org/10.1007/bfb0033843openalex-snapshot
Higher-order value flow graphs
inferred← citeshttps://doi.org/10.1017/s0956796802004513openalex-snapshot
CPS transformation of flow information
inferred← citeshttps://doi.org/10.1017/s0960129502003857openalex-snapshot
Exact flow analysis
inferred← citeshttps://doi.org/10.1023/a:1007734417713openalex-snapshot
inferred← citeshttps://doi.org/10.1109/iccl.1994.288372openalex-snapshot
Binding-time analysis: abstract interpretation versus type inference
inferred← citeshttps://doi.org/10.1145/199448.199533openalex-snapshot
A type system equivalent to flow analysis
inferred← citeshttps://doi.org/10.1145/2187671.2187672openalex-snapshot
Control-flow analysis of functional programs
inferred← citeshttps://doi.org/10.1145/224164.224199openalex-snapshot
Formal language, grammar and set-constraint-based program analysis by abstract interpretation
inferred← citeshttps://doi.org/10.7146/brics.v14i18.21936openalex-snapshot
Control-Flow Analysis of Functional Programs
inferred← citeshttps://doi.org/10.7146/brics.v4i2.18781openalex-snapshot
Abstract Interpretation in the Operational Semantics Hierarchy
inferred← citeshttps://doi.org/10.7146/dpb.v24i493.7021openalex-snapshot
Particpants' Proceedings on the Workshop: Types for Program Analysis
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.