2014
DOI: 10.1007/978-3-642-54833-8_16
View full text
|
|
Share

Abstract: Abstract. We present a novel model of concurrent computations with shared memory and provide a simple, yet powerful, logical framework for uniform Hoarestyle reasoning about partial correctness of coarse-and fine-grained concurrent programs. The key idea is to specify arbitrary resource protocols as communicating state transition systems (STS) that describe valid states of a resource and the transitions the resource is allowed to make, including transfer of heap ownership. We demonstrate how reasoning in term…

Expand abstract

Search citation statements

Order By: Relevance

Citation Types

0
91
0

Paper Sections

0
0
0
0
0

Publication Types

0
0
0
0

Relationship

0
0

Authors

Journals