A program logic for concurrent objects under fair scheduling

DOI10.1145/2837614.2837635zbMath1347.68087OpenAlexW2236913981MaRDI QIDQ2828283

Xinyu Feng, Hongjin Liang

Publication date: 24 October 2016

Published in: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2837614.2837635

zbMATH Keywords

progressrefinementconcurrencyprogram logicrely-guarantee reasoning

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) 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 (5)

Ghost signals: verifying termination of busy waiting ⋮ A Higher-Order Logic for Concurrent Termination-Preserving Refinement ⋮ Actor-based model checking for software-defined networks ⋮ SDN-actors: modeling and verification of SDN programs ⋮ Towards a Thread-Local Proof Technique for Starvation Freedom

This page was built for publication: A program logic for concurrent objects under fair scheduling