Local Reasoning about Programs that Alter Data Structures

O’Hearn, Peter W.; Reynolds, John; Yang, Hongseok

doi:10.1007/3-540-44802-0_1

Cited by 456 publications

(404 citation statements)

References 8 publications

Supporting

Mentioning

402

Contrasting

Unclassified

Order By: Relevance

“…In a spatial logic, the truth of a formula depends on a spatial structure, such as a system of ambients. Apart from the ambient logic, other examples include logics for concurrent objects [4], heaps [25,20,22], trees [6], graphs [5], and the π-calculus [2,3]. Spatial logics are being applied as notations for specifying and verifying programs, and as query languages for semistructured data.…”

Section: Resultsmentioning

confidence: 99%

The Decidability of Model Checking Mobile Ambients

Charatonik

Talbot

2001

Computer Science Logic

View full text Add to dashboard Cite

We settle the complexity bounds of the model checking problem for the ambient calculus with public names against the ambient logic. We show that if either the calculus contains replication or the logic contains the guarantee operator, the problem is undecidable. In the case of the replication-free calculus and guarantee-free logic we prove that the problem is PSPACE-complete. For the complexity upper-bound, we devise a new representation of processes that remains of polynomial size during process execution; this allows us to keep the model checking procedure in polynomial space. Moreover, we prove PSPACE-hardness of the problem for several quite simple fragments of the calculus and the logic; this suggests that there are no interesting fragments with polynomial-time model checking algorithms.

show abstract

Section: Resultsmentioning

confidence: 99%

The Decidability of Model Checking Mobile Ambients

Charatonik

Talbot

2001

Computer Science Logic

View full text Add to dashboard Cite

show abstract

“…1 as a doubly linked list segment starting by the node at index ifrom, ending by the node at index ilast; the starting node stores as previous node iprev, and the ending node stores as next node ito. The predicate definition is classic in Separation Logic [24], except the bound constraint on the node indexes (locations). If the source ifrom and target ilast indexes are equal, the list is empty; otherwise an occupied node is present at index ifrom and it is linked to the previous node and the remainder of the list.…”

Section: Acyclic Doubly Linked Listmentioning

confidence: 99%

A Verified Implementation of the Bounded List Container

Cauderlier

Sighireanu

2018

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. This paper contributes to the trend of providing fully verified container libraries. We consider an implementation of the bounded doubly linked list container which manages the list in a fixed size, heap allocated array. The container provides constant time methods to update the list by adding, deleting, and changing elements, as well as cursors for list traversal and access to elements. The library is implemented in C, but we wrote the code and its specification by imitating the ones provided by GNAT for the standard library of Ada 2012. The proof of functional correctness is done using VeriFast, which provides an auto-active verification environment for Separation Logic extended with algebraic data types. The specifications proved entail the contracts of the Ada library and include new features. The verification method we used employs a precise algebraic model of the data structure and we show that it facilitates the verification and captures entirely the library contracts. This case study may be of interest for other verification platforms, thus we highlight the intricate points of its proof.

show abstract

“…However, infering transitive relations of must-aliasing, i.e., between variables at different program points might enable the inference of constancy information, but this results in a much more expensive analysis than ours. Our work shares its motivation with the evolving field of local reasoning [14], such as separation logic [16] and regional logic [3] which provide expressive frameworks to reason about programs with shared mutable data structures. While our goals are more restricted, our technique has the advantage of allowing fully automatic inference.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

Field-Sensitive Value Analysis by Field-Insensitive Analysis

Albert

Arenas

Genaim

et al. 2009

FM 2009: Formal Methods

View full text Add to dashboard Cite

Abstract. Shared and mutable data-structures pose major problems in static analysis and most analyzers are unable to keep track of the values of numeric variables stored in the heap. In this paper, we first identify sufficient conditions under which heap allocated numeric variables in object oriented programs (i.e., numeric fields) can be handled as nonheap allocated variables. Then, we present a static analysis to infer which numeric fields satisfy these conditions at the level of (sequential) bytecode. This allows instrumenting the code with ghost variables which make such numeric fields observable to any field-insensitive value analysis. Our experimental results in termination analysis show that we greatly enlarge the class of analyzable programs with a reasonable overhead.

show abstract

Local Reasoning about Programs that Alter Data Structures

Cited by 456 publications

References 8 publications

The Decidability of Model Checking Mobile Ambients

The Decidability of Model Checking Mobile Ambients

A Verified Implementation of the Bounded List Container

Field-Sensitive Value Analysis by Field-Insensitive Analysis

Contact Info

Product

Resources

About