AtomCaml: first-class atomicity via rollback

DOI10.1145/1086365.1086378zbMATH Open1302.68052OpenAlexW2119964141WikidataQ131124997 ScholiaQ131124997MaRDI QIDQ2936772FDOQ2936772

Authors: Michael F. Ringenburg, Dan Grossman 

Publication date: 6 January 2015

Published in: Proceedings of the tenth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1086365.1086378

Recommendations

• Software transactional memory
• Exceptions and side-effects in atomic blocks
• A Concurrent Calculus with Atomic Transactions
• A criterion for atomicity
• Verifying atomic data types

zbMATH Keywords

atomicityconcurrent programmingtransactionsObjective Caml

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cited In (8)

• A formal semantics of nested atomic sections with thread escape
• Transactional events
• Title not available (Why is that?)
• Exceptions and side-effects in atomic blocks
• Title not available (Why is that?)
• AtomCaml
• Proving opacity of transactional memory with early release
• Last-use opacity: a strong safety property for transactional memory with prerelease support

Uses Software

• OCaml
• Atomizer
• PLAN
• Guava

This page was built for publication: AtomCaml: first-class atomicity via rollback

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936772)