On the public citation graph

A proof technique for communicating sequential processes

0 signed · 146 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/bf00268134openalex-snapshot

An axiomatic proof technique for parallel programs I

inferredcites →https://doi.org/10.1109/tse.1979.230190openalex-snapshot

Communication and Synchronization in Distributed Systems

inferredcites →https://doi.org/10.1109/tse.1981.230844openalex-snapshot

Proofs of Networks of Processes

inferredcites →https://doi.org/10.1145/357084.357087openalex-snapshot

Distributed Termination

inferredcites →https://doi.org/10.1145/357094.357101openalex-snapshot

Output Guards and Nondeterminism in “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/357114.357119openalex-snapshot

Assignment and Procedure Call Proof Rules

inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot

An axiomatic basis for computer programming

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/363235.363259openalex-snapshot

An axiomatic basis for computer programming

What points at this work

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

inferred← citeshttps://doi.org/10.1002/scj.4690171102openalex-snapshot

Verification system for partial correctness of communicating sequential processes

inferred← citeshttps://doi.org/10.1002/scj.4690180401openalex-snapshot

Verification system for freedom from deadlock of communicating sequential processes

inferred← citeshttps://doi.org/10.1007/3-540-11490-4_14openalex-snapshot

Partial correctness of distributed programs

inferred← citeshttps://doi.org/10.1007/3-540-11490-4_15openalex-snapshot

Specification of distributed programs

inferred← citeshttps://doi.org/10.1007/3-540-11492-0_4openalex-snapshot

Proof rules

inferred← citeshttps://doi.org/10.1007/3-540-11494-7_7openalex-snapshot

A weakest precondition semantics for communicating processes

inferred← citeshttps://doi.org/10.1007/3-540-12896-4_351openalex-snapshot

A static analysis of CSP programs

inferred← citeshttps://doi.org/10.1007/3-540-12896-4_356openalex-snapshot

A semantics and proof system for communicating processes

inferred← citeshttps://doi.org/10.1007/3-540-15198-2_16openalex-snapshot

A complete modal proof system for a subset of SCCS

inferred← citeshttps://doi.org/10.1007/3-540-15199-0_21openalex-snapshot

Synthesis of parallel programs invariants

inferred← citeshttps://doi.org/10.1007/3-540-15239-3_12openalex-snapshot

Introduction

inferred← citeshttps://doi.org/10.1007/3-540-15239-3_19openalex-snapshot

Levin & Gries: Verification of CSP

inferred← citeshttps://doi.org/10.1007/3-540-15648-8_26openalex-snapshot

A proof system for Distributed Processes

inferred← citeshttps://doi.org/10.1007/3-540-15648-8_4openalex-snapshot

An axiomatic treatment of a parallel programming language

inferred← citeshttps://doi.org/10.1007/3-540-15670-4_1openalex-snapshot

On the axiomatic treatment of concurrency

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_2openalex-snapshot

Hierarchical development of concurrent systems in a temporal logic framework

inferred← citeshttps://doi.org/10.1007/3-540-16042-6_3openalex-snapshot

A new class of high level programs for distributed computing systems

inferred← citeshttps://doi.org/10.1007/3-540-36208-8_19openalex-snapshot

Formal Techniques for Java-like Programs

inferred← citeshttps://doi.org/10.1007/3-540-45426-8_6openalex-snapshot

An Environment for the Integrated Modelling of Systems with Complex Continuous and Discrete Dynamics

inferred← citeshttps://doi.org/10.1007/3-540-45931-6_2openalex-snapshot

Verification for Java’s Reentrant Multithreading Concept

inferred← citeshttps://doi.org/10.1007/3-540-49213-5_1openalex-snapshot

The Need for Compositional Proof Systems: A Survey

inferred← citeshttps://doi.org/10.1007/3-540-54430-5_90openalex-snapshot

Synchrony loosening transformations for interacting processes

inferred← citeshttps://doi.org/10.1007/3-540-55599-4_133openalex-snapshot

