{"file_date_updated":"2020-07-14T12:45:39Z","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"ddc":["000","004"],"publist_id":"4598","volume":8052,"intvolume":"      8052","year":"2013","conference":{"location":"Buenos Aires, Argentina","end_date":"2013-08-30","name":"CONCUR: Concurrency Theory","start_date":"2013-08-27"},"citation":{"ieee":"T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability proofs,” vol. 8052. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 242–256, 2013.","mla":"Henzinger, Thomas A., et al. <i>Aspect-Oriented Linearizability Proofs</i>. Vol. 8052, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 242–56, doi:<a href=\"https://doi.org/10.1007/978-3-642-40184-8_18\">10.1007/978-3-642-40184-8_18</a>.","short":"T.A. Henzinger, A. Sezgin, V. Vafeiadis, 8052 (2013) 242–256.","apa":"Henzinger, T. A., Sezgin, A., &#38; Vafeiadis, V. (2013). Aspect-oriented linearizability proofs. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentina: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-642-40184-8_18\">https://doi.org/10.1007/978-3-642-40184-8_18</a>","ista":"Henzinger TA, Sezgin A, Vafeiadis V. 2013. Aspect-oriented linearizability proofs. 8052, 242–256.","chicago":"Henzinger, Thomas A, Ali Sezgin, and Viktor Vafeiadis. “Aspect-Oriented Linearizability Proofs.” Lecture Notes in Computer Science. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40184-8_18\">https://doi.org/10.1007/978-3-642-40184-8_18</a>.","ama":"Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability proofs. 2013;8052:242-256. doi:<a href=\"https://doi.org/10.1007/978-3-642-40184-8_18\">10.1007/978-3-642-40184-8_18</a>"},"ec_funded":1,"_id":"2328","pubrep_id":"197","language":[{"iso":"eng"}],"has_accepted_license":"1","author":[{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"first_name":"Ali","last_name":"Sezgin","full_name":"Sezgin, Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Viktor","last_name":"Vafeiadis","full_name":"Vafeiadis, Viktor"}],"page":"242 - 256","doi":"10.1007/978-3-642-40184-8_18","status":"public","related_material":{"record":[{"relation":"later_version","id":"1832","status":"public"}]},"quality_controlled":"1","title":"Aspect-oriented linearizability proofs","alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:57:01Z","series_title":"Lecture Notes in Computer Science","oa_version":"Submitted Version","oa":1,"scopus_import":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2013-08-01T00:00:00Z","publication_status":"published","abstract":[{"lang":"eng","text":"Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on identifying 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.\r\nIn 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."}],"department":[{"_id":"ToHe"}],"day":"01","type":"conference","file":[{"date_created":"2018-12-12T10:08:58Z","file_size":337059,"file_id":"4721","date_updated":"2020-07-14T12:45:39Z","file_name":"IST-2014-197-v1+1_main-queue-verification.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","relation":"main_file","checksum":"bdbb520de91751fe0136309ad4ef67e4"}],"date_updated":"2023-02-23T10:16:27Z","month":"08"}