The "Hoare Logic" of CSP, and All That
| dc.contributor.author | Lamport, Leslie | en_US |
| dc.contributor.author | Schneider, Fred B. | en_US |
| dc.date.accessioned | 2007-04-23T16:43:45Z | |
| dc.date.available | 2007-04-23T16:43:45Z | |
| dc.date.issued | 1982-05 | en_US |
| dc.description.abstract | Generalized Hoare Logic is a formal logical system for deriving invariance properties of programs. It provides a uniform way to describe a variety of methods for reasoning about concurrent programs, including noninterference, satisfaction, and cooperation proofs. We describe a simple meta-rule of the Generalized Hoare-Logic - the Decomposition Principle - and show how all these methods can be derived using it. | en_US |
| dc.format.extent | 1876426 bytes | |
| dc.format.extent | 569278 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/TR82-490 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6330 | |
| 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 | The "Hoare Logic" of CSP, and All That | en_US |
| dc.type | technical report | en_US |