scientific article
From MaRDI portal
Publication:3130550
DOI10.23638/LMCS-14(1:9)2018zbMath1459.68038arXiv1701.08682MaRDI QIDQ3130550
Tuan Phong Ngo, Mohamed Faouzi Atig, Ahmed Bouajjani, Parosh Aziz Abdulla
Publication date: 23 January 2018
Full work available at URL: https://arxiv.org/abs/1701.08682
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (2)
Unifying Operational Weak Memory Verification: An Axiomatic Approach ⋮ Probabilistic total store ordering
Cites Work
- Effective abstractions for verification under relaxed memory models
- Stateless model checking for TSO and PSO
- Explaining relaxed memory models with program transformations
- What’s Decidable about Weak Memory Models?
- Counter-Example Guided Fence Insertion under TSO
- Well (and Better) Quasi-Ordered Transition Systems
- Verification of Concurrent Programs on Weak Memory Models
- Owicki-Gries Reasoning for Weak Memory Models
- Effective Program Verification for Relaxed Memory Models
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
- The Benefits of Duality in Verifying Concurrent Programs under TSO
- Robustness against Power is PSpace-complete
- On the verification problem for weak memory models
- Software Verification for Weak Memory via Program Transformation
- Checking and Enforcing Robustness against TSO
- Ordering by Divisibility in Abstract Algebras
- Well-structured transition systems everywhere!
This page was built for publication:
