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/6572
Title: Proving Temporal Properties of Concurrent Programs: A Non-Temporal Approach
Authors: Alpern, Bowen
Keywords: computer science
technical report
Issue Date: Feb-1986
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR86-732
Abstract: This thesis develops a new method for proving properties of concurrent programs and gives formal definitions for safety and liveness. A property is specified by a property recognizer - a finite-state machine that accepts the sequences of program states in the property it specifies. A property recognizer can be constructed for any temporal logic formula. (ABRIDGED ABSTRACT)
URI: http://hdl.handle.net/1813/6572
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
86-732.pdf6.61 MBAdobe PDFView/Open
86-732.ps2.64 MBPostscriptView/Open

Refworks Export

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

 

© 2014 Cornell University Library Contact Us