{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:10:52Z","timestamp":1750306252485,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,1,16]],"date-time":"2017-01-16T00:00:00Z","timestamp":1484524800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nd\/4.0\/"}],"funder":[{"name":"FWF","award":["Y757"],"award-info":[{"award-number":["Y757"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,1,16]]},"DOI":"10.1145\/3018610.3018617","type":"proceedings-article","created":{"date-parts":[[2016,12,22]],"date-time":"2016-12-22T21:20:29Z","timestamp":1482441629000},"page":"17-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["A formalization of the Berlekamp-Zassenhaus factorization algorithm"],"prefix":"10.1145","author":[{"given":"Jose","family":"Divas\u00f3n","sequence":"first","affiliation":[{"name":"Universidad de La Rioja, Spain"}]},{"given":"Sebastiaan","family":"Joosten","sequence":"additional","affiliation":[{"name":"University of Innsbruck, Austria"}]},{"given":"Ren\u00e9","family":"Thiemann","sequence":"additional","affiliation":[{"name":"University of Innsbruck, Austria"}]},{"given":"Akihisa","family":"Yamada","sequence":"additional","affiliation":[{"name":"University of Innsbruck, Austria"}]}],"member":"320","published-online":{"date-parts":[[2017,1,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-013-9284-7"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28641-4_12"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1967.tb03174.x"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1981-0606517-5"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217975.1217980"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-314X(01)92763-5"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03545-1_9"},{"key":"e_1_3_2_1_8_1","volume-title":"Radboud Universiteit Nijmegen","author":"Kirkels B.","year":"2004","unstructured":"B. Kirkels . Irreducibility certificates for polynomials with integer coefficients. Master\u2019s thesis , Radboud Universiteit Nijmegen , 2004 . B. Kirkels. Irreducibility certificates for polynomials with integer coefficients. Master\u2019s thesis, Radboud Universiteit Nijmegen, 2004."},{"key":"e_1_3_2_1_9_1","volume-title":"Volume II: Seminumerical Algorithms","author":"Knuth D. E.","year":"1981","unstructured":"D. E. Knuth . The Art of Computer Programming , Volume II: Seminumerical Algorithms , 2 nd Edition. Addison-Wesley , 1981 . ISBN 0-201-03822-6. D. E. Knuth. The Art of Computer Programming, Volume II: Seminumerical Algorithms, 2nd Edition. Addison-Wesley, 1981. ISBN 0-201-03822-6.","edition":"2"},{"key":"e_1_3_2_1_10_1","first-page":"118","volume-title":"Theorem Proving in Higher Order Logics: Emerging Trends Proceedings","volume":"1","author":"Kobayashi H.","year":"2005","unstructured":"H. Kobayashi , H. Suzuki , and Y. Ono . Formalization of Hensel\u2019s lemma . In Theorem Proving in Higher Order Logics: Emerging Trends Proceedings , volume 1 , pages 114\u2013 118 , 2005 . H. Kobayashi, H. Suzuki, and Y. Ono. Formalization of Hensel\u2019s lemma. In Theorem Proving in Higher Order Logics: Emerging Trends Proceedings, volume 1, pages 114\u2013118, 2005."},{"key":"e_1_3_2_1_11_1","series-title":"EPTCS","first-page":"13","volume-title":"PAR","author":"Krauss A.","year":"2010","unstructured":"A. Krauss . Recursive definitions of monadic functions. In PAR 2010 , volume 43 of EPTCS , pages 1\u2013 13 , 2010. A. Krauss. Recursive definitions of monadic functions. In PAR 2010, volume 43 of EPTCS, pages 1\u201313, 2010."},{"key":"e_1_3_2_1_12_1","series-title":"LNCS","first-page":"218","volume-title":"ITP","author":"Kun\u02c7car O.","year":"2016","unstructured":"O. Kun\u02c7car and A. Popescu . From types to sets by local type definitions in higher-order logic . In ITP 2016 , volume 9807 of LNCS , pages 200\u2013 218 , 2016. O. Kun\u02c7car and A. Popescu. From types to sets by local type definitions in higher-order logic. In ITP 2016, volume 9807 of LNCS, pages 200\u2013218, 2016."},{"key":"e_1_3_2_1_13_1","volume-title":"Archive of Formal Proofs","author":"Lee H.","year":"2014","unstructured":"H. Lee . Vector spaces . Archive of Formal Proofs , 2014 . H. Lee. Vector spaces. Archive of Formal Proofs, 2014."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-014-9312-2"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1974-0354624-3"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1086837.1086844"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1791547"},{"key":"e_1_3_2_1_18_1","series-title":"LNCS","first-page":"408","volume-title":"ITP","author":"Thiemann R.","year":"2016","unstructured":"R. Thiemann and A. Yamada . Algebraic numbers in Isabelle\/HOL . In ITP 2016 , volume 9807 of LNCS , pages 391\u2013 408 , 2016. R. Thiemann and A. Yamada. Algebraic numbers in Isabelle\/HOL. In ITP 2016, volume 9807 of LNCS, pages 391\u2013 408, 2016."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2854065.2854073"},{"key":"e_1_3_2_1_20_1","unstructured":"Wolfram Research Inc. Mathematica. Champaign Illinois version 11.0 edition 2016.  Wolfram Research Inc. Mathematica. Champaign Illinois version 11.0 edition 2016."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/800205.806320"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-314X(69)90047-X"}],"event":{"name":"CPP '17: Certified Proofs and Programs","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGLOG ACM Special Interest Group on Logic and Computation"],"location":"Paris France","acronym":"CPP '17"},"container-title":["Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3018610.3018617","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3018610.3018617","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:59Z","timestamp":1750220639000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3018610.3018617"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,16]]},"references-count":22,"alternative-id":["10.1145\/3018610.3018617","10.1145\/3018610"],"URL":"https:\/\/doi.org\/10.1145\/3018610.3018617","relation":{},"subject":[],"published":{"date-parts":[[2017,1,16]]},"assertion":[{"value":"2017-01-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}