An Abort-Aware Model of Transactional Programming

DOI10.1007/978-3-540-93900-9_9MaRDI QIDQ3600465zbMATH OpenOpenAlexFDO

Authors Kousha Etessami, Patrice Godefroid

Publication date 10 February 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://www.pure.ed.ac.uk/ws/files/14009673/vmcai09_transactions_with_appendix.pdf

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Model checking transactional memories
• Towards formally specifying and verifying transactional memory
• scientific article; zbMATH DE number 7075928
• Transactional Memory: Glimmer of a Theory
• Non-interference and local correctness in transactional memory

Cited in

(1)

• Partial aborts for transactions via first-class continuations

Describes a project that uses

Uses Software

• Bebop

This page was built for publication: An Abort-Aware Model of Transactional Programming

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