Local Reasoning for Storable Locks and Threads

Gotsman, Alexey; Berdine, Josh; Cook, Byron; Rinetzky, Noam; Sagiv, Mooly

doi:10.1007/978-3-540-76637-7_3

Cited by 83 publications

(118 citation statements)

References 12 publications

Supporting

Mentioning

117

Contrasting

Order By: Relevance

“…Various extensions of separation logic to concurrent programs have been proposed [9,10,16,8,11]. In particular, Gotsman et al [10] propose a variant of concurrent separation logic that supports an unbounded number of dynamically allocated locks and threads, which is similar to our approach in many respects.…”

Section: Related Workmentioning

confidence: 97%

“…The programming model described above is similar to the techniques used in various extensions of separation logic [8,9,10,11]. We discuss them in Section 4.…”

Section: Programming Modelmentioning

confidence: 99%

“…In particular, Gotsman et al [10] propose a variant of concurrent separation logic that supports an unbounded number of dynamically allocated locks and threads, which is similar to our approach in many respects. For example, the boolean expression acc(o.f ) can be considered to be the counterpart of the separation logic predicate o.f → in the sense that they both represent a permission to access the location &o.f .…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

VeriCool: An Automatic Verifier for a Concurrent Object-Oriented Language

Smans

Jacobs

Piessens

2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Reasoning about object-oriented programs is hard, due to aliasing, dynamic binding and the need for data abstraction and framing. Reasoning about concurrent object-oriented programs is even harder, since in general interference by other threads has to be taken into account at each program point.In this paper, we propose an approach to the automatic verification of concurrent Java-like programs. The cornerstone of the approach is a programming model, a set of rules, which limits thread inference to synchronization points such that one can reason sequentially about most code. In particular, programs conforming to the programming model are guaranteed to be data race free. Compared to previous incarnations of the programming model, our approach is more flexible in describing the set of memory locations protected by an object's lock. In addition, we combine the model with an approach for data abstraction and framing based on dynamic frames. To the best of our knowledge, this is the first paper combining dynamic frames and concurrency.We implemented the approach in a tool, called VeriCool, and used it to verify several small concurrent programs.

show abstract

Section: Related Workmentioning

confidence: 97%

“…The programming model described above is similar to the techniques used in various extensions of separation logic [8,9,10,11]. We discuss them in Section 4.…”

Section: Programming Modelmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

VeriCool: An Automatic Verifier for a Concurrent Object-Oriented Language

Smans

Jacobs

Piessens

2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Mezzo is strongly inspired by separation logic [13] in its treatment of heapallocated data and by concurrent separation logic [10] and its successors [8,3] in its treatment of locks. Like second-order separation logic, as found at the core of CaReSL [14], Mezzo supports higher-order functions and quantification over permissions (assertions) and types (predicates).…”

Section: Related Workmentioning

confidence: 99%

Type Soundness and Race Freedom for Mezzo

Balabonski

Pottier

Protzenko

2014

Functional and Logic Programming

View full text Add to dashboard Cite

Abstract. The programming language Mezzo is equipped with a rich type system that controls aliasing and access to mutable memory. We incorporate shared-memory concurrency into Mezzo and present a modular formalization of its core type system, in the form of a concurrent λ-calculus, which we extend with references and locks. We prove that welltyped programs do not go wrong and are data-race free. Our definitions and proofs are machine-checked.

show abstract

“…The proof should be similar to the proof for standard CSL. We believe other extensions of CSL, such as CSL with storable locks [17,18] and the combination of CSL with Rely-Guarantee reasoning [29,13], can also be proved sound with respect to the grainless semantics. Then their soundness in our relaxed semantics can be derived easily from Lemma 5.4.…”

Section: Soundness Of Cslmentioning

confidence: 99%

Parameterized Memory Models and Concurrent Separation Logic

Ferreira

Feng

Shao

2010

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. In this paper, we formalize relaxed memory models by giving a parameterized operational semantics to a concurrent programming language. Behaviors of a program under a relaxed memory model are defined as behaviors of a set of related programs under the sequentially consistent model. This semantics is parameterized in the sense that different memory models can be obtained by using different relations between programs. We present one particular relation that is weaker than many memory models and accounts for the majority of sequential optimizations. We then show that the derived semantics has the DRF-guarantee, using a notion of race-freedom captured by an operational grainless semantics. Our grainless semantics bridges concurrent separation logic (CSL) and relaxed memory models naturally, which allows us to finally prove the folklore theorem that CSL is sound with relaxed memory models.

show abstract

Local Reasoning for Storable Locks and Threads

Cited by 83 publications

References 12 publications

VeriCool: An Automatic Verifier for a Concurrent Object-Oriented Language

VeriCool: An Automatic Verifier for a Concurrent Object-Oriented Language

Type Soundness and Race Freedom for Mezzo

Parameterized Memory Models and Concurrent Separation Logic

Contact Info

Product

Resources

About