Proving Properties of Parallel Programs: An Axiomatic Approach
dc.contributor.author | Owicki, Susan S. | en_US |
dc.contributor.author | Gries, David | en_US |
dc.date.accessioned | 2007-04-23T17:17:20Z | |
dc.date.available | 2007-04-23T17:17:20Z | |
dc.date.issued | 1975-05 | en_US |
dc.description.abstract | This paper presents an axiomatic technique for proving a number of properties of parallel programs. Hoare has given a set of axioms for partial correctness of parallel programs, but they are not strong enough in most cases. Here we define a deductive system which is in some sense complete for partial correctness. The information in a partial correctness proof is then used to prove such properties as mutual exclusion, blocking and termination. | en_US |
dc.format.extent | 962751 bytes | |
dc.format.extent | 513371 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/TR75-243 | en_US |
dc.identifier.uri | https://hdl.handle.net/1813/6638 | |
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 | Proving Properties of Parallel Programs: An Axiomatic Approach | en_US |
dc.type | technical report | en_US |