Proving Temporal Properties of Concurrent Programs: A Non-Temporal Approach
| dc.contributor.author | Alpern, Bowen | en_US |
| dc.date.accessioned | 2007-04-23T17:12:57Z | |
| dc.date.available | 2007-04-23T17:12:57Z | |
| dc.date.issued | 1986-02 | en_US |
| dc.description.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) | en_US |
| dc.format.extent | 6772706 bytes | |
| dc.format.extent | 2701003 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/TR86-732 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6572 | |
| 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 Temporal Properties of Concurrent Programs: A Non-Temporal Approach | en_US |
| dc.type | technical report | en_US |