Decomposable Relaxation for Concurrent Data Structures

DOI10.1007/978-3-319-51963-0_15zbMath1444.68064OpenAlexW2569058444MaRDI QIDQ2971134

Yi Lv, Chao Wang, Peng Wu

Publication date: 4 April 2017

Published in: SOFSEM 2017: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-51963-0_15

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Data structures (68P05)

Related Items (1)

Decomposable Relaxation for Concurrent Data Structures

Cites Work

• On reducing linearizability to state reachability
• Aspect-Oriented Linearizability Proofs
• Quantitative relaxation of concurrent data structures
• Decomposable Relaxation for Concurrent Data Structures
• Quasi-Linearizability is Undecidable
• Verifying Concurrent Programs against Sequential Specifications
• An Integrated Specification and Verification Technique for Highly Concurrent Data Structures

This page was built for publication: Decomposable Relaxation for Concurrent Data Structures