On the public citation graph

Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems

0 signed · 140 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/11539452_36openalex-snapshot
Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems
inferredcites →https://doi.org/10.1007/11871743openalex-snapshot
Variations on Constants
inferredcites →https://doi.org/10.1007/3-540-46425-5_23openalex-snapshot
Constraint-Based Inter-Procedural Analysis of Parallel Programs
inferredcites →https://doi.org/10.1007/3-540-49019-1_2openalex-snapshot
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis
inferredcites →https://doi.org/10.1007/3-540-63141-0_10openalex-snapshot
Reachability analysis of pushdown automata: Application to model-checking
inferredcites →https://doi.org/10.1007/978-3-540-24597-1_7openalex-snapshot
Reachability Analysis of Process Rewrite Systems
inferredcites →https://doi.org/10.1007/978-3-540-24727-2_2openalex-snapshot
Theories for the Global Ubiquitous Computer
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_35openalex-snapshot
A Temporal Logic of Nested Calls and Returns
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-540-32033-3_15openalex-snapshot
Call-by-Value Is Dual to Call-by-Name – Reloaded
inferredcites →https://doi.org/10.1007/978-3-540-32033-3_35openalex-snapshot
On Computing Reachability Sets of Process Rewrite Systems
inferredcites →https://doi.org/10.1007/b94618openalex-snapshot
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science : 23rd Conference, Mumbai, India, December 15-17, 2003. Proceedings
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/j.entcs.2005.02.063openalex-snapshot
Reachability Analysis of Synchronized PA Systems
inferredcites →https://doi.org/10.1016/j.tcs.2003.09.002openalex-snapshot
Precise interprocedural dependence analysis of parallel programs
inferredcites →https://doi.org/10.1016/s0304-3975(00)00306-6openalex-snapshot
The regular viewpoint on PA-processes
inferredcites →https://doi.org/10.1016/s1571-0661(05)80426-8openalex-snapshot
A Direct Symbolic Approach to Model Checking Pushdown Systems (extended abstract)
inferredcites →https://doi.org/10.1017/cbo9780511624193openalex-snapshot
Process Algebra
inferredcites →https://doi.org/10.1145/325694.325697openalex-snapshot
Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
inferredcites →https://doi.org/10.1145/604131.604137openalex-snapshot
A generic approach to the static analysis of concurrent programs with procedures

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4643578openalex-extracted
inferred← citeshttps://doi.org/10.1007/11590156_28openalex-snapshot
Reachability Analysis of Multithreaded Software with Asynchronous Communication
inferred← citeshttps://doi.org/10.1007/11590156_5openalex-snapshot
From Logic to Games
inferred← citeshttps://doi.org/10.1007/11609773_27openalex-snapshot
Verification of Well-Formed Communicating Recursive State Machines
inferred← citeshttps://doi.org/10.1007/11805618_11openalex-snapshot
Rewriting Models of Boolean Programs
inferred← citeshttps://doi.org/10.1007/11817963_29openalex-snapshot
Model Checking Multithreaded Programs with Asynchronous Atomic Methods
inferred← citeshttps://doi.org/10.1007/978-0-387-34735-6_19openalex-snapshot
Regular Hedge Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-030-00250-3_4openalex-snapshot
Constrained Dynamic Tree Networks
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-05529-5_16openalex-snapshot
Model Checking Dynamic Pushdown Networks with Locks and Priorities
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-031-50521-8_3openalex-snapshot
A Navigation Logic for Recursive Programs with Dynamic Thread Creation
inferred← citeshttps://doi.org/10.1007/978-3-031-66456-4_14openalex-snapshot
Reachability Analysis of Concurrent Self-modifying Code
inferred← citeshttps://doi.org/10.1007/978-3-032-00828-2_17openalex-snapshot
LTL Model Checking of Concurrent Self Modifying Code
inferred← citeshttps://doi.org/10.1007/978-3-319-03542-0_3openalex-snapshot
Model Checking Dynamic Pushdown Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-51963-0_2openalex-snapshot
Verifying Parametric Thread Creation
inferred← citeshttps://doi.org/10.1007/978-3-319-52234-0_23openalex-snapshot
Reachability for Dynamic Parametric Processes
inferred← citeshttps://doi.org/10.1007/978-3-319-59647-1_22openalex-snapshot
Reachability Analysis of Dynamic Pushdown Networks with Priorities
inferred← citeshttps://doi.org/10.1007/978-3-319-63390-9_9openalex-snapshot
Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-68167-2_15openalex-snapshot
Dealing with Priorities and Locks for Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-71237-6_12openalex-snapshot
Static Analysis of Multithreaded Recursive Programs Communicating via Rendez-Vous
inferred← citeshttps://doi.org/10.1007/978-3-319-94460-9_5openalex-snapshot
CARET Analysis of Multithreaded Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-69166-2_14openalex-snapshot
Conflict Analysis of Programs with Procedures, Dynamic Thread Creation, and Monitors
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_54openalex-snapshot
A Generic Framework for Reasoning About Dynamic Networks of Infinite-State Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_10openalex-snapshot
Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_20openalex-snapshot
Precise Fixpoint-Based Analysis of Programs with Thread-Creation and Procedures
inferred← citeshttps://doi.org/10.1007/978-3-540-78800-3_20openalex-snapshot
Interprocedural Analysis of Concurrent Programs Under a Context Bound
inferred← citeshttps://doi.org/10.1007/978-3-540-85114-1_19openalex-snapshot
Symbolic Context-Bounded Analysis of Multithreaded Java Programs
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-88282-4_6openalex-snapshot
On Bifix Systems and Generalizations
inferred← citeshttps://doi.org/10.1007/978-3-642-02652-2_12openalex-snapshot
A Decision Procedure for Detecting Atomicity Violations for Communicating Processes with Locks
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_39openalex-snapshot
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
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-02979-0_3openalex-snapshot
Program Analysis through Finite Tree Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-03466-4_20openalex-snapshot
Constrained Reachability of Process Rewrite Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-04420-5_13openalex-snapshot
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
inferred← citeshttps://doi.org/10.1007/978-3-642-11957-6_31openalex-snapshot
Weighted Dynamic Pushdown Networks
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-14295-6_55openalex-snapshot
Dynamic Cutoff Detection in Parameterized Concurrent Programs
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-18275-4_15openalex-snapshot
Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation
inferred← citeshttps://doi.org/10.1007/978-3-642-19805-2_15openalex-snapshot
Regularity and Context-Freeness over Word Rewriting Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-19829-8_16openalex-snapshot
Normalization of Linear Horn Clauses
inferred← citeshttps://doi.org/10.1007/978-3-642-19835-9_28openalex-snapshot
On Probabilistic Parallel Programs with Process Creation and Synchronisation
inferred← citeshttps://doi.org/10.1007/978-3-642-23217-6_36openalex-snapshot
Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems
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-32589-2_55openalex-snapshot
Weakly-Synchronized Ground Tree Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-642-32940-1_6openalex-snapshot
Reachability Problem for Weak Multi-Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-33125-1_4openalex-snapshot
Efficient May Happen in Parallel Analysis for Async-Finish Parallelism
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-38856-9_25openalex-snapshot
Contextual Locking for Dynamic Pushdown Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-40184-8_21openalex-snapshot
Safety Verification of Asynchronous Pushdown Systems with Shaped Stacks
inferred← citeshttps://doi.org/10.1007/s00165-014-0330-yopenalex-snapshot
Model checking dynamic pushdown networks
inferred← citeshttps://doi.org/10.1007/s10009-010-0159-5openalex-snapshot
A decision procedure for detecting atomicity violations for communicating processes with locks
inferred← citeshttps://doi.org/10.1007/s10207-014-0257-6openalex-snapshot
A new algorithm for low-deterministic security
inferred← citeshttps://doi.org/10.1007/s10270-012-0230-7openalex-snapshot
Relational interprocedural verification of concurrent programs
inferred← citeshttps://doi.org/10.1007/s10703-014-0207-yopenalex-snapshot
Budget-bounded model-checking 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/s11390-020-0541-zopenalex-snapshot
Reachability of Patterned Conditional Pushdown Systems
inferred← citeshttps://doi.org/10.1007/s11704-018-7069-1openalex-snapshot
A fully abstract semantics for value-passing CCS for trees
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.05.029openalex-snapshot
Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism
inferred← citeshttps://doi.org/10.1016/j.ic.2017.12.003openalex-snapshot
Analyzing pushdown systems with stack manipulation
inferred← citeshttps://doi.org/10.1016/j.ic.2019.03.003openalex-snapshot
On store languages and applications
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.scico.2013.11.008openalex-snapshot
Understanding probabilistic software leaks
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.05.028openalex-snapshot
Verifying parallel programs with dynamic communication structures
inferred← citeshttps://doi.org/10.1080/03081079.2012.757437openalex-snapshot
Automated formal analysis and verification: an overview
inferred← citeshttps://doi.org/10.1109/lics.2006.11openalex-snapshot
An Automata-Theoretic Approach for Model Checking Threads for LTL Propert
inferred← citeshttps://doi.org/10.1109/lics.2007.9openalex-snapshot
A Robust Class of Context-Sensitive Languages
inferred← citeshttps://doi.org/10.1109/lics.2011.36openalex-snapshot
The Complexity of Verifying Ground Tree Rewrite Systems
inferred← citeshttps://doi.org/10.1109/sefm.2009.29openalex-snapshot
Relational Interprocedural Verification of Concurrent Programs
inferred← citeshttps://doi.org/10.1109/tase.2013.10openalex-snapshot
Process Rewrite Systems for Software Model Checking
inferred← citeshttps://doi.org/10.1145/1190215.1190262openalex-snapshot
On the analysis of interacting pushdown systems
inferred← citeshttps://doi.org/10.1145/1190216.1190262openalex-snapshot
On the analysis of interacting pushdown systems
inferred← citeshttps://doi.org/10.1145/1925844.1926398openalex-snapshot
Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol
inferred← citeshttps://doi.org/10.1145/1925844.1926443openalex-snapshot
Complexity of pattern-based verification for multithreaded programs
inferred← citeshttps://doi.org/10.1145/1926385.1926398openalex-snapshot
Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol
inferred← citeshttps://doi.org/10.1145/1926385.1926443openalex-snapshot
Complexity of pattern-based verification for multithreaded programs
inferred← citeshttps://doi.org/10.1145/2103621.2103681openalex-snapshot
Analysis of recursively parallel programs
inferred← citeshttps://doi.org/10.1145/2103656.2103681openalex-snapshot
Analysis of recursively parallel programs
inferred← citeshttps://doi.org/10.1145/2518188openalex-snapshot
Analysis of Recursively Parallel Programs
inferred← citeshttps://doi.org/10.1145/2629644openalex-snapshot
Pattern-Based Verification for Multithreaded Programs
inferred← citeshttps://doi.org/10.1145/2629679openalex-snapshot
Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems
inferred← citeshttps://doi.org/10.1145/2837614.2837627openalex-snapshot
Unboundedness and downward closures of higher-order pushdown automata
inferred← citeshttps://doi.org/10.1145/2914770.2837627openalex-snapshot
Unboundedness and downward closures of higher-order pushdown automata
inferred← citeshttps://doi.org/10.1145/3034950.3034984openalex-snapshot
A New Parallel Approach for Reachability Analysis of Pushdown Models
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.14236/ewic/vecos2007.7openalex-snapshot
Computing Transitive Closures of Hedge Transformations
inferred← citeshttps://doi.org/10.1504/ijccbs.2012.045079openalex-snapshot
Computing transitive closures of hedge transformations
inferred← citeshttps://doi.org/10.17760/d20328155openalex-snapshot
Resource-aware program analysis using observation sequences
inferred← citeshttps://doi.org/10.2168/lmcs-5(2:3)2009openalex-snapshot
A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes
inferred← citeshttps://doi.org/10.2168/lmcs-7(4:4)2011openalex-snapshot
Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads
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.2168/lmcs-9(3:13)2013openalex-snapshot
Reachability Problem for Weak Multi-Pushdown Automata
inferred← citeshttps://doi.org/10.22158/wjssr.v4n4p287openalex-snapshot
Reachability Analysis of Asynchronous Dynamic Pushdown Networks Based on Tree Semantics Approach
inferred← citeshttps://doi.org/10.3233/fi-2010-368openalex-snapshot
Decidability Problems in Petri Nets with Names and Replication
inferred← citeshttps://doi.org/10.3929/ethz-a-006213873openalex-snapshot
Model Checking Boolean Programs
inferred← citeshttps://doi.org/10.4204/eptcs.129.24openalex-snapshot
Iterable Forward Reachability Analysis of Monitor-DPNs
inferred← citeshttps://doi.org/10.4204/eptcs.89.4openalex-snapshot
Partially-commutative context-free languages
inferred← citeshttps://doi.org/10.4230/lipics.concur.2015.383openalex-snapshot
On Reachability Analysis of Pushdown Systems with Transductions: Application to Boolean Programs with Call-by-Reference
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.2011.457openalex-snapshot
Parameterised Pushdown Systems with Non-Atomic Writes
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2013.313openalex-snapshot
Saturation of Concurrent Collapsible Pushdown Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1410.8852openalex-snapshot
Decidable Models of Recursive Asynchronous Concurrency
inferred← citeshttps://doi.org/10.48550/arxiv.1502.05873openalex-snapshot
Annotated Stack Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1609.05385openalex-snapshot
Reachability for dynamic parametric processes
inferred← citeshttps://doi.org/10.48550/arxiv.1611.02528openalex-snapshot
LTL Model-Checking for Dynamic Pushdown Networks Communicating via Locks
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.5287/ora-7rg81n5vyopenalex-snapshot
Saturation methods for global model-checking pushdown systems
inferred← citeshttps://doi.org/10.54337/aau588616986openalex-snapshot
Quantitative Verification and Synthesis of Resilient Networks
inferred← citeshttps://doi.org/10.5445/ir/1000028162openalex-snapshot
Probabilistic Noninterference Based on Program Dependence Graphs
inferred← citeshttps://doi.org/10.5555/1946284.1946299openalex-snapshot
Join-lock-sensitive forward reachability analysis for concurrent programs with dynamic process creation
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/7c30d231z10a9z41cfza1c1z9538d82e5610openalex-snapshot
Grammaires de graphes et langages formels
inferred← citeshttps://doi.org/10.70675/f51892c5z9581z4412zbe27zaa702a9e56dfopenalex-snapshot
Synthesis for parameterized systems
showing the first 119 of 120 · page through all 120
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.