{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T19:31:49Z","timestamp":1725823909327},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319206141"},{"type":"electronic","value":"9783319206158"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20615-8_4","type":"book-chapter","created":{"date-parts":[[2015,6,22]],"date-time":"2015-06-22T15:31:23Z","timestamp":1434987083000},"page":"55-70","source":"Crossref","is-referenced-by-count":3,"title":["Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof"],"prefix":"10.1007","author":[{"given":"Lu\u00eds","family":"Cruz-Filipe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Schneider-Kamp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,23]]},"reference":[{"key":"4_CR1","series-title":"Texts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive Theorem Proving and Program Development","author":"Y Bertot","year":"2004","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Interactive Theorem Proving and Program Development. Texts in Theoretical Computer Science. Springer, Heidelberg (2004)"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Codish, M., Cruz-Filipe, L., Frank, M., Schneider-Kamp, P.: Twenty-five comparators is optimal when sorting nine inputs (and twenty-nine for ten). In: ICTAI 2014, pp. 186\u2013193. IEEE (2014)","DOI":"10.1109\/ICTAI.2014.36"},{"key":"4_CR3","series-title":"Leibniz International Proceedings in Informatics","first-page":"21","volume-title":"International Conference on Rewriting Techniques and Applications","author":"E Contejean","year":"2011","unstructured":"Contejean, E., Courtieu, P., Forest, J., Pons, O.: Automated certified proofs with CiME3. In: Schmidt-Schau\u00df, M. (ed.) RTA 2011. LIPIcs, vol. 10, pp. 21\u201330. Schloss Dagstuhl, Germany (2011)"},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.entcs.2005.11.024","volume":"151","author":"L Cruz-Filipe","year":"2006","unstructured":"Cruz-Filipe, L., Letouzey, P.: A large-scale experiment in executing extracted programs. Electron. Notes Comput. Sci. 151(1), 75\u201391 (2006)","journal-title":"Electron. Notes Comput. Sci."},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Cruz-Filipe, L., Schneider-Kamp, P.: Formalizing size-optimal sorting networks: extracting a certified proof checker. In: Proceedings of ITP 2015, LNCS, Springer (2015, Submitted for Publication). CoRR. abs\/1502.05209","DOI":"10.1007\/978-3-319-22102-1_10"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/B978-0-7204-2262-7.50020-X","volume-title":"A Survey of Combinatorial Theory","author":"RW Floyd","year":"1973","unstructured":"Floyd, R.W., Knuth, D.E.: The Bose-Nelson sorting problem. In: Srivastava, J.N. (ed.) A Survey of Combinatorial Theory, pp. 163\u2013172. North-Holland, Amsterdam (1973)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-642-38856-9_19","volume-title":"Static Analysis","author":"A Fouilhe","year":"2013","unstructured":"Fouilhe, A., Monniaux, D., P\u00e9rin, M.: Efficient generation of correctness certificates for the abstract domain of polyhedra. In: Logozzo, F., F\u00e4hndrich, M. (eds.) Static Analysis. LNCS, vol. 7935, pp. 345\u2013365. Springer, Heidelberg (2013)"},{"key":"4_CR8","volume-title":"The Art of Computer Programming, Volume III: Sorting and Searching","author":"DE Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley, Redwood City (1973)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Krebbers, R., Spitters, B.: Computer certified efficient exact reals in Coq. In: Davenport, J.H., Farmer, W.M., Urban, J., Rabe, F. (eds.) MKM 2011 and Calculemus 2011. LNCS, vol. 6824, pp. 90\u2013106. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-22673-1_7"},{"issue":"7","key":"4_CR10","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1538788.1538814","volume":"52","author":"X Leroy","year":"2009","unstructured":"Leroy, X.: Formal verification of a realistic compiler. Commun. ACM 52(7), 107\u2013115 (2009)","journal-title":"Commun. ACM"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-540-69407-6_39","volume-title":"Logic and Theory of Algorithms","author":"P Letouzey","year":"2008","unstructured":"Letouzey, P.: Extraction in Coq: an overview. In: Beckmann, A., Dimitracopoulos, C., L\u00f6we, B. (eds.) CiE 2008. LNCS, vol. 5028, pp. 359\u2013369. Springer, Heidelberg (2008)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-71067-7_21","volume-title":"Theorem Proving in Higher Order Logics","author":"R O\u2019Connor","year":"2008","unstructured":"O\u2019Connor, R.: Certified exact transcendental real number computation in Coq. In: Mohamed, O.A., Mu\u00f1oz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 246\u2013261. Springer, Heidelberg (2008)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/3-540-44904-3_19","volume-title":"Typed Lambda Calculi and Applications","author":"N Oury","year":"2003","unstructured":"Oury, N.: Observational equivalence and program extraction in the Coq proof assistant. In: Hofmann, M.O. (ed.) TLCA 2003. LNCS, vol. 2701, pp. 271\u2013285. Springer, Heidelberg (2003)"},{"key":"4_CR14","series-title":"Electronic Proceedings in Theoretical Computer Science","first-page":"61","volume-title":"User Interfaces for Theorem Provers","author":"C Sternagel","year":"2014","unstructured":"Sternagel, C., Thiemann, R.: The certification problem format. In: Benzm\u00fcller, C., Paleo, B.W. (eds.) UITP 2014. EPTCS, vol. 167, pp. 61\u201372. ACM Press, New York (2014)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-642-39634-2_19","volume-title":"Interactive Theorem Proving","author":"R Thiemann","year":"2013","unstructured":"Thiemann, R.: Formalizing bounded increase. In: Blazy, S., Paulin-Mohring, C., Pichardie, D. (eds.) ITP 2013. LNCS, vol. 7998, pp. 245\u2013260. Springer, Heidelberg (2013)"},{"key":"4_CR16","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-1-4684-2001-2_12","volume-title":"Complexity of Computer Computations","author":"DC Voorhis van","year":"1972","unstructured":"van Voorhis, D.C.: Toward a lower bound for sorting networks. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 119\u2013129. Plenum Press, New York (1972)"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20615-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T14:45:42Z","timestamp":1566917142000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-20615-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319206141","9783319206158"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20615-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}