BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × China
1 × France
1 × Italy
1 × Portugal
2 × Spain
7 × USA
Collaborated with:
D.Prountzos K.Pingali M.Sagiv S.Sagiv J.Field G.Ramalingam J.Berdine G.Ramalingam T.Lev-Ami M.Emmi R.Majumdar B.Dogadov N.Rinetzky O.Tripp K.S.McKinley G.Arnold R.Shaham E.Yahav B.Cook M.Sridharan S.Adams M.Das Z.Yang D.Goyal D.Nguyen M.Kulkarni M.Burtscher M.A.Hassaan R.Kaleem T.Lee A.Lenharth M.Méndez-Lojo X.Sui
Talks about:
analysi (8) shape (6) parallel (4) abstract (4) program (4) graph (4) concurr (3) decomposit (2) synthes (2) static (2)

Person: Roman Manevich

DBLP DBLP: Manevich:Roman

Contributed to:

PLDI 20152015
OOPSLA 20122012
PLDI 20122012
PLDI 20112011
POPL 20112011
PLDI 20102010
CAV 20082008
SAS 20082008
TACAS 20072007
VMCAI 20062006
VMCAI 20052005
FSE 20042004
SAS 20042004
SAS 20022002
CAV (1) 20162016

Wrote 15 papers:

PLDI-2015-PrountzosMP #automation #graph #parallel #source code
Synthesizing parallel graph programs via automated planning (DP, RM, KP), pp. 533–544.
OOPSLA-2012-PrountzosMP #concurrent #graph #named #source code
Elixir: a system for synthesizing concurrent graph programs (DP, RM, KP), pp. 375–394.
PLDI-2012-TrippMFS #named #parallel
JANUS: exploiting parallelism via hindsight (OT, RM, JF, MS), pp. 145–156.
PLDI-2011-PingaliNKBHKLLMMPS #algorithm #parallel
The tao of parallelism in algorithms (KP, DN, MK, MB, MAH, RK, THL, AL, RM, MML, DP, XS), pp. 12–25.
POPL-2011-PrountzosMPM #analysis #graph #optimisation #parallel #source code
A shape analysis for optimizing parallel graph programs (DP, RM, KP, KSM), pp. 159–172.
PLDI-2010-EmmiMM #transaction #verification
Parameterized verification of transactional memories (ME, RM, RM), pp. 134–145.
CAV-2008-BerdineLMRS #analysis #concurrent #quantifier #thread
Thread Quantification for Concurrent Shape Analysis (JB, TLA, RM, GR, SS), pp. 399–413.
SAS-2008-ManevichLSRB #analysis #composition #concurrent
Heap Decomposition for Concurrent Shape Analysis (RM, TLA, MS, GR, JB), pp. 363–377.
TACAS-2007-ManevichBCRS #analysis #composition #graph
Shape Analysis by Graph Decomposition (RM, JB, BC, GR, MS), pp. 3–18.
VMCAI-2006-ArnoldMSS #abstraction #analysis
Combining Shape Analyses by Intersecting Abstractions (GA, RM, MS, RS), pp. 33–48.
VMCAI-2005-ManevichYRS #abstraction #canonical
Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists (RM, EY, GR, SS), pp. 181–198.
FSE-2004-ManevichSA #named #static analysis
PSE: explaining program failures via postmortem static analysis (RM, MS, SA, MD, ZY), pp. 63–72.
SAS-2004-ManevichSRF #abstraction
Partially Disjunctive Heap Abstraction (RM, SS, GR, JF), pp. 265–279.
SAS-2002-ManevichRFGS #first-order #representation #static analysis
Compactly Representing First-Order Structures for Static Analysis (RM, GR, JF, DG, SS), pp. 196–212.
CAV-2016-ManevichDR #analysis #linear #termination
From Shape Analysis to Termination Analysis in Linear Time (RM, BD, NR), pp. 426–446.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.