{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T22:00:31Z","timestamp":1775340031463,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,1,18]],"date-time":"2016-01-18T00:00:00Z","timestamp":1453075200000},"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":["Y757"],"award-info":[{"award-number":["Y757"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,1,18]]},"DOI":"10.1145\/2854065.2854073","type":"proceedings-article","created":{"date-parts":[[2016,1,12]],"date-time":"2016-01-12T13:18:57Z","timestamp":1452604737000},"page":"88-99","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Formalizing Jordan normal forms in Isabelle\/HOL"],"prefix":"10.1145","author":[{"given":"Ren\u00e9","family":"Thiemann","sequence":"first","affiliation":[{"name":"University of Innsbruck, Austria"}]},{"given":"Akihisa","family":"Yamada","sequence":"additional","affiliation":[{"name":"University of Innsbruck, Austria"}]}],"member":"320","published-online":{"date-parts":[[2016,1,18]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"LIPIcs","first-page":"80","volume-title":"Proc. RTA","author":"Avanzini M.","year":"2013"},{"key":"e_1_3_2_1_2_1","first-page":"39","volume-title":"Proc. RTA 2015","author":"Avanzini M.","year":"2015"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. CICM Workshops 2013, volume 1010 of CEUR Workshop Proceedings","author":"Ballarin C.","year":"2013"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. LOPSTR 2013","volume":"8901","author":"Divas\u00b4on J.","year":"2013"},{"key":"e_1_3_2_1_5_1","volume-title":"Archive of Formal Proofs","author":"Divas\u00b4on J.","year":"2014"},{"key":"e_1_3_2_1_6_1","volume-title":"Archive of Formal Proofs","author":"Divas\u00b4on J.","year":"2015"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676724.2693166"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-007-9087-9"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08587-6_13"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"J.\n       \n      Giesl F.\n       \n      Mesnard A.\n       \n      Rubio R.\n       \n      Thiemann and \n      \n      \n      J.\n       \n      Waldmann\n      \n  \n  . \n  Termination competition (termCOMP\n   \n  2015\n  ). In Proc. \n  CADE-\n  25 volume \n  9195\n   of \n  LNCS pages 105\u2013\n  108 2015.  J. Giesl F. Mesnard A. Rubio R. Thiemann and J. Waldmann. Termination competition (termCOMP 2015). In Proc. CADE-25 volume 9195 of LNCS pages 105\u2013108 2015.","DOI":"10.1007\/978-3-319-21401-6_6"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-012-9250-9"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03545-1_9"},{"key":"e_1_3_2_1_13_1","volume-title":"Gauthier-Villars","author":"Jordan C.","year":"1870"},{"key":"e_1_3_2_1_14_1","volume-title":"Archive of Formal Proofs","author":"Lee H.","year":"2014"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2022278.2022280"},{"key":"e_1_3_2_1_16_1","first-page":"315","volume-title":"Proc. FSTTCS 2008","volume":"2","author":"Moser G.","year":"2008"},{"key":"e_1_3_2_1_17_1","series-title":"LNCS","first-page":"564","volume-title":"Proc. LPAR-17","author":"Neurauter F.","year":"2010"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"T.\n       \n      Nipkow L.\n       \n      Paulson and \n      \n      \n      M.\n       \n      Wenzel\n      \n  \n  . \n  Isabelle\/HOL \u2013 A Proof Assistant for Higher-Order Logic volume \n  2283\n   of \n  LNCS\n  . \n  2002\n  .   T. Nipkow L. Paulson and M. Wenzel. Isabelle\/HOL \u2013 A Proof Assistant for Higher-Order Logic volume 2283 of LNCS. 2002.","DOI":"10.1007\/3-540-45949-9"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1201\/9781420009934"},{"key":"e_1_3_2_1_20_1","volume-title":"Archive of Formal Proofs","author":"Sternagel C.","year":"2010"},{"key":"e_1_3_2_1_21_1","series-title":"LNCS (ARCoSS)","first-page":"455","volume-title":"Proc. RTATLCA","author":"Sternagel C.","year":"2014"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"e_1_3_2_1_23_1","first-page":"419","article-title":"M\u00e9moire sur la r\u00e9solution des \u00e9quations num\u00e9riques","volume":"11","author":"Sturm J. C. F.","year":"1829","journal-title":"Bulletin des Sciences de F\u00e9russac"},{"key":"e_1_3_2_1_24_1","volume-title":"Archive of Formal Proofs","author":"Thiemann R.","year":"2014"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03359-9_31"},{"key":"e_1_3_2_1_26_1","volume-title":"Archive of Formal Proofs","author":"Thiemann R.","year":"2015"},{"key":"e_1_3_2_1_27_1","series-title":"Leibniz International Proceedings in Informatics (LIPIcs)","first-page":"372","volume-title":"Proc. RTA","author":"Waldmann J.","year":"2010"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/800205.806320"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"H. Zankl and M. Korp. Modular complexity analysis for term rewriting. Logical Methods in Computer Science 10(1:19):1\u201334 2014.  H. Zankl and M. Korp. Modular complexity analysis for term rewriting. Logical Methods in Computer Science 10(1:19):1\u201334 2014.","DOI":"10.2168\/LMCS-10(1:19)2014"}],"event":{"name":"CPP 2016: Certified Proofs and Programs","location":"St. Petersburg FL USA","acronym":"CPP 2016","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGLOG ACM Special Interest Group on Logic and Computation"]},"container-title":["Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2854065.2854073","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2854065.2854073","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:46Z","timestamp":1750225726000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2854065.2854073"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,18]]},"references-count":29,"alternative-id":["10.1145\/2854065.2854073","10.1145\/2854065"],"URL":"https:\/\/doi.org\/10.1145\/2854065.2854073","relation":{},"subject":[],"published":{"date-parts":[[2016,1,18]]},"assertion":[{"value":"2016-01-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}