{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:32:49Z","timestamp":1725471169296},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540371878"},{"type":"electronic","value":"9783540371885"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11814771_37","type":"book-chapter","created":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T11:44:21Z","timestamp":1160048661000},"page":"438-452","source":"Crossref","is-referenced-by-count":8,"title":["Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials"],"prefix":"10.1007","author":[{"given":"Assia","family":"Mahboubi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","series-title":"Algorithms and Computation in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05355-3","volume-title":"Algorithms and Computation in Mathematics","author":"S. Basu","year":"2003","unstructured":"Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. In: Algorithms and Computation in Mathematics. Algorithms and Computation in Mathematics, vol.\u00a010, Springer, Heidelberg (2003), draft for snd edition available at http:\/\/name.math.univ-rennes1.fr\/marie-francoise.roy\/bpr-posted1.html"},{"key":"37_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive Theorem Proving and Program Development. Coq\u2019Art: the Calculus of Inductive Constructions. Texts in Theoretical Computer Science","author":"Y. Bertot","year":"2004","unstructured":"Bertot, Y., Casteran, P.: Interactive Theorem Proving and Program Development. Coq\u2019Art: the Calculus of Inductive Constructions. Texts in Theoretical Computer Science. Springer, Heidelberg (2004)"},{"key":"37_CR3","unstructured":"Boulm\u00e9, S.: Vers la sp\u00e9cification formelle d\u2019un algorithme non trivial de calcul formel: le calcul de pgcd de deux polyn\u00f4mes par la cha\u00eene de pseudo-restes de sous-r\u00e9sultants. Master\u2019s thesis, SPI team, Paris VI University (September 1997)"},{"issue":"4","key":"37_CR4","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1145\/321662.321665","volume":"18","author":"W.S. Brown","year":"1971","unstructured":"Brown, W.S., Traub, J.F.: On Euclid\u2019s Algorithm and the The Theory of Subresultants. Journal of the ACM\u00a018(4), 505\u2013514 (1971)","journal-title":"Journal of the ACM"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1145\/321371.321381","volume":"14","author":"G.E. Collins","year":"1967","unstructured":"Collins, G.E.: Subresultant and Reduced Polynomial Remainder Sequences. Journal of the ACM\u00a014, 128\u2013142 (1967)","journal-title":"Journal of the ACM"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Delahaye, D., Mayero, M.: Quantifier Elimination over Algebraically Closed Fields in a Proof Assistant using a Computer Algebra System. In: Proceedings of Calculemus 2005 (2005)","DOI":"10.1016\/j.entcs.2005.11.023"},{"key":"37_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/b102438","volume-title":"Algorithms for Computer Algebra","author":"K. Geddes","year":"1992","unstructured":"Geddes, K., Czapor, S.R., Labahn, G.: Algorithms for Computer Algebra. Kluwer Academic Publishers, Dordrecht (1992)"},{"issue":"2","key":"37_CR8","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1017\/S0956796802004501","volume":"13","author":"V.C. Gilles Barthe","year":"2003","unstructured":"Gilles Barthe, V.C., Pons, O.: Setoids in type theory. Journal of Functional Programming\u00a013(2), 261\u2013293 (2003)","journal-title":"Journal of Functional Programming"},{"key":"37_CR9","first-page":"235","volume-title":"International Conference on Functional Programming 2002","author":"B. Gr\u00e9goire","year":"2002","unstructured":"Gr\u00e9goire, B., Leroy, X.: A Compiled Implementation of Strong Reduction. In: International Conference on Functional Programming 2002, pp. 235\u2013246. ACM Press, New York (2002)"},{"key":"37_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11541868_7","volume-title":"Theorem Proving in Higher Order Logics","author":"B. Gr\u00e9goire","year":"2005","unstructured":"Gr\u00e9goire, B., Mahboubi, A.: Proving Ring Equalities Done Right in Coq. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol.\u00a03603, Springer, Heidelberg (2005)"},{"key":"37_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/11814771_36","volume-title":"Automated Reasoning","author":"B. Gr\u00e9goire","year":"2006","unstructured":"Gr\u00e9goire, B., Th\u00e9ry, L.: A Purely Functional Library for Modular Arithmetic and its Application for Certifying Large Prime Numbers. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, Springer, Heidelberg (2006)"},{"key":"37_CR12","unstructured":"Harrison, J.: The HOL-Light System 2.20. University of Cambrige, DSTO, SRI International (May 2006), http:\/\/www.cl.cam.ac.uk\/jrh\/hol-light\/"},{"key":"37_CR13","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1023\/A:1006023127567","volume":"21","author":"J. Harrison","year":"1998","unstructured":"Harrison, J., Th\u00e9ry, L.: A Skeptic\u2019s Approach to Combining HOL and Maple. Journal of Automated Reasoning\u00a021, 279\u2013294 (1998)","journal-title":"Journal of Automated Reasoning"},{"key":"37_CR14","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1515\/crll.1836.15.101","volume":"15","author":"C. Jacobi","year":"1836","unstructured":"Jacobi, C.: De Eliminatione Variablilis e Duabus Aequationibus. J. Reine Angew. Math\u00a015, 101\u2013124 (1836)","journal-title":"J. Reine Angew. Math"},{"key":"37_CR15","volume-title":"The Art of Computer Programming, Semi-numerical Algorithms","author":"D. Knuth","year":"1998","unstructured":"Knuth, D.: The Art of Computer Programming, Semi-numerical Algorithms, vol.\u00a02. Addison-Wesley, Reading (1998)"},{"key":"37_CR16","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1145\/220346.220376","volume-title":"ISSAC 1995: Proceedings of the 1995 international symposium on Symbolic and algebraic computation","author":"H.-C. Liao","year":"1995","unstructured":"Liao, H.-C., Fateman, R.J.: Evaluation of the Heuristic Polynomial gcd. In: ISSAC 1995: Proceedings of the 1995 international symposium on Symbolic and algebraic computation, pp. 240\u2013247. ACM Press, New York (1995)"},{"key":"37_CR17","unstructured":"Mahboubi, A.: Programming and Certifying a CAD Algorithm in the Coq system. In: Mathematics, Algorithms, Proofs, number 05021 in Dagstuhl Seminar Proceedings. IBFI, Schloss Dagstuhl, Germany (2006)"},{"key":"37_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL A Proof Assistant for Higher-Order Logic","author":"T. Nipkow","year":"2002","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle\/HOL. LNCS, vol.\u00a02283. Springer, Heidelberg (2002)"},{"key":"37_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/11617990_7","volume-title":"Types for Proofs and Programs","author":"C. Sacerdoti","year":"2006","unstructured":"Sacerdoti, C.: A Semi-reflexive Tactic for (Sub-)Equational Reasoning. In: Filli\u00e2tre, J.-C., Paulin-Mohring, C., Werner, B. (eds.) TYPES 2004. LNCS, vol.\u00a03839, pp. 98\u2013114. Springer, Heidelberg (2006)"},{"key":"37_CR20","unstructured":"The Coq Development Team. The Coq Proof Assistant Reference Manual \u2013 Version V8.0 (April 2004), http:\/\/coq.inria.fr"},{"key":"37_CR21","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1026518331905","volume":"26","author":"L. Th\u00e9ry","year":"2001","unstructured":"Th\u00e9ry, L.: A Machine-Checked Implementation of Buchberger\u2019s Algorithm. Journal of Automated Reasoning\u00a026, 107\u2013137 (2001)","journal-title":"Journal of Automated Reasoning"},{"issue":"1-3","key":"37_CR22","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0304-3975(02)00639-4","volume":"297","author":"J. Gathen von zur","year":"2003","unstructured":"von zur Gathen, J., L\u00fccking, T.: Subresultants Revisited. Theoretical Computer Science\u00a0297(1-3), 199\u2013239 (2003)","journal-title":"Theoretical Computer Science"},{"key":"37_CR23","volume-title":"Fundamental Problems of Algorithmic Algebra","author":"C.K. Yap","year":"2000","unstructured":"Yap, C.K.: Fundamental Problems of Algorithmic Algebra. Oxford University Press, Oxford (2000)"},{"key":"37_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3188-3","volume-title":"Effective Polynomial Computation","author":"R. Zippel","year":"1993","unstructured":"Zippel, R.: Effective Polynomial Computation. Kluwer Academic Publishers, Dordrecht (1993)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11814771_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:14:36Z","timestamp":1605626076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11814771_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540371878","9783540371885"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11814771_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}