Is sometimes ever better than always? | Zendy

David Gries | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Is sometimes ever better than always?

Author(s) -

David Gries

Publication year - 1979

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-09251-X

DOI - 10.1007/bfb0014664

Subject(s) - ackermann function , assertion , computer science , mathematical proof , simple (philosophy) , algorithm , function (biology) , calculus (dental) , theoretical computer science , programming language , mathematics , medicine , inverse , philosophy , geometry , dentistry , epistemology , evolutionary biology , biology

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research