The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
LLVM: a compilation framework for lifelong program analysis & transformation
Abstract
We describe LLVM (low level virtual machine), a compiler framework designed to support transparent, lifelong program analysis and transformation for arbitrary programs, by providing high-level information to compiler transformations at compile-time, link-time, run-time, and in idle time between runs. 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; an instruction for typed address arithmetic; and a simple mechanism that can be used to implement the exception handling features of high-level languages (and setjmp/longjmp in C) uniformly and efficiently. The LLVM compiler framework and code representation together provide a combination of key capabilities that are important for practical, lifelong analysis and transformation of programs. To our knowledge, no existing compilation approach provides all these capabilities. We describe the design of the LLVM representation and compiler framework, and evaluate the design in three ways: (a) the size and effectiveness of the representation, including the type information it provides; (b) compiler performance for several interprocedural problems; and (c) illustrative examples of the benefits LLVM provides for several challenging compiler problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Efficiently computing static single assignment form and the control dependence graph
Cytron, R., Ferrante, J., Rosen, B. K., Wegman, M. N., & Zadeck, F. K. (1991) · ACM Transactions on Programming Languages and Systems · doi:10.1145/115372.115320 · Cited by 2,267
Java Virtual Machine Specification
Lindholm, T., & Yellin, F. (1996) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,155
Ungar, D., & Smith, R. B. (1987) · Conference on Object-Oriented Programming Systems, Languages, and Applications · doi:10.1145/38765.38828 · Cited by 897
From system F to typed assembly language
Morrisett, G., Walker, D., Crary, K., & Glew, N. (1999) · ACM Transactions on Programming Languages and Systems · doi:10.1145/319301.319345 · Cited by 584
Region-based memory management in cyclone
Grossman, D., Morrisett, G., Jim, T., Hicks, M., Wang, Y., & Cheney, J. (2002) · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/512529.512563 · Cited by 403
The Jalapeño dynamic optimizing compiler for Java
Burke, M., Choi, J.-D., Fink, S. J., Grove, D., Hind, M., Sarkar, V., Serrano, M. J., Sreedhar, V. C., Srinivasan, H., & Whaley, J. (1999) · doi:10.1145/304065.304113 · Cited by 271
Vlahakos, D., Foster, M. H., Ucci, A. A., Barrett, K. J., Datta, S. K., & Madaio, M. P. (1992) · Journal of the American Society of Nephrology · doi:10.1681/asn.v281345 · Cited by 241
A practical flow-sensitive and context-sensitive C and C++ memory leak detector
Heine, D. L., & Lam, M. S. (2003) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/781131.781150 · Cited by 143
Implementing typed intermediate languages
Shao, Z., League, C., & Monnier, S. (1998) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/289423.289460 · Cited by 80
Amme, W., Dalton, N., von Ronne, J., & Franz, M. (2001) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/378795.378825 · Cited by 73
Memory safety without runtime checks or garbage collection
Dhurjati, D., Kowshik, S., Adve, V., & Lattner, C. (2003) · ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES) · doi:10.1145/780732.780743 · Cited by 61
Self-citationEnsuring code safety without runtime checks for real-time control systems
Kowshik, S., Dhurjati, D., & Adve, V. (2002) · International Conference on Compilers, Architecture, and Synthesis for Embedded Systems (CASES) · doi:10.1145/581630.581678 · Cited by 54
Self-citation
Research works printed but not linked: 33
- 10.1145/378795.378811 · doi:10.1145/378795.378811
- 10.1145/800017.800542 · doi:10.1145/800017.800542
- muth, 1999, Alto A platform for object code modification
- meijer, 2002, A Technical Overview of the Commmon Language Infrastructure
- dehnert, 2003, The transmeta code morphing software: Using speculation, recovery and adaptive retranslation to address real-life challenges, 2nd IEEE/ACM Symp Code Generation and Optimization
- 0, Managed extensions for c++ specification, NET Framework Compiler and Language Reference
- shukla, 2003, Lightweight Cross-procedure Tracing for Runtime Optimization
- 2001, C++ ABI for Itanium
- cohn, 1997, Optimizing Alpha executables on Windows NT with Spike, Digital Technical Journal, 9
- romer, 1997, Instrumentation and optimization of Win32/Intel executables using Etch, Proc USENIX Windows NT Workshop
- 10.1109/40.671403 · doi:10.1109/40.671403
- 10.1145/301618.301635 · doi:10.1145/301618.301635
- 10.1145/223428.207121 · doi:10.1145/223428.207121
- 10.1109/ISCA.1997.604517 · doi:10.1109/isca.1997.604517
- 10.1016/S0066-4138(61)80014-1 · doi:10.1016/s0066-4138(61)80014-1
- srivastava, 1992, A practical system for intermodule code optimization at link-time, Journal of Programming Languages, 1, 1
- 10.1109/IWIA.1998.779076 · doi:10.1109/iwia.1998.779076
- 10.1145/12276.13338 · doi:10.1145/12276.13338
- 10.1145/265563.265576 · doi:10.1145/265563.265576
- 10.1145/347324.348916 · doi:10.1145/347324.348916
- 2000, XL FORTRAN: Eight ways to boost performance, White Paper
- 10.1145/778559.778562 · doi:10.1145/778559.778562
- lattner, 0, LLVM Language Reference Manual
- 10.1109/MICRO.2003.1253196 · doi:10.1109/micro.2003.1253196
- 10.1145/231379.231402 · doi:10.1145/231379.231402
- 10.1145/781131.781155 · DOI
- lattner, 2002, Automatic pool allocation for disjoint data structures, Proc ACM SIGPLAN Workshop on Memory System Performance, 10.1145/773146.773041 · doi:10.1145/773146.773041
- 10.1145/169683.169678 · doi:10.1145/169683.169678
- 10.1145/349299.349303 · doi:10.1145/349299.349303
- 10.1145/277652.277745 · doi:10.1145/277652.277745
- lattner, 2003, Data structure analysis: A fast and scalable context-sensitive heap analysis, Tech Report
- 0, The Architectural Neutral Distribution Format
- chase, 1994, Implementation of exception handling, J C Language Transl, 5, 229
Cited by
High-Level Synthesis for FPGAs: From Prototyping to Deployment
Cong, J., Liu, B., Neuendorffer, S., Noguera, J., Vissers, K., & Zhang, Z. (2011) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2011.2110592 · Cited by 846
Angora: Efficient Fuzzing by Principled Search
Chen, P., & Chen, H. (2018) · 2018 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2018.00046 · Cited by 552
MLIR: Scaling Compiler Infrastructure for Domain Specific Computation
Lattner, C., Amini, M., Bondhugula, U., Cohen, A., Davis, A., Pienaar, J., Riddle, R., Shpeisman, T., Vasilache, N., & Zinenko, O. (2021) · 2021 IEEE/ACM International Symposium on Code Generation and Optimization (CGO) · doi:10.1109/cgo51591.2021.9370308 · Cited by 541
Self-citationA Survey and Evaluation of FPGA High-Level Synthesis Tools
Nane, R., Sima, V.-M., Pilato, C., Choi, J., Fort, B., Canis, A., Chen, Y. T., Hsiao, H., Brown, S., Ferrandi, F., et al. (2016) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2015.2513673 · Cited by 532
A practical evaluation of spectrum-based fault localization
Abreu, R., Zoeteweij, P., Golsteijn, R., & van Gemund, A. J. C. (2009) · Journal of Systems and Software · doi:10.1016/j.jss.2009.06.035 · Cited by 495
Metadata
- Authors
- Lattner, C., & Adve, V.
- Venue
- International Symposium on Code Generation and Optimization, 2004. CGO 2004.
- Publisher
- IEEE
- Published
- 2004-01-01
- Pages
- 75-86
- OpenAlex
- W4246166885
- Cited by
- 2,681
- References
- 12
- FWCI
- 6.29
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.