- A Shape Analysis for Optimizing Parallel Graph Programs
- A Shape Analysis for Optimizing Parallel Graph Programs Dimitrios Prountzos1 Roman Manevich2 Keshav Pingali1,2 Kathryn S. McKinley1
- The Tao of Parallelism in Algorithms Keshav Pingali1,3, Donald Nguyen1, Milind Kulkarni5,
- Heap Decomposition for Concurrent Shape Analysis Tel Aviv University, School of Computer Science,
- The Tao of Parallelism in Algorithms Keshav Pingali1,3, Donald Nguyen1, Milind Kulkarni5,
- Shape Analysis by Graph Decomposition R. Manevich1,
- Thread Quantification for Concurrent Shape Analysis J. Berdine1
- Synthesizing Concurrent Graph Data Structures: A Case Study
- Heap Decomposition for Concurrent Shape Analysis Tel Aviv University, School of Computer Science,
- Raymond and Beverly Sackler Faculty of Exact Sciences The Blavatnik School of Computer Science
- PSE: Explaining Program Failures via Postmortem Static Analysis
- Abstract Transformers for Thread Correlation Analysis
- TVLA: A SYSTEM FOR GENERATING ABSTRACT INTERPRETERS
- This is a preliminary version of a paper to appear in PLDI '10. Parameterized Verification of Transactional Memories
- Partially Disjunctive Heap Abstraction Roman Manevich1
- Abstract Counterexample-based Refinement for Powerset Domains
- Heap Decomposition for Concurrent Shape Analysis R. Manevich1,
- Efficiently Inferring Thread Correlations Technical Report TR-09-59203
- Combining Shape Analyses by Intersecting Abstractions
- Abstract Counterexample-based Refinement for Relational Domains
- Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists
- Thread Quantification for Concurrent Shape Analysis Tel Aviv University, School of Computer Science,
- Intersecting Heap Abstractions with Applications to Compile-time
- Data Structures and Algorithms for Ef cient Shape Analysis
- A Shape Analysis for Optimizing Parallel Graph Programs
- Shape Analysis by Graph Decomposition R. Manevich1,
- Compactly Representing First-Order Structures for Static Analysis
- A Shape Analysis for Optimizing Parallel Graph Programs Dimitrios Prountzos1 Roman Manevich2 Keshav Pingali1,2 Kathryn S. McKinley1
- Lightweight Analysis of Acyclic Unshared Lists Roman Manevich2
- Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists
