Communicating State Transition Systems for Fine-Grained Concurrent Resources

DOI10.1007/978-3-642-54833-8_16zbMath1405.68219OpenAlexW143008620MaRDI QIDQ5410705

Ruy Ley-Wild, Germán Andrés Delbianco, Aleksandar Nanevski, Ilya Sergey

Publication date: 16 April 2014

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

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

Mathematics Subject Classification ID

Related Items (14)

Aneris: A Mechanised Logic for Modular Reasoning about Distributed Systems ⋮ Deductive synthesis of programs with pointers: techniques, challenges, opportunities (invited paper) ⋮ Caper ⋮ Verifying Concurrent Graph Algorithms ⋮ Improving thread-modular abstract interpretation ⋮ A perspective on specifying and verifying concurrent modules ⋮ Concise outlines for a complex logic: a proof outline checker for TaDA ⋮ A fine-grained semantics for arrays and pointers under weak memory models ⋮ Steps in modular specifications for concurrent modules (invited tutorial paper) ⋮ Iris from the ground up: A modular foundation for higher-order concurrent separation logic ⋮ A Higher-Order Logic for Concurrent Termination-Preserving Refinement ⋮ Abstract Specifications for Concurrent Maps ⋮ Unnamed Item ⋮ Correctness and concurrent complexity of the black-white bakery algorithm

Uses Software

• Coq

This page was built for publication: Communicating State Transition Systems for Fine-Grained Concurrent Resources