{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:18Z","timestamp":1772164038542,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,10,29]],"date-time":"2013-10-29T00:00:00Z","timestamp":1383004800000},"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":[[2013,10,29]]},"DOI":"10.1145\/2509136.2509556","type":"proceedings-article","created":{"date-parts":[[2013,10,23]],"date-time":"2013-10-23T11:29:17Z","timestamp":1382527757000},"page":"833-848","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["Bounded partial-order reduction"],"prefix":"10.1145","author":[{"given":"Katherine E.","family":"Coons","sequence":"first","affiliation":[{"name":"University of Texas at Austin, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Madan","family":"Musuvathi","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kathryn S.","family":"McKinley","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA & University of Texas at Austin, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,10,29]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"226","volume-title":"Distributed Computing","volume":"2","author":"Apt K. R.","year":"1988","unstructured":"Apt , K. R. , Francez , N. , and Katz , S . Appraising fairness in languages for distributed programming . In Distributed Computing ( 1988 ), vol. 2 , pp. 226 -- 241 . Apt, K. R., Francez, N., and Katz, S. Appraising fairness in languages for distributed programming. In Distributed Computing (1988), vol. 2, pp. 226--241."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2509136.2509556"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:FORM.0000040028.49845.67"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926432"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040315"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/547238"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/263699.263717"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/647762.735513"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90054-J"},{"key":"e_1_3_2_2_11_1","first-page":"279","volume-title":"Advances in Petri nets","author":"Mazurkiewicz A.","year":"1986","unstructured":"Mazurkiewicz , A. Trace theory . In Advances in Petri nets 1986 , part II on Petri nets: Applications and relationships to other models of concurrency (1986), Springer-Verlag , pp. 279 -- 324 . Mazurkiewicz, A. Trace theory. In Advances in Petri nets 1986, part II on Petri nets: Applications and relationships to other models of concurrency (1986), Springer-Verlag, pp. 279--324."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250785"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375625"},{"key":"e_1_3_2_2_15_1","volume-title":"USENIX Symposium on Operating Systems Design and Implementation","author":"Musuvathi M.","year":"2009","unstructured":"Musuvathi , M. , Qadeer , S. , Ball , T. , Basler , G. , Nainar , A. , and Neamtiu , I . Finding and reproducing heisenbugs in concurrent programs . In USENIX Symposium on Operating Systems Design and Implementation ( 2009 ). Musuvathi, M., Qadeer, S., Ball, T., Basler, G., Nainar, A., and Neamtiu, I. Finding and reproducing heisenbugs in concurrent programs. In USENIX Symposium on Operating Systems Design and Implementation (2009)."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/647759.735025"},{"key":"e_1_3_2_2_18_1","first-page":"3","author":"Visser W.","year":"2000","unstructured":"Visser , W. , Havelund , K. , Brat , G. , and Park , S. Model checking programs. In Automated Softeware Engineering Journal ( 2000 ), pp. 3 -- 12 . Visser, W., Havelund, K., Brat, G., and Park, S. Model checking programs. In Automated Softeware Engineering Journal (2000), pp. 3--12.","journal-title":"Automated Softeware Engineering Journal ("}],"event":{"name":"SPLASH '13: Conference on Systems, Programming, and Applications: Software for Humanity","location":"Indianapolis Indiana USA","acronym":"SPLASH '13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2509136.2509556","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2509136.2509556","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:28:34Z","timestamp":1750217314000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2509136.2509556"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,29]]},"references-count":15,"alternative-id":["10.1145\/2509136.2509556","10.1145\/2509136"],"URL":"https:\/\/doi.org\/10.1145\/2509136.2509556","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2544173.2509556","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,10,29]]},"assertion":[{"value":"2013-10-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}