Verifying correctness of persistent concurrent data structures
From MaRDI portal
Publication:6535948
DOI10.1007/978-3-030-30942-8_12zbMATH Open1539.68084MaRDI QIDQ6535948FDOQ6535948
Brijesh Dongol, Gerhard Schellhorn, Heike Wehrheim, Simon Doherty, John Derrick
Publication date: 14 March 2024
Data structures (68P05) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Forward and backward simulations. I. Untimed Systems
- An Integrated Specification and Verification Technique for Highly Concurrent Data Structures
- Tentative steps toward a development method for interfering programs
- Formal Techniques for Networked and Distributed Systems – FORTE 2004
- Making Linearizability Compositional for Partially Ordered Executions
- Library abstraction for C/C++ concurrency
- A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures
- Verification of Concurrent Programs on Weak Memory Models
- Proving Opacity of a Pessimistic {STM}
This page was built for publication: Verifying correctness of persistent concurrent data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535948)
