Programming & Compilers

Guides to programming representations, compilers, program analysis, verification and code-generation mechanisms.

Showing 1–4 of 4 guides

Register allocation illustrated through live-range interference, register spilling before reuse, branch-dependent lifetimes, loop-range splitting and target instruction constraints.

How register allocation preserves live values with spills and target constraints

Register allocation fits live values into a limited register set. Trace interference, spill storage, path-dependent reuse and target constraints without losing required operands.

Static single assignment illustrated through unique definitions, edge-selected phi values, loop-carried values, edge copies and a temporary preserving a cyclic parallel copy.

9 min read

How static single assignment joins value versions

Static single assignment gives definitions distinct identities and selects values by incoming control-flow edges. Follow branches, loop-carried values and transfers that preserve them.

Bytecode verification illustrated through abstract interpretation of operand stack types and local states, instruction contracts, branch joins, worklist stabilization and limits of structural checks.

8 min read

How bytecode verification checks execution states

Bytecode verification propagates stack and local-state descriptions through every reachable instruction. Explore compatible joins, loop stabilization and the limits of its guarantee.

Abstract interpretation widening illustrated with expanding intervals, narrowing a bounded loop, lost variable relationships, control-flow joins, assignment names, and proved, counterexample or inconclusive outcomes.

8 min read

How abstract interpretation widening reaches a useful result when program states keep growing

Abstract interpretation widening expands a program-state summary to make analysis converge. Trace interval joins, narrowing and the relationships that a coarse domain loses.