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 -

acm transactions on programming languages and systems

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.233

H-Index - 70

eISSN - 1558-4593

pISSN - 0164-0925

DOI - 10.1145/357073.357080

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

The “intermittent assertion” method for proving programs correct is explained and compared with the conventional method. Simple conventional proofs of iterative algorithms that compute recursively defined functions, including Ackermann's function, are given.

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