Decidability and Complexity for Quiescent Consistency
DOI10.1145/2933575.2933576zbMath1392.68295arXiv1511.08447OpenAlexW2511286235WikidataQ130957562 ScholiaQ130957562MaRDI QIDQ4635867
Brijesh Dongol, Robert M. Hierons
Publication date: 23 April 2018
Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.08447
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
This page was built for publication: Decidability and Complexity for Quiescent Consistency