Checking a large routine.¶
Turing, A. M. (1949). Checking a large routine. Report of a Conference on High Speed Automatic Calculating Machines, 67-69.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Well-Foundedness (Well-Ordering)
- Loops, recursions, proof-search procedures, rewrite systems, constraint-solving algorithms, and dataflow-analysis fixpoint computations all prove termination by exhibiting a well-founded "variant" or "measure" that the process strictly decreases at every step.
This sourceEarliest argument for program termination by exhibiting a strictly-decreasing measure.
- Loops, recursions, proof-search procedures, rewrite systems, constraint-solving algorithms, and dataflow-analysis fixpoint computations all prove termination by exhibiting a well-founded "variant" or "measure" that the process strictly decreases at every step.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:b8de4aa0820a · see in the full table