Pretending Atomicity

dc.contributor.authorLamport, Leslieen_US
dc.contributor.authorSchneider, Fred B.en_US
dc.date.accessioned2007-04-23T17:36:21Z
dc.date.available2007-04-23T17:36:21Z
dc.date.issued1989-05en_US
dc.description.abstractWe present a theorem for deriving properties of a concurrent program by reasoning about a simpler, coarser-grained version. The theorem generalizes a result that Lipton proved for partial correctness and deadlock-freedom. Our theorem applies to all safety properties.en_US
dc.format.extent2032788 bytes
dc.format.extent446809 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1005en_US
dc.identifier.urihttps://hdl.handle.net/1813/6805
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titlePretending Atomicityen_US
dc.typetechnical reporten_US
Files
Original bundle
Now showing 1 - 2 of 2
Loading...
Thumbnail Image
Name:
89-1005.pdf
Size:
1.94 MB
Format:
Adobe Portable Document Format
No Thumbnail Available
Name:
89-1005.ps
Size:
436.34 KB
Format:
Postscript Files