Type-Theoretic Models of Concurrency
| dc.contributor.author | Cleaveland, Walter Rance II | en_US |
| dc.date.accessioned | 2007-04-23T17:19:59Z | |
| dc.date.available | 2007-04-23T17:19:59Z | |
| dc.date.issued | 1987-05 | en_US |
| dc.description.abstract | Sequential computation has well-understood correctness criteria and proof techniques for verifying programs, but the novelty and complexity of concurrent computation complicates a similar analysis of concurrenct programs. This thesis examines the use of a system for developing formal mathematics, the Nuprl proof development system, as a tool for reasoning about concurrency and ameliorating somewhat the complex chore of analyzing concurrent programs. | en_US |
| dc.format.extent | 16524443 bytes | |
| dc.format.extent | 3090679 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/TR87-837 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6677 | |
| 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 | Type-Theoretic Models of Concurrency | en_US |
| dc.type | technical report | en_US |