On the public citation graph

Data flow analysis of distributed communicating processes

0 signed · 49 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-10003-2_65openalex-snapshot
Semantic analysis of communicating sequential processes
inferredcites →https://doi.org/10.1007/3-540-15204-0_11openalex-snapshot
Csp-programs as nets with individual tokens
inferredcites →https://doi.org/10.1007/bf00283332openalex-snapshot
The complexity of reachability in distributed communicating processes
inferredcites →https://doi.org/10.1109/tse.1975.6312852openalex-snapshot
Property extraction in well-founded property sets
inferredcites →https://doi.org/10.1137/0204044openalex-snapshot
A Simple Algorithm for Global Data Flow Analysis Problems
inferredcites →https://doi.org/10.1145/321921.321939openalex-snapshot
A Fast and Usually Linear Algorithm for Global Flow Analysis
inferredcites →https://doi.org/10.1145/322123.322135openalex-snapshot
Data Flow Analysis for Procedural Languages
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/359114.359127openalex-snapshot
High level programming for distributed computing
inferredcites →https://doi.org/10.1145/359576.359585openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/567752.567777openalex-snapshot
Data flow analysis of communicating processes
inferredcites →https://doi.org/10.1145/72981.72984openalex-snapshot
Towards dataflow analysis of communicating finite state machines
inferredcites →https://doi.org/10.1145/800076.802467openalex-snapshot
Distributed algorithms for synchronizing interprocess communication within real time
inferredcites →https://doi.org/10.1145/800220.806691openalex-snapshot
Understanding and using asynchronous message passing (Preliminary Version)
inferredcites →https://doi.org/10.1147/rd.281.0052openalex-snapshot
A New Programming Methodology for Long-Lived Software Systems
inferredcites →https://doi.org/10.2307/2283757openalex-snapshot
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
inferredcites →https://doi.org/10.7146/dpb.v15i208.7559openalex-snapshot
A Calculus of Communicating Systems with Label Passing

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-55511-0_16openalex-snapshot
An algorithm for analyzing communicating processes
inferred← citeshttps://doi.org/10.1007/3-540-57209-0_20openalex-snapshot
Tractable flow analysis for anomaly detection in distributed programs
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_222openalex-snapshot
Static and dynamic processor allocation for higher-order concurrent languages
inferred← citeshttps://doi.org/10.1007/978-1-4615-2271-3_5openalex-snapshot
Static Deadlock Analysis for CSP-Type Communications
inferred← citeshttps://doi.org/10.1007/978-3-642-03466-4_1openalex-snapshot
Static Analysis of Concurrent Programs Using Ordinary Differential Equations
inferred← citeshttps://doi.org/10.1007/bfb0022024openalex-snapshot
Activity threads: A unified framework for aiding behavioural modelling
inferred← citeshttps://doi.org/10.1016/j.ins.2011.11.034openalex-snapshot
An enhanced flow analysis technique for detecting unreachability faults in concurrent systems
inferred← citeshttps://doi.org/10.1038/s41598-024-60981-zopenalex-snapshot
Experimental study on failure mode and fracture evolution characteristics of red shale in Kaiyang Phosphorus mining area.
inferred← citeshttps://doi.org/10.1109/32.310668openalex-snapshot
Tractable dataflow analysis for distributed systems
inferred← citeshttps://doi.org/10.1109/90.503762openalex-snapshot
On parallelizing and optimizing the implementation of communication protocols
inferred← citeshttps://doi.org/10.1109/dasc.1997.635010openalex-snapshot
Retrospective exploration of safety properties in real-time concurrent systems
inferred← citeshttps://doi.org/10.1109/icpp.2006.32openalex-snapshot
Data-Flow Analysis for MPI Programs
inferred← citeshttps://doi.org/10.1109/icse.1994.296793openalex-snapshot
An integrated method for effective behaviour analysis of distributed systems
inferred← citeshttps://doi.org/10.1109/tsmc.2014.2311757openalex-snapshot
Ordinary Differential Equation-Based Deadlock Detection
inferred← citeshttps://doi.org/10.1145/117009.117015openalex-snapshot
Data flow analysis of communicating finite state machines
inferred← citeshttps://doi.org/10.1145/143165.143194openalex-snapshot
Compile-time analysis of parallel programs that share memory
inferred← citeshttps://doi.org/10.1145/143369.143417openalex-snapshot
Compile-time analysis of communicating processes
inferred← citeshttps://doi.org/10.1145/155332.155346openalex-snapshot
Non-concurrency analysis
inferred← citeshttps://doi.org/10.1145/173284.155346openalex-snapshot
Non-concurrency analysis
inferred← citeshttps://doi.org/10.1145/182409.182493openalex-snapshot
Analyzing stores and references in a parallel symbolic language
inferred← citeshttps://doi.org/10.1145/182590.182493openalex-snapshot
Analyzing stores and references in a parallel symbolic language
inferred← citeshttps://doi.org/10.1145/226295.226299openalex-snapshot
Improving the accuracy of Petri net-based analysis of concurrent programs
inferred← citeshttps://doi.org/10.1145/229000.226299openalex-snapshot
Improving the accuracy of Petri net-based analysis of concurrent programs
inferred← citeshttps://doi.org/10.1145/239098.239114openalex-snapshot
Verification of communication protocols using data flow analysis
inferred← citeshttps://doi.org/10.1145/250707.239114openalex-snapshot
Verification of communication protocols using data flow analysis
inferred← citeshttps://doi.org/10.1145/258993.259002openalex-snapshot
Partial-evaluation techniques for concurrent programs
inferred← citeshttps://doi.org/10.1145/258994.259002openalex-snapshot
Partial-evaluation techniques for concurrent programs
inferred← citeshttps://doi.org/10.1145/295558.295570openalex-snapshot
Checking safety properties using compositional reachability analysis
inferred← citeshttps://doi.org/10.1145/302405.302663openalex-snapshot
Data flow analysis for checking properties of concurrent Java programs
inferred← citeshttps://doi.org/10.1145/3328905.3329500openalex-snapshot
Static Termination Analysis for Event-driven Distributed Algorithms
inferred← citeshttps://doi.org/10.1145/3335149openalex-snapshot
Efficient Verification of Concurrent Systems Using Synchronisation Analysis and SAT/SMT Solving
inferred← citeshttps://doi.org/10.5555/257734.257792openalex-snapshot
An integrated method for effective behaviour analysis of distributed 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.