{"publication":"Logical Methods in Computer Science","pubrep_id":"390","quality_controlled":"1","date_published":"2015-04-01T00:00:00Z","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"}],"day":"01","status":"public","ec_funded":1,"citation":{"short":"S. Chakraborty, T.A. Henzinger, A. Sezgin, V. Vafeiadis, Logical Methods in Computer Science 11 (2015).","apa":"Chakraborty, S., Henzinger, T. A., Sezgin, A., &#38; Vafeiadis, V. (2015). Aspect-oriented linearizability proofs. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-11(1:20)2015\">https://doi.org/10.2168/LMCS-11(1:20)2015</a>","ista":"Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. 2015. Aspect-oriented linearizability proofs. Logical Methods in Computer Science. 11(1), 20.","mla":"Chakraborty, Soham, et al. “Aspect-Oriented Linearizability Proofs.” <i>Logical Methods in Computer Science</i>, vol. 11, no. 1, 20, International Federation of Computational Logic, 2015, doi:<a href=\"https://doi.org/10.2168/LMCS-11(1:20)2015\">10.2168/LMCS-11(1:20)2015</a>.","chicago":"Chakraborty, Soham, Thomas A Henzinger, Ali Sezgin, and Viktor Vafeiadis. “Aspect-Oriented Linearizability Proofs.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2015. <a href=\"https://doi.org/10.2168/LMCS-11(1:20)2015\">https://doi.org/10.2168/LMCS-11(1:20)2015</a>.","ama":"Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability proofs. <i>Logical Methods in Computer Science</i>. 2015;11(1). doi:<a href=\"https://doi.org/10.2168/LMCS-11(1:20)2015\">10.2168/LMCS-11(1:20)2015</a>","ieee":"S. Chakraborty, T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability proofs,” <i>Logical Methods in Computer Science</i>, vol. 11, no. 1. International Federation of Computational Logic, 2015."},"doi":"10.2168/LMCS-11(1:20)2015","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:45:17Z","publisher":"International Federation of Computational Logic","publist_id":"5271","abstract":[{"text":"Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on the identification of the so-called linearization points. Regrettably, such proofs, whether manual or automatic, are often complicated and scale poorly to advanced non-blocking concurrency patterns, such as helping and optimistic updates. In response, we propose a more modular way of checking linearizability of concurrent queue algorithms that does not involve identifying linearization points. We reduce the task of proving linearizability with respect to the queue specification to establishing four basic properties, each of which can be proved independently by simpler arguments. As a demonstration of our approach, we verify the Herlihy and Wing queue, an algorithm that is challenging to verify by a simulation proof. ","lang":"eng"}],"related_material":{"record":[{"status":"public","id":"2328","relation":"earlier_version"}]},"article_processing_charge":"No","language":[{"iso":"eng"}],"issue":"1","date_created":"2018-12-11T11:54:15Z","month":"04","date_updated":"2023-02-23T10:38:13Z","volume":11,"title":"Aspect-oriented linearizability proofs","_id":"1832","department":[{"_id":"ToHe"}],"author":[{"first_name":"Soham","full_name":"Chakraborty, Soham","last_name":"Chakraborty"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Ali","last_name":"Sezgin","full_name":"Sezgin, Ali"},{"first_name":"Viktor","last_name":"Vafeiadis","full_name":"Vafeiadis, Viktor"}],"ddc":["000"],"article_number":"20","year":"2015","type":"journal_article","license":"https://creativecommons.org/licenses/by-nd/4.0/","oa_version":"Published Version","oa":1,"publication_status":"published","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)"},"file":[{"checksum":"7370e164d0a731f442424a92669efc34","file_size":380203,"access_level":"open_access","creator":"system","date_updated":"2020-07-14T12:45:17Z","file_id":"4881","relation":"main_file","file_name":"IST-2015-390-v1+1_1502.07639.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:11:27Z"}],"intvolume":"        11","has_accepted_license":"1"}