LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation

Lattner, C., & Adve, V. (2004). LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation. Proceedings of the International Symposium on Code Generation and Optimization (CGO), 75-86.

Type

Conference paper

Intellectual base

Primary research

Year

2004

Pages

75-86

DOI

10.1109/cgo.2004.1281665

DOI registrant

Institute of Electrical and Electronics Engineers

Link

https://dl.acm.org/doi/10.5555/977395.977673

Cited from

computer_science, systems_cybernetics

Cited by

3 citations across 3 artifacts.

Each citation links to the sentence it supports in the citing article.

Primes

• Dependency
  • Software build systems (Aho, Lam, Sethi, and Ullman 2006; Lattner and Adve 2004). A modern build system like Bazel, Make, or Ninja represents a project as a directed acyclic graph of build targets, where each target depends on input files and other targets.

    This sourceDevelops dependency-graph data structures (SSA-based use-def chains) reused across compilation stages — cited inline in the software-build-systems example.

• Multi Path Convergence
  • In computer science, many source languages compile to the same intermediate representation, and canonical forms in computer algebra reduce every equivalent expression to one representative.

    This sourceMultiple source languages are lowered to a single canonical intermediate representation, decoupling the shared optimization/code-generation back-end from input language diversity.

    Supported in partVerified against the publisher's abstract

    The LLVM abstract establishes a common, language-independent low-level code representation for arbitrary programs, which speaks only to the compiler-IR clause of this compound claim, and only as a frame.

    “LLVM defines a common, low-level code representation in static single assignment (SSA) form, with several novel features: a simple, language-independent type-system that exposes the primitives commonly used to implement high-level language features”

    Read by an automated reader; not a human review. How support was checked

Domain-specific

• Intermediate representation
  • … identity and a convenient observable transfers from Static single-assignment IR gives each value one definition and represents merges with phi-like operations, simplifying data-flow analysis. to A virtual machine distributes typed bytecode that is interpreted or just-in-time compiled on several architectures..

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 3 citations: 1 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.

Links previously used in the corpus

Before the registry existed this work was also linked 1 other way.

• https://doi.org/10.1109/CGO.2004.1281665 ×1

Registry ID ref:6b57b0caf5be · see in the full table