Fan, HuaGolab, Wojciech2018-06-282018-06-282018-10-01https://doi.org/10.1016/j.ipl.2018.06.004http://hdl.handle.net/10012/13443The final publication is available at Elsevier via http://dx.doi.org/10.1016/j.ipl.2018.06.004 © 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/We consider an algorithmic problem related to analyzing consistency anomalies in distributed storage systems. Specifically, given a history of read, write, and read-modify-write operations applied by clients, we quantify how far the history deviates from the “gold standard” of linearizability (Herlihy and Wing, 1990). Our solution generalizes a known algorithm that considers reads and writes only.enAttribution-NonCommercial-NoDerivatives 4.0 InternationalDistributed systemsConsistencyLinearizabilityVerificationArticle