Search Results - "Yves Bertot"

Views of PI: Definition and computation by Bertot, Yves, Allais, Guillaume

“…We study several formal proofs and algorithms related to the number pi in the context of Coq's standard library. In particular, we clarify the relation between…”
Get full text

The challenges of using Type Theory to teach Mathematics: Invited Presentation at the 12th International Workshop on Theorem proving components for Educational software by Bertot, Yves

Get full text

C-language floating-point proofs layered with VST and Flocq by Appel, Andrew W., Bertot, Yves

“…We demonstrate tools and methods for proofs about the correctness and numerical accuracy of C programs. The tools are foundational, in that they are connected…”
Get full text

C floating-point proofs layered with VST and Flocq by Andrew W. Appel, Yves Bertot

“…We demonstrate tools and methods for proofs about the correctness and numerical accuracy of C programs. The tools are foundational, in that they are connected…”
Get full text

Corrigendum: C floating-point proofs layered with VST and Flocq by Andrew W. Appel, Yves Bertot

Get full text

C-language oating-point proofs layered with VST and Flocq 1 by Appel, Andrew W, Bertot, Yves

“…We demonstrate tools and methods for proofs about the correctness and numerical accuracy of C programs. The tools are foundational, in that they are connected…”
Get full text

Distant Decimals of π: Formal Proofs of Some Algorithms Computing Them and Guarantees of Exact Computation by Bertot, Yves, Rideau, Laurence, Théry, Laurent

“…We describe how to compute very far decimals of π and how to provide formal guarantees that the decimals we compute are correct. In particular, we report on an…”
Get full text

Distant Decimals of $$\pi $$ π : Formal Proofs of Some Algorithms Computing Them and Guarantees of Exact Computation by Bertot, Yves, Rideau, Laurence, Théry, Laurent

Get full text

Inductive and Coinductive Components of Corecursive Functions in Coq by Bertot, Yves, Komendantskaya, Ekaterina

“…In Constructive Type Theory, recursive and corecursive definitions are subject to syntactic restrictions which guarantee termination for recursive functions…”
Get full text

Formal Verification of a Geometry Algorithm: A Quest for Abstract Views and Symmetry in Coq Proofs by Bertot, Yves

“…International Colloquium on Theoretical of Computing (ICTAC), Oct 2018, Stellenbosch, South Africa This extended abstract is about an effort to build a formal…”
Get full text

The CtCoq system : Design and architecture by BERTOT, Y

“…The CtCoq user-interface is a graphical user-interface designed to be added to the Coq proof development system, acting as a broker between the human user and…”
Get full text

Distant decimals of $\pi by Bertot, Yves, Rideau, Laurence, Théry, Laurent

“…We describe how to compute very far decimals of $$\pi$$ and how to provide formal guarantees that the decimals we compute are correct. In particular, we report…”
Get full text

Structural abstract interpretation, A formal study using Coq by Bertot, Yves

“…Dans LERNET Summer School (2008) interpreters are tools to compute approximations for behaviors of a program. These approximations can then be used for…”
Get full text

Theorem proving support in programming language semantics by Bertot, Yves

“…We describe several views of the semantics of a simple programming language as formal documents in the calculus of inductive constructions that can be verified…”
Get full text

A simple canonical representation of rational numbers by Bertot, Yves

“…We propose to use a simple inductive type as a basis to represent the field of rational numbers. We describe the relation between this representation of…”
Get full text

A Combination of a Dynamic Geometry Software With a Proof Assistant for Interactive Formal Proofs by Pham, Tuan Minh, Bertot, Yves

“…This paper presents an interface for geometry proving. It is a combination of a dynamic geometry software, Geogebra [Geogebra development team, Introduction to…”
Get full text

Extending the Calculus of Constructions with Tarski's fix-point theorem by Bertot, Yves

“…We propose to use Tarski's least fixpoint theorem as a basis to define recursive functions in the calculus of inductive constructions. This widens the class of…”
Get full text

A Proof of GMP Square Root by Bertot, Yves, Magaud, Nicolas, Zimmermann, Paul

“…We present a formal proof (at the implementation level) of an efficient algorithm proposed by P. Zimmermann in 1999 to compute square roots of arbitrarily…”
Get full text

CoInduction in Coq by Bertot, Yves

“…We describe the basic notions of co-induction as they are available in the coq system. As an application, we describe arithmetic properties for simple…”
Get full text

Coq in a Hurry by Bertot, Yves

“…Cours (2008) 22 pages These notes provide a quick introduction to the Coq system and show how it can be used to define logical concepts and functions and…”
Get full text