{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T17:11:58Z","timestamp":1693847518282},"reference-count":20,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3619,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s1571-0661(05)80006-4","type":"journal-article","created":{"date-parts":[[2005,5,20]],"date-time":"2005-05-20T13:21:17Z","timestamp":1116595277000},"page":"450-463","source":"Crossref","is-referenced-by-count":15,"title":["Automatically Verifying Concurrent Queue Algorithms"],"prefix":"10.1016","volume":"89","author":[{"given":"Eran","family":"Yahav","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mooly","family":"Sagiv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80006-4_BIB1","article-title":"Verification of infinite-state systems by combining abstraction and reachability analysis","author":"Abdulla","year":"1633","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/S1571-0661(05)80006-4_BIB2","series-title":"LFM 2000: Fifth NASA Langley Formal Methods Workshop","first-page":"187","article-title":"An overview of SAL","author":"Bensalem","year":"2000"},{"key":"10.1016\/S1571-0661(05)80006-4_BIB3","article-title":"InVeSt: A tool for the verification of invariants","volume":"1427","author":"Bensalem","year":"1998","journal-title":"LNCS"},{"key":"10.1016\/S1571-0661(05)80006-4_BIB4","series-title":"POPL","first-page":"269","article-title":"Systematic design of program analysis frameworks","author":"Cousot","year":"1979"},{"key":"10.1016\/S1571-0661(05)80006-4_BIB5","series-title":"11th Int. Conf. on Computer-Aided Verification.","article-title":"Experience with predicate abstraction","author":"Das","year":"1999"},{"key":"10.1016\/S1571-0661(05)80006-4_BIB6","series-title":"Proc. Static Analysis Symposium","article-title":"Typestate verification: Abstraction techniques and complexity results","author":"Field","year":"2003"},{"key":"10.1016\/S1571-0661(05)80006-4_BIB7","first-page":"72","article-title":"Construction of abstract state graphs with PVS","volume":"1254","author":"Graf","year":"1997","journal-title":"LNCS"},{"key":"10.1016\/S1571-0661(05)80006-4_BIB8","series-title":"Program Flow Analysis: Theory and Applications, chapter 4","first-page":"102","article-title":"Flow analysis and optimization of Lisp-like structures","author":"Jones","year":"1981"},{"key":"10.1016\/S1571-0661(05)80006-4_BIB9","series-title":"Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing (PODC '96)","first-page":"267","article-title":"Simple, fast, and practical non-blocking and blocking concurrent queue algorithms","author":"Michael","year":"1996"},{"key":"10.1016\/S1571-0661(05)80006-4_BIB10","series-title":"Proceedings of the 1991 International Conference on Parallel Processing","first-page":"68","article-title":"A non-blocking algorithm for shared queues using Compare-and-Swap","author":"Prakash","year":"1991"},{"key":"10.1016\/S1571-0661(05)80006-4_BIB11","series-title":"Proc. European Symp. on Programming","article-title":"Finite differencing of logical formulas for static analysis","author":"Reps","year":"2003"},{"issue":"3","key":"10.1016\/S1571-0661(05)80006-4_BIB12","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1145\/514188.514190","article-title":"Parametric shape analysis via 3-valued logic","volume":"24","author":"Sagiv","year":"2002","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"10.1016\/S1571-0661(05)80006-4_BIB13","series-title":"Proceedings of the 7th International Static Analysis Symposium (SAS '00)","article-title":"Model checking guided abstraction and analysis","author":"Saidi","year":"2000"},{"key":"10.1016\/S1571-0661(05)80006-4_BIB14","series-title":"Proceedings of Supercomputing '90","first-page":"495","article-title":"A simple and correct shared-queue algorithm using Compare-and-Swap","author":"Stone","year":"1990"},{"key":"10.1016\/S1571-0661(05)80006-4_BIB15","series-title":"Parallel and Distributed Computing in Engineering Systems","first-page":"147","article-title":"A non-blocking Compare-and-Swap algorithm for a shared circular queue","author":"Stone","year":"1992"},{"key":"10.1016\/S1571-0661(05)80006-4_BIB16","series-title":"Proc. of the 10th Annual ACM Symposium on Principles of Programming Lanuages","first-page":"276","article-title":"Mechanisms for compile-time enforcement of security","author":"Strom","year":"1983"},{"issue":"1","key":"10.1016\/S1571-0661(05)80006-4_BIB17","first-page":"157","article-title":"Typestate: A programming language concept for enhancing software reliability","volume":"SE-12","author":"Strom","year":"1986","journal-title":"tose"},{"key":"10.1016\/S1571-0661(05)80006-4_BIB18","article-title":"A library of concurrent objects and their proofs of correctness","author":"Wing","year":"1990","journal-title":"Technical Report CMU-CS-90\u2013151, Carnegie-Mellon University"},{"key":"10.1016\/S1571-0661(05)80006-4_BIB19","unstructured":"E. Yahav. http:\/\/www.cs.tau.ac.il\/~yahave."},{"key":"10.1016\/S1571-0661(05)80006-4_BIB20","series-title":"Proc. of 27th POPL","first-page":"27","article-title":"Verifying safety properties of concurrent Java programs using 3-valued logic","author":"Yahav","year":"2001"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105800064?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105800064?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T10:50:27Z","timestamp":1548499827000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105800064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S1571066105800064"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80006-4","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}