Non-interference and local correctness in transactional memory

DOI10.1016/j.tcs.2016.06.021zbMath1371.68052OpenAlexW2442252798MaRDI QIDQ2357153

Petr Kuznetsov, Sathya Peri

Publication date: 19 June 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.06.021

zbMATH Keywords

permissivenessopacitynon-interferencecorrectness criterionsoftware transactional memory

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

An efficient approach to achieve compositionality using optimized multi-version object based transactional systems

Uses Software

• NOrec

Cites Work

• Inherent limitations on disjoint-access parallel implementations of transactional memory
• Defining liveness
• A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition
• Permissiveness in Transactional Memories
• The serializability of concurrent database updates
• A theory of reliability in database systems
• Disjoint-access-parallel implementations of strong shared memory primitives