Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Roman Manevich
2010 – today
- 2012
[c17]Dimitrios Prountzos, Roman Manevich, Keshav Pingali: Elixir: a system for synthesizing concurrent graph programs. OOPSLA 2012: 375-394- [c16]Omer Tripp, Roman Manevich, John Field, Mooly Sagiv: JANUS: exploiting parallelism via hindsight. PLDI 2012: 145-156
- 2011
- [c15]Keshav Pingali, Donald Nguyen, Milind Kulkarni, Martin Burtscher, Muhammad Amber Hassaan, Rashid Kaleem, Tsung-Hsien Lee, Andrew Lenharth, Roman Manevich, Mario Méndez-Lojo, Dimitrios Prountzos, Xin Sui: The tao of parallelism in algorithms. PLDI 2011: 12-25
- [c14]Dimitrios Prountzos, Roman Manevich, Keshav Pingali, Kathryn S. McKinley: A shape analysis for optimizing parallel graph programs. POPL 2011: 159-172
- 2010
- [c13]Michael Emmi, Rupak Majumdar, Roman Manevich: Parameterized verification of transactional memories. PLDI 2010: 134-145
2000 – 2009
- 2009
- [c12]Michal Segalov, Tal Lev-Ami, Roman Manevich, Ganesan Ramalingam, Mooly Sagiv: Abstract Transformers for Thread Correlation Analysis. APLAS 2009: 30-46
- 2008
- [c11]Josh Berdine, Tal Lev-Ami, Roman Manevich, G. Ramalingam, Shmuel Sagiv: Thread Quantification for Concurrent Shape Analysis. CAV 2008: 399-413
- [c10]Roman Manevich, Tal Lev-Ami, Mooly Sagiv, Ganesan Ramalingam, Josh Berdine: Heap Decomposition for Concurrent Shape Analysis. SAS 2008: 363-377
- 2007
- [c9]Roman Manevich, Josh Berdine, Byron Cook, G. Ramalingam, Mooly Sagiv: Shape Analysis by Graph Decomposition. TACAS 2007: 3-18
- 2006
- [c8]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
- [c7]Gilad Arnold, Roman Manevich, Mooly Sagiv, Ran Shaham: Combining Shape Analyses by Intersecting Abstractions. VMCAI 2006: 33-48
- 2005
- [c6]Roman Manevich, Eran Yahav, Ganesan Ramalingam, Shmuel Sagiv: Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists. VMCAI 2005: 181-198
- [c5]Nurit Dor, John Field, Denis Gopan, Tal Lev-Ami, Alexey Loginov, Roman Manevich, G. Ramalingam, Thomas W. Reps, Noam Rinetzky, Mooly Sagiv, Reinhard Wilhelm, Eran Yahav, Greta Yorsh: Automatic Verification of Strongly Dynamic Software Systems. VSTTE 2005: 82-92
- 2004
- [c4]Tal Lev-Ami, Roman Manevich, Shmuel Sagiv: TVLA: A system for generating abstract interpreters. IFIP Congress Topical Sessions 2004: 367-376
- [c3]Roman Manevich, Shmuel Sagiv, Ganesan Ramalingam, John Field: Partially Disjunctive Heap Abstraction. SAS 2004: 265-279
- [c2]Roman Manevich, Manu Sridharan, Stephen Adams, Manuvir Das, Zhe Yang: PSE: explaining program failures via postmortem static analysis. SIGSOFT FSE 2004: 63-72
- 2002
- [c1]Roman Manevich, G. Ramalingam, John Field, Deepak Goyal, Shmuel Sagiv: Compactly Representing First-Order Structures for Static Analysis. SAS 2002: 196-212
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 22:14 CET by the dblp team