{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:31Z","timestamp":1772164051792,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,1,14]],"date-time":"2015-01-14T00:00:00Z","timestamp":1421193600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["S11402-N23"],"award-info":[{"award-number":["S11402-N23"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["267989"],"award-info":[{"award-number":["267989"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,1,14]]},"DOI":"10.1145\/2676726.2677008","type":"proceedings-article","created":{"date-parts":[[2014,12,19]],"date-time":"2014-12-19T08:51:05Z","timestamp":1418979065000},"page":"433-444","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Succinct Representation of Concurrent Trace Sets"],"prefix":"10.1145","author":[{"given":"Ashutosh","family":"Gupta","sequence":"first","affiliation":[{"name":"IST Austria, Klosterneuburg, Austria"}]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[{"name":"IST Austria, Klosterneuburg, Austria"}]},{"given":"Arjun","family":"Radhakrishna","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]},{"given":"Roopsha","family":"Samanta","sequence":"additional","affiliation":[{"name":"IST Austria, Klosterneuburg, Austria"}]},{"given":"Thorsten","family":"Tarrach","sequence":"additional","affiliation":[{"name":"IST Austria, Klosterneuburg, Austria"}]}],"member":"320","published-online":{"date-parts":[[2015,1,14]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2958031.2958099"},{"key":"e_1_3_2_2_2_1","first-page":"79","volume-title":"FORTE","author":"Basu S.","year":"2003","unstructured":"S. Basu , D. Saha , Y. Lin , and S. Smolka . Generation of all counter-examples for push-down systems . In FORTE , pages 79 -- 94 . 2003 . S. Basu, D. Saha, Y. Lin, and S. Smolka. Generation of all counter-examples for push-down systems. In FORTE, pages 79--94. 2003."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54862-8_25"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250769"},{"key":"e_1_3_2_2_5_1","first-page":"184","volume-title":"CAV","author":"Beyer D.","year":"2011","unstructured":"D. Beyer and E. Keremoglu . CPACHECKER: A tool for configurable software verification . In CAV , pages 184 -- 190 , 2011 . http:\/\/cpachecker.sosy-lab.org\/. D. Beyer and E. Keremoglu. CPACHECKER: A tool for configurable software verification. In CAV, pages 184--190, 2011. http:\/\/cpachecker.sosy-lab.org\/."},{"key":"e_1_3_2_2_6_1","first-page":"156","volume-title":"DATE","author":"Bjesse P.","year":"2004","unstructured":"P. Bjesse and J. Kukula . Using counter example guided abstraction refinement to find complex bugs . In DATE , pages 156 -- 161 , 2004 . P. Bjesse and J. Kukula. Using counter example guided abstraction refinement to find complex bugs. In DATE, pages 156--161, 2004."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38856-9_8"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2958031.2958070"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_38"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375619"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24730-2_15"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31980-1_40"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0025774"},{"key":"e_1_3_2_2_14_1","first-page":"154","volume-title":"CAV","author":"Clarke E. M.","year":"2000","unstructured":"E. M. Clarke , O. Grumberg , S. Jha , Y. Lu , and H. Veith . Counterexample-guided abstraction refinement . In CAV , pages 154 -- 169 , 2000 . E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In CAV, pages 154--169, 2000."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_3_2_2_16_1","first-page":"356","volume-title":"CAV","author":"Donaldson A.","year":"2011","unstructured":"A. Donaldson , A. Kaiser , D. Kroening , and T. Wahl . Symmetry-aware predicate abstraction for shared-variable concurrent programs . In CAV , pages 356 -- 371 , 2011 . A. Donaldson, A. Kaiser, D. Kroening, and T. Wahl. Symmetry-aware predicate abstraction for shared-variable concurrent programs. In CAV, pages 356--371, 2011."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945468"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/838237.838485"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491411.2491453"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429086"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1765871.1765889"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25318-8_16"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964021"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594315"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1882291.1882302"},{"key":"e_1_3_2_2_26_1","first-page":"221","volume-title":"OSDI","author":"Jin G.","year":"2012","unstructured":"G. Jin , W. Zhang , D. Deng , B. Liblit , and S. Lu . Automated Concurrency-Bug Fixing . In OSDI , pages 221 -- 236 . 2012 . G. Jin, W. Zhang, D. Deng, B. Liblit, and S. Lu. Automated Concurrency-Bug Fixing. In OSDI, pages 221--236. 2012."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_39"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_47"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1346281.1346323"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/357233.357237"},{"key":"e_1_3_2_2_31_1","first-page":"405","volume-title":"TACAS","author":"Morse J.","year":"2014","unstructured":"J. Morse , M. Ramalho , L. Cordeiro , D. Nicole , and B. Fischer . ES-BMC 1.22 . In TACAS , pages 405 -- 407 . 2014 . http:\/\/www.esbmc.org\/. J. Morse, M. Ramalho, L. Cordeiro, D. Nicole, and B. Fischer. ES-BMC 1.22. In TACAS, pages 405--407. 2014. http:\/\/www.esbmc.org\/."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1986308.1986334"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1779046.1779089"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/265924.265927"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/11494881_14"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31424-7_11"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926433"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103621.2103702"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706338"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00768-2_13"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05089-3_17"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.873897"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12002-2_27"}],"event":{"name":"POPL '15: The 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Mumbai India","acronym":"POPL '15","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2676726.2677008","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2676726.2677008","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:03Z","timestamp":1750212783000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2676726.2677008"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,14]]},"references-count":43,"alternative-id":["10.1145\/2676726.2677008","10.1145\/2676726"],"URL":"https:\/\/doi.org\/10.1145\/2676726.2677008","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2775051.2677008","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2015,1,14]]},"assertion":[{"value":"2015-01-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}