Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/7462
Title: Is Sometimes Ever Better Than Always?
Authors: Gries, David
Keywords: computer science
technical report
Issue Date: Jun-1978
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR78-343
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.
URI: http://hdl.handle.net/1813/7462
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
78-343.pdf727.65 kBAdobe PDFView/Open
78-343.ps263.07 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us