{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T18:21:13Z","timestamp":1784830873869,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T00:00:00Z","timestamp":1528675200000},"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":[[2018,6,11]]},"DOI":"10.1145\/3192366.3192405","type":"proceedings-article","created":{"date-parts":[[2018,6,12]],"date-time":"2018-06-12T08:16:01Z","timestamp":1528791361000},"page":"135-150","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Advanced automata-based algorithms for program termination checking"],"prefix":"10.1145","author":[{"given":"Yu-Fang","family":"Chen","sequence":"first","affiliation":[{"name":"Academia Sinica, Taiwan \/ National Taipei University, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthias","family":"Heizmann","sequence":"additional","affiliation":[{"name":"University of Freiburg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ond\u0159ej","family":"Leng\u00e1l","sequence":"additional","affiliation":[{"name":"Brno University of Technology, Czechia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yong","family":"Li","sequence":"additional","affiliation":[{"name":"Institute of Software at Chinese Academy of Sciences, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ming-Hsien","family":"Tsai","sequence":"additional","affiliation":[{"name":"Academia Sinica, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrea","family":"Turrini","sequence":"additional","affiliation":[{"name":"Institute of Software at Chinese Academy of Sciences, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lijun","family":"Zhang","sequence":"additional","affiliation":[{"name":"Institute of Software at Chinese Academy of Sciences, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,6,11]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Software Verification Competition (SV-Comp) Benchmarks. https:\/\/github.com\/sosy-lab\/sv-benchmarks. Accessed: 2017-11-01.  Software Verification Competition (SV-Comp) Benchmarks. https:\/\/github.com\/sosy-lab\/sv-benchmarks. Accessed: 2017-11-01."},{"key":"e_1_3_2_2_2_1","first-page":"158","volume-title":"Proceedings of 16th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'10)","author":"Abdulla Parosh Aziz","year":"2010","unstructured":"Parosh Aziz Abdulla , Yu-Fang Chen , Luk\u00e1? Hol\u00edk, Richard Mayr , and Tom\u00e1? Vojnar. 2010 . When Simulation Meets Antichains: On Checking Language Inclusion of Nondeterministic Finite (Tree) Automata . In Proceedings of 16th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'10) . Springer-Verlag, Berlin, Heidelberg , 158 - 174 . Parosh Aziz Abdulla, Yu-Fang Chen, Luk\u00e1? Hol\u00edk, Richard Mayr, and Tom\u00e1? Vojnar. 2010. When Simulation Meets Antichains: On Checking Language Inclusion of Nondeterministic Finite (Tree) Automata. In Proceedings of 16th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'10). Springer-Verlag, Berlin, Heidelberg, 158-174."},{"key":"e_1_3_2_2_3_1","volume-title":"Principles of Model Checking","author":"Baier Christel","unstructured":"Christel Baier and Joost-Pieter Katoen . 2008. Principles of Model Checking . The MIT Press . Christel Baier and Joost-Pieter Katoen. 2008. Principles of Model Checking. The MIT Press."},{"key":"e_1_3_2_2_4_1","volume-title":"Monotonicity Constraints and Ranking Functions. Logical Methods in Computer Science 6, 3","author":"Ben-Amram Amir M.","year":"2010","unstructured":"Amir M. Ben-Amram . 2010. Size-Change Termination , Monotonicity Constraints and Ranking Functions. Logical Methods in Computer Science 6, 3 ( 2010 ). http:\/\/arxiv.org\/abs\/1005.0253 Amir M. Ben-Amram. 2010. Size-Change Termination, Monotonicity Constraints and Ranking Functions. Logical Methods in Computer Science 6, 3 (2010). http:\/\/arxiv.org\/abs\/1005.0253"},{"key":"e_1_3_2_2_5_1","volume-title":"Monotonicity Constraints for Termination in the Integer Domain. Logical Methods in Computer Science 7, 3","author":"Ben-Amram Amir M.","year":"2011","unstructured":"Amir M. Ben-Amram . 2011. Monotonicity Constraints for Termination in the Integer Domain. Logical Methods in Computer Science 7, 3 ( 2011 ). Amir M. Ben-Amram. 2011. Monotonicity Constraints for Termination in the Integer Domain. Logical Methods in Computer Science 7, 3 (2011)."},{"key":"e_1_3_2_2_6_1","first-page":"51","volume-title":"Proceedings of 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'13)","author":"Amir","unstructured":"Amir M. Ben-Amram and Samir Genaim. 2013. On the Linear Ranking Problem for Integer Linear-Constraint Loops . In Proceedings of 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'13) . ACM, New York, NY, USA , 51 - 62 . Amir M. Ben-Amram and Samir Genaim. 2013. On the Linear Ranking Problem for Integer Linear-Constraint Loops. In Proceedings of 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'13). ACM, New York, NY, USA, 51-62."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629488"},{"key":"e_1_3_2_2_8_1","first-page":"304","volume-title":"Proceedings of 27th International Conference on Computer Aided Verification (CAV'15)","volume":"9207","author":"Amir","unstructured":"Amir M. Ben-Amram and Samir Genaim. 2015. Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions . In Proceedings of 27th International Conference on Computer Aided Verification (CAV'15) , Vol. 9207 . Springer, Cham , 304 - 321 . Amir M. Ben-Amram and Samir Genaim. 2015. Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions. In Proceedings of 27th International Conference on Computer Aided Verification (CAV'15), Vol. 9207. Springer, Cham, 304-321."},{"key":"e_1_3_2_2_9_1","first-page":"601","volume-title":"Proceedings of 29th International Conference on Computer Aided Verification (CAV'17)","volume":"10427","author":"Amir","unstructured":"Amir M. Ben-Amram and Samir Genaim. 2017. On Multiphase-Linear Ranking Functions . In Proceedings of 29th International Conference on Computer Aided Verification (CAV'17) , Vol. 10427 . Springer, Cham , 601 - 620 . Amir M. Ben-Amram and Samir Genaim. 2017. On Multiphase-Linear Ranking Functions. In Proceedings of 29th International Conference on Computer Aided Verification (CAV'17), Vol. 10427. Springer, Cham, 601-620."},{"key":"e_1_3_2_2_10_1","first-page":"331","volume-title":"Proceedings of 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'17)","author":"Beyer Dirk","year":"2017","unstructured":"Dirk Beyer . 2017 . Software Verification with Validation of Results - (Report on SV-Comp 2017) . In Proceedings of 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'17) . Springer-Verlag New York, Inc., New York, NY, USA , 331 - 349 . Dirk Beyer. 2017. Software Verification with Validation of Results - (Report on SV-Comp 2017). In Proceedings of 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'17). Springer-Verlag New York, Inc., New York, NY, USA, 331-349."},{"key":"e_1_3_2_2_11_1","first-page":"184","volume-title":"Proceedings of 23rd International Conference on Computer Aided Verification (CAV'11)","author":"Beyer Dirk","year":"2032","unstructured":"Dirk Beyer and M. Erkan Keremoglu . 2011. CPAchecker: A Tool for Configurable Software Verification . In Proceedings of 23rd International Conference on Computer Aided Verification (CAV'11) . Springer-Verlag, Berlin, Heidelberg , 184 - 190 . http:\/\/dl.acm.org\/citation.cfm?id= 2032 305.2032321 Dirk Beyer and M. Erkan Keremoglu. 2011. CPAchecker: A Tool for Configurable Software Verification. In Proceedings of 23rd International Conference on Computer Aided Verification (CAV'11). Springer-Verlag, Berlin, Heidelberg, 184-190. http:\/\/dl.acm.org\/citation.cfm?id=2032305.2032321"},{"key":"e_1_3_2_2_12_1","first-page":"770","volume-title":"Proceedings of 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'16)","author":"Heizmann Matthias","year":"2016","unstructured":"Franti?ek Blahoudek, Matthias Heizmann , Sven Schewe , Jan Strejcek , and Ming-Hsien Tsai . 2016 . Complementing Semi-deterministic B\u00fcchi Automata . In Proceedings of 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'16) . Springer Berlin Heidelberg, Berlin, Heidelberg , 770 - 787 . Franti?ek Blahoudek, Matthias Heizmann, Sven Schewe, Jan Strejcek, and Ming-Hsien Tsai. 2016. Complementing Semi-deterministic B\u00fcchi Automata. In Proceedings of 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'16). Springer Berlin Heidelberg, Berlin, Heidelberg, 770-787."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54577-5_6"},{"key":"e_1_3_2_2_14_1","first-page":"491","volume-title":"Proceedings of 17th International Conference on Computer Aided Verification (CAV'05)","author":"Bradley Aaron R.","unstructured":"Aaron R. Bradley , Zohar Manna , and Henny B. Sipma . 2005. Linear Ranking with Reachability . In Proceedings of 17th International Conference on Computer Aided Verification (CAV'05) . Springer-Verlag, Berlin, Heidelberg , 491 - 504 . Aaron R. Bradley, Zohar Manna, and Henny B. Sipma. 2005. Linear Ranking with Reachability. In Proceedings of 17th International Conference on Computer Aided Verification (CAV'05). Springer-Verlag, Berlin, Heidelberg, 491-504."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49674-9_22"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-013-0186-4"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134029"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941487.1941509"},{"key":"e_1_3_2_2_19_1","first-page":"47","volume-title":"Proceedings of 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'13)","author":"Zuleger Florian","year":"2013","unstructured":"Byron Cook, Abigail See, and Florian Zuleger . 2013 . Ramsey vs. Lexicographic Termination Proving . In Proceedings of 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'13) . Springer-Verlag, Berlin, Heidelberg , 47 - 61 . Byron Cook, Abigail See, and Florian Zuleger. 2013. Ramsey vs. Lexicographic Termination Proving. In Proceedings of 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'13). Springer-Verlag, Berlin, Heidelberg, 47-61."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54577-5_8"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103687"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/647544.730469"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_5"},{"key":"e_1_3_2_2_24_1","volume-title":"Vardi","author":"Fogarty Seth","year":"2012","unstructured":"Seth Fogarty and Moshe Y . Vardi . 2012 . B\u00fcchi Complementation and Size-Change Termination. Logical Methods in Computer Science 8, 1 (2012). Seth Fogarty and Moshe Y. Vardi. 2012. B\u00fcchi Complementation and Size-Change Termination. Logical Methods in Computer Science 8, 1 (2012)."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02348-4_3"},{"key":"e_1_3_2_2_26_1","volume-title":"Comparison of Algorithms for Checking Emptiness of B\u00fcchi Automata. In Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09)","volume":"13","author":"Gaiser Andreas","year":"2009","unstructured":"Andreas Gaiser and Stefan Schwoon . 2009 . Comparison of Algorithms for Checking Emptiness of B\u00fcchi Automata. In Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09) , Vol. 13 . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/ 2009\/2349 Andreas Gaiser and Stefan Schwoon. 2009. Comparison of Algorithms for Checking Emptiness of B\u00fcchi Automata. In Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09), Vol. 13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2009\/2349"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2958031.2958105"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-016-9388-y"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-006-9057-7"},{"key":"e_1_3_2_2_30_1","volume-title":"Partial-Order Methods for the Verification of Concurrent Systems - An Approach to the State-Explosion Problem","author":"Godefroid Patrice","unstructured":"Patrice Godefroid . 1996. Partial-Order Methods for the Verification of Concurrent Systems - An Approach to the State-Explosion Problem . Springer . Patrice Godefroid. 1996. Partial-Order Methods for the Verification of Concurrent Systems - An Approach to the State-Explosion Problem. Springer."},{"key":"e_1_3_2_2_31_1","first-page":"304","volume-title":"Proceedings of 17th International Conference on Static Analysis (SAS'10)","author":"Harris William R.","year":"1882","unstructured":"William R. Harris , Akash Lal , Aditya V. Nori , and Sriram K. Rajamani . 2010. Alternation for Termination . In Proceedings of 17th International Conference on Static Analysis (SAS'10) . Springer-Verlag, Berlin, Heidelberg , 304 - 319 . http:\/\/dl.acm.org\/citation.cfm?id= 1882 094.1882113 William R. Harris, Akash Lal, Aditya V. Nori, and Sriram K. Rajamani. 2010. Alternation for Termination. In Proceedings of 17th International Conference on Static Analysis (SAS'10). Springer-Verlag, Berlin, Heidelberg, 304-319. http:\/\/dl.acm.org\/citation.cfm?id=1882094.1882113"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-02444-8_26"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_53"},{"key":"e_1_3_2_2_34_1","first-page":"89","volume-title":"Proceedings of 22nd International Conference on Computer Aided Verification (CAV'10)","author":"Kroening Daniel","unstructured":"Daniel Kroening , Natasha Sharygina , Aliaksei Tsitovich , and Christoph M. Wintersteiger . 2010. Termination Analysis with Compositional Transition Invariants . In Proceedings of 22nd International Conference on Computer Aided Verification (CAV'10) . Springer-Verlag, Berlin, Heidelberg , 89 - 103 . Daniel Kroening, Natasha Sharygina, Aliaksei Tsitovich, and Christoph M. Wintersteiger. 2010. Termination Analysis with Compositional Transition Invariants. In Proceedings of 22nd International Conference on Computer Aided Verification (CAV'10). Springer-Verlag, Berlin, Heidelberg, 89-103."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(87)90036-5"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2737993"},{"key":"e_1_3_2_2_37_1","first-page":"81","volume-title":"Proceedings of 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'01)","author":"Lee Chin Soon","unstructured":"Chin Soon Lee , Neil D. Jones , and Amir M . Ben-Amram. 2001. The sizechange principle for program termination . In Proceedings of 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'01) . ACM, New York, NY, USA , 81 - 92 . Chin Soon Lee, Neil D. Jones, and Amir M. Ben-Amram. 2001. The sizechange principle for program termination. In Proceedings of 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'01). ACM, New York, NY, USA, 81-92."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31424-7_12"},{"key":"e_1_3_2_2_39_1","volume-title":"Ranking Templates for Linear Loops. Logical Methods in Computer Science 11, 1","author":"Leike Jan","year":"2015","unstructured":"Jan Leike and Matthias Heizmann . 2015. Ranking Templates for Linear Loops. Logical Methods in Computer Science 11, 1 ( 2015 ). Jan Leike and Matthias Heizmann. 2015. Ranking Templates for Linear Loops. Logical Methods in Computer Science 11, 1 (2015)."},{"key":"e_1_3_2_2_41_1","volume-title":"Implementing a Termination Analysis using Configurable Software Analysis. Master's Thesis","author":"Ott Sebastian","unstructured":"Sebastian Ott . 2016. Implementing a Termination Analysis using Configurable Software Analysis. Master's Thesis , University of Passau , Software Systems Lab. Sebastian Ott. 2016. Implementing a Termination Analysis using Configurable Software Analysis. Master's Thesis, University of Passau, Software Systems Lab."},{"key":"e_1_3_2_2_42_1","volume-title":"POPL","author":"Padon Oded","year":"2018","unstructured":"Oded Padon , Jochen Hoenicke , Giuliano Losa , Andreas Podelski , Mooly Sagiv , and Sharon Shoham . 2018. Reducing Liveness to Safety in First-Order Logic. ACM Program. Lang. 2 , POPL ( 2018 ), 26:1-26:33. Oded Padon, Jochen Hoenicke, Giuliano Losa, Andreas Podelski, Mooly Sagiv, and Sharon Shoham. 2018. Reducing Liveness to Safety in First-Order Logic. ACM Program. Lang. 2, POPL (2018), 26:1-26:33."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/647762.735490"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24622-0_20"},{"key":"e_1_3_2_2_45_1","first-page":"32","volume-title":"Transition Invariants. In Proceedings of 19th Annual IEEE Symposium on Logic in Computer Science (LICS'04)","author":"Podelski Andreas","year":"2004","unstructured":"Andreas Podelski and Andrey Rybalchenko . 2004 . Transition Invariants. In Proceedings of 19th Annual IEEE Symposium on Logic in Computer Science (LICS'04) . IEEE Computer Society,Washington, DC, USA , 32 - 41 . Andreas Podelski and Andrey Rybalchenko. 2004. Transition Invariants. In Proceedings of 19th Annual IEEE Symposium on Logic in Computer Science (LICS'04). IEEE Computer Society,Washington, DC, USA, 32-41."},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_31"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28756-5_17"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-016-9389-x"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38856-9_5"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46681-0_46"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49674-9_4"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54833-8_22"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10936-7_19"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.5555\/111948.111969"}],"event":{"name":"PLDI '18: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"Philadelphia PA USA","acronym":"PLDI '18","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3192366.3192405","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3192366.3192405","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:07:53Z","timestamp":1750198073000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3192366.3192405"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,11]]},"references-count":53,"alternative-id":["10.1145\/3192366.3192405","10.1145\/3192366"],"URL":"https:\/\/doi.org\/10.1145\/3192366.3192405","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3296979.3192405","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2018,6,11]]},"assertion":[{"value":"2018-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}