2008 |
22 | EE | Xin Zheng,
Radu Rugina:
Demand-driven alias analysis for C.
POPL 2008: 197-208 |
21 | EE | Greg Bronevetsky,
Daniel Marques,
Keshav Pingali,
Radu Rugina,
Sally A. McKee:
Compiler-enhanced incremental checkpointing for OpenMP applications.
PPOPP 2008: 275-276 |
2007 |
20 | EE | Sigmund Cherem,
Radu Rugina:
A Practical Escape and Effect Analysis for Building Lightweight Method Summaries.
CC 2007: 172-186 |
19 | EE | Sigmund Cherem,
Radu Rugina:
Uniqueness inference for compile-time object deallocation.
ISMM 2007: 117-128 |
18 | EE | Greg Bronevetsky,
Daniel Marques,
Keshav Pingali,
Radu Rugina:
Compiler-Enhanced Incremental Checkpointing.
LCPC 2007: 1-15 |
17 | EE | Sigmund Cherem,
Lonnie Princehouse,
Radu Rugina:
Practical memory leak detection using guarded value-flow analysis.
PLDI 2007: 480-491 |
16 | EE | Sigmund Cherem,
Radu Rugina:
Maintaining Doubly-Linked List Invariants in Shape Analysis with Local Reasoning.
VMCAI 2007: 234-250 |
2006 |
15 | EE | Sigmund Cherem,
Radu Rugina:
Compile-time deallocation of individual objects.
ISMM 2006: 138-149 |
14 | EE | Maksim Orlovich,
Radu Rugina:
Memory Leak Analysis by Contradiction.
SAS 2006: 405-424 |
2005 |
13 | EE | Brian Hackett,
Radu Rugina:
Region-based shape analysis with tracked locations.
POPL 2005: 310-323 |
12 | EE | Radu Rugina,
Martin C. Rinard:
Symbolic bounds analysis of pointers, array indices, and accessed memory regions.
ACM Trans. Program. Lang. Syst. 27(2): 185-235 (2005) |
11 | EE | Sigmund Cherem,
Radu Rugina:
A Verifier for Region-Annotated Java Bytecodes.
Electr. Notes Theor. Comput. Sci. 141(1): 183-201 (2005) |
2004 |
10 | EE | Sigmund Cherem,
Radu Rugina:
Region analysis and transformation for Java programs.
ISMM 2004: 85-96 |
9 | EE | Radu Rugina:
Shape Analysis Quantitative Shape Analysis.
SAS 2004: 228-245 |
2003 |
8 | EE | Stephen Chong,
Radu Rugina:
Static Analysis of Accessed Regions in Recursive Data Structures.
SAS 2003: 463-482 |
7 | EE | Radu Rugina,
Martin C. Rinard:
Pointer analysis for structured parallel programs.
ACM Trans. Program. Lang. Syst. 25(1): 70-116 (2003) |
2001 |
6 | EE | Radu Rugina,
Martin C. Rinard:
Design-Driven Compilation.
CC 2001: 150-164 |
2000 |
5 | EE | Radu Rugina,
Martin C. Rinard:
Recursion Unrolling for Divide and Conquer Programs.
LCPC 2000: 34-48 |
4 | EE | Radu Rugina,
Martin C. Rinard:
Symbolic bounds analysis of pointers, array indices, and accessed memory regions.
PLDI 2000: 182-195 |
1999 |
3 | EE | Radu Rugina,
Martin C. Rinard:
Pointer Analysis for Multithreaded Programs.
PLDI 1999: 77-90 |
2 | EE | Radu Rugina,
Martin C. Rinard:
Automatic Parallelization of Divide and Conquer Algorithms.
PPOPP 1999: 72-83 |
1998 |
1 | EE | Radu Rugina,
Klaus E. Schauser:
Predicting the Running Times of Parallel Programs by Simulation.
IPPS/SPDP 1998: 654-660 |