default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoman Manevich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j1]Bor-Yuh Evan Chang
, Cezara Dragoi, Roman Manevich, Noam Rinetzky, Xavier Rival:
Shape Analysis. Found. Trends Program. Lang. 6(1-2): 1-158 (2020)- [c24]Oren Ish-Shalom, Shachar Itzhaky, Roman Manevich, Noam Rinetzky:
Harnessing Static Analysis to Help Learn Pseudo-Inverses of String Manipulating Procedures for Automatic Test Generation. VMCAI 2020: 180-201
2010 – 2019
- 2019
- [c23]Vahid Mokhtari, Roman Manevich, Luís Seabra Lopes, Armando J. Pinho:
Learning the Scope of Applicability for Task Planning Knowledge in Experience-Based Planning Domains. IROS 2019: 3973-3979 - [i3]Vahid Mokhtari, Luís Seabra Lopes, Armando J. Pinho, Roman Manevich:
Learning Task Knowledge and its Scope of Applicability in Experience-Based Planning Domains. CoRR abs/1902.10770 (2019) - [i2]Vahid Mokhtari, Luís Seabra Lopes, Armando J. Pinho, Roman Manevich:
Computing the Scope of Applicability for Acquired Task Knowledge in Experience-Based Planning Domains. CoRR abs/1903.06015 (2019) - 2018
- [c22]Roman Manevich, Sharon Shoham:
Inferring Program Extensions from Traces. ICGI 2018: 139-154 - [c21]Kalev Alpernas, Roman Manevich, Aurojit Panda, Mooly Sagiv, Scott Shenker, Sharon Shoham, Yaron Velner:
Abstract Interpretation of Stateful Networks. SAS 2018: 86-106 - 2017
- [c20]Shlomi Dolev, Roman Manevich, Amit Rokach:
Programming reflexes (Extended abstract). NCA 2017: 149-152 - [i1]Kalev Alpernas, Roman Manevich, Aurojit Panda, Mooly Sagiv, Scott Shenker, Sharon Shoham, Yaron Velner:
Modular Safety Verification for Stateful Networks. CoRR abs/1708.05904 (2017) - 2016
- [c19]Roman Manevich, Boris Dogadov, Noam Rinetzky:
From Shape Analysis to Termination Analysis in Linear Time. CAV (1) 2016: 426-446 - 2015
- [c18]Dimitrios Prountzos, Roman Manevich, Keshav Pingali:
Synthesizing parallel graph programs via automated planning. PLDI 2015: 533-544 - 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
- [b1]Roman Manevich:
Partially disjunctive shape analysis. Tel Aviv University, Israel, 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-375 - [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
aka: Mooly Sagiv
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
