 | Job Zwiers - 1989 - 284 lapas
...Alan Turing in 1949. His paper "Checking a large routine" [Turing] opens with the following sentences: "How can one check a routine in the sense of making...correctness of the whole programme easily follows." Turing's idea is to reduce a global statement, about the whole program, in one step to a number of... | |
 | Wolfgang Reisig, Grzegorz Rozenberg - 1998 - 942 lapas
...check a routine in the sense of making sure that it is right ?“ and went on to answer that “... the programmer should make a number of definite assertions...correctness of the whole programme easily follows.” In modern terminology, Turing proposes the “inductive assertion method” to prove program correctness,... | |
 | Harry D. Foster, Adam C. Krolnik, David J. Lacey - 2004 - 422 lapas
...problem into set of assertions: How can one check a large routine in the sense of making sure that it's right? In order that the man who checks may not have...individually, and from which the correctness of the whole program easily flows. Over 30 years ago, Floyd [1967] and Hoare [1969] proposed the concept of using... | |
 | Ben Cohen, Srinivasan Venkataramanan, Ajeetha Kumari - 2004 - 436 lapas
...following in June 24, 1949: How can one check a large routine in the sense of making sure that it's right? In order that the man who checks may not have...individually, and from which the correctness of the whole program easily flows. This statement is what is thought to be the first application of AssertionBased... | |
| |
How can one check a large routine in the sense of making sure that it's right? In order that the man who checks may not have too difficult a task, the programmer should make a number of definite assertions which can be checked individually, and from which... 