All Structured Programs Have Small Tree Width and Good Register Allocation¶
Thorup, M. (1998). All Structured Programs Have Small Tree Width and Good Register Allocation. Information and Computation.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Partial k-tree
- Thorup showed that control-flow graphs of structured programs have small treewidth and used the property in register-allocation analysis
This sourceThorup's paper is the named source for both halves, and 'small' is its own word; the underlying result is a fixed constant bound (the follow-up literature reports treewidth at most 6 for goto-free structured programs), not merely an asymptotic smallness.
SupportedVerified against the source
- Thorup showed that control-flow graphs of structured programs have small treewidth and used the property in register-allocation analysis
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 1 of 1 citation: 1 supported. 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:5c10b4dac047 · see in the full table