eCommons

 

Proving Properties of Parallel Programs: An Axiomatic Approach

dc.contributor.authorOwicki, Susan S.en_US
dc.contributor.authorGries, Daviden_US
dc.date.accessioned2007-04-23T17:17:20Z
dc.date.available2007-04-23T17:17:20Z
dc.date.issued1975-05en_US
dc.description.abstractThis 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.extent962751 bytes
dc.format.extent513371 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR75-243en_US
dc.identifier.urihttps://hdl.handle.net/1813/6638
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleProving Properties of Parallel Programs: An Axiomatic Approachen_US
dc.typetechnical reporten_US

Files

Original bundle
Now showing 1 - 2 of 2
Loading...
Thumbnail Image
Name:
75-243.pdf
Size:
940.19 KB
Format:
Adobe Portable Document Format
No Thumbnail Available
Name:
75-243.ps
Size:
501.34 KB
Format:
Postscript Files