| 2007 |
|---|
| 10 | EE | Chris Lattner,
Andrew Lenharth,
Vikram S. Adve:
Making context-sensitive points-to analysis with heap cloning practical for the real world.
PLDI 2007: 278-289 |
| 2005 |
|---|
| 9 | EE | Chris Lattner,
Vikram S. Adve:
Transparent pointer compression for linked data structures.
Memory System Performance 2005: 24-35 |
| 8 | EE | Chris Lattner,
Vikram S. Adve:
Automatic pool allocation: improving performance by controlling data structure layout in the heap.
PLDI 2005: 129-142 |
| 7 | EE | Dinakar Dhurjati,
Sumant Kowshik,
Vikram S. Adve,
Chris Lattner:
Memory safety without garbage collection for embedded applications.
ACM Trans. Embedded Comput. Syst. 4(1): 73-111 (2005) |
| 2004 |
|---|
| 6 | EE | Chris Lattner,
Vikram S. Adve:
LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation.
CGO 2004: 75-88 |
| 5 | EE | Chris Lattner,
Vikram S. Adve:
The LLVM Compiler Framework and Infrastructure Tutorial.
LCPC 2004: 15-16 |
| 2003 |
|---|
| 4 | EE | Dinakar Dhurjati,
Sumant Kowshik,
Vikram S. Adve,
Chris Lattner:
Memory safety without runtime checks or garbage collection.
LCTES 2003: 69-80 |
| 3 | EE | Vikram S. Adve,
Chris Lattner,
Michael Brukman,
Anand Shukla,
Brian Gaeke:
LLVA: A Low-level Virtual Instruction Set Architecture.
MICRO 2003: 205-216 |
| 2002 |
|---|
| 2 | EE | Chris Lattner,
Shashank Shekhar,
Anand Shukla,
Vikram S. Adve:
Addressing Fundamental Bottlenecks in Link-Time and Dynamic Optimization.
IPDPS 2002 |
| 1 | EE | Chris Lattner,
Vikram S. Adve:
Automatic pool allocation for disjoint data structures.
MSP/ISMM 2002: 13-24 |
