LLVM

The LLVM Project is a collection of modular and reusable compiler and toolchain technologies. Despite its name, LLVM has little to do with traditional virtual machines, though it does provide helpful libraries that can be used to build them.LLVM began as a research project at the University of Illinois, with the goal of providing a modern, SSA-based compilation strategy capable of supporting both static and dynamic compilation of arbitrary programming languages. Since then, LLVM has grown to be an umbrella project consisting of a number of different subprojects, many of which are being used in production by a wide variety of commercial and open source projects as well as being widely used in academic research.


References in zbMATH (referenced in 75 articles )

Showing results 1 to 20 of 75.
Sorted by year (citations)

1 2 3 4 next

  1. Chris Cummins, Zacharias V. Fisches, Tal Ben-Nun, Torsten Hoefler, Hugh Leather: ProGraML: Graph-based Deep Learning for Program Optimization and Analysis (2020) arXiv
  2. Garzella, Jack J.; Baranowski, Marek; He, Shaobo; Rakamarić, Zvonimir: Leveraging compiler intermediate representation for multi- and cross-language verification (2020)
  3. Ish-Shalom, Oren; Itzhaky, Shachar; Manevich, Roman; Rinetzky, Noam: Harnessing static analysis to help learn pseudo-inverses of string manipulating procedures for automatic test generation (2020)
  4. Andersson, Joel A. E.; Gillis, Joris; Horn, Greg; Rawlings, James B.; Diehl, Moritz: CasADi: a software framework for nonlinear optimization and optimal control (2019)
  5. Niemetz, Aina; Preiner, Mathias; Reynolds, Andrew; Zohar, Yoni; Barrett, Clark; Tinelli, Cesare: Towards bit-width-independent proofs in SMT solvers (2019)
  6. Ricardo Nobre, João Bispo, Tiago Carvalho, João M.P. Cardoso: Nonio - modular automatic compiler phase selection and ordering specialization framework for modern compilers (2019) not zbMATH
  7. Sharma, Tushar; Reps, Thomas: A new abstraction framework for affine transformers (2019)
  8. Boutonnet, Rémy; Halbwachs, Nicolas: Improving the results of program analysis by abstract interpretation beyond the decreasing sequence (2018)
  9. Hensel, Jera; Giesl, Jürgen; Frohn, Florian; Ströder, Thomas: Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution (2018)
  10. Kiefer, Moritz; Klebanov, Vladimir; Ulbrich, Mattias: Relational program reasoning using compiler IR (2018)
  11. Lauko, Henrich; Ročkai, Petr; Barnat, Jiří: Symbolic computation via program transformation (2018)
  12. Lopez-Garcia, P.; Darmawan, L.; Klemen, M.; Liqat, U.; Bueno, F.; Hermenegildo, M. V.: Interval-based resource usage verification by translation into Horn clauses and an application to energy consumption (2018)
  13. Popuri, Sai K.; Raim, Andrew M.; Neerchal, Nagaraj K.; Gobbert, Matthias K.: Parallelizing computation of expected values in recombinant binomial trees (2018)
  14. Yang, Kai; Duan, Zhenhua; Tian, Cong; Zhang, Nan: A compiler for MSVL and its applications (2018)
  15. Bezanson, Jeff; Edelman, Alan; Karpinski, Stefan; Shah, Viral B.: Julia: a fresh approach to numerical computing (2017)
  16. Dunning, Iain; Huchette, Joey; Lubin, Miles: JuMP: a modeling language for mathematical optimization (2017)
  17. Giesl, Jürgen; Aschermann, Cornelius; Brockschmidt, Marc; Emmes, Fabian; Frohn, Florian; Fuhs, Carsten; Hensel, Jera; Otto, Carsten; Plücker, Martin; Schneider-Kamp, Peter; Ströder, Thomas; Swiderski, Stephanie; Thiemann, René: Analyzing program termination and complexity automatically with \textsfAProVE (2017)
  18. Harris, William R.; Jha, Somesh; Reps, Thomas W.; Seshia, Sanjit A.: Program synthesis for interactive-security systems (2017)
  19. Knoop, Jens; Kovács, Laura; Zwirchmayr, Jakob: Replacing conjectures by positive knowledge: inferring proven precise worst-case execution time bounds using symbolic execution (2017)
  20. Pierre Fernique, Christophe Pradal: AutoWIG: Automatic Generation of Python Bindings for C++ Libraries (2017) arXiv

1 2 3 4 next


Further publications can be found at: http://llvm.org/pubs/