A framework for parallel composition of protocols

inferred← citeshttps://doi.org/10.1007/3-540-58043-3_23openalex-snapshot

Verification and specification of concurrent programs

inferred← citeshttps://doi.org/10.1007/978-0-387-09766-4_182openalex-snapshot

Owicki-Gries Method of Axiomatic Verification

inferred← citeshttps://doi.org/10.1007/978-0-387-35358-6_8openalex-snapshot

A proof theory of asynchronously communicating sequential processes

inferred← citeshttps://doi.org/10.1007/978-1-4612-0325-4_21openalex-snapshot

Distributed Concurrent Programs as Strategies in Games

inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_17openalex-snapshot

Concurrent Programs as Strategies in Games

inferred← citeshttps://doi.org/10.1007/978-1-4757-4376-0_1openalex-snapshot

Introduction

inferred← citeshttps://doi.org/10.1007/978-1-4757-4376-0_8openalex-snapshot

Distributed Programs

inferred← citeshttps://doi.org/10.1007/978-3-031-35361-1_8openalex-snapshot

Reasoning About Choreographic Programs

inferred← citeshttps://doi.org/10.1007/978-3-031-38499-8_6openalex-snapshot

Uniform Substitution for Dynamic Logic with Communicating Hybrid Programs

inferred← citeshttps://doi.org/10.1007/978-3-540-39656-7_1openalex-snapshot

A Tool-Supported Proof System for Multithreaded Java

inferred← citeshttps://doi.org/10.1007/978-3-540-39958-2_11openalex-snapshot

Inductive Proof Outlines for Monitors in Java

inferred← citeshttps://doi.org/10.1007/978-3-642-73451-9_7openalex-snapshot

Prozeßkommunikation mit asynchronem Empfangen

inferred← citeshttps://doi.org/10.1007/978-3-642-77580-2_5openalex-snapshot

An introduction to compositional methods for concurrency and their application to real-time

inferred← citeshttps://doi.org/10.1007/978-3-642-82453-1_8openalex-snapshot

The Cooperation Test : a syntax-directed verification method

inferred← citeshttps://doi.org/10.1007/978-3-642-82921-5_10openalex-snapshot

Proving Correctness of CSP Programs — A Tutorial

inferred← citeshttps://doi.org/10.1007/978-3-7091-9288-7_5openalex-snapshot

Fault-Tolerant Distributed Sort Generated from a Verification Proof Outline

inferred← citeshttps://doi.org/10.1007/978-94-015-9608-4_9openalex-snapshot

A Personal, Historical Perspective of Parallel Programming for High Performance

inferred← citeshttps://doi.org/10.1007/bf00264361openalex-snapshot

Redundant proofs of non-interference in Levin-Gries CSP program proofs

inferred← citeshttps://doi.org/10.1007/bf00268075openalex-snapshot

Specification-oriented semantics for Communicating Processes

inferred← citeshttps://doi.org/10.1007/bf00283331openalex-snapshot

A proof system for distributed processes

inferred← citeshttps://doi.org/10.1007/bf00289498openalex-snapshot

Total correctness of CSP programs

inferred← citeshttps://doi.org/10.1007/bf01082606openalex-snapshot

Axiomatic system for proving the properties of simple multimodule programs

inferred← citeshttps://doi.org/10.1007/bf01843567openalex-snapshot

A model and temporal proof system for networks of processes

inferred← citeshttps://doi.org/10.1007/bf01933742openalex-snapshot

An axiomatic semantics for nested concurrency

inferred← citeshttps://doi.org/10.1007/bf02252958openalex-snapshot

A complete axiomatic semantics of spawning

inferred← citeshttps://doi.org/10.1007/bf02311231openalex-snapshot

P — A logic — a compositional proof system for distributed programs

inferred← citeshttps://doi.org/10.1007/bf02737106openalex-snapshot

A proof system for distributed processes

