Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6099
Title: Putting Time into Proof Outlines
Authors: Scheider, Fred B.
Bard, Bloom
Marzullo, Keith
Keywords: computer science
technical report
Issue Date: Sep-1991
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR93-1333
Abstract: A logic for reasoning about timing properties of concurrent programs is presented. The logic is based on Hoare-style proof outlines and can handle maximal parallelism as well as certain resource-constrained execution environments. The correctness proof for a mutual exclusion protocol that uses execution timings in a subtle way illustrates the logic in action. A soundness proof using structual operational semantics is outlines in the appendix.
URI: http://hdl.handle.net/1813/6099
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
93-1333.pdf2.93 MBAdobe PDFView/Open
93-1333.ps643.34 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us