{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:15Z","timestamp":1750306335257,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T00:00:00Z","timestamp":1467676800000},"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":[[2016,7,5]]},"DOI":"10.1145\/2933575.2934561","type":"proceedings-article","created":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T13:34:47Z","timestamp":1476452087000},"page":"207-216","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["The complexity of regular abstractions of one-counter languages"],"prefix":"10.1145","author":[{"given":"Mohamed Faouzi","family":"Atig","sequence":"first","affiliation":[{"name":"Uppsala University, Sweden"}]},{"given":"Dmitry","family":"Chistikov","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Software, Systems (MPI-SWS), Germany"}]},{"given":"Piotr","family":"Hofman","sequence":"additional","affiliation":[{"name":"LSV, CNRS & ENS Cachan, Universit\u00e9 Paris-Saclay, France"}]},{"given":"K. Narayan","family":"Kumar","sequence":"additional","affiliation":[{"name":"Chennai Mathematical Institute, India"}]},{"given":"Prakash","family":"Saivasan","sequence":"additional","affiliation":[{"name":"Chennai Math. Institute, India, Univ. of Kaiserslautern, Germany"}]},{"given":"Georg","family":"Zetzsche","sequence":"additional","affiliation":[{"name":"LSV, CNRS & ENS Cachan, Universit\u00e9 Paris-Saclay, France"}]}],"member":"320","published-online":{"date-parts":[[2016,7,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-02444-8_20"},{"key":"e_1_3_2_1_2_1","volume-title":"FSTTCS","author":"Abdulla P. A.","year":"2015","unstructured":"P. A. Abdulla , M. F. Atig , R. Meyer , and M. S. Salehi . What's decidable about availability languages ? In FSTTCS , 2015 . P. A. Abdulla, M. F. Atig, R. Meyer, and M. S. Salehi. What's decidable about availability languages? In FSTTCS, 2015."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926454"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85361-9_29"},{"key":"e_1_3_2_1_5_1","volume-title":"FSTTCS","author":"Atig M. F.","year":"2008","unstructured":"M. F. Atig , A. Bouajjani , and T. Touili . Analyzing asynchronous programs with preemption . In FSTTCS , 2008 . M. F. Atig, A. Bouajjani, and T. Touili. Analyzing asynchronous programs with preemption. In FSTTCS, 2008."},{"key":"e_1_3_2_1_6_1","volume-title":"Context-bounded analysis for concurrent programs with dynamic creation of threads. Logical Methods in Computer Science, 7(4)","author":"Atig M. F.","year":"2011","unstructured":"M. F. Atig , A. Bouajjani , and S. Qadeer . Context-bounded analysis for concurrent programs with dynamic creation of threads. Logical Methods in Computer Science, 7(4) , 2011 . M. F. Atig, A. Bouajjani, and S. Qadeer. Context-bounded analysis for concurrent programs with dynamic creation of threads. Logical Methods in Computer Science, 7(4), 2011."},{"key":"e_1_3_2_1_7_1","volume-title":"FSTTCS","author":"Atig M. F.","year":"2014","unstructured":"M. F. Atig , A. Bouajjani , K. N. Kumar , and P. Saivasan . On bounded reachability analysis of shared memory systems . In FSTTCS , 2014 . M. F. Atig, A. Bouajjani, K. N. Kumar, and P. Saivasan. On bounded reachability analysis of shared memory systems. In FSTTCS, 2014."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15579-1_37"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488626"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1017074.1017096"},{"key":"e_1_3_2_1_11_1","first-page":"178","article-title":"On constructing obstruction sets of words","volume":"44","author":"Courcelle B.","year":"1991","unstructured":"B. Courcelle . On constructing obstruction sets of words . Bulletin of the EATCS , 44 : 178 -- 186 , 1991 . B. Courcelle. On constructing obstruction sets of words. Bulletin of the EATCS, 44:178--186, 1991.","journal-title":"Bulletin of the EATCS"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90023-9"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926443"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.03.019"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629644"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-04921-2_1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2160910.2160915"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1551570.1551577"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1880999.1881050"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31424-7_22"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837627"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-2.1.326"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1887654.1887686"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2010.21"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2007.9"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09698-8_11"},{"key":"e_1_3_2_1_27_1","volume-title":"CONCUR","author":"Torre S. La","year":"2015","unstructured":"S. La Torre , A. Muscholl , and I. Walukiewicz . Safety of parametrized asynchronous shared-memory systems is almost always decidable . In CONCUR , 2015 . S. La Torre, A. Muscholl, and I. Walukiewicz. Safety of parametrized asynchronous shared-memory systems is almost always decidable. In CONCUR, 2015."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-32033-3_23"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90018-1"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28872-2_25"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00646-1"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/321356.321364"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_29"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(75)80005-5"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(78)90156-5"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/11532231_25"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47666-6_35"},{"key":"e_1_3_2_1_38_1","volume-title":"STACS","author":"Zetzsche G.","year":"2015","unstructured":"G. Zetzsche . Computing downward closures for stacked counter automata . In STACS , 2015 . G. Zetzsche. Computing downward closures for stacked counter automata. In STACS, 2015."}],"event":{"name":"LICS '16: 31st Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"],"location":"New York NY USA","acronym":"LICS '16"},"container-title":["Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933575.2934561","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2933575.2934561","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:53Z","timestamp":1750222493000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933575.2934561"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,5]]},"references-count":38,"alternative-id":["10.1145\/2933575.2934561","10.1145\/2933575"],"URL":"https:\/\/doi.org\/10.1145\/2933575.2934561","relation":{},"subject":[],"published":{"date-parts":[[2016,7,5]]},"assertion":[{"value":"2016-07-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}