Deciding Robustness against Total Store Ordering

DOI10.1007/978-3-642-22012-8_34zbMath1333.68082OpenAlexW1913137593MaRDI QIDQ3012938

Eike Möhlmann, Ahmed Bouajjani, Roland Meyer

Publication date: 7 July 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-22012-8_34

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (6)

Unnamed Item ⋮ Tackling Real-Life Relaxed Concurrency with FSL++ ⋮ Robustness Against Transactional Causal Consistency. ⋮ Checking robustness between weak transactional consistency models ⋮ Context-Bounded Analysis of TSO Systems ⋮ Linearizability on hardware weak memory models

Uses Software

• Checkfence

Cites Work

• Model-checking of correctness conditions for concurrent objects
• Sound and Complete Monitoring of Sequential Consistency for Relaxed Memory Models
• Effective Program Verification for Relaxed Memory Models
• The complexity of propositional linear temporal logics
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Testing Shared Memories
• On the verification problem for weak memory models

This page was built for publication: Deciding Robustness against Total Store Ordering