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

DOI10.1145/69575.2083zbMath0517.68054OpenAlexW2003164038MaRDI QIDQ3666272

Marty Ossefort

Publication date: 1983

Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/69575.2083

zbMATH Keywords

verificationCSPmessage-passing systemscommunicating sequential processesprogram proofsrebound sorting

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Related Items (3)

Generic systolic arrays: A methodology for systolic design ⋮ Correctness of concurrent processes ⋮ An introduction to compositional methods for concurrency and their application to real-time.

This page was built for publication: Correctness Proofs of Communicating Processes: Three Illustrative Examples From the Literature