On the verification problem for weak memory models

DOI10.1145/1706299.1706303zbMath1312.68050OpenAlexW1971332773MaRDI QIDQ5255057

Ahmed Bouajjani, Sebastian Burckhardt, Mohamed Faouzi Atig, Madanlal Musuvathi

Publication date: 11 June 2015

Published in: Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

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

zbMATH Keywords

program verificationinfinite state systemsrelaxed memory modelslossy channel systems

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical problems of computer architecture (68M07) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

TSO-to-TSO linearizability is undecidable ⋮ Static analysis of embedded real-time concurrent software with dynamic priorities ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Parallelized sequential composition and hardware weak memory models ⋮ Precise Thread-Modular Abstract Interpretation of Concurrent Programs Using Relational Interference Abstractions ⋮ Probabilistic total store ordering ⋮ Decidability of liveness for concurrent objects on the TSO memory model ⋮ Unnamed Item ⋮ Static Analysis of Run-Time Errors in Embedded Critical Parallel C Programs ⋮ Sound and Complete Monitoring of Sequential Consistency for Relaxed Memory Models ⋮ The decidability of verification under PS 2.0 ⋮ Checking robustness between weak transactional consistency models ⋮ Deciding Robustness against Total Store Ordering ⋮ Context-Bounded Analysis of TSO Systems ⋮ Unnamed Item ⋮ Complexity Hierarchies beyond Elementary ⋮ Studying Operational Models of Relaxed Concurrency

This page was built for publication: On the verification problem for weak memory models