We review a number of illustrative example programs for the Java Memory Model (JMM) [6, 3], relating them to the original design goals and giving intuitive explanations (which can be made precise). We consider good, bad and ugly examples. The good examples are allowed behaviours in the JMM, showing possibilities for non sequentially consistent executions and reordering optimisations. The bad examples are prohibited behaviours, which are clearly ruled out by the JMM. The ugly examples are most interesting: these are tricky cases which illustrate some problem areas for the current formulation of the memory model, where the anticipated design goals are not met. For some of these we mention possible fixes, drawing on knowledge we gained while formalising the memory model in the theorem prover Isabelle [1].
[1]
Richard J. Boulton,et al.
Theorem Proving in Higher Order Logics
,
2003,
Lecture Notes in Computer Science.
[2]
Jeremy Manson,et al.
The Java memory model
,
2005,
POPL '05.
[3]
Leslie Lamport,et al.
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
,
2016,
IEEE Transactions on Computers.
[4]
David Aspinall,et al.
Formalising Java's Data Race Free Guarantee
,
2007,
TPHOLs.
[5]
Alexander Knapp,et al.
The Java Memory Model: Operationally, Denotationally, Axiomatically
,
2007,
ESOP.