Floyd-Hoare Verifiers "Considered Harmful"
| dc.date.accessioned | 2004-10-08T20:37:51Z | |
| dc.date.accessioned | 2018-11-24T10:21:32Z | |
| dc.date.available | 2004-10-08T20:37:51Z | |
| dc.date.available | 2018-11-24T10:21:32Z | |
| dc.date.issued | 1978-01-01 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/6688 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/6688 | |
| dc.description.abstract | The Floyd-Hoare methodology completely dominates the field of program verification and has contributed much to our understanding of how programs might be analyzed. Useful but limited verifiers have been developed using Floyd-Hoare techniques. However, it has long been known that it is difficult to handle side effects on shared data structures within the Floyd-Hoare framework. Most examples of successful Floyd-Hoare axioms for assignment to complex data structures, similar statements have been used by London. This paper demonstrates an error in these formalizations and suggests a different style of verification. | en_US |
| dc.format.extent | 8997805 bytes | |
| dc.format.extent | 6678766 bytes | |
| dc.language.iso | en_US | |
| dc.title | Floyd-Hoare Verifiers "Considered Harmful" | en_US |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| AIM-456.pdf | 6.678Mb | application/pdf | View/ |
| AIM-456.ps | 8.997Mb | application/postscript | View/ |