scientific article; zbMATH DE number 7577571
From MaRDI portal
Publication:5101340
Brijesh Dongol, Simon Doherty, Gerhard Schellhorn, John Derrick, Eleni Bila, Heike Wehrheim
Publication date: 30 August 2022
Full work available at URL: https://arxiv.org/abs/2011.15013
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Towards formally specifying and verifying transactional memory
- Forward and backward simulations. I. Untimed Systems
- Verifying correctness of persistent concurrent data structures: a sound and complete method
- A Framework for Formally Verifying Software Transactional Memory Algorithms
- Transactional Mutex Locks
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
- Data Refinement
- Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory
- Modularising Opacity Verification for Hybrid Transactional Memory
- Proving Opacity via Linearizability: A Sound and Complete Method
- Verifying Opacity of a Transactional Mutex Lock
- Robust Shared Objects for Non-Volatile Main Memory