Fairness, Resources, and Separation

DOI10.1016/j.entcs.2010.08.011zbMath1342.68072OpenAlexW2016206252MaRDI QIDQ3178252

Stephen Brookes

Publication date: 8 July 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2010.08.011

zbMATH Keywords

fairnessdenotational semanticsconcurrencyshared memoryresourcesseparation logicfixed-point induction

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Concurrent Separation Logic and Operational Semantics ⋮ Symmetry in domination for hypergraphs with choice

Cites Work

• A model of concurrency with fair merge and full recursion
• Resources, concurrency, and local reasoning
• Semantics of finite and infinite networks of concurrent communicating agents
• Modeling concurrency with partial orders
• The expressive power of indeterminate dataflow primitives
• Full abstraction for a shared-variable parallel language
• A fixpoint semantics for nondeterministic data flow
• Proving Liveness Properties of Concurrent Programs
• Permission accounting in separation logic
• A generalized Kahn Principle for abstract asynchronous networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fairness, Resources, and Separation