A Proof Technique for Communicating Sequential Processes(With an Example)
| dc.contributor.author | Levin, Gary Marc | en_US |
| dc.date.accessioned | 2007-04-23T18:25:10Z | |
| dc.date.available | 2007-04-23T18:25:10Z | |
| dc.date.issued | 1979-11 | en_US |
| dc.description.abstract | 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 of a substantial part of a PhD thesis that is expected to be completed in June 1980. | en_US |
| dc.format.extent | 1322530 bytes | |
| dc.format.extent | 411902 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR79-401 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/7514 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | A Proof Technique for Communicating Sequential Processes(With an Example) | en_US |
| dc.type | technical report | en_US |