Is Sometimes Ever Better Than Always?
| dc.contributor.author | Gries, David | en_US |
| dc.date.accessioned | 2007-04-23T18:21:40Z | |
| dc.date.available | 2007-04-23T18:21:40Z | |
| dc.date.issued | 1978-06 | en_US |
| dc.description.abstract | The "intermittent assertion" method for proving programs correct is explained and compared to the conventional axiomatic method. Simple axiomatic proofs of iterative algorithms that compute recursively defined functions, including Ackermann's function, are given. A critical examination of the two methods leads to the opinion that the axiomatic method is preferable. | en_US |
| dc.format.extent | 745111 bytes | |
| dc.format.extent | 269386 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/TR78-343 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/7462 | |
| 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 | Is Sometimes Ever Better Than Always? | en_US |
| dc.type | technical report | en_US |