Cornell eCommons
metadata only
A Proof Technique for Communicating Sequential Processes(With an Example)
We present proof rules for an extension of the Communicating Sequential Processes proposed by Hoare. The send and receive statements are treated symmetrically, simplifying the rules and allowing send to appear in guards. An example is given to explain the use of the technique. This is an outline
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the Notions of Bounded Bypass, and How to Make any Deadlock-Free MUTEX Protocol Satisfy One of Them#287096
- I/O Automaton Models and Proofs for Shared-Key Communication Systems#464648
- Constitutive Rules: Games, Language, and Assertion#84807
- Less Effort, Shorter Proofs: Reinforcement Learning for Security Protocol Analysis in Tamarin#222541
- Internet Protocol Police (IPP) - Schedule of Punishments#131675
Record · ID 1149685
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive