Computer Science – Symbolic Computation
Scientific paper
2007-03-06
Computer Science
Symbolic Computation
8th Conference on Real Numbers and Computers, Saint Jacques de Compostelle : Espagne (2008)
Scientific paper
Formal proof checkers such as Coq are capable of validating proofs of correction of algorithms for finite field arithmetics but they require extensive training from potential users. The delayed solution of a triangular system over a finite field mixes operations on integers and operations on floating point numbers. We focus in this report on verifying proof obligations that state that no round off error occurred on any of the floating point operations. We use a tool named Gappa that can be learned in a matter of minutes to generate proofs related to floating point arithmetic and hide technicalities of formal proof checkers. We found that three facilities are missing from existing tools. The first one is the ability to use in Gappa new lemmas that cannot be easily expressed as rewriting rules. We coined the second one ``variable interchange'' as it would be required to validate loop interchanges. The third facility handles massive loop unrolling and argument instantiation by generating traces of execution for a large number of cases. We hope that these facilities may sometime in the future be integrated into mainstream code validation.
Boldo Sylvie
Daumas Marc
Giorgi Pascal
No associations
LandOfFree
Formal proof for delayed finite field arithmetic using floating point operators does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Formal proof for delayed finite field arithmetic using floating point operators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Formal proof for delayed finite field arithmetic using floating point operators will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-234604