Tractable Refinement Checking for Concurrent Objects
From MaRDI portal
Publication:2819855
DOI10.1145/2676726.2677002zbMath1345.68096OpenAlexW2089775579MaRDI QIDQ2819855
Michael Emmi, Ahmed Bouajjani, Constantin Enea, Jad Hamza
Publication date: 29 September 2016
Published in: Proceedings of the 42nd 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/2676726.2677002
Logic in computer science (03B70) Approximation algorithms (68W25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (10)
TSO-to-TSO linearizability is undecidable ⋮ On reducing linearizability to state reachability ⋮ Decidability and complexity for quiescent consistency and its variations ⋮ Relating trace refinement and linearizability ⋮ Quantifiability: a concurrent correctness condition modeled in vector space ⋮ Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability ⋮ Concurrent correctness in vector space ⋮ Actor-based model checking for software-defined networks ⋮ SDN-actors: modeling and verification of SDN programs ⋮ Unnamed Item
This page was built for publication: Tractable Refinement Checking for Concurrent Objects
