• Cite Icon6
  • https://doi.org/10.1145/2480359.2429110Copy DOI Icon

Plan B

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Recent advances in verification have made it possible to envision trusted implementations of real-world languages. Java with its type-safety and fully specified semantics would appear to be an ideal candidate; yet, the complexity of the translation steps used in production virtual machines have made it a challenging target for verifying compiler technology. One of Java's key innovations, its memory model, poses significant obstacles to such an endeavor. The Java Memory Model is an ambitious attempt at specifying the behavior of multithreaded programs in a portable, hardware agnostic, way. While experts have an intuitive grasp of the properties that the model should enjoy, the specification is complex and not well-suited for integration within a verifying compiler infrastructure. Moreover, the specification is given in an axiomatic style that is distant from the intuitive reordering-based reasonings traditionally used to justify or rule out behaviors, and ill suited to the kind of operational reasoning one would expect to employ in a compiler. This paper takes a step back, and introduces a Buffered Memory Model (BMM) for Java. We choose a pragmatic point in the design space sacrificing generality in favor of a model that is fully characterized in terms of the reorderings it allows, amenable to formal reasoning, and which can be efficiently applied to a specific hardware family, namely x86 multiprocessors. Although the BMM restricts the reorderings compilers are allowed to perform, it serves as the key enabling device to achieving a verification pathway from bytecode to machine instructions. Despite its restrictions, we show that it is backwards compatible with the Java Memory Model and that it does not cripple performance on TSO architectures.

Similar Papers
  • PDF
  • Research Article
  • Citations20

A formalization of Java’s concurrent access modes

  • Oct 10, 2019
  • Proceedings of the ACM on Programming Languages
  • John Bender +1
  • Conference Article
  • Citations140

Fixing the Java memory model

  • Jun 01, 1999
  • William Pugh
  • Conference Article
  • Citations70

Runtime optimizations for a Java DSM implementation

  • Jun 01, 2001
  • R Veldema +3
  • Conference Article
  • Citations4

JDMM

  • Jun 12, 2014
  • Foivos S Zakkak +1
  • Research Article
  • Citations83

The Java memory model is fatally flawed

  • Jan 01, 2000
  • Concurrency: Practice and Experience
  • William Pugh
  • Book Chapter
  • Citations23

Memory-Model-Sensitive Data Race Analysis

  • Jan 01, 2004
  • Yue Yang +2
  • Conference Article
  • Citations1

DiSquawk

  • Aug 29, 2016
  • Foivos S Zakkak +1
  • Research Article
  • Citations47

Goldilocks

  • Jun 10, 2007
  • ACM SIGPLAN Notices
  • Tayfun Elmas +2
  • Research Article
  • Citations43

HRF-Relaxed

  • Apr 16, 2015
  • ACM Transactions on Architecture and Code Optimization
  • Benedict R Gaster +2
  • Research Article
  • Citations14

Categorical model of structural operational semantics for imperative language

  • Dec 09, 2016
  • Journal of information and organizational sciences
  • William Steingartner +1
  • Research Article
  • Citations32

RCDC

  • Mar 05, 2011
  • ACM SIGPLAN Notices
  • Joseph Devietti +4
  • Conference Article

Recent advances in verification, equivalence checking & SAT solvers

  • May 25, 2003
  • R Dreschler +1
  • Conference Article
  • Citations33

Transformational programming

  • Jan 01, 1983
  • Robert Paige
  • Peer Review Report

Editor's evaluation: Complex plumages spur rapid color diversification in kingfishers (Aves: Alcedinidae)

  • Dec 02, 2022
  • Kaspar Delhey
  • Book Chapter
  • Citations47

Generative Operational Semantics for Relaxed Memory Models

  • Jan 01, 2010
  • Radha Jagadeesan +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.