On the public citation graph

Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection

0 signed · 50 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/11523468_117openalex-snapshot
Unsafe Grammars and Panic Automata
inferredcites →https://doi.org/10.1007/3-540-45413-6_21openalex-snapshot
Deciding Monadic Theories of Hyperalgebraic Trees
inferredcites →https://doi.org/10.1007/3-540-45931-6_15openalex-snapshot
Higher-Order Pushdown Trees Are Easy
inferredcites →https://doi.org/10.1007/978-3-540-78127-1_31openalex-snapshot
Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey
inferredcites →https://doi.org/10.1007/978-3-540-85238-4_17openalex-snapshot
Positional Strategies for Higher-Order Pushdown Parity Games
inferredcites →https://doi.org/10.1007/978-3-642-22012-8_12openalex-snapshot
Krivine Machines and Higher-Order Schemes
inferredcites →https://doi.org/10.1007/s10990-007-9018-9openalex-snapshot
A call-by-name lambda-calculus machine
inferredcites →https://doi.org/10.1016/0304-3975(82)90009-3openalex-snapshot
The IO- and OI-hierarchies
inferredcites →https://doi.org/10.1109/lics.2006.38openalex-snapshot
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
inferredcites →https://doi.org/10.1109/lics.2008.34openalex-snapshot
Collapsible Pushdown Automata and Recursion Schemes
inferredcites →https://doi.org/10.1109/lics.2009.29openalex-snapshot
A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes
inferredcites →https://doi.org/10.1109/lics.2010.40openalex-snapshot
Recursion Schemes and Logical Reflection
inferredcites →https://doi.org/10.1109/lics.2012.62openalex-snapshot
On the Significance of the Collapse Operation
inferredcites →https://doi.org/10.2478/s11533-010-0046-zopenalex-snapshot
Choice functions and well-orderings over the infinite binary tree
inferredcites →https://doi.org/10.5287/ora-0z5qv7o6zopenalex-snapshot
On collapsible pushdown automata, their graphs and the power of links

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-319-20297-6_24openalex-snapshot
Rewriting Higher-Order Stack Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-89884-1_25openalex-snapshot
Higher-Order Program Verification via HFL Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-33512-9_2openalex-snapshot
Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-35308-6_4openalex-snapshot
Program Certification by Higher-Order Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_3openalex-snapshot
Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_10openalex-snapshot
Alternating Parity Krivine Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-48057-1_20openalex-snapshot
Finitary Semantics of Linear Logic and Higher-Order Model-Checking
inferred← citeshttps://doi.org/10.1007/s00224-014-9533-0openalex-snapshot
On First-Order Logic and CPDA Graphs
inferred← citeshttps://doi.org/10.1007/s00224-017-9769-6openalex-snapshot
Rewriting Higher-Order Stack Trees
inferred← citeshttps://doi.org/10.1016/j.ic.2014.07.012openalex-snapshot
Krivine machines and higher-order schemes
inferred← citeshttps://doi.org/10.1017/s0960129514000590openalex-snapshot
Simply typed fixpoint calculus and collapsible pushdown automata
inferred← citeshttps://doi.org/10.1109/lics.2008.34openalex-snapshot
Collapsible Pushdown Automata and Recursion Schemes
inferred← citeshttps://doi.org/10.1109/lics.2013.46openalex-snapshot
Pumping by Typing
inferred← citeshttps://doi.org/10.1109/lics.2015.9openalex-snapshot
Higher-Order Model Checking: An Overview
inferred← citeshttps://doi.org/10.1145/2500365.2500589openalex-snapshot
C-SHORe
inferred← citeshttps://doi.org/10.1145/2544174.2500589openalex-snapshot
C-SHORe
inferred← citeshttps://doi.org/10.1145/2603088.2603133openalex-snapshot
Compositional higher-order model checking via ω -regular games over Böhm trees
inferred← citeshttps://doi.org/10.1145/2951913.2951919openalex-snapshot
Automatically disproving fair termination of higher-order functional programs
inferred← citeshttps://doi.org/10.1145/3022670.2951919openalex-snapshot
Automatically disproving fair termination of higher-order functional programs
inferred← citeshttps://doi.org/10.1145/3026744.3026745openalex-snapshot
Automata theory and higher-order model-checking
inferred← citeshttps://doi.org/10.1145/3091122openalex-snapshot
Collapsible Pushdown Automata and Recursion Schemes
inferred← citeshttps://doi.org/10.1145/3158127openalex-snapshot
Linearity in higher-order recursion schemes
inferred← citeshttps://doi.org/10.1145/3377137openalex-snapshot
How Good Is a Strategy in a Game with Nature?
inferred← citeshttps://doi.org/10.1145/3452917openalex-snapshot
Higher-order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties
inferred← citeshttps://doi.org/10.1145/3457214openalex-snapshot
Collapsible Pushdown Parity Games
inferred← citeshttps://doi.org/10.1145/3632929openalex-snapshot
On Model-Checking Higher-Order Effectful Programs
inferred← citeshttps://doi.org/10.23638/lmcs-16(1:20)2020openalex-snapshot
Recursion Schemes, the MSO Logic, and the U quantifier
inferred← citeshttps://doi.org/10.3233/fi-222145openalex-snapshot
Cost Automata, Safe Schemes, and Downward Closures
inferred← citeshttps://doi.org/10.4204/eptcs.191.12openalex-snapshot
A Type-Directed Negation Elimination
inferred← citeshttps://doi.org/10.4230/lipics.csl.2012.500openalex-snapshot
Variants of Collapsible Pushdown Systems
inferred← citeshttps://doi.org/10.4230/lipics.csl.2013.129openalex-snapshot
Saturation-Based Model Checking of Higher-Order Recursion Schemes
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2013.115openalex-snapshot
Model Checking and Functional Program Transformations
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2020.53openalex-snapshot
Higher-Order Nonemptiness Step by Step
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.140openalex-snapshot
Higher-Order Model Checking Step by Step
inferred← citeshttps://doi.org/10.48550/arxiv.2010.06361openalex-snapshot
Collapsible Pushdown Parity Games
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.