On the public citation graph

An Automata-Theoretic Approach for Model Checking Threads for LTL Propert

0 signed · 34 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/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/3-540-44450-5_10openalex-snapshot
Model Checking CTL Properties of Pushdown Systems
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-31980-1_7openalex-snapshot
Context-Bounded Model Checking of Concurrent Software
inferredcites →https://doi.org/10.1016/s0304-3975(00)00306-6openalex-snapshot
The regular viewpoint on PA-processes
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/349214.349241openalex-snapshot
Context-sensitive synchronization-sensitive analysis is undecidable
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.1007/11609773_27openalex-snapshot
Verification of Well-Formed Communicating Recursive State Machines
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-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-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-71998-4_9openalex-snapshot
SVtL: System Verification Through Logic Tool Support for Verifying Sliced Hierarchical Statecharts
inferred← citeshttps://doi.org/10.1007/978-3-540-93900-9_2openalex-snapshot
Model Checking Concurrent Programs
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-13754-9_11openalex-snapshot
An Automata-Theoretic Approach to Infinite-State Systems
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-23217-6_30openalex-snapshot
Reasoning about Threads with Bounded Lock Chains
inferred← citeshttps://doi.org/10.1007/978-3-642-28756-5_30openalex-snapshot
Reachability under Contextual Locking
inferred← citeshttps://doi.org/10.1007/s00165-014-0330-yopenalex-snapshot
Model checking dynamic pushdown networks
inferred← citeshttps://doi.org/10.1007/s10009-013-0274-1openalex-snapshot
Static analysis for concurrent programs with applications to data race detection
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.1109/lics.2008.37openalex-snapshot
Parameterization as Abstraction: A Tractable Approach to the Dataflow Analysis of Concurrent Programs
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.2168/lmcs-9(3:21)2013openalex-snapshot
Reachability under Contextual Locking
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.4204/eptcs.129.24openalex-snapshot
Iterable Forward Reachability Analysis of Monitor-DPNs
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.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
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.