On the public citation graph
Specification-oriented semantics for communicating processes
0 signed · 81 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/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-10699-5_102openalex-snapshot
Scenarios: A model of non-determinate computation
inferredcites →https://doi.org/10.1007/3-540-11494-7_17openalex-snapshot
Specification of communicating processes and process implementation correctness
inferredcites →https://doi.org/10.1007/3-540-12689-9_98openalex-snapshot
A complete set of axioms for a theory of communicating sequential processes
inferredcites →https://doi.org/10.1007/bf00289266openalex-snapshot
A proof technique for communicating sequential processes
inferredcites →https://doi.org/10.1007/bfb0012801openalex-snapshot
Domains for denotational semantics
inferredcites →https://doi.org/10.1016/0022-0000(79)90006-0openalex-snapshot
Semantics of nondeterminism, concurrency, and communication
inferredcites →https://doi.org/10.1016/0096-0551(83)90036-xopenalex-snapshot
Denotational semantics: The scott-strachey approach to programming language theory
inferredcites →https://doi.org/10.1016/0167-6423(81)90005-8openalex-snapshot
A calculus of total correctness for communicating processes
inferredcites →https://doi.org/10.1016/0304-3975(83)90081-6openalex-snapshot
A more complete model of communicating processes
inferredcites →https://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
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(84)90114-2openalex-snapshot
Linear time and branching time semantics for recursion with merge
inferredcites →https://doi.org/10.1016/s0019-9958(82)91250-5openalex-snapshot
Processes and the denotational semantics of concurrency
inferredcites →https://doi.org/10.1109/sfcs.1981.36openalex-snapshot
Possible futures, acceptances, refusals, and communicating processes
inferredcites →https://doi.org/10.1109/tse.1981.230844openalex-snapshot
Proofs of Networks of Processes
inferredcites →https://doi.org/10.1145/321992.321997openalex-snapshot
Initial Algebra Semantics and Continuous Algebras
inferredcites →https://doi.org/10.1145/322358.322372openalex-snapshot
Formal Justification of a Proof System for Communicating Sequential Processes
inferredcites →https://doi.org/10.1145/357103.357110openalex-snapshot
A Proof System for Communicating Sequential Processes
inferredcites →https://doi.org/10.1145/357172.357178openalex-snapshot
Proving Liveness Properties of Concurrent Programs
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/360248.360251openalex-snapshot
Formal verification of parallel programs
inferredcites →https://doi.org/10.1145/800070.802188openalex-snapshot
Denotational semantics of concurrency
inferredcites →https://doi.org/10.1145/800220.806687openalex-snapshot
Four combinators for concurrency
inferredcites →https://doi.org/10.1145/800220.806698openalex-snapshot
Proving safety and liveness of communicating processes with examples
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-12896-4_353openalex-snapshot
Algebraic tools for system construction
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_14openalex-snapshot
An improved failures model for communicating processes
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_17openalex-snapshot
Applications of topology to semantics of communicating processes
inferred← citeshttps://doi.org/10.1007/3-540-16042-6_22openalex-snapshot
A complete proof system for SCCS with modal assertions
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_81openalex-snapshot
A timed model for communicating sequential processes
inferred← citeshttps://doi.org/10.1007/3-540-18203-9_1openalex-snapshot
Parallelism issues in multi — Style computers
inferred← citeshttps://doi.org/10.1007/3-540-19020-1_17openalex-snapshot
Metric spaces as models for real-time concurrency
inferred← citeshttps://doi.org/10.1007/3-540-51803-7_34openalex-snapshot
Compositionality and modularity in process specification and design: A trace-state based approach
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_73openalex-snapshot
A model for real-time systems
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_187openalex-snapshot
Languages for reactive specifications: Synchrony vs asynchrony
inferred← citeshttps://doi.org/10.1007/978-1-4471-0299-1_2openalex-snapshot
Behavioral compatibility in Concurrent Object Constructions
inferred← citeshttps://doi.org/10.1007/978-1-4471-3534-0_14openalex-snapshot
Specifying Processes in Terms of Their Environments
inferred← citeshttps://doi.org/10.1007/978-1-4471-3756-6_15openalex-snapshot
A Theory of State-based Parallel Programming: Part 1
inferred← citeshttps://doi.org/10.1007/978-1-84882-912-1_1openalex-snapshot
Insight, Inspiration and Collaboration
inferred← citeshttps://doi.org/10.1007/978-3-319-23506-6_2openalex-snapshot
Ernst-Rüdiger Olderog: A Life for Meaning
inferred← citeshttps://doi.org/10.1007/978-3-319-69483-2_7openalex-snapshot
Compositional Hoare-Style Reasoning About Hybrid CSP in the Duration Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-74884-4_10openalex-snapshot
Towards a Design Methodology for Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-87374-4_14openalex-snapshot
Models and logic of MOS circuits
inferred← citeshttps://doi.org/10.1007/bf01094341openalex-snapshot
Tools for specifying real-time systems
inferred← citeshttps://doi.org/10.1007/bf01211434openalex-snapshot
Towards a formal foundation of the specification and description language SDL
inferred← citeshttps://doi.org/10.1007/bfb0015740openalex-snapshot
Infinite streams and finite observations in the semantics of uniform concurrency
inferred← citeshttps://doi.org/10.1007/bfb0015776openalex-snapshot
Compositionality and concurrent networks: Soundness and completeness of a proofsystem
inferred← citeshttps://doi.org/10.1007/bfb0027040openalex-snapshot
Contrasting themes in the semantics of imperative concurrency
inferred← citeshttps://doi.org/10.1007/bfb0027046openalex-snapshot
Process theory: Semantics, specification and verification
inferred← citeshttps://doi.org/10.1007/bfb0039071openalex-snapshot
Equivalences, congruences, and complete axiomatizations for probabilistic processes
inferred← citeshttps://doi.org/10.1007/bfb0040255openalex-snapshot
A hierarchy of domains for real-time distributed computing
inferred← citeshttps://doi.org/10.1007/s00165-003-0007-4openalex-snapshot
Relational Concurrent Refinement
inferred← citeshttps://doi.org/10.1016/0167-6423(85)90010-3openalex-snapshot
Top-down design and the algebra of communicating processes
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90130-6openalex-snapshot
On the suitability of trace semantics for modular proofs of communicating processes
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90030-8openalex-snapshot
A timed model for communicating sequential processes
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90155-mopenalex-snapshot
The expressive power of implicit specifications
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90058-popenalex-snapshot
A compositional proof system on a category of labelled transition systems
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80048-0openalex-snapshot
Semantics of communicating processes
inferred← citeshttps://doi.org/10.1017/s0960129514000334openalex-snapshot
Models for CSP with availability information
inferred← citeshttps://doi.org/10.1093/comjnl/30.6.498openalex-snapshot
Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
inferred← citeshttps://doi.org/10.1109/lics.1988.5113openalex-snapshot
A category of labelled Petri nets and compositional proof system
inferred← citeshttps://doi.org/10.1145/22145.22174openalex-snapshot
Transition systems, infinitary languages and the semantics of uniform concurrency
inferred← citeshttps://doi.org/10.1145/2499777.2500724openalex-snapshot
Behavioral refinement of non-deterministic state transition diagrams based on behavior elimination
inferred← citeshttps://doi.org/10.1145/3477355.3477375openalex-snapshot
List of Tony Hoare’s Publications
inferred← citeshttps://doi.org/10.1145/72981.73000openalex-snapshot
Predicates are predicate transformers: a unified compositional theory for concurrency
inferred← citeshttps://doi.org/10.21236/ada611117openalex-snapshot
Principles of Trust for Embedded Systems
inferred← citeshttps://doi.org/10.4204/eptcs.41.7openalex-snapshot
Models for CSP with availability information
inferred← citeshttps://doi.org/10.7146/brics.v3i39.20021openalex-snapshot
On the Complexity of Deciding Behavioural Equivalences and Preorders. A Survey
inferred← citeshttps://doi.org/10.7146/brics.v3i43.20025openalex-snapshot
Weak Semantics Based on Lighted Button Pressing Experiments. An Alternative Characterization of the Readiness Semantics
inferred← citeshttps://doi.org/10.7146/brics.v5i6.19278openalex-snapshot
Further Results on Partial Order Equivalences on Infinite Systems
inferred← citeshttps://doi.org/10.7146/dpb.v19i307.6555openalex-snapshot
Partial orders and fully abstract models for concurrency
inferred← citeshttps://doi.org/10.7146/dpb.v19i308.6558openalex-snapshot
True concurrency can be traced
inferred← citeshttps://doi.org/10.7146/dpb.v20i352.6582openalex-snapshot
A Model for Real-Time 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.