Specification and Proof Techniques for Serializers
| dc.date.accessioned | 2004-10-01T20:34:13Z | |
| dc.date.accessioned | 2018-11-24T10:10:26Z | |
| dc.date.available | 2004-10-01T20:34:13Z | |
| dc.date.available | 2018-11-24T10:10:26Z | |
| dc.date.issued | 1977-08-01 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/5756 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/5756 | |
| dc.description.abstract | This paper presents an implementation mechanism, specification language, and proof techniques for problems involving the arbitration of concurrent requests to shared resources. This mechanism is the serializer which may be described as a kind of protection mechanism, in that it prevents improper orders of access to a protected resource. Serializers are a generalization and improvement of the monitor mechanism of Brinch-Hansen and Hoare. | en_US |
| dc.format.extent | 37 p. | en_US |
| dc.format.extent | 11673723 bytes | |
| dc.format.extent | 8252798 bytes | |
| dc.language.iso | en_US | |
| dc.title | Specification and Proof Techniques for Serializers | en_US |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| AIM-438.pdf | 8.252Mb | application/pdf | View/ |
| AIM-438.ps | 11.67Mb | application/postscript | View/ |