An Operational Semantics including ‘Volatile’ for Safe Concurrency.

Boyland, John

doi:10.5381/jot.2009.8.4.a2

Cited by 4 publications

(6 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Boyland [8] formalises in Twelf a semantics for a simple language with allocation, synchronisation, volatiles, thread spawns and joins, which may raise an error upon a data race. He shows that a program never raises such errors iff it is data-race free in the JMM sense.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Java and the Java Memory Model — A Unified, Machine-Checked Formalisation

Lochbihler

2012

Programming Languages and Systems

View full text Add to dashboard Cite

We present a machine-checked formalisation of the Java memory model and connect it to an operational semantics for Java source code and bytecode. This provides the link between sequential semantics and the memory model that has been missing in the literature. Our model extends previous formalisations by dynamic memory allocation, thread spawns and joins, infinite executions, the wait-notify mechanism and thread interruption. We prove the Java data race freedom guarantee for the complete formalisation in a modular way. This work makes the assumptions about the sequential semantics explicit and shows how to discharge them.

show abstract

Section: Related Workmentioning

confidence: 99%

“…We extend our model accordingly ( § §2.1,2.2). Following [8,9], we interleave all threads and reconstruct the fundamental notions of the JMM a posteriori ( §2.3).…”

Section: Introductionmentioning

confidence: 99%

Java and the Java Memory Model — A Unified, Machine-Checked Formalisation

Lochbihler

2012

Programming Languages and Systems

View full text Add to dashboard Cite

show abstract

“…It features dynamic memory allocation, thread spawns and joins, the wait-notify mechanism, interruption, and infinite executions. Each of these is well understood and has been formalised before (e.g., Liu and Moore [2003]; Petri and Huisman [2008]; Farzan et al [2004aFarzan et al [ , 2004b), but their combination with the memory model is novel and results in subtle interactions, which previous JMM formalisations have missed [Aspinall andŠevčík 2007a;Cenciarelli et al 2007;Huisman and Petri 2007;Boyland 2009]. I illustrate these cases with new examples and show how to deal with them.…”

Section: Introductionmentioning

confidence: 93%

“…In contrast, my stack of semantics leads to modular proofs with explicit assumptions at the interfaces. Boyland [2009] formalises in Twelf a semantics for a simple language with allocation, synchronisation, volatiles, thread spawns and joins, which may raise an error upon a data race. He shows that a program never raises such errors if and only if it is datarace free in the JMM sense.…”

Section: Related Workmentioning

confidence: 99%

Making the java memory model safe

Lochbihler¹

2013

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

This work presents a machine-checked formalisation of the Java memory model and connects it to an operational semantics for Java and Java bytecode. For the whole model, I prove the data race freedom guarantee and type safety. The model extends previous formalisations by dynamic memory allocation, thread spawns and joins, infinite executions, the wait-notify mechanism, and thread interruption, all of which interact in subtle ways with the memory model. The formalisation resulted in numerous clarifications of and fixes to the existing JMM specification.

show abstract

“…To the best of our knowledge, only Boyland [12] describes an operational semantics for a Java-like language including volatile variables. Boyland proposes the notion of write-key to distinguish between a volatile and a normal variable read/write.…”

Section: Lock-free Data Structuresmentioning

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

An Operational Semantics including ‘Volatile’ for Safe Concurrency.

Cited by 4 publications

References 21 publications

Java and the Java Memory Model — A Unified, Machine-Checked Formalisation

Java and the Java Memory Model — A Unified, Machine-Checked Formalisation

Making the java memory model safe

The VerCors project

Contact Info

Product

Resources

About