{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:19Z","timestamp":1750307719311,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,7,19]],"date-time":"2009-07-19T00:00:00Z","timestamp":1247961600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,7,19]]},"DOI":"10.1145\/1639622.1639632","type":"proceedings-article","created":{"date-parts":[[2009,10,27]],"date-time":"2009-10-27T13:27:28Z","timestamp":1256650048000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["An annotation assistant for interactive debugging of programs with common synchronization idioms"],"prefix":"10.1145","author":[{"given":"Tayfun","family":"Elmas","sequence":"first","affiliation":[{"name":"Ko\u00e7 University, \u0130stanbul, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Sezgin","sequence":"additional","affiliation":[{"name":"Ko\u00e7 University, \u0130stanbul, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serdar","family":"Tasiran","sequence":"additional","affiliation":[{"name":"Ko\u00e7 University, \u0130stanbul, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaz","family":"Qadeer","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,7,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11804192_17"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"L. M.\n      de Moura\n     and \n      N.\n      Bjrner\n  . \n  Z3: An efficient smt solver\n  . In C. R. Ramakrishnan and J. Rehof editors TACAS volume \n  4963\n   of \n  Lecture Notes in Computer Science pages \n  337\n  --\n  340\n  . \n  Springer 2008\n  .   L. M. de Moura and N. Bjrner. Z3: An efficient smt solver. In C. R. Ramakrishnan and J. Rehof editors TACAS volume 4963 of Lecture Notes in Computer Science pages 337--340. Springer 2008.","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480885"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.12.006"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/647540.730008"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512558"},{"key":"e_1_3_2_1_8_1","first-page":"89","article-title":"Transactions for software model checking","author":"Flanagan C.","year":"2003","unstructured":"C. Flanagan and S. Qadeer . Transactions for software model checking . Electronic Notes in Theoretical Computer Science , 89 , 2003 . C. Flanagan and S. Qadeer. Transactions for software model checking. Electronic Notes in Theoretical Computer Science, 89, 2003.","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/604174.604176"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.1993.21"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/361227.361234"},{"key":"e_1_3_2_1_12_1","first-page":"8","volume-title":"OSDI '04: Proceedings of the 6th conference on Symposium on Opearting Systems Design&amp;Implementation","author":"MacCormick J.","year":"2004","unstructured":"J. MacCormick , N. Murphy , M. Najork , C. A. Thekkath , and L. Zhou . Boxwood: abstractions as the foundation for storage infrastructure . In OSDI '04: Proceedings of the 6th conference on Symposium on Opearting Systems Design&amp;Implementation , pages 8 -- 8 , Berkeley, CA, USA , 2004 . USENIX Association. J. MacCormick, N. Murphy, M. Najork, C. A. Thekkath, and L. Zhou. Boxwood: abstractions as the foundation for storage infrastructure. In OSDI '04: Proceedings of the 6th conference on Symposium on Opearting Systems Design&amp;Implementation, pages 8--8, Berkeley, CA, USA, 2004. USENIX Association."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248106"},{"key":"e_1_3_2_1_14_1","volume-title":"C++ Network Programming: Resolving Complexity Using Ace and Patterns (C++ in-Depth Series)","author":"Schmidt D. C.","year":"2001","unstructured":"D. C. Schmidt and S. D. Huston . C++ Network Programming: Resolving Complexity Using Ace and Patterns (C++ in-Depth Series) . Addison-Wesley Longman Publishing Co., Inc. , Boston, MA, USA , 2001 . D. C. Schmidt and S. D. Huston. C++ Network Programming: Resolving Complexity Using Ace and Patterns (C++ in-Depth Series). Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2001."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/504282.504288"},{"key":"e_1_3_2_1_16_1","volume-title":"Automatically verifying concurrent queue algorithms. Electr. Notes Theor. Comput. Sci., 89(3)","author":"Yahav E.","year":"2003","unstructured":"E. Yahav and S. Sagiv . Automatically verifying concurrent queue algorithms. Electr. Notes Theor. Comput. Sci., 89(3) , 2003 . E. Yahav and S. Sagiv. Automatically verifying concurrent queue algorithms. Electr. Notes Theor. Comput. Sci., 89(3), 2003."}],"event":{"name":"ISSTA '09: International Symposium on Software Testing and Analysis","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGSOFT ACM Special Interest Group on Software Engineering"],"location":"Chicago Illinois","acronym":"ISSTA '09"},"container-title":["Proceedings of the 7th Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1639622.1639632","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1639622.1639632","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:28Z","timestamp":1750253428000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1639622.1639632"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,19]]},"references-count":15,"alternative-id":["10.1145\/1639622.1639632","10.1145\/1639622"],"URL":"https:\/\/doi.org\/10.1145\/1639622.1639632","relation":{},"subject":[],"published":{"date-parts":[[2009,7,19]]},"assertion":[{"value":"2009-07-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}