A proof technique for communicating sequential processes
type: Item
instance of: scholarly article
title: A proof technique for communicating sequential processes
zbMATH Open document ID: 0463.68034
DOI: 10.1007/BF00289266
author: Gary Levin
author: David Gries
published in: Acta Informatica
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68N25
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 3725689
zbMATH Keywords: communicating sequential processes
zbMATH Keywords: proof rules
zbMATH Keywords: total correctness
zbMATH Keywords: deadlock
MaRDI profile type: Publication
cites work: A Proof System for Communicating Sequential Processes
cites work: Deadlock absence proofs for networks of communicating processes
cites work: Proofs of Networks of Processes
cites work: Q3871899
cites work: Q4144755
cites work: Distributed Termination
cites work: Assignment and Procedure Call Proof Rules
cites work: An axiomatic basis for computer programming
cites work: Communicating sequential processes
description: scientific article; zbMATH DE number 3725689