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 52 articles )

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

1 2 3 next

  1. Bezanson, Jeff; Edelman, Alan; Karpinski, Stefan; Shah, Viral B.: Julia: a fresh approach to numerical computing (2017)
  2. Dunning, Iain; Huchette, Joey; Lubin, Miles: JuMP: a modeling language for mathematical optimization (2017)
  3. 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 \ssfAProVE (2017)
  4. Pierre Fernique, Christophe Pradal: AutoWIG: Automatic Generation of Python Bindings for C++ Libraries (2017) arXiv
  5. Sinn, Moritz; Zuleger, Florian; Veith, Helmut: Complexity and resource bound analysis of imperative programs using difference constraints (2017)
  6. Ströder, Thomas; Giesl, Jürgen; Brockschmidt, Marc; Frohn, Florian; Fuhs, Carsten; Hensel, Jera; Schneider-Kamp, Peter; Aschermann, Cornelius: Automatically proving termination and memory safety for programs with pointer arithmetic (2017)
  7. Wood, Tim; Drossopolou, Sophia; Lahiri, Shuvendu K.; Eisenbach, Susan: Modular verification of procedure equivalence in the presence of memory allocation (2017)
  8. Chambers, John M.: Extending R (2016)
  9. Gange, Graeme; Navas, Jorge A.; Schachte, Peter; Søndergaard, Harald; Stuckey, Peter J.: An abstract domain of uninterpreted functions (2016)
  10. Saarikivi, Olli; Heljanko, Keijo: LCTD: test-guided proofs for C programs on LLVM (2016)
  11. Travkin, Oleg; Wehrheim, Heike: Verification of concurrent programs on weak memory models (2016)
  12. Agosta, Giovanni; Barenghi, Alessandro; Pelosi, Gerardo; Scandale, Michele: Trace-based schedulability analysis to enhance passive side-channel attack resilience of embedded software (2015)
  13. Barnat, Jiří: Quo vadis explicit-state model checking (2015)
  14. Berger, Ulrich; Lawrence, Andrew; Forsberg, Fredrik Nordvall; Seisenberger, Monika: Extracting verified decision procedures: DPLL and resolution (2015)
  15. Dragan, Ioan; Kovács, Laura: Lingva: generating and proving program properties using symbol elimination (2015)
  16. Lubin, Miles; Dunning, Iain: Computing in operations research using Julia (2015)
  17. Patney, Anjul; Tzeng, Stanley; Seitz, Kerry A.; Owens, John D.: Piko: a framework for authoring programmable graphics pipelines (2015) ioport
  18. Chen, Peng; Zhang, Lei; Han, Yin-He; Chen, Yun-Ji: A general-purpose many-accelerator architecture based on dataflow graph clustering of applications (2014) ioport
  19. Chen, Xuhao; Shen, Li; Wang, Zhiying; Zheng, Zhong; Chen, Wei: Binary compatibility for embedded systems using greedy subgraph mapping (2014) ioport
  20. Lampka, Kai; Giannopoulou, Georgia; Pellizzoni, Rodolfo; Wu, Zheng; Stoimenov, Nikolay: A formal approach to the WCRT analysis of multicore systems with memory contention under phase-structured task sets (2014)

1 2 3 next


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