Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials

Assia Mahboubi. Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials. In Ulrich Furbach, Natarajan Shankar, editors, Automated Reasoning, Third International Joint Conference, IJCAR 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings. Volume 4130 of Lecture Notes in Computer Science, pages 438-452, Springer, 2006. [doi]

Abstract

Abstract is missing.