Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials
From MaRDI portal
Publication:3613426
DOI10.1007/11814771_37zbMath1222.68369OpenAlexW1568929477MaRDI QIDQ3613426
Publication date: 12 March 2009
Published in: Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00001270
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
A case-study in algebraic manipulation using mechanized reasoning tools ⋮ A verified implementation of algebraic numbers in Isabelle/HOL ⋮ Algebraic Numbers in Isabelle/HOL
Uses Software
This page was built for publication: Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials
