Checking and Enforcing Robustness against TSO

DOI10.1007/978-3-642-37036-6_29zbMath1381.68039arXiv1208.6152OpenAlexW149053240MaRDI QIDQ5326306

Roland Meyer, Ahmed Bouajjani, Egor Derevenetc

Publication date: 5 August 2013

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.6152

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (12)

Unnamed Item ⋮ Stateless model checking for TSO and PSO ⋮ Decidability of liveness for concurrent objects on the TSO memory model ⋮ Parameterized model checking on the TSO weak memory model ⋮ Robustness Against Transactional Causal Consistency. ⋮ Checking robustness between weak transactional consistency models ⋮ Context-Bounded Analysis of TSO Systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ CCA-Secure Keyed-Fully Homomorphic Encryption ⋮ Unnamed Item ⋮ Linearizability on hardware weak memory models

This page was built for publication: Checking and Enforcing Robustness against TSO