Candidate Talk: Partially Disjunctive Shape Analysis

  • Roman Manevich

Tel Aviv University

Speaker Details

Roman Manevich is a Ph.D. candidate in the Computer Science Department at Tel Aviv university, advised by Professor Mooly Sagiv. Roman’s research interests are software verification of (concurrent) programs manipulating dynamically allocated memory and in particular static program analysis. He obtained a B.Sc. Cum Laude in Computer Science in 2001 and an M.Sc. Cum Laude in Computer Science in 2003, both from Tel Aviv University. He was cited in the Dean’s list in 2000 as an outstanding undergraduate student and received an outstanding graduate student award in 2005. He was awarded the Clore Fellowship for outstanding Ph.D. students in Israel, in 2005-2008. Roman has worked in Telelogic (was i-Logix) in 2001-2003 developing a code generating tool for UML models that automatically adds web-connectivity to embedded devices. He has interned in MSR Redmond, MSR India, and in IBM Watson, developing efficient static analysis techniques.

Watch Next