| 2007 |
|---|
| 8 | EE | Roman Manevich,
Josh Berdine,
Byron Cook,
G. Ramalingam,
Mooly Sagiv:
Shape Analysis by Graph Decomposition.
TACAS 2007: 3-18 |
| 2006 |
|---|
| 7 | EE | Roman Manevich,
John Field,
Thomas A. Henzinger,
G. Ramalingam,
Mooly Sagiv:
Abstract Counterexample-Based Refinement for Powerset Domains.
Program Analysis and Compilation 2006: 273-292 |
| 6 | EE | Gilad Arnold,
Roman Manevich,
Mooly Sagiv,
Ran Shaham:
Combining Shape Analyses by Intersecting Abstractions.
VMCAI 2006: 33-48 |
| 2005 |
|---|
| 5 | EE | Roman Manevich,
Eran Yahav,
Ganesan Ramalingam,
Shmuel Sagiv:
Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists.
VMCAI 2005: 181-198 |
| 2004 |
|---|
| 4 | | Tal Lev-Ami,
Roman Manevich,
Shmuel Sagiv:
TVLA: A system for generating abstract interpreters.
IFIP Congress Topical Sessions 2004: 367-376 |
| 3 | EE | Roman Manevich,
Shmuel Sagiv,
Ganesan Ramalingam,
John Field:
Partially Disjunctive Heap Abstraction.
SAS 2004: 265-279 |
| 2 | EE | Roman Manevich,
Manu Sridharan,
Stephen Adams,
Manuvir Das,
Zhe Yang:
PSE: explaining program failures via postmortem static analysis.
SIGSOFT FSE 2004: 63-72 |
| 2002 |
|---|
| 1 | EE | Roman Manevich,
G. Ramalingam,
John Field,
Deepak Goyal,
Shmuel Sagiv:
Compactly Representing First-Order Structures for Static Analysis.
SAS 2002: 196-212 |
