Java and the Java Memory Model — A Unified, Machine-Checked Formalisation
From MaRDI portal
Publication:2892748
DOI10.1007/978-3-642-28869-2_25zbMath1352.68034OpenAlexW64027241MaRDI QIDQ2892748
Publication date: 22 June 2012
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-28869-2_25
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)
Related Items (10)
Mining the Archive of Formal Proofs ⋮ CoSMed: a confidentiality-verified social media platform ⋮ Mechanising a type-safe model of multithreaded Java with a verified compiler ⋮ Automatic refinement to efficient data structures: a comparison of two approaches ⋮ A formalized general theory of syntax with bindings ⋮ Unnamed Item ⋮ An operational happens-before memory model ⋮ A formalized general theory of syntax with bindings: extended version ⋮ CoCon: a conference management system with formally verified document confidentiality ⋮ CoSMed: A Confidentiality-Verified Social Media Platform
Uses Software
This page was built for publication: Java and the Java Memory Model — A Unified, Machine-Checked Formalisation
