Subjective auxiliary state for coarse-grained concurrency

DOI10.1145/2429069.2429134zbMath1301.68102MaRDI QIDQ2931839

Aleksandar Nanevski, Ruy Ley-Wild

Publication date: 27 November 2014

Published in: Proceedings of the 40th 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/2429069.2429134

zbMATH Keywords

verification; concurrency; dependent type theory; local reasoning; rely-guarantee thinking

Mathematics Subject Classification ID

03B70: Logic in computer science

68Q55: Semantics in the theory of computing

68Q60: Specification and verification (program logics, model checking, etc.)

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

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

Related Items

Iris from the ground up: A modular foundation for higher-order concurrent separation logic, Unnamed Item, Aneris: A Mechanised Logic for Modular Reasoning about Distributed Systems, Connecting Higher-Order Separation Logic to a First-Order Outside World, Steps in modular specifications for concurrent modules (invited tutorial paper), A perspective on specifying and verifying concurrent modules, On the relation between concurrent separation logic and concurrent Kleene algebra, Tackling Real-Life Relaxed Concurrency with FSL++

Uses Software

• Coq