Plotting in a Formally Verified Way

08/06/2021
by   Guillaume Melquiond, et al.
0

An invaluable feature of computer algebra systems is their ability to plot the graph of functions. Unfortunately, when one is trying to design a library of mathematical functions, this feature often falls short, producing incorrect and potentially misleading plots, due to accuracy issues inherent to this use case. This paper investigates what it means for a plot to be correct and how to formally verify this property. The Coq proof assistant is then turned into a tool for plotting function graphs using reliable polynomial approximations. This feature is provided as part of the CoqInterval library.

READ FULL TEXT
research
01/24/2022

Comparative Verification of the Digital Library of Mathematical Functions and Computer Algebra Systems

Digital mathematical libraries assemble the knowledge of years of mathem...
research
02/11/2022

Dandelion: Certified Approximations of Elementary Functions

Elementary function operations such as sin and exp cannot in general be ...
research
09/28/2022

FV Time: a formally verified Coq library

FV Time is a small-scale verification project developed in the Coq proof...
research
07/16/2021

Verified Mutable Data Structures

Malfunctions in software like airplane control systems or nuclear plant ...
research
12/20/2019

(Newtonian) Space-Time Algebra

The space-time (s-t) algebra provides a mathematical model for communica...
research
08/06/2019

A Formally Verified HOL Algebra for Dynamic Reliability Block Diagrams

Dynamic reliability block diagrams (DRBDs) are introduced to overcome th...
research
11/25/2021

RLIBM-PROG: Progressive Polynomial Approximations for Fast Correctly Rounded Math Libraries

This paper presents a novel method for generating a single polynomial ap...

Please sign up or login with your details

Forgot password? Click here to reset