{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:57Z","timestamp":1772164077703,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":60,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,1,11]],"date-time":"2016-01-11T00:00:00Z","timestamp":1452470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000288","name":"Royal Society","doi-asserted-by":"publisher","award":["IE131642"],"award-info":[{"award-number":["IE131642"]}],"id":[{"id":"10.13039\/501100000288","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["24680001,15KT0012"],"award-info":[{"award-number":["24680001,15KT0012"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,1,11]]},"DOI":"10.1145\/2837614.2837673","type":"proceedings-article","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T09:05:00Z","timestamp":1452157500000},"page":"718-732","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Lattice-theoretic progress measures and coalgebraic model checking"],"prefix":"10.1145","author":[{"given":"Ichiro","family":"Hasuo","sequence":"first","affiliation":[{"name":"University of Tokyo, Japan"}]},{"given":"Shunsuke","family":"Shimizu","sequence":"additional","affiliation":[{"name":"University of Tokyo, Japan"}]},{"given":"Corina","family":"C\u00eerstea","sequence":"additional","affiliation":[{"name":"University of Southampton, UK"}]}],"member":"320","published-online":{"date-parts":[[2016,1,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39212-2_3"},{"key":"e_1_3_2_1_2_1","volume-title":"Rudiments of \u00b5-Calculus. Studies in Logic and the Foundations of Mathematics","author":"Arnold A.","year":"2001","unstructured":"A. Arnold and D. Niwi\u00b4nski . Rudiments of \u00b5-Calculus. Studies in Logic and the Foundations of Mathematics . Elsevier , Amsterdam , 2001 . A. Arnold and D. Niwi\u00b4nski. Rudiments of \u00b5-Calculus. Studies in Logic and the Foundations of Mathematics. Elsevier, Amsterdam, 2001."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198568612.001.0001","volume-title":"Category Theory. Oxford Logic Guides","author":"Awodey S.","year":"2006","unstructured":"S. Awodey . Category Theory. Oxford Logic Guides . Oxford Univ. Press , 2006 . S. Awodey. Category Theory. Oxford Logic Guides. Oxford Univ. Press, 2006."},{"key":"e_1_3_2_1_5_1","volume-title":"CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part II","volume":"9207","author":"Ben-Amram A. M.","year":"2015","unstructured":"A. M. Ben-Amram and S. Genaim . Complexity of Bradley-Manna-Sipma lexicographic ranking functions. In D. Kroening and C. S. Pasareanu, editors, Computer Aided Verification - 27th International Conference , CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part II , volume 9207 of Lecture Notes in Computer Science, pages 304\u2013321. Springer , 2015 . A. M. Ben-Amram and S. Genaim. Complexity of Bradley-Manna-Sipma lexicographic ranking functions. In D. Kroening and C. S. Pasareanu, editors, Computer Aided Verification - 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part II, volume 9207 of Lecture Notes in Computer Science, pages 304\u2013321. Springer, 2015."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31982-5_29"},{"key":"e_1_3_2_1_7_1","series-title":"Studies in Logic and Practical Reasoning","volume-title":"Handbook of Modal Logic","author":"Bradfield J.","year":"2006","unstructured":"J. Bradfield and C. Stirling . Modal mu-calculi . In P. Blackburn, J. van Benthem, and F. Wolter, editors, Handbook of Modal Logic , volume 3 of Studies in Logic and Practical Reasoning , chapter 12. Elsevier , 2006 . J. Bradfield and C. Stirling. Modal mu-calculi. In P. Blackburn, J. van Benthem, and F. Wolter, editors, Handbook of Modal Logic, volume 3 of Studies in Logic and Practical Reasoning, chapter 12. Elsevier, 2006."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.07.038"},{"key":"e_1_3_2_1_9_1","first-page":"130","volume-title":"Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004","author":"Chatterjee K.","year":"2004","unstructured":"K. Chatterjee , M. Jurdzinski , and T. A. Henzinger . Quantitative stochastic parity games. In J. I. Munro, editor , Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004 , New Orleans, Louisiana, USA , January 11-14, 2004 , pages 121\u2013 130 . SIAM, 2004. K. Chatterjee, M. Jurdzinski, and T. A. Henzinger. Quantitative stochastic parity games. In J. I. Munro, editor, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pages 121\u2013 130. SIAM, 2004."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511621192","volume-title":"Modal Logic","author":"Chellas B. F.","year":"1980","unstructured":"B. F. Chellas . Modal Logic . Cambridge University Press , 1980 . B. F. Chellas. Modal Logic. Cambridge University Press, 1980."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.04.025"},{"key":"e_1_3_2_1_12_1","series-title":"Lecture Notes in Computer Science","first-page":"144","volume-title":"Algebra and Coalgebra in Computer Science - 4th International Conference, CALCO","author":"C\u02c6\u0131rstea C.","year":"2011","unstructured":"C. C\u02c6\u0131rstea . Model checking linear coalgebraic temporal logics: An automata-theoretic approach . In A. Corradini, B. Klin, and C. C\u02c6\u0131rstea, editors, Algebra and Coalgebra in Computer Science - 4th International Conference, CALCO 2011 , Winchester, UK , August 30 - September 2, 2011. Proceedings , volume 6859 of Lecture Notes in Computer Science , pages 130\u2013 144 . Springer, 2011. C. C\u02c6\u0131rstea. Model checking linear coalgebraic temporal logics: An automata-theoretic approach. In A. Corradini, B. Klin, and C. C\u02c6\u0131rstea, editors, Algebra and Coalgebra in Computer Science - 4th International Conference, CALCO 2011, Winchester, UK, August 30 - September 2, 2011. Proceedings, volume 6859 of Lecture Notes in Computer Science, pages 130\u2013144. Springer, 2011."},{"key":"e_1_3_2_1_13_1","unstructured":"C. C\u02c6\u0131rstea. A coalgebraic approach to linear-time logics. In Muscholl  C. C\u02c6\u0131rstea. A coalgebraic approach to linear-time logics. In Muscholl"},{"key":"e_1_3_2_1_14_1","unstructured":"pages 426\u2013440. pages 426\u2013440."},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. 6th International Conference on Algebra and Coalgebra in Computer Science (CALCO 2015)","author":"C\u02c6\u0131rstea C.","year":"2015","unstructured":"C. C\u02c6\u0131rstea . Canonical coalgebraic linear time logics . In Proc. 6th International Conference on Algebra and Coalgebra in Computer Science (CALCO 2015) , 2015 . To appear. C. C\u02c6\u0131rstea. Canonical coalgebraic linear time logics. In Proc. 6th International Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), 2015. To appear."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.06.002"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"C.\n      C\u02c6\u0131rstea C.\n      Kupke and \n      D.\n      Pattinson\n  . \n  EXPTIME tableaux for the coalgebraic \u00b5-calculus\n  . In E. Gr\u00e4del and R. Kahle editors CSL volume \n  5771\n   of \n  Lecture Notes in Computer Science pages 179\u2013\n  193\n  . Springer 2009.   C. C\u02c6\u0131rstea C. Kupke and D. Pattinson. EXPTIME tableaux for the coalgebraic \u00b5-calculus. In E. Gr\u00e4del and R. Kahle editors CSL volume 5771 of Lecture Notes in Computer Science pages 179\u2013193. Springer 2009.","DOI":"10.1007\/978-3-642-04027-6_15"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxp004"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01383878"},{"key":"e_1_3_2_1_20_1","unstructured":"R.\n      Cleaveland M.\n      Klein and \n      B.\n      Steffen\n  . \n  Faster model checking for the modal mu-calculus\n  . In G. von Bochmann and D. K. Probst editors Computer Aided Verification Fourth International\n   Workshop CAV \u201992 Montreal Canada June 29 - July 1 1992 Proceedings volume \n  663\n   of \n  Lecture Notes in Computer Science pages 410\u2013\n  422\n  . Springer 1992.   R. Cleaveland M. Klein and B. Steffen. Faster model checking for the modal mu-calculus. In G. von Bochmann and D. K. Probst editors Computer Aided Verification Fourth International Workshop CAV \u201992 Montreal Canada June 29 - July 1 1992 Proceedings volume 663 of Lecture Notes in Computer Science pages 410\u2013422. Springer 1992."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1979.82.43"},{"key":"e_1_3_2_1_22_1","unstructured":"L.\n      de Alfaro T. A.\n      Henzinger and \n      R.\n      Majumdar\n  . \n  Discounting the future in systems theory\n  . In J. C. M. Baeten J. K. Lenstra J. Parrow and G. J. Woeginger editors Automata Languages\n   and Programming 30th International Colloquium ICALP \n  2003 Eindhoven The Netherlands June 30 - July 4 2003. Proceedings volume \n  2719\n   of \n  Lect\n  . Notes Comp. \n  Sci\n  . pages 1022\u2013\n  1037\n  . Springer 2003.   L. de Alfaro T. A. Henzinger and R. Majumdar. Discounting the future in systems theory. In J. C. M. Baeten J. K. Lenstra J. Parrow and G. J. Woeginger editors Automata Languages and Programming 30th International Colloquium ICALP 2003 Eindhoven The Netherlands June 30 - July 4 2003. Proceedings volume 2719 of Lect. Notes Comp. Sci. pages 1022\u20131037. Springer 2003."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703420675"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1305\/ndjfl\/1093890715"},{"key":"e_1_3_2_1_25_1","series-title":"Lecture Notes in Computer Science","first-page":"392","volume-title":"S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P","author":"Fontaine G.","unstructured":"G. Fontaine , R. A. Leal , and Y. Venema . Automata for coalgebras: An approach using predicate liftings . In S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P . G. Spirakis, editors, ICALP ( 2), volume 6199 of Lecture Notes in Computer Science , pages 381\u2013 392 . Springer, 2010. G. Fontaine, R. A. Leal, and Y. Venema. Automata for coalgebras: An approach using predicate liftings. In S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis, editors, ICALP (2), volume 6199 of Lecture Notes in Computer Science, pages 381\u2013 392. Springer, 2010."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_5"},{"key":"e_1_3_2_1_27_1","volume-title":"Generic trace semantics via coinduction. Logical Methods in Comp. Sci., 3(4:11)","author":"Hasuo I.","year":"2007","unstructured":"I. Hasuo , B. Jacobs , and A. Sokolova . Generic trace semantics via coinduction. Logical Methods in Comp. Sci., 3(4:11) , 2007 . I. Hasuo, B. Jacobs, and A. Sokolova. Generic trace semantics via coinduction. Logical Methods in Comp. Sci., 3(4:11), 2007."},{"key":"e_1_3_2_1_28_1","volume-title":"Lattice-theoretic progress measures and coalgebraic model checking. Extended version with appendices,","author":"Hasuo I.","year":"2015","unstructured":"I. Hasuo , S. Shimizu , and C. C\u02c6\u0131rstea . Lattice-theoretic progress measures and coalgebraic model checking. Extended version with appendices, available at http:\/\/arxiv.org\/, 2015 . I. Hasuo, S. Shimizu, and C. C\u02c6\u0131rstea. Lattice-theoretic progress measures and coalgebraic model checking. Extended version with appendices, available at http:\/\/arxiv.org\/, 2015."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2725"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1017\/S096012950200378X"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2004.02.031"},{"key":"e_1_3_2_1_32_1","volume-title":"Towards mathematics of states and observations. Draft of a book (ver. 2.0), available online","author":"Jacobs B.","year":"2012","unstructured":"B. Jacobs . Introduction to coalgebra. Towards mathematics of states and observations. Draft of a book (ver. 2.0), available online , 2012 . B. Jacobs. Introduction to coalgebra. Towards mathematics of states and observations. Draft of a book (ver. 2.0), available online, 2012."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2014.12.005"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"M.\n      Jurdzinski\n    .\n  Small progress measures for solving parity games\n  . In H. Reichel and S. Tison editors STACS volume \n  1770\n   of \n  Lecture Notes in Computer Science pages 290\u2013\n  301\n  . Springer 2000.   M. Jurdzinski. Small progress measures for solving parity games. In H. Reichel and S. Tison editors STACS volume 1770 of Lecture Notes in Computer Science pages 290\u2013301. Springer 2000.","DOI":"10.1007\/3-540-46541-3_24"},{"key":"e_1_3_2_1_35_1","volume-title":"Coalgebraic trace semantics for continuous probabilistic transition systems. Logical Methods in Computer Science, 9(4)","author":"Kerstan H.","year":"2013","unstructured":"H. Kerstan and B. K\u00f6nig . Coalgebraic trace semantics for continuous probabilistic transition systems. Logical Methods in Computer Science, 9(4) , 2013 . H. Kerstan and B. K\u00f6nig. Coalgebraic trace semantics for continuous probabilistic transition systems. Logical Methods in Computer Science, 9(4), 2013."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1991.151650"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2007.02.034"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2009.29"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(82)90125-6"},{"key":"e_1_3_2_1_40_1","volume-title":"Berlin","author":"Lane S. Mac","year":"1998","unstructured":"S. Mac Lane . Categories for the Working Mathematician . Springer , Berlin , 2 nd edition, 1998 . S. Mac Lane. Categories for the Working Mathematician. Springer, Berlin, 2nd edition, 1998.","edition":"2"},{"key":"e_1_3_2_1_41_1","first-page":"350","volume-title":"Muscholl {42}","author":"Mio M.","unstructured":"M. Mio . Upper-expectation bisimilarity and \u0141ukasiewicz \u00b5-calculus . In Muscholl {42} , pages 335\u2013 350 . M. Mio. Upper-expectation bisimilarity and \u0141ukasiewicz \u00b5-calculus. In Muscholl {42}, pages 335\u2013350."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-0072(98)00042-6"},{"key":"e_1_3_2_1_43_1","volume-title":"FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings","volume":"8412","author":"Muscholl A.","year":"2014","unstructured":"A. Muscholl , editor. Foundations of Software Science and Computation Structures - 17th International Conference , FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings , volume 8412 of Lecture Notes in Computer Science , 2014 . A. Muscholl, editor. Foundations of Software Science and Computation Structures - 17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings, volume 8412 of Lecture Notes in Computer Science, 2014."},{"key":"e_1_3_2_1_44_1","unstructured":"Springer.  Springer."},{"key":"e_1_3_2_1_45_1","volume-title":"TGC 2015","author":"Nakagawa S.","year":"2015","unstructured":"S. Nakagawa and I. Hasuo . Near-optimal scheduling for LTL with future discounting. In Trustworthy Global Computing - 10th International Symposium , TGC 2015 , Lecture Notes in Computer Science. Springer , 2015 . to appear. S. Nakagawa and I. Hasuo. Near-optimal scheduling for LTL with future discounting. In Trustworthy Global Computing - 10th International Symposium, TGC 2015, Lecture Notes in Computer Science. Springer, 2015. to appear."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2006.38"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00201-9"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2013.48"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2008.05.027"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/12.1.149"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.32"},{"key":"e_1_3_2_1_52_1","series-title":"Elect","volume-title":"Category Theory and Computer Science","author":"Power J.","year":"1999","unstructured":"J. Power and D. Turi . A coalgebraic foundation for linear time semantics . In Category Theory and Computer Science , volume 29 of Elect . Notes in Theor. Comp. Sci. Elsevier , Amsterdam, 1999 . J. Power and D. Turi. A coalgebraic foundation for linear time semantics. In Category Theory and Computer Science, volume 29 of Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 1999."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00056-6"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1462179.1462185"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"crossref","unstructured":"L.\n      Schr\u00f6der\n     and \n      Y.\n      Venema\n  . \n  Flat coalgebraic fixed point logics\n  . In P. Gastin and F. Laroussinie editors CONCUR volume \n  6269\n   of \n  Lect\n  . Notes Comp. \n  Sci\n  . pages 524\u2013\n  538\n  . Springer 2010.  L. Schr\u00f6der and Y. Venema. Flat coalgebraic fixed point logics. In P. Gastin and F. Laroussinie editors CONCUR volume 6269 of Lect. Notes Comp. Sci. pages 524\u2013538. Springer 2010.","DOI":"10.1007\/978-3-642-15375-4_36"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2603088.2603133"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44584-6_31"},{"key":"e_1_3_2_1_58_1","volume-title":"Proc. 6th International Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), Leibniz International Proceedings in Informatics","author":"Urabe N.","year":"2015","unstructured":"N. Urabe and I. Hasuo . Coalgebraic infinite traces and Kleisli simulations . In Proc. 6th International Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), Leibniz International Proceedings in Informatics , 2015 . To appear; extended version available at http:\/\/arxiv.org\/abs\/1505.06819. N. Urabe and I. Hasuo. Coalgebraic infinite traces and Kleisli simulations. In Proc. 6th International Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), Leibniz International Proceedings in Informatics, 2015. To appear; extended version available at http:\/\/arxiv.org\/abs\/1505.06819."},{"key":"e_1_3_2_1_59_1","volume-title":"Banff Higher Order Workshop","volume":"1043","author":"Vardi M. Y.","year":"1995","unstructured":"M. Y. Vardi . An automata-theoretic approach to linear temporal logic. In F. Moller and G. M. Birtwistle, editors , Banff Higher Order Workshop , volume 1043 of Lecture Notes in Computer Science, pages 238\u2013266. Springer , 1995 . M. Y. Vardi. An automata-theoretic approach to linear temporal logic. In F. Moller and G. M. Birtwistle, editors, Banff Higher Order Workshop, volume 1043 of Lecture Notes in Computer Science, pages 238\u2013266. Springer, 1995."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2005.06.003"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.36045\/bbms\/1102714178"}],"event":{"name":"POPL '16: The 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"St. Petersburg FL USA","acronym":"POPL '16","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837614.2837673","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2837614.2837673","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:43:38Z","timestamp":1750211018000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837614.2837673"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,11]]},"references-count":60,"alternative-id":["10.1145\/2837614.2837673","10.1145\/2837614"],"URL":"https:\/\/doi.org\/10.1145\/2837614.2837673","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2914770.2837673","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016,1,11]]},"assertion":[{"value":"2016-01-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}