|
Search the dblp DataBase
Roman Manevich:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Tal Lev-Ami, Roman Manevich, Shmuel Sagiv
TVLA: A system for generating abstract interpreters. [Citation Graph (0, 0)][DBLP] IFIP Congress Topical Sessions, 2004, pp:367-376 [Conf]
- Roman Manevich, G. Ramalingam, John Field, Deepak Goyal, Shmuel Sagiv
Compactly Representing First-Order Structures for Static Analysis. [Citation Graph (0, 0)][DBLP] SAS, 2002, pp:196-212 [Conf]
- Roman Manevich, Shmuel Sagiv, Ganesan Ramalingam, John Field
Partially Disjunctive Heap Abstraction. [Citation Graph (0, 0)][DBLP] SAS, 2004, pp:265-279 [Conf]
- Roman Manevich, Manu Sridharan, Stephen Adams, Manuvir Das, Zhe Yang
PSE: explaining program failures via postmortem static analysis. [Citation Graph (0, 0)][DBLP] SIGSOFT FSE, 2004, pp:63-72 [Conf]
- Gilad Arnold, Roman Manevich, Mooly Sagiv, Ran Shaham
Combining Shape Analyses by Intersecting Abstractions. [Citation Graph (0, 0)][DBLP] VMCAI, 2006, pp:33-48 [Conf]
- Roman Manevich, Eran Yahav, Ganesan Ramalingam, Shmuel Sagiv
Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists. [Citation Graph (0, 0)][DBLP] VMCAI, 2005, pp:181-198 [Conf]
- Roman Manevich, John Field, Thomas A. Henzinger, G. Ramalingam, Mooly Sagiv
Abstract Counterexample-Based Refinement for Powerset Domains. [Citation Graph (0, 0)][DBLP] Program Analysis and Compilation, 2006, pp:273-292 [Conf]
- Roman Manevich, Josh Berdine, Byron Cook, G. Ramalingam, Mooly Sagiv
Shape Analysis by Graph Decomposition. [Citation Graph (0, 0)][DBLP] TACAS, 2007, pp:3-18 [Conf]
Abstract Transformers for Thread Correlation Analysis. [Citation Graph (, )][DBLP]
Thread Quantification for Concurrent Shape Analysis. [Citation Graph (, )][DBLP]
Parameterized verification of transactional memories. [Citation Graph (, )][DBLP]
Heap Decomposition for Concurrent Shape Analysis. [Citation Graph (, )][DBLP]
Automatic Verification of Strongly Dynamic Software Systems. [Citation Graph (, )][DBLP]
Search in 0.018secs, Finished in 0.019secs
|