Roman Manevich

TL;DR: It is suggested that the operator formulation and tao-analysis of algorithms can be the foundation of a systematic approach to parallel programming.

TL;DR: PSE (Postmortem Symbolic Evaluation), a static analysis algorithm that can be used by programmers to diagnose software failures, is described, which combines a novel dataflow analysis and memory alias analysis in a manner that allows for precise exploration of the program's behavior in polynomial time.

TL;DR: This paper provides a new and rather precise family of abstractions for potentially cyclic singly-linked lists, and encoded this particular predicate abstraction and corresponding transformers in TVLA, and used this implementation to successfully verify safety properties of several list manipulating programs, including programs that were not previously verified using predicate abstraction or canonical abstraction.

TL;DR: An instantiation of the technique with Canonical Abstraction as the base abstraction is implemented and used to successfully verify linearizability of data-structures in the presence of an unbounded number of threads.

TL;DR: One of the continuing challenges in abstract interpretation is the creation of abstractions that yield analyses that are both tractable and precise enough to prove interesting properties about real-world programs.