2009 |
22 | EE | Sumit Gulwani,
Krishna K. Mehra,
Trishul M. Chilimbi:
SPEED: precise and efficient static estimation of program computational complexity.
POPL 2009: 127-139 |
2008 |
21 | EE | Sigmund Cherem,
Trishul M. Chilimbi,
Sumit Gulwani:
Inferring locks for atomic sections.
PLDI 2008: 304-315 |
20 | EE | Chen Ding,
Trishul M. Chilimbi:
All-window profiling of concurrent executions.
PPOPP 2008: 265-266 |
2007 |
19 | EE | Trishul M. Chilimbi,
Aditya V. Nori,
Kapil Vaswani:
Quantifying the effectiveness of testing via efficient residual path profiling.
ESEC/SIGSOFT FSE 2007: 545-548 |
18 | EE | Trishul M. Chilimbi,
Aditya V. Nori,
Kapil Vaswani:
Quantifying the effectiveness of testing via efficient residual path profiling.
ESEC/SIGSOFT FSE (Companion) 2007: 545-548 |
17 | EE | Kapil Vaswani,
Aditya V. Nori,
Trishul M. Chilimbi:
Preferential path profiling: compactly numbering interesting paths.
POPL 2007: 351-362 |
2006 |
16 | EE | Trishul M. Chilimbi,
Vinod Ganapathy:
HeapMD: identifying heap-based bugs using anomaly detection.
ASPLOS 2006: 219-228 |
15 | EE | Trishul M. Chilimbi,
Ran Shaham:
Cache-conscious coallocation of hot data streams.
PLDI 2006: 252-262 |
14 | EE | Wen-ke Chen,
Sanjay Bhansali,
Trishul M. Chilimbi,
Xiaofeng Gao,
Weihaw Chuang:
Profile-guided proactive garbage collection for locality optimization.
PLDI 2006: 332-340 |
2005 |
13 | EE | Erez Perelman,
Trishul M. Chilimbi,
Brad Calder:
Variational Path Profiling.
IEEE PACT 2005: 7-16 |
2004 |
12 | EE | Matthias Hauswirth,
Trishul M. Chilimbi:
Low-overhead memory leak detection using adaptive statistical profiling.
ASPLOS 2004: 156-164 |
2002 |
11 | EE | Trishul M. Chilimbi,
Martin Hirzel:
Dynamic Hot Data Stream Prefetching for General-Purpose Programs.
PLDI 2002: 199-209 |
10 | EE | Shai Rubin,
Rastislav Bodík,
Trishul M. Chilimbi:
An efficient profile-analysis framework for data-layout optimizations.
POPL 2002: 140-153 |
2001 |
9 | EE | Trishul M. Chilimbi:
On the Stability of Temporal Data Reference Profiles.
IEEE PACT 2001: 151- |
8 | | Trishul M. Chilimbi:
Efficient Representations and Abstractions for Quantifying and Exploiting Data Reference Locality.
PLDI 2001: 191-202 |
2000 |
7 | | Trishul M. Chilimbi,
Richard E. Jones,
Benjamin G. Zorn:
Designing a Trace Format for Heap Allocation Events.
ISMM 2000: 35-49 |
6 | EE | Trishul M. Chilimbi,
Mark D. Hill,
James R. Larus:
Making Pointer-Based Data Structures Cache Conscious.
IEEE Computer 33(12): 67-74 (2000) |
1999 |
5 | EE | Trishul M. Chilimbi,
Mark D. Hill,
James R. Larus:
Cache-Conscious Structure Layout.
PLDI 1999: 1-12 |
4 | EE | Trishul M. Chilimbi,
Bob Davidson,
James R. Larus:
Cache-Conscious Structure Definition.
PLDI 1999: 13-24 |
1998 |
3 | EE | Trishul M. Chilimbi,
James R. Larus:
Using Generational Garbage Collection To Implement Cache-Conscious Data Placement.
ISMM 1998: 37-48 |
1995 |
2 | EE | Trishul M. Chilimbi,
Thomas Ball,
Stephen G. Eick,
James R. Larus:
Storm Watch: A Tool for Visualizing Memory System Protocols.
SC 1995 |
1994 |
1 | | Trishul M. Chilimbi,
James R. Larus:
Cachier: A Tool for Automatically Inserting CICO Annotations.
ICPP 1994: 89-98 |