scientific article; zbMATH DE number 7561275
From MaRDI portal
Publication:5090915
DOI10.4230/LIPIcs.DISC.2018.23zbMath1497.68141arXiv1805.03992MaRDI QIDQ5090915
Adam Morrison, Noam Rinetzky, Yotam M. Y. Feldman, Constantin Enea, Sharon Shoham
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1805.03992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
verificationsynchronizationformal methodsconcurrencyconcurrent data structuresoptimistic concurrency controllineariazability
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Data structures (68P05)
Cites Work
- Unnamed Item
- On reducing linearizability to state reachability
- A constructive approach for proving data structures' linearizability
- \textsc{Poling}: SMT aided linearizability proofs
- Proving linearizability using forward simulations
- Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity
- Iris
- Aspect-Oriented Linearizability Proofs
- Subjective auxiliary state for coarse-grained concurrency
- The topological structure of asynchronous computability
- Modular verification of a non-blocking stack
- Shape-Value Abstraction for Verifying Linearizability
- Verifying properties of parallel programs
- A Fast Contention-Friendly Binary Search Tree
- Concurrent search structure algorithms
- Pragmatic primitives for non-blocking data structures
- Verifying linearizability with hindsight
- Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency
- Permission accounting in separation logic
- CONCUR 2004 - Concurrency Theory
- CONCUR 2004 - Concurrency Theory
- Verifying Concurrent Programs against Sequential Specifications
- An Integrated Specification and Verification Technique for Highly Concurrent Data Structures
- A Simple Optimistic Skiplist Algorithm
- Comparison Under Abstraction for Verifying Linearizability
This page was built for publication: