Zobrazeno 1 - 10
of 83
pro vyhledávání: '"Yves Bertot"'
Autor:
Andrew W. Appel, Yves Bertot
Publikováno v:
Journal of Formalized Reasoning, Vol 13, Iss 1, Pp 1-16 (2021)
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 to formal semantic specifications of the C operational semantics and of the IEEE 754 float
Externí odkaz:
https://doaj.org/article/16ded9c99b134470a43e1808b7668c7f
Autor:
Andrew W. Appel, Yves Bertot
Publikováno v:
Journal of Formalized Reasoning, Vol 13, Iss 1 (2021)
Externí odkaz:
https://doaj.org/article/5bc61cb2fe8b4b3db502851564feea42
Autor:
Yves Bertot, Guillaume Allais
Publikováno v:
Journal of Formalized Reasoning, Vol 7, Iss 1, Pp 105-129 (2014)
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 roots of the cosine function and the limit of the alternated series whose terms are the in
Externí odkaz:
https://doaj.org/article/964a072946204bc59452a2871c0d1835
Publikováno v:
Journal of Automated Reasoning. 61:33-71
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 on an experiment where 1 million decimals of $$\pi $$ and the billionth hexadecimal (with
Autor:
Yves Bertot
Publikováno v:
Theoretical Aspects of Computing – ICTAC 2018 ISBN: 9783030025076
ICTAC
ICTAC 2018-International Colloquium on Theoretical of Computing
ICTAC 2018-International Colloquium on Theoretical of Computing, Oct 2018, Stellenbosch, South Africa
ICTAC
ICTAC 2018-International Colloquium on Theoretical of Computing
ICTAC 2018-International Colloquium on Theoretical of Computing, Oct 2018, Stellenbosch, South Africa
International audience; This extended abstract is about an effort to build a formal description of a triangulation algorithm starting with a naive description of the algorithm where triangles, edges, and triangulations are simply given as sets and th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5c61a21e25b5b9121aef0f50e2800e6f
https://doi.org/10.1007/978-3-030-02508-3_1
https://doi.org/10.1007/978-3-030-02508-3_1
Publikováno v:
Certified Programs and Proofs
Certified Programs and Proofs, Jan 2016, St Petersburg, Florida, United States. pp.12
CPP
Certified Programs and Proofs, Jan 2016, St Petersburg, Florida, United States. pp.12
CPP
We describe the formalisation in Coq of a proof that the numbers e and $\pi$ are transcendental. This proof lies at the interface of two domains of mathematics that are often considered separately: calculus (real and elementary complex analysis) and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::096da282656d2e5af975a777899ce344
https://hal.inria.fr/hal-01240025
https://hal.inria.fr/hal-01240025
Autor:
Alexey Solovyev, Jeremy Avigad, Andrea Asperti, Georges Gonthier, Stéphane Le Roux, Sidi Ould Biha, Ioana Pasca, Assia Mahboubi, Russell O'Connor, Enrico Tassi, François Garillot, Laurence Rideau, Cyril Cohen, Laurent Théry, Yves Bertot
Publikováno v:
Interactive Theorem Proving ISBN: 9783642396335
ITP
ITP 2013, 4th Conference on Interactive Theorem Proving
ITP 2013, 4th Conference on Interactive Theorem Proving, Jul 2013, Rennes, France. pp.163-179, ⟨10.1007/978-3-642-39634-2_14⟩
ITP
ITP 2013, 4th Conference on Interactive Theorem Proving
ITP 2013, 4th Conference on Interactive Theorem Proving, Jul 2013, Rennes, France. pp.163-179, ⟨10.1007/978-3-642-39634-2_14⟩
International audience; This paper reports on a six-year collaborative effort that cul- minated in a complete formalization of a proof of the Feit-Thompson Odd Order Theorem in the Coq proof assistant. The formalized proof is constructive, and relies
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8edf5c2f030660500c9cd44d945cff0e
http://hdl.handle.net/11585/185912
http://hdl.handle.net/11585/185912
Autor:
Yves Bertot
Publikováno v:
Certified Programs and Proofs (CPP'15)
Certified Programs and Proofs (CPP'15), Jan 2015, Mumbai, India. ⟨10.1145/2676724.2693172⟩
CPP
Certified Programs and Proofs (CPP'15), Jan 2015, Mumbai, India. ⟨10.1145/2676724.2693172⟩
CPP
International audience; We describe two approaches for the computation of mathematical constant approximations inside interactive theorem provers. These two approaches share the same basis of fixed point computation and differ only in the way the pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2f8be9a8ab2568355800785e2848e7f5
https://inria.hal.science/hal-01074927
https://inria.hal.science/hal-01074927
Autor:
Yves Bertot, Pierre Castéran
Coq is an interactive proof assistant for the development of mathematical theories and formally certified software. It is based on a theory called the calculus of inductive constructions, a variant of type theory. This book provides a pragmatic intro
Autor:
Yves Bertot
Publikováno v:
Electronic Notes in Theoretical Computer Science. 85(7):1-16
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 numbers and the representation as fractions of non-zero natural numbers. The usual operations of