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.

Type

Journal article

Intellectual base

Primary research

Year

1998

DOI

10.1006/inco.1997.2697

Link

https://doi.org/10.1006/inco.1997.2697

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.

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:5c10b4dac047 · see in the full table