V
Vikram Adve
Researcher at University of Illinois at Urbana–Champaign
Publications - 120
Citations - 10907
Vikram Adve is an academic researcher from University of Illinois at Urbana–Champaign. The author has contributed to research in topics: Compiler & Code generation. The author has an hindex of 43, co-authored 114 publications receiving 10044 citations. Previous affiliations of Vikram Adve include National Center for Supercomputing Applications & University of Wisconsin-Madison.
Papers
More filters
Proceedings ArticleDOI
LLVM: a compilation framework for lifelong program analysis & transformation
Chris Lattner,Vikram Adve +1 more
TL;DR: The design of the LLVM representation and compiler framework is evaluated in three ways: the size and effectiveness of the representation, including the type information it provides; compiler performance for several interprocedural problems; and illustrative examples of the benefits LLVM provides for several challenging compiler problems.
Journal ArticleDOI
A type and effect system for deterministic parallel Java
Robert L. Bocchino,Vikram Adve,Danny Dig,Sarita V. Adve,Stephen T. Heumann,Rakesh Komuravelli,Jeffrey Overbey,Patrick Simmons,Hyojin Sung,Mohsen Vakilian +9 more
TL;DR: It is demonstrated that a practical type and effect system can simplify parallel programming by guaranteeing deterministic semantics with modular, compile-time type checking even in a rich, concurrent object-oriented language such as Java.
Proceedings ArticleDOI
Understanding the propagation of hard errors to software and implications for resilient system design
TL;DR: This paper explores a cooperative hardware-software solution that watches for anomalous software behavior to indicate the presence of hardware faults, resulting in identifying low-cost detection methods and providing guidelines for implementation of the recovery and diagnosis components of such a reliability solution.
Proceedings ArticleDOI
Making context-sensitive points-to analysis with heap cloning practical for the real world
TL;DR: This paper shows, for the first time, that a context-sensitive, field-sensitive algorithm with fullheap cloning (by acyclic call paths) can indeed be both scalable and extremely fast in practice.
Proceedings ArticleDOI
Backwards-compatible array bounds checking for C with very low overhead
Dinakar Dhurjati,Vikram Adve +1 more
TL;DR: A collection of techniques are described that dramatically reduce the overhead of this approach, by exploiting a fine-grain partitioning of memory called Automatic Pool Allocation, and shows that the memory partitioning is key to bringing down this overhead.