inferred← citeshttps://doi.org/10.1007/bf02811338openalex-snapshot

An introduction to compositional methods for concurrency and their application to real-time

inferred← citeshttps://doi.org/10.1007/bf02973486openalex-snapshot

Proof techniques for port-directed communication and broadcast

inferred← citeshttps://doi.org/10.1007/bfb0002777openalex-snapshot

Synchronising asynchronous communications

inferred← citeshttps://doi.org/10.1007/bfb0015773openalex-snapshot

A complete compositional modal proof system for a subset of CCS

inferred← citeshttps://doi.org/10.1007/bfb0019365openalex-snapshot

A compositional proof system for distributed programs

inferred← citeshttps://doi.org/10.1007/bfb0027044openalex-snapshot

The quest goes on: A survey of proofsystems for partial correctness of CSP

inferred← citeshttps://doi.org/10.1007/bfb0036937openalex-snapshot

Specification-oriented semantics for communicating processes

inferred← citeshttps://doi.org/10.1007/bfb0039074openalex-snapshot

Proving termination of communicating programs

inferred← citeshttps://doi.org/10.1007/bfb0039720openalex-snapshot

Formal derivation of an error-detecting distributed data scheduler using Changeling

inferred← citeshttps://doi.org/10.1007/s00165-019-00501-3openalex-snapshot

Fifty years of Hoare’s logic

inferred← citeshttps://doi.org/10.1007/s00287-012-0627-2openalex-snapshot

Turing und die Verifikation

inferred← citeshttps://doi.org/10.1007/s10009-015-0403-0openalex-snapshot

Some recent advances in automated analysis

inferred← citeshttps://doi.org/10.1016/0020-0190(87)90197-9openalex-snapshot

Predicate transfer and timeout in message passing systems

inferred← citeshttps://doi.org/10.1016/0020-0190(89)90049-5openalex-snapshot

Cooperating proofs for distributed programs with multiparty interactions

inferred← citeshttps://doi.org/10.1016/0020-0190(89)90191-9openalex-snapshot

Auxiliary variables in partial correctness programming logics

inferred← citeshttps://doi.org/10.1016/0140-3664(88)90041-2openalex-snapshot

Behavioural approach to OSI system design

inferred← citeshttps://doi.org/10.1016/0164-1212(93)90023-qopenalex-snapshot

Tracing the execution of distributed programs

inferred← citeshttps://doi.org/10.1016/0167-6423(82)90002-8openalex-snapshot

A methodology for programming with concurrency: An informal presentation

inferred← citeshttps://doi.org/10.1016/0167-6423(83)90005-9openalex-snapshot

Extended naming conventions for communicating processes

inferred← citeshttps://doi.org/10.1016/0167-6423(83)90010-2openalex-snapshot

Exceptions and interrupts in CSP

inferred← citeshttps://doi.org/10.1016/0167-6423(83)90013-8openalex-snapshot

Decomposition of distributed programs into communication-closed layers

inferred← citeshttps://doi.org/10.1016/0167-6423(84)90018-2openalex-snapshot

A proof system for concurrent ADA programs

inferred← citeshttps://doi.org/10.1016/0167-6423(88)90013-5openalex-snapshot

Partially interpreted schemas for CSP programming

inferred← citeshttps://doi.org/10.1016/0167-6423(95)00002-aopenalex-snapshot

Verifying programs that use causally-ordered message-passing

inferred← citeshttps://doi.org/10.1016/0167-8191(89)90074-4openalex-snapshot

Automatic transformation of high-level object-oriented specifications into parallel programs

inferred← citeshttps://doi.org/10.1016/0304-3975(84)90001-xopenalex-snapshot

A weakest precondition semantics for communicating processes

inferred← citeshttps://doi.org/10.1016/b978-0-408-02938-4.50007-3openalex-snapshot

Concepts and notations for concurrent programming**Reprinted from: ACM Computing Surveys, 15(1), March 1983 with permission of the Association for Computing Machinery Inc.

