Program development by stepwise refinement.¶
Wirth, N. (1971). Program development by stepwise refinement. Communications of the ACM, 14(4), 221-227.
Cited by¶
3 citations across 3 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Decomposition
- It separates a system along chosen dimensions (functional, structural, temporal, causal) and creates a divide-and-conquer logic: understand each part independently, then reconstruct understanding of the whole from part-level insights, a logic Wirth (1971) crystallized in his stepwise-refinement methodology.
This sourceCharacterizes programming as successive decomposition of tasks into subtasks and data into data structures.
Supported in partVerified against the work's full text
Wirth's paper presents programming as successive decomposition of tasks into subtasks, which supports the Wirth stepwise-refinement attribution.
“It is here considered as a decomposition of tasks into subtasks and of data into data structures.”
- It separates a system along chosen dimensions (functional, structural, temporal, causal) and creates a divide-and-conquer logic: understand each part independently, then reconstruct understanding of the whole from part-level insights, a logic Wirth (1971) crystallized in his stepwise-refinement methodology.
- Progressive Refinement from Core Model
- Perturbation Theory (physics), comparative statics (economics), local-expansion methods (engineering), fine-tuning of pre-trained models (machine learning), and the linearize-around-equilibrium practice across applied mathematics.
This sourceFoundational software-methodology paper: characterizes program development as successive decomposition of tasks into subtasks and data into data structures, distinguishing the process of decomposition from any particular structural outcome.
- Perturbation Theory (physics), comparative statics (economics), local-expansion methods (engineering), fine-tuning of pre-trained models (machine learning), and the linearize-around-equilibrium practice across applied mathematics.
- Refinement
- Refinement is the iterative process of progressively improving the precision, quality, or fitness of a candidate solution, model, artifact, or design by repeated cycles of evaluation and adjustment, as Wirth (1971) formalized in his foundational treatment of stepwise refinement.
This sourceFoundational software-methodology paper: characterizes program development as successive decomposition of tasks into subtasks and data into data structures, distinguishing the process of decomposition from any particular structural outcome.
Supported in partVerified against the work's full text
Wirth treats refinement as successive decomposition of tasks and data, not as iterative cycles of evaluation and adjustment to improve quality, so only the stepwise-refinement frame is supported.
“This successive decomposition or refinement of specifications terminates when all instructions are ex- pressed in terms of an underlying computer or program- ming language”
- Refinement is the iterative process of progressively improving the precision, quality, or fitness of a candidate solution, model, artifact, or design by repeated cycles of evaluation and adjustment, as Wirth (1971) formalized in his foundational treatment of stepwise refinement.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 2 of 3 citations: 2 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:3ef4ad21f690 · see in the full table