A program logic for concurrent objects under fair scheduling
From MaRDI portal
Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
- Towards a thread-local proof technique for starvation freedom
- Characterizing progress properties of concurrent objects via contextual refinements
- Starling: lightweight concurrency verification with views
- Modular verification of concurrency-aware linearizability
- Checking linearizability of concurrent priority queues
Cited in
(14)- Actor-based model checking for software-defined networks
- SDN-actors: modeling and verification of SDN programs
- Starling: lightweight concurrency verification with views
- Starvation-free monitors
- Towards a thread-local proof technique for starvation freedom
- Characterizing progress properties of concurrent objects via contextual refinements
- A higher-order logic for concurrent termination-preserving refinement
- Modular Schedulability Analysis of Concurrent Objects in Creol
- scientific article; zbMATH DE number 7362744 (Why is no real title available?)
- Specifying and reasoning about shared-variable concurrency
- A rely-guarantee-based simulation for cooperative semantics
- A compositional theory of linearizability
- Promptness and bounded fairness in concurrent and parameterized systems
- Ghost signals: verifying termination of busy waiting
This page was built for publication: A program logic for concurrent objects under fair scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828283)
