Characterizing progress properties of concurrent objects via contextual refinements

DOI10.1007/978-3-642-40184-8_17MaRDI QIDQ2842110zbMATH OpenOpenAlexFDO

Authors Hongjin Liang, Jan Hoffmann, Xinyu Feng, Zhong Shao

Publication date 12 August 2013

Published in CONCUR 2013 – Concurrency Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• A program logic for concurrent objects under fair scheduling
• Abstraction for concurrent objects
• Abstraction for Concurrent Objects
• Proving Linearizability Via Non-atomic Refinement
• A foundation for modular reasoning about safety and progress properties of state-based concurrent programs

Cited in

(3)

• Progress assumption in concurrent systems
• A program logic for concurrent objects under fair scheduling
• Decidability of liveness for concurrent objects on the TSO memory model

This page was built for publication: Characterizing progress properties of concurrent objects via contextual refinements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842110)