Dr. Roman Manevich

romanm foto

Contacts

Email:
Homepage:
Office: 208 in 37 building
Phone number: 08-6477879
Fax number: 08-6477650
Box number: 71
Office hours: Wed 12:00-14:00

Teaching

Fall 2017-2018 20213021 Compiler Principles
Fall 2017-2018 20214001 Research Project
Spring 2018 20225931 Program Analysis and Verification
Spring 2018 20214001 Research Project
Fall 2016-2017 20214001 Research Project
Fall 2016-2017 20214221 project for honor students
Fall 2016-2017 20213021 Compiler Principles
Spring 2017 20225931 Program Analysis and Verification
Spring 2017 20214001 Research Project
Fall 2015-2016 20214001 Research Project
Fall 2015-2016 20213021 Compiler Principles
Spring 2016 20225931 Program Analysis and Verification
Spring 2016 20214001 Research Project
Fall 2014-2015 20213021 Compiler Principles
Fall 2014-2015 20214001 Research Project
Spring 2015 20214521 Mini-Project on Implementing Parallel Graph Algorithms
Spring 2015 20214001 Research Project
Spring 2015 20225931 Program Analysis and Verification
Summer 2015 20214001 Research Project
Fall 2013-2014 20213021 Compiler Principles
Spring 2014 20225931 Program Analysis and Verification
Fall 2012-2013 20213021 Compiler Principles
Spring 2013 20215781 Program Analysis and Verification

Education

2001  -  B.Sc  Tel Aviv University, Computer Science
2003  -  M.Sc  Tel Aviv University, Computer Science
Thesis: Algorithms and Data Structures for Efficient Shape Analysis
Advisor: Mooly Sagiv
2009  -  Ph.D  Tel Aviv University, Computer Science
Thesis: Partially Disjunctive Shape Analysis
Advisor: Mooly Sagiv

Selected publications all BibTex

 
Conference Articles
Dimitrios Prountzos, Roman Manevich, and Keshav Pingali. Synthesizing Parallel Graph Programs via Automated Planning. In Programming Languages Design and Implementation (PLDI'15), pages 533-544, ACM, 2015.
 
Proceedings
Dimitrios Prountzos, Roman Manevich, and Keshav Pingali. Elixir: A System for Synthesizing Concurrent Graph Programs. In OOPSLA'12: Object-Oriented Programming, Systems, Languages and Applications, 2012.
Omer Tripp, Roman Manevich, John Field, and Mooly Sagiv. Janus: Exploiting Parallelism via Hindsight. In PLDI'12: Programming Languages Design and Implementation, 2012.
Dimitrios Prountzos, Roman Manevich, Keshav Pingali, Kathryn McKinley. A Shape Analysis for Optimizing Parallel Graph Programs. , 2011.
Michael Emmi, Rupak Majumdar, and Roman Manevich. Parameterized Verification of Transactional Memories. In PLDI'10: Programming Language Design and Implementation, 2010.
Josh Berdine, Tal Lev-Ami, Roman Manevich, Ganesan Ramalingam, and Mooly Sagiv. Thread Quantification for Concurrent Shape Analysis. In CAV'08: 20th International Conference on Computer Aided Verification, 2008.
Roman Manevich, Tal Lev-Ami, Ganesan Ramalingam, Mooly Sagiv, and Josh Berdine. Heap Decomposition for Concurrent Shape Analysis. In SAS'08: 15th International Static Analysis Symposium, 2008.
Roman Manevich, Josh Berdine, Byron Cook, Ganesan Ramalingam, and Mooly Sagiv. Shape Analysis by Graph Decomposition. In TACAS'07: 13th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2007.
Gilad Arnold, Roman Manevich, Mooly Sagiv, and Ran Shaham. Combining Shape Analyses by Intersecting Abstractions. In VMCAI '06: 7th Conference on Verification, Model Checking and Abstract Interpretation, 2006.
Roman Manevich, Eran Yahav, Ganesan Ramalingam, and Mooly Sagiv. Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists. In VMCAI '05: 6th Conference on Verification, Model Checking and Abstract Interpretation, 2005.
Roman Manevich, Manu Sridharan, Stephen Adams, Manuvir Das, and Zhe Yang. PSE: Explaining Program Failures via Postmortem Static Analysis. In FSE '04: 12th International Symposium on the Foundations of Software Engineering, 2004.
Roman Manevich, Mooly Sagiv, Ganesan Ramalingam, and John Field. Partially Disjunctive Heap Abstraction. In SAS '04: 11th International Static Analysis Symposium, 2004.
Roman Manevich, Ganesan Ramalingam, John Field, Deepak Goyal, and Mooly Sagiv. Compactly Representing First-Order Structures for Static Analysis. In SAS '02: The 9th International Static Analysis Symposium, 2002.