On the public citation graph

Graphs and decidable transductions based on edge constraints

https://doi.org/10.1007/bfb0017482
0 signed · 20 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-55251-0_7openalex-snapshot
Monadic second-order definable graph transductions
inferredcites →https://doi.org/10.1007/bfb0017397openalex-snapshot
A characterization of context-free NCE graph languages by monadic second-order logic on trees
inferredcites →https://doi.org/10.1016/0890-5401(90)90043-hopenalex-snapshot
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50010-xopenalex-snapshot
Graph Rewriting: An Algebraic and Logic Approach
inferredcites →https://doi.org/10.1145/158511.158628openalex-snapshot
Graph types

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-36384-x_25openalex-snapshot
Shape Analysis through Predicate Abstraction and Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-36578-8_17openalex-snapshot
A Temporal Approach to Specification and Verification of Pointer Data-Structures
inferred← citeshttps://doi.org/10.1007/3-540-46425-5_8openalex-snapshot
Compile-Time Debugging of C Programs Working on Trees
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_45openalex-snapshot
Characterizing and Deciding MSO-Definability of Macro Tree Transductions
inferred← citeshttps://doi.org/10.1007/978-3-540-27864-1_25openalex-snapshot
On Logics of Aliasing
inferred← citeshttps://doi.org/10.1137/s0097539701394511openalex-snapshot
Macro Tree Translations of Linear Size Increase are MSO Definable
inferred← citeshttps://doi.org/10.1145/777388.777395openalex-snapshot
Storeless semantics and alias logic
inferred← citeshttps://doi.org/10.1145/966049.777395openalex-snapshot
Storeless semantics and alias logic
inferred← citeshttps://doi.org/10.7146/brics.v1i10.21660openalex-snapshot
Monadic Second-order Logic for Parameterized Verification
inferred← citeshttps://doi.org/10.7146/brics.v1i11.21659openalex-snapshot
A Homomorphism Concept for omega-Regularity
inferred← citeshttps://doi.org/10.7146/brics.v1i13.21656openalex-snapshot
Stable Bistructure Models of PCF
inferred← citeshttps://doi.org/10.7146/brics.v1i8.21662openalex-snapshot
Decidability Issues for Petri Nets
inferred← citeshttps://doi.org/10.7146/brics.v1i9.21661openalex-snapshot
Bistructures, Bidomains and Linear Logic
inferred← citeshttps://doi.org/10.7146/brics.v7i39.20205openalex-snapshot
The Pointer Assertion Logic Engine
inferred← citeshttps://doi.org/10.7146/dpb.v23i470.6943openalex-snapshot
Verification of Pointers
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.