• Publications
  • Influence
Local Reasoning about Programs that Alter Data Structures
TLDR
An extension of Hoare's logic for reasoning about programs that alter data structures is described, based on a possible worlds model of the logic of bunched implications, and includes spatial conjunction and implication connectives alongside those of classical logic. Expand
Local Action and Abstract Separation Logic
TLDR
Local actions provide a semantics for a generalized form of (sequential) separation logic, and it is shown that the conditions on local actions allow a general soundness proof for a separation logic for concurrency, interpreted over arbitrary separation algebras. Expand
A Local Shape Analysis Based on Separation Logic
TLDR
This work describes a program analysis for linked list programs where the abstract domain uses formulae from separation logic in a manner similar to that described in the previous chapter. Expand
Replicated data types: specification, verification, optimality
TLDR
This work proposes a framework for specifying replicated data types using relations over events and verifying their implementations using replication-aware simulations, and shows how to specify consistency of replicated stores with multiple objects axiomatically, in analogy to prior work on weak memory models. Expand
Compositional shape analysis by means of bi-abduction
TLDR
A compositional shape analysis, where each procedure is analyzed independently of its callers, based on a generalized form of abduction (inference of explanatory hypotheses) which is the basis of a new interprocedural analysis algorithm. Expand
Automated concolic testing of smartphone apps
TLDR
The approach is based on concolic testing and generates sequences of events automatically and systematically and alleviates the path-explosion problem by checking a condition on program executions that identifies subsumption between different event sequences. Expand
Compositional Shape Analysis by Means of Bi-Abduction
TLDR
A method of boosting shape analyses by defining a compositional method, where each procedure is analyzed independently of its callers, which is based on a generalized form of abduction (inference of explanatory hypotheses), which is called bi-abduction. Expand
Shape Analysis for Composite Data Structures
TLDR
A shape analysis that adapts to some of the complex composite data structures found in industrial systems-level programs and introduces the use of generic higher-order inductive predicates describing spatial relationships together with a method of synthesizing new parameterized spatial predicates which can be used in combination with the higher- order predicates. Expand
Views: compositional reasoning for concurrent programs
TLDR
This paper presents the "Concurrent Views Framework", a metatheory of concurrent reasoning principles that proves each of these systems is sound without requiring induction on the operational semantics. Expand
Abstraction for concurrent objects
TLDR
This study formally shows that these conditions can be characterized in terms of observational refinement and provides a new understanding of sequential consistency and linearizability in Terms of abstraction of dependency between computation steps of client programs. Expand
...
1
2
3
4
5
...