inferred← citeshttps://doi.org/10.1016/b978-0-408-02938-4.50016-4openalex-snapshot

Key references in distributed computer systems 1959–1989

inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50020-2openalex-snapshot

Methods and Logics for Proving Programs

inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50023-8openalex-snapshot

Distributed Computing: Models and Methods

inferred← citeshttps://doi.org/10.1016/b978-0-934613-12-5.50008-2openalex-snapshot

Introduction to Program Verification

inferred← citeshttps://doi.org/10.1016/j.camwa.2005.02.015openalex-snapshot

Computation of equilibriain noncooperative games

inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.072openalex-snapshot

Inductive Proof Outlines for Exceptions in Multithreaded Java

inferred← citeshttps://doi.org/10.1016/j.tcs.2004.09.019openalex-snapshot

An assertion-based proof system for multithreaded Java

inferred← citeshttps://doi.org/10.1016/s0065-2458(08)60533-1openalex-snapshot

Protocol Engineering

inferred← citeshttps://doi.org/10.1080/10637199808947391openalex-snapshot

AXIOMATIC FRAMEWORKS FOR DEVELOPING BSP-STYLE PROGRAMS∗

inferred← citeshttps://doi.org/10.1109/32.223804openalex-snapshot

Proof rules for flush channels

inferred← citeshttps://doi.org/10.1109/32.58782openalex-snapshot

The specification and verified decomposition of system requirements using CSP

inferred← citeshttps://doi.org/10.1109/32.663998openalex-snapshot

Component based design of multitolerant systems

inferred← citeshttps://doi.org/10.1109/5.48825openalex-snapshot

A review of specification and verification methods for parallel programs including the dataflow approach

inferred← citeshttps://doi.org/10.1109/cmpsac.1992.217571openalex-snapshot

Fault-tolerant concurrent branch and bound algorithms derived from program verification

inferred← citeshttps://doi.org/10.1109/cng.1984.680779openalex-snapshot

CSP-based Specifications For Network Protocols and services

inferred← citeshttps://doi.org/10.1109/compsac.2005.121openalex-snapshot

Power Transmission Control Using Distributed Max Flow

inferred← citeshttps://doi.org/10.1109/csf.2011.11openalex-snapshot

Automated Proofs for Diffie-Hellman-Based Key Exchanges

inferred← citeshttps://doi.org/10.1109/hicss.1993.284112openalex-snapshot

Model checking of control-finite CSP programs

inferred← citeshttps://doi.org/10.1109/icdcs.1989.37994openalex-snapshot

An approach to verification of communication in distributed computing system software

inferred← citeshttps://doi.org/10.1109/icdcs.1991.148725openalex-snapshot

Using tracing to direct our reasoning about distributed programs

inferred← citeshttps://doi.org/10.1109/ipdps.2006.1639626openalex-snapshot

Cost evaluation from specifications for BSP programs

inferred← citeshttps://doi.org/10.1109/ispdc.2011.17openalex-snapshot

Formal Refinement of BSP Programs with Early Cost Evaluation

inferred← citeshttps://doi.org/10.1109/soca.2011.6166223openalex-snapshot

Invariants as a unified knowledge model for Cyber-Physical Systems

inferred← citeshttps://doi.org/10.1109/spdp.1990.143568openalex-snapshot

Modeling distributed termination with pre-defined partial termination ordering

inferred← citeshttps://doi.org/10.1109/spdp.1994.346156openalex-snapshot

DTVS: a distributed trace visualization system

inferred← citeshttps://doi.org/10.1109/tc.1986.1676697openalex-snapshot

A LOTOS Specification of the PROWAY Highway Service

inferred← citeshttps://doi.org/10.1109/tsg.2013.2283171openalex-snapshot

Unified Invariants for Cyber-Physical Switched System Stability

inferred← citeshttps://doi.org/10.1145/1013812.18197openalex-snapshot

Conformity analysis for communication protocols

