|
Search the dblp DataBase
Chris Lattner:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Chris Lattner, Vikram S. Adve
Transparent pointer compression for linked data structures. [Citation Graph (0, 0)][DBLP] Memory System Performance, 2005, pp:24-35 [Conf]
- Chris Lattner, Vikram S. Adve
LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation. [Citation Graph (0, 0)][DBLP] CGO, 2004, pp:75-88 [Conf]
- Chris Lattner, Shashank Shekhar, Anand Shukla, Vikram S. Adve
Addressing Fundamental Bottlenecks in Link-Time and Dynamic Optimization. [Citation Graph (0, 0)][DBLP] IPDPS, 2002, pp:- [Conf]
- Chris Lattner, Vikram S. Adve
Automatic pool allocation for disjoint data structures. [Citation Graph (0, 0)][DBLP] MSP/ISMM, 2002, pp:13-24 [Conf]
- Chris Lattner, Vikram S. Adve
The LLVM Compiler Framework and Infrastructure Tutorial. [Citation Graph (0, 0)][DBLP] LCPC, 2004, pp:15-16 [Conf]
- Dinakar Dhurjati, Sumant Kowshik, Vikram S. Adve, Chris Lattner
Memory safety without runtime checks or garbage collection. [Citation Graph (0, 0)][DBLP] LCTES, 2003, pp:69-80 [Conf]
- Vikram S. Adve, Chris Lattner, Michael Brukman, Anand Shukla, Brian Gaeke
LLVA: A Low-level Virtual Instruction Set Architecture. [Citation Graph (0, 0)][DBLP] MICRO, 2003, pp:205-216 [Conf]
- Chris Lattner, Vikram S. Adve
Automatic pool allocation: improving performance by controlling data structure layout in the heap. [Citation Graph (0, 0)][DBLP] PLDI, 2005, pp:129-142 [Conf]
- Dinakar Dhurjati, Sumant Kowshik, Vikram S. Adve, Chris Lattner
Memory safety without garbage collection for embedded applications. [Citation Graph (0, 0)][DBLP] ACM Trans. Embedded Comput. Syst., 2005, v:4, n:1, pp:73-111 [Journal]
- Chris Lattner, Andrew Lenharth, Vikram S. Adve
Making context-sensitive points-to analysis with heap cloning practical for the real world. [Citation Graph (0, 0)][DBLP] PLDI, 2007, pp:278-289 [Conf]
Search in 0.001secs, Finished in 0.002secs
|