On the public citation graph
A Robust Class of Context-Sensitive Languages
0 signed · 146 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11513988_49openalex-snapshot
Reasoning About Threads Communicating via Locks
inferredcites →https://doi.org/10.1007/11539452_36openalex-snapshot
Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems
inferredcites →https://doi.org/10.1007/11590156_28openalex-snapshot
Reachability Analysis of Multithreaded Software with Asynchronous Communication
inferredcites →https://doi.org/10.1007/11690634_20openalex-snapshot
Propositional Dynamic Logic with Recursive Programs
inferredcites →https://doi.org/10.1007/11691372_22openalex-snapshot
Verifying Concurrent Message-Passing C Programs with Recursive Calls
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-31980-1_7openalex-snapshot
Context-Bounded Model Checking of Concurrent Software
inferredcites →https://doi.org/10.1007/978-3-642-59126-6_7openalex-snapshot
Languages, Automata, and Logic
inferredcites →https://doi.org/10.1007/bf01691346openalex-snapshot
Generalized finite automata theory with an application to a decision problem of second-order logic
inferredcites →https://doi.org/10.1016/0022-0000(86)90026-7openalex-snapshot
Automata-theoretic techniques for modal logics of programs
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50021-4openalex-snapshot
Temporal and Modal Logic
inferredcites →https://doi.org/10.1016/s0022-0000(70)80041-1openalex-snapshot
Tree acceptors and some of their applications
inferredcites →https://doi.org/10.1137/0222054openalex-snapshot
Deciding Properties of Nonregular Programs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11609773_27openalex-snapshot
Verification of Well-Formed Communicating Recursive State Machines
inferred← citeshttps://doi.org/10.1007/978-3-030-00359-3_10openalex-snapshot
LTL Model-Checking for Communicating Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-01090-4_22openalex-snapshot
Round-Bounded Control of Parameterized Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-24886-4_12openalex-snapshot
On Timed Scope-Bounded Context-Sensitive Languages
inferred← citeshttps://doi.org/10.1007/978-3-030-45190-5_21openalex-snapshot
Revisiting Underapproximate Reachability for Multipushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-43587-4_23openalex-snapshot
Forwards- and Backwards-Reachability for Cooperating Multi-pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-09698-8_11openalex-snapshot
Scope-Bounded Pushdown Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-11936-6_1openalex-snapshot
Verifying Communicating Multi-pushdown Systems via Split-Width
inferred← citeshttps://doi.org/10.1007/978-3-319-12027-0_1openalex-snapshot
A Parsing Approach to SAT
inferred← citeshttps://doi.org/10.1007/978-3-319-20028-6_6openalex-snapshot
On Distributed Monitoring and Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-319-22360-5_1openalex-snapshot
Automata and Logics for Concurrent Systems: Five Models in Five Pages
inferred← citeshttps://doi.org/10.1007/978-3-319-23111-2_7openalex-snapshot
Tinput-Driven Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-30000-9_12openalex-snapshot
Input-Driven Queue Automata with Internal Transductions
inferred← citeshttps://doi.org/10.1007/978-3-319-45994-3_11openalex-snapshot
Decidable Models of Integer-Manipulating Programs with Recursive Parallelism
inferred← citeshttps://doi.org/10.1007/978-3-319-46376-6_8openalex-snapshot
Emergence in Context-Free Parallel Communicating Grammar Systems: What Does and Does not Make a Grammar System More Expressive Than Its Parts
inferred← citeshttps://doi.org/10.1007/978-3-319-53733-7_33openalex-snapshot
Reachability Analysis of Pushdown Systems with an Upper Stack
inferred← citeshttps://doi.org/10.1007/978-3-319-59647-1_21openalex-snapshot
Parity Games on Bounded Phase Multi-pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-94111-0_8openalex-snapshot
Model-Checking HyperLTL for Pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-97879-6_17openalex-snapshot
Reasoning About Reversal-Bounded Counter Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-78800-3_21openalex-snapshot
Context-Bounded Analysis of Concurrent Queue Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_29openalex-snapshot
On the Reachability Analysis of Acyclic Networks of Pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-85780-8_9openalex-snapshot
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_5openalex-snapshot
An Infinite Automaton Characterization of Double Exponential Time
inferred← citeshttps://doi.org/10.1007/978-3-540-92687-0_27openalex-snapshot
Games on Multi-stack Pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_50openalex-snapshot
Event-Clock Visibly Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-00596-1_29openalex-snapshot
Realizability of Concurrent Recursive Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_42openalex-snapshot
Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-02979-0_18openalex-snapshot
Verifying Parallel Programs with Dynamic Communication Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-04420-5_19openalex-snapshot
Games on Higher Order Multi-stack Pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_19openalex-snapshot
Reachability Analysis of Communicating Pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-12200-2_10openalex-snapshot
The Language Theory of Bounded Context-Switching
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_53openalex-snapshot
Global Reachability in Bounded Phase Multi-stack Pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-15375-4_9openalex-snapshot
From Multi to Single Stack Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_15openalex-snapshot
Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-23217-6_14openalex-snapshot
Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-24288-5_6openalex-snapshot
Formal Language Constrained Reachability and Model Checking Propositional Dynamic Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-28729-9_26openalex-snapshot
Model Checking Languages of Data Words
inferred← citeshttps://doi.org/10.1007/978-3-642-28756-5_31openalex-snapshot
Bounded Phase Analysis of Message-Passing Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_22openalex-snapshot
Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters
inferred← citeshttps://doi.org/10.1007/978-3-642-31644-9_13openalex-snapshot
Descriptional Complexity of Input-Driven Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_55openalex-snapshot
Weakly-Synchronized Ground Tree Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-642-32940-1_38openalex-snapshot
MSO Decidability of Multi-Pushdown Systems via Split-Width
inferred← citeshttps://doi.org/10.1007/978-3-642-33386-6_13openalex-snapshot
Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding
inferred← citeshttps://doi.org/10.1007/978-3-642-33475-7_16openalex-snapshot
A Temporal Logic for Multi-threaded Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-38536-0_35openalex-snapshot
Model-Checking Bounded Multi-Pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-38771-5_7openalex-snapshot
Adjacent Ordered Multi-Pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_22openalex-snapshot
Ramsey Goes Visibly Pushdown
inferred← citeshttps://doi.org/10.1007/978-3-642-39274-0_21openalex-snapshot
Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-54848-2_2openalex-snapshot
Context-Bounded Analysis of TSO Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_32openalex-snapshot
A Unifying Approach for Multistack Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_37openalex-snapshot
Model Checking Concurrent Recursive Programs Using Temporal Logics
inferred← citeshttps://doi.org/10.1007/978-3-662-44584-6_21openalex-snapshot
Controllers for the Verification of Communicating Multi-pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-47666-6_2openalex-snapshot
Automated Synthesis of Distributed Controllers
inferred← citeshttps://doi.org/10.1007/978-3-662-47666-6_33openalex-snapshot
On the Complexity of Intersecting Regular, Context-Free, and Tree Languages
inferred← citeshttps://doi.org/10.1007/978-3-662-53132-7_1openalex-snapshot
Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-53132-7_4openalex-snapshot
A Perfect Class of Context-Sensitive Timed Languages
inferred← citeshttps://doi.org/10.1007/s00224-016-9700-6openalex-snapshot
The Complexity of Model Checking Multi-Stack Systems
inferred← citeshttps://doi.org/10.1007/s10009-013-0276-zopenalex-snapshot
Bounded phase analysis of message-passing programs
inferred← citeshttps://doi.org/10.1007/s10703-014-0207-yopenalex-snapshot
Budget-bounded model-checking pushdown systems
inferred← citeshttps://doi.org/10.1007/s10703-017-0282-yopenalex-snapshot
Realizability of concurrent recursive programs
inferred← citeshttps://doi.org/10.1007/s10703-023-00431-0openalex-snapshot
Round- and context-bounded control of dynamic pushdown systems
inferred← citeshttps://doi.org/10.1007/s11334-020-00363-6openalex-snapshot
LTL Model Checking for Communicating Concurrent Programs
inferred← citeshttps://doi.org/10.1007/s42979-024-03371-6openalex-snapshot
CHC-Based Verification of Programs Through Graph Decompositions
inferred← citeshttps://doi.org/10.1016/j.disc.2019.111703openalex-snapshot
On exteriority notions in book embeddings and treewidth
inferred← citeshttps://doi.org/10.1016/j.ic.2016.07.010openalex-snapshot
On the path-width of integer linear programming
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104588openalex-snapshot
Reachability of scope-bounded multistack pushdown systems
inferred← citeshttps://doi.org/10.1016/j.jal.2007.12.002openalex-snapshot
A note on an extension of PDL
inferred← citeshttps://doi.org/10.1016/j.jal.2014.05.001openalex-snapshot
Temporal logics for concurrent recursive programs: Satisfiability and model checking
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103601openalex-snapshot
Backwards-reachability for cooperating multi-pushdown systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.06.012openalex-snapshot
Verification of well-formed communicating recursive state machines
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.05.028openalex-snapshot
Verifying parallel programs with dynamic communication structures
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.012openalex-snapshot
Deterministic input-driven queue automata: Finite turns, decidability, and closure properties
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.08.012openalex-snapshot
Ordered multi-stack visibly pushdown automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.04.050openalex-snapshot
Decidable models of integer-manipulating programs with recursive parallelism
inferred← citeshttps://doi.org/10.1051/ita/2016016openalex-snapshot
When input-driven pushdown automata meet reversiblity
inferred← citeshttps://doi.org/10.1051/ita/2017006openalex-snapshot
The determinacy strength of pushdownω-languages
inferred← citeshttps://doi.org/10.1051/ita/2021006openalex-snapshot
Digging input-driven pushdown automata
inferred← citeshttps://doi.org/10.1109/ispdc.2013.30openalex-snapshot
Not Seeing the Parse Trees from the Parse Forest of a Context-Free Parallel Communicating Grammar System
inferred← citeshttps://doi.org/10.1109/lics.2012.39openalex-snapshot
A Perfect Model for Bounded Verification
inferred← citeshttps://doi.org/10.1109/lics.2013.22openalex-snapshot
The Complexity of Model Checking Multi-stack Systems
inferred← citeshttps://doi.org/10.1142/s0129054125410072openalex-snapshot
Sweeping Input-Driven Pushdown Automata
inferred← citeshttps://doi.org/10.1145/1925844.1926419openalex-snapshot
The tree width of auxiliary storage
inferred← citeshttps://doi.org/10.1145/1926385.1926419openalex-snapshot
The tree width of auxiliary storage
inferred← citeshttps://doi.org/10.1145/2603088.2603112openalex-snapshot
Senescent ground tree rewrite systems
inferred← citeshttps://doi.org/10.1145/2660193.2660211openalex-snapshot
Natural proofs for asynchronous programs using almost-synchronous reductions
inferred← citeshttps://doi.org/10.1145/2714064.2660211openalex-snapshot
Natural proofs for asynchronous programs using almost-synchronous reductions
inferred← citeshttps://doi.org/10.1145/2774221openalex-snapshot
Ramsey-Based Inclusion Checking for Visibly Pushdown Automata
inferred← citeshttps://doi.org/10.1145/2933575.2934561openalex-snapshot
The complexity of regular abstractions of one-counter languages
inferred← citeshttps://doi.org/10.1145/3009837.3009848openalex-snapshot
Context-sensitive data-dependence analysis via linear conjunctive language reachability
inferred← citeshttps://doi.org/10.1145/3093333.3009848openalex-snapshot
Context-sensitive data-dependence analysis via linear conjunctive language reachability
inferred← citeshttps://doi.org/10.1145/3192366.3192419openalex-snapshot
CUBA: interprocedural Context-UnBounded Analysis of concurrent programs
inferred← citeshttps://doi.org/10.1145/3296979.3192419openalex-snapshot
CUBA: interprocedural Context-UnBounded Analysis of concurrent programs
inferred← citeshttps://doi.org/10.1145/3418583openalex-snapshot
Interprocedural Context-Unbounded Program Analysis Using Observation Sequences
inferred← citeshttps://doi.org/10.1145/3434298openalex-snapshot
Verifying correct usage of context-free API protocols
inferred← citeshttps://doi.org/10.1145/3527540.3527542openalex-snapshot
How treewidth helps in verification
inferred← citeshttps://doi.org/10.1145/3704854openalex-snapshot
Program Analysis via Multiple Context Free Language Reachability
inferred← citeshttps://doi.org/10.1145/3763160openalex-snapshot
Products of Recursive Programs for Hypersafety Verification
inferred← citeshttps://doi.org/10.1145/3776716openalex-snapshot
Bounded Treewidth, Multiple Context-Free Grammars, and Downward Closures
inferred← citeshttps://doi.org/10.17760/d20328155openalex-snapshot
Resource-aware program analysis using observation sequences
inferred← citeshttps://doi.org/10.2168/lmcs-4(4:16)2008openalex-snapshot
On the Expressive Power of 2-Stack Visibly Pushdown Automata
inferred← citeshttps://doi.org/10.2168/lmcs-8(3:20)2012openalex-snapshot
Model-Checking of Ordered Multi-Pushdown Automata
inferred← citeshttps://doi.org/10.2168/lmcs-8(3:23)2012openalex-snapshot
Reachability Analysis of Communicating Pushdown Systems
inferred← citeshttps://doi.org/10.23638/lmcs-14(2:8)2018openalex-snapshot
Analyzing Timed Systems Using Tree Automata
inferred← citeshttps://doi.org/10.26226/morressier.604907f51a80aac83ca25da8openalex-snapshot
Revisiting Underapproximate Reachability for Multipushdown Systems
inferred← citeshttps://doi.org/10.4204/eptcs.151.1openalex-snapshot
Saturation algorithms for model-checking pushdown systems
inferred← citeshttps://doi.org/10.4204/eptcs.161.9openalex-snapshot
On the Path-Width of Integer Linear Programming
inferred← citeshttps://doi.org/10.4204/eptcs.333.24openalex-snapshot
Products in a Category with Only One Object
inferred← citeshttps://doi.org/10.4204/eptcs.339.4openalex-snapshot
Separating the Expressive Power of Propositional Dynamic and Modal Fixpoint Logics
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2008.1739openalex-snapshot
Analyzing Asynchronous Programs with Preemption
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2010.216openalex-snapshot
Global Model Checking of Ordered Multi-Pushdown Systems
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2012.173openalex-snapshot
Scope-bounded Multistack Pushdown Systems: Fixed-Point, Sequentialization, and Tree-Width
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2013.313openalex-snapshot
Saturation of Concurrent Collapsible Pushdown Systems
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2020.52openalex-snapshot
Model checking Branching-Time Properties of Multi-Pushdown Systems is Hard
inferred← citeshttps://doi.org/10.48550/arxiv.0707.0562openalex-snapshot
On a Non-Context-Free Extension of PDL
inferred← citeshttps://doi.org/10.48550/arxiv.1212.1485openalex-snapshot
A Note on the Complexity of Model-Checking Bounded Multi-Pushdown Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1311.4915openalex-snapshot
Senescent Ground Tree Rewrite Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1506.02369openalex-snapshot
Automated Synthesis of Distributed Controllers
inferred← citeshttps://doi.org/10.48550/arxiv.1605.06868openalex-snapshot
Decidable models of integer-manipulating programs with recursive parallelism (technical report)
inferred← citeshttps://doi.org/10.48550/arxiv.1804.04766openalex-snapshot
CUBA: Interprocedural Context-UnBounded Analysis of Concurrent Programs (Extended Manuscript)
inferred← citeshttps://doi.org/10.70675/61130ea1zef23z4950z81e1z91b74939ff7copenalex-snapshot
Vers la vérification de propriétés de sûreté pour des systèmes infinis communicants : décidabilité et raffinement des abstractions
inferred← citeshttps://doi.org/10.70675/f51892c5z9581z4412zbe27zaa702a9e56dfopenalex-snapshot
Synthesis for parameterized systems
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.