Notes on Structured Programming¶
Dijkstra, E. W. (1970). Notes on Structured Programming.
Cited by¶
3 citations across 3 artifacts.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Adverse Adaptation Red Team
- A passed red team shows only that the tested moves failed — it is an existence proof of a weakness, never an absence proof of safety — so "we passed the red team" hardening into a blanket security claim is the classic misuse.
This sourceT.H. Report 70-WSK-03, EWD249, 2nd ed., Technological University Eindhoven (1970). States that testing can reveal the presence of bugs but never prove their absence.
- A passed red team shows only that the tested moves failed — it is an existence proof of a weakness, never an absence proof of safety — so "we passed the red team" hardening into a blanket security claim is the classic misuse.
- Injection Payload Regression Tests
- Its fundamental limit is the one every test suite shares — it can demonstrate that known payloads are handled, never that unknown ones are: testing shows the presence of holes, not their absence.
This sourceReport 70-WSK-03, 2nd ed. (1970). States that program testing can demonstrate the presence of bugs but cannot establish their absence across untested cases.
- Its fundamental limit is the one every test suite shares — it can demonstrate that known payloads are handled, never that unknown ones are: testing shows the presence of holes, not their absence.
- Property-Based Equivalence Test
- A green run is evidence, not proof — testing shows the presence of differences, not their absence,
This sourceExplains that testing can reveal bugs but cannot prove their absence because sampling cannot exhaust the enormous input space.
- A green run is evidence, not proof — testing shows the presence of differences, not their absence,
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. Neither this nor any other of the 3 citations of this work carries a recorded support check.
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.
Links previously used in the corpus¶
Before the registry existed this work was also linked 1 other way.
Registry ID ref:ba2a7a2fdf67 · see in the full table