Roman Manevich

According to our database1, Roman Manevich authored at least 27 papers between 2002 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Harnessing Static Analysis to Help Learn Pseudo-Inverses of String Manipulating Procedures for Automatic Test Generation.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2020

2019
Computing the Scope of Applicability for Acquired Task Knowledge in Experience-Based Planning Domains.
CoRR, 2019

Learning Task Knowledge and its Scope of Applicability in Experience-Based Planning Domains.
CoRR, 2019

Learning the Scope of Applicability for Task Planning Knowledge in Experience-Based Planning Domains.
Proceedings of the 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2019

2018
Abstract Interpretation of Stateful Networks.
Proceedings of the Static Analysis - 25th International Symposium, 2018

Inferring Program Extensions from Traces.
Proceedings of the 14th International Conference on Grammatical Inference, 2018

2017
Modular Safety Verification for Stateful Networks.
CoRR, 2017

Programming reflexes (Extended abstract).
Proceedings of the 16th IEEE International Symposium on Network Computing and Applications, 2017

2016
From Shape Analysis to Termination Analysis in Linear Time.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015
Synthesizing parallel graph programs via automated planning.
Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2015

2012
JANUS: exploiting parallelism via hindsight.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2012

Elixir: a system for synthesizing concurrent graph programs.
Proceedings of the 27th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2012

2011
A shape analysis for optimizing parallel graph programs.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

The tao of parallelism in algorithms.
Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, 2011

2010
Parameterized verification of transactional memories.
Proceedings of the 2010 ACM SIGPLAN Conference on Programming Language Design and Implementation, 2010

2009
Abstract Transformers for Thread Correlation Analysis.
Proceedings of the Programming Languages and Systems, 7th Asian Symposium, 2009

2008
Heap Decomposition for Concurrent Shape Analysis.
Proceedings of the Static Analysis, 15th International Symposium, 2008

Thread Quantification for Concurrent Shape Analysis.
Proceedings of the Computer Aided Verification, 20th International Conference, 2008

2007
Shape Analysis by Graph Decomposition.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007

2006
Combining Shape Analyses by Intersecting Abstractions.
Proceedings of the Verification, 2006

Abstract Counterexample-Based Refinement for Powerset Domains.
Proceedings of the Program Analysis and Compilation, 2006

2005
Automatic Verification of Strongly Dynamic Software Systems.
Proceedings of the Verified Software: Theories, 2005

Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists.
Proceedings of the Verification, 2005

2004
PSE: explaining program failures via postmortem static analysis.
Proceedings of the 12th ACM SIGSOFT International Symposium on Foundations of Software Engineering, 2004, Newport Beach, CA, USA, October 31, 2004

Partially Disjunctive Heap Abstraction.
Proceedings of the Static Analysis, 11th International Symposium, 2004

TVLA: A system for generating abstract interpreters.
Proceedings of the Building the Information Society, 2004

2002
Compactly Representing First-Order Structures for Static Analysis.
Proceedings of the Static Analysis, 9th International Symposium, 2002


  Loading...