inferred← citeshttps://doi.org/10.1145/1024840.1035256openalex-snapshot

A methodology for verifying request processing protocols

inferred← citeshttps://doi.org/10.1145/1780.1805openalex-snapshot

Axiomatic semantics of communicating sequential processes

inferred← citeshttps://doi.org/10.1145/18172.18197openalex-snapshot

Conformity analysis for communication protocols

inferred← citeshttps://doi.org/10.1145/2993.357247openalex-snapshot

The ``Hoare Logic'' of CSP, and All That

inferred← citeshttps://doi.org/10.1145/318593.318624openalex-snapshot

A model and temporal proof system for networks of processes

inferred← citeshttps://doi.org/10.1145/3477355.3477359openalex-snapshot

Assessing the Success and Impact of Hoare’s Logic

inferred← citeshttps://doi.org/10.1145/356901.356903openalex-snapshot

Concepts and Notations for Concurrent Programming

inferred← citeshttps://doi.org/10.1145/3816707openalex-snapshot

Tony Hoare: his path to the ACM Turing Award

inferred← citeshttps://doi.org/10.1145/41625.41628openalex-snapshot

Completeness and incompleteness of trace-based network proof systems

inferred← citeshttps://doi.org/10.1145/42192.42195openalex-snapshot

Specification and verification of liveness properties of cyclic, concurrent processes

inferred← citeshttps://doi.org/10.1145/579.583openalex-snapshot

Using message passing for distributed programming: proof rules and disciplines

inferred← citeshttps://doi.org/10.1145/579.584openalex-snapshot

Modeling the distributed termination convention of CSP

inferred← citeshttps://doi.org/10.1145/63264.63402openalex-snapshot

ECCS and LIPS: two languages for OSI systems specification and verification

inferred← citeshttps://doi.org/10.1145/69575.2083openalex-snapshot

Correctness Proofs of Communicating Processes: Three Illustrative Examples From the Literature

inferred← citeshttps://doi.org/10.1145/69575.69577openalex-snapshot

Tentative steps toward a development method for interfering programs

inferred← citeshttps://doi.org/10.1145/69624.357208openalex-snapshot

An Effective Implementation for the Generalized Input-Output Construct of CSP

inferred← citeshttps://doi.org/10.1145/800220.806691openalex-snapshot

Understanding and using asynchronous message passing (Preliminary Version)

inferred← citeshttps://doi.org/10.15479/at:ista:8332openalex-snapshot

Verifying concurrent programs: Refinement, synchronization, sequentialization

inferred← citeshttps://doi.org/10.21220/s2-fcrz-jw60openalex-snapshot

Causal Distributed Assert Statements

inferred← citeshttps://doi.org/10.21236/ada208996openalex-snapshot

Chapter on Distributed Computing

inferred← citeshttps://doi.org/10.21236/ada256234openalex-snapshot

An Axiomatic Treatment of Partial Correctness and Deadlock in a Shared Variable Parallel Language

inferred← citeshttps://doi.org/10.3233/fi-1994-201238openalex-snapshot

COMPOSITIONAL PROOFS FOR NETWORKS OF PROCESSES

inferred← citeshttps://doi.org/10.3233/fi-2021-2026openalex-snapshot

Using Hoare Logic in a Process Algebra Setting

inferred← citeshttps://doi.org/10.5555/1366982.1366987openalex-snapshot

A Deductive Proof System for Multithreaded Java with Exceptions

inferred← citeshttps://doi.org/10.5555/1898699.1898853openalex-snapshot

Cost evaluation from specifications for BSP programs

inferred← citeshttps://doi.org/10.5555/41765.41779openalex-snapshot

Specifying software/hardware interactions in distributed systems

inferred← citeshttps://doi.org/10.5555/800054.801950openalex-snapshot

Multifaceted distributed systems specification using processes and event synchronization

inferred← citeshttps://doi.org/10.82444/warw.33803119openalex-snapshot

A temporal logic for the specification and verification of 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.