Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Chris Lattner
2000 – 2009
- 2007
[c9]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
- [j1]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)
- [c8]Chris Lattner, Vikram S. Adve: Transparent pointer compression for linked data structures. Memory System Performance 2005: 24-35
- [c7]Chris Lattner, Vikram S. Adve: Automatic pool allocation: improving performance by controlling data structure layout in the heap. PLDI 2005: 129-142
- 2004
- [c6]Chris Lattner, Vikram S. Adve: LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation. CGO 2004: 75-88
- [c5]Chris Lattner, Vikram S. Adve: The LLVM Compiler Framework and Infrastructure Tutorial. LCPC 2004: 15-16
- 2003
- [c4]Dinakar Dhurjati, Sumant Kowshik, Vikram S. Adve, Chris Lattner: Memory safety without runtime checks or garbage collection. LCTES 2003: 69-80
- [c3]Vikram S. Adve, Chris Lattner, Michael Brukman, Anand Shukla, Brian Gaeke: LLVA: A Low-level Virtual Instruction Set Architecture. MICRO 2003: 205-216
- 2002
- [c2]Chris Lattner, Shashank Shekhar, Anand Shukla, Vikram S. Adve: Addressing Fundamental Bottlenecks in Link-Time and Dynamic Optimization. IPDPS 2002
- [c1]Chris Lattner, Vikram S. Adve: Automatic pool allocation for disjoint data structures. MSP/ISMM 2002: 13-24
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:29 CET by the dblp team