Sciweavers

47 search results - page 2 / 10
» cade 2006
Sort
View
CADE
2006
Springer
14 years 5 months ago
Automatic Termination Proofs in the Dependency Pair Framework
Jürgen Giesl, Peter Schneider-Kamp, Ren&eacut...
CADE
2006
Springer
14 years 5 months ago
Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials
We describe here a formal proof in the Coq system of the structure theorem for subresultants, which allows to prove formally the correctness of our implementation of the subresulta...
Assia Mahboubi
CADE
2006
Springer
14 years 5 months ago
Verifying Mixed Real-Integer Quantifier Elimination
Abstract. We present a formally verified quantifier elimination procedure for the first order theory over linear mixed real-integer arithmetics in higher-order logic based on a wor...
Amine Chaieb