Liveness-Preserving Atomicity Abstraction

DOI10.1007/978-3-642-22012-8_36zbMath1333.68198OpenAlexW2151448199MaRDI QIDQ3012940

Alexey Gotsman, Hongseok Yang

Publication date: 7 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22012-8_36

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

Balancing expressiveness in formal approaches to concurrency ⋮ Relating trace refinement and linearizability ⋮ Higher-order linearisability ⋮ Liveness-Preserving Atomicity Abstraction ⋮ Unnamed Item ⋮ Linearizability on hardware weak memory models

Uses Software

• Line-up

Cites Work

• Unnamed Item
• A scalable lock-free stack algorithm
• Splitting atoms safely
• Defining liveness
• Verification of concurrent programs: The automata-theoretic framework
• Liveness-Preserving Atomicity Abstraction
• Proving that programs eventually do something good
• Abstraction for Concurrent Objects
• Proving that non-blocking algorithms don't block
• Comparison Under Abstraction for Verifying Linearizability

This page was built for publication: Liveness-Preserving Atomicity Abstraction