Skip to search formSkip to main contentSkip to account menu

Local Reasoning about Programs that Alter Data Structures

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.
View via Publisher (opens in a new tab)

Compositional shape analysis by means of bi-abduction

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.
View on ACM (opens in a new tab)

Local Action and Abstract Separation Logic

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.
View on IEEE (opens in a new tab)

Computability and Complexity Results for a Spatial Assertion Language for Data Structures

It is shown that validity, even for this restricted language, is not r.e., but that the quantifier-free sublanguage is decidable, and the complexity of model checking and validity for several fragments is considered.
View via Publisher (opens in a new tab)

A Local Shape Analysis Based on Separation Logic

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.
View via Publisher (opens in a new tab)

Automated concolic testing of smartphone apps

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.
View on ACM (opens in a new tab)

Replicated data types: specification, verification, optimality

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.
View on ACM (opens in a new tab)

Shape Analysis for Composite Data Structures

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.
View via Publisher (opens in a new tab)

Views: compositional reasoning for concurrent programs

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.
View on ACM (opens in a new tab)

Abstraction for concurrent objects

View via Publisher (opens in a new tab)
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)