Inter-process buffers in separation logic with rely-guarantee

Bornat, Richard; Amjad, Hasan

doi:10.1007/s00165-009-0141-8

Cited by 16 publications

(14 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Vafeiadis and Parkinson propose a combination of rely/guarantee reasoning and separation logic, named RGSep [53], to tame the complexity of the verification of concurrent algorithms. Bornat and Amjad [10] employed RGSep to prove correctness of two inter-process buffers algorithms.…”

Section: Related Workmentioning

confidence: 99%

The VerCors project

Amighi

Blom

Huisman

et al. 2012

Proceedings of the Sixth Workshop on Programming Languages Meets Program Verification

View full text Add to dashboard Cite

This paper describes the first results and on-going work in the Ver-Cors project. The VerCors project is about Verification of Concurrent Data Structures. Its goal is to develop a specification language and program logic for concurrent programs, and in particular for concurrent data structures, as these are the essential building blocks of many different concurrent programs. The program logic is based on our earlier work on permission-based separation logic for Java. This is an extension of Hoare logic that is particularly convenient to reason about concurrent programs.The paper first describes the tool set that is currently being built to support reasoning with this logic. It supports a specification language that combines features of separation logic with JML. For the verification, the program and its annotations are encoded into Chalice, and then we reuse the Chalice translation to Boogie to generate the proof obligations.Next, the paper describes our first results on data structure specifications. We use histories to keep track of the changes to the data structures, and we show how these histories allow us to derive other conclusions about the data structure implementations. We also discuss how we plan to reason about volatile variables, and how we will use this to verify lock-free data structures.Throughout the paper, we discuss our plans for future work within the VerCors project.

show abstract

Section: Related Workmentioning

confidence: 99%

The VerCors project

Amighi

Blom

Huisman

et al. 2012

Proceedings of the Sixth Workshop on Programming Languages Meets Program Verification

View full text Add to dashboard Cite

show abstract

“…The title of [BA08] alone should indicate why this is exciting. Again, the availability of this in published form will admit proper unbiased comparison.…”

Section: Comparison With "Separation Logic"mentioning

confidence: 99%

Elucidating concurrent algorithms via layers of abstraction and reification

Jones

Pierce

2011

Form. Asp. Comput.

View full text Add to dashboard Cite

Abstract. Arguing that intricate concurrent programs satisfy their specifications can be difficult; recording understandable explanations is important for subsequent readers. Abstraction is a key tool even for sequential programs. The purpose here is to explore some abstractions that help readers (and writers) understand the design of concurrent programs. As an illustration, the paper presents a formal development of a non-trivial parallel program: Simpson's implementation of asynchronous communication mechanisms (ACMs). Although the correctness of this "4-slot algorithm" has been shown elsewhere, earlier proofs fail to offer much insight into the design. From an understandable (yet formal) design history of this one algorithm, the techniques employed in the explanation are teased out for wider application. Among these techniques is using a "fiction of atomicity" as an aid to understanding the initial steps of development. The rely-guarantee approach is, here, combined with notions of read/write frames and "phased" specifications; furthermore, the atomicity assumptions implied by the rely/guarantee conditions are achieved by clever choice of data representations.

show abstract

“…The first property is data coherence, which means that the writer and the reader never access the same slot at the same time 1 . Data coherence is mainly achieved in the writer's strategy.…”

Section: Simpson's Four-slot Algorithmmentioning

confidence: 99%

“…The other group of people use RGSep logic. Bornat and Amjad [1] construct an assertional proof for Simpson's algorithm using RGSep. Due to the use of separation logic, the proof is more modular and simpler than by using rely-guarantee methods alone since predicates need only to specify the footprints of commands.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

See 1 more Smart Citation

Proving Simpson's Four-Slot Algorithm Using Ownership Transfer

Wang

EPiC Series in Computing

View full text Add to dashboard Cite

Simpson's four-slot algorithm has been an instructive example in studying various assertional proof methods/logics geared towards shared variable concurrency. Previously, techniques like relyguarantee, data refinement and resource separation have been applied to simplify the construction of its correctness proof. Still, an elegant, concise and insightful proof is elusive.Recently with the new generation of logics coming of age which are, for the first time, equipped with ownership transfer, it becomes imperative to ask to what extent can ownership transfer facilitate a nice proof of the algorithm. Ownership transfer is especially promising here because the conflict resolution mechanism in the four-slot algorithm can be easily recast as an implementation based on ownership transfer.

show abstract

Inter-process buffers in separation logic with rely-guarantee

Cited by 16 publications

References 39 publications

The VerCors project

The VerCors project

Elucidating concurrent algorithms via layers of abstraction and reification

Proving Simpson's Four-Slot Algorithm Using Ownership Transfer

Contact Info

Product

Resources

About