On the public citation graph

Communicating processes with value-passing and assignments

https://doi.org/10.1007/bf01212486
0 signed · 37 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-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-10284-1openalex-snapshot
Algebraic semantics
inferredcites →https://doi.org/10.1007/bf01642508openalex-snapshot
A proof system for communicating processes with value-passing
inferredcites →https://doi.org/10.1007/bfb0022510openalex-snapshot
A term model for CCS
inferredcites →https://doi.org/10.1007/bfb0027046openalex-snapshot
Process theory: Semantics, specification and verification
inferredcites →https://doi.org/10.1007/bfb0032033openalex-snapshot
A theory of communicating processes with value-passing
inferredcites →https://doi.org/10.1016/0304-3975(84)90022-7openalex-snapshot
A linear-history semantics for languages for distributed programming
inferredcites →https://doi.org/10.1016/0304-3975(84)90113-0openalex-snapshot
Testing equivalences for processes
inferredcites →https://doi.org/10.1016/0304-3975(88)90049-7openalex-snapshot
The laws of OCCAM programming
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1137/0211062openalex-snapshot
The Category-Theoretic Solution of Recursive Domain Equations
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/359576.359585openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/4221.4249openalex-snapshot
Acceptance trees
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes

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-40911-4_3openalex-snapshot
Linking DC Together with TRSL
inferred← citeshttps://doi.org/10.1007/3-540-48118-4_4openalex-snapshot
An operational semantics for timed RAISE
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_85openalex-snapshot
Higher order communicating processes with Value-Passing, Assignment and return of results
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_124openalex-snapshot
A semantic theory for Concurrent ML
inferred← citeshttps://doi.org/10.1007/3-540-61052-9_45openalex-snapshot
A process algebra based on Linda
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_47openalex-snapshot
Symbolic transition graph with assignment
inferred← citeshttps://doi.org/10.1007/3-540-62503-8_15openalex-snapshot
Testing semantics of asynchronous distributed programs
inferred← citeshttps://doi.org/10.1007/978-3-031-91118-7_4openalex-snapshot
Constructive characterisations of the MUST-preorder for asynchrony
inferred← citeshttps://doi.org/10.1007/978-3-642-39698-4_11openalex-snapshot
The Value-Passing Calculus
inferred← citeshttps://doi.org/10.1007/978-3-662-04293-9_9openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.1007/s00224-024-10164-0openalex-snapshot
Imperative Process Algebra and Models of Parallel Computation
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50021-7openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50025-4openalex-snapshot
A Symbolic Approach to Value-Passing Processes
inferred← citeshttps://doi.org/10.1016/j.ipl.2014.09.014openalex-snapshot
A ground-complete axiomatization of stateless bisimilarity over Linda
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.07.043openalex-snapshot
Theory of interaction
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00261-2openalex-snapshot
Bisimulations for a calculus of broadcasting systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00339-4openalex-snapshot
Linda-based applicative and imperative process algebras
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80004-5openalex-snapshot
Full Abstraction for Strongly Fair Communicating Processes
inferred← citeshttps://doi.org/10.1109/icci.1993.315370openalex-snapshot
A denotational model for the integration of concurrent, functional and imperative programming
inferred← citeshttps://doi.org/10.14236/ewic/iwfm1999.13openalex-snapshot
Modular Composition of Language Features through Extensions of Semantic Language Models
inferred← citeshttps://doi.org/10.48550/arxiv.1508.00093openalex-snapshot
The Name-Passing Calculus
inferred← citeshttps://doi.org/10.7561/sacs.2022.1.137openalex-snapshot
Imperative Process Algebra with Abstraction
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.