Yves Bertot

2.6k citations
33 papers · 784 indexed · 1 hit paper · h-index 9

Yves Bertot

30 papers receiving 705 citations

Hit Papers

Interactive Theorem Proving and Program Development5502004202620112018100200300400500

Peers

Yves Bertot
Comparison fields: 5 of 57
  • Software 138
  • Computational Theory and Mathematics 471
  • Artificial Intelligence 611
  • Theoretical Computer Science 16
  • Hardware and Architecture 89
Replace Christine Paulin-Mohring with:
Christine Paulin-Mohring France
Pierre Castéran France
Jean-Christophe Filliâtre France
Michael J. C. Gordon United Kingdom
Tom Melham United Kingdom
R. J. R. Back Finland
Eugene E. Kohlbecker United States
Anna Ingólfsdóttir Iceland
Corrado Böhm Italy
Robert Nieuwenhuis Spain
Yves Bertot relative to Christine Paulin-Mohring France Christine Paulin-Mohring's profile →
Citations per field
00.5×10×15×
Christine Paulin-Mohring · 1×
Citations per year

Countries citing papers authored by Yves Bertot

Since Specialization
Citations

This map shows the geographic impact of Yves Bertot's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Yves Bertot with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Yves Bertot more than expected).

Fields of papers citing papers by Yves Bertot

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Yves Bertot. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Yves Bertot. The network helps show where Yves Bertot may publish in the future.

Co-authorship network

The 16 scholars most cited alongside Yves Bertot, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Yves Bertot Line = papers co-authored together Yves Bertot links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown
#Work
1 20166
2 20126
3 20113
4 20095
5
Fixed point semantics and partial recursion in Coq
20081
6 20085
7 20086
8 200714
9 20053
10 200412
11
QArith: Coq Formalisation of Lazy Rational Arithmetic
20031
12
INFLUENCIA DE DIFERENTES VARIANTES DE FERTILIZACIÓN EN EL CRECIMIENTO Y DESARROLLO DE POSTURAS DE Coffea canephora Pierre
20022
13
A proof of GMP square root using the Coq assistant
20022
14 20028
15
Mathematics and Proof Presentation in Pcoq
200118
16
A Coq Formalization of a Type Checker for Object Initialization in the Java Virtual Machine
20003
17 19982
18 199830
19
Implementing Proof by Pointing without a Structure Editor
19978
20 199225

About Yves Bertot

Yves Bertot is a scholar working on Computational Theory and Mathematics, Software, Theoretical Computer Science, Artificial Intelligence and Discrete Mathematics and Combinatorics, having authored 33 papers that have together received 784 indexed citations. Recurring topics across this work include Logic, programming, and type systems (22 papers), Formal Methods in Verification (8 papers), Mathematics, Computing, and Information Processing (7 papers), Numerical Methods and Algorithms (6 papers), Polynomial and algebraic computation (4 papers), Logic, Reasoning, and Knowledge (4 papers), Model-Driven Software Engineering Techniques (3 papers) and semigroups and automata theory (3 papers). The work is most often cited by research in Software (138 citations), Computational Theory and Mathematics (471 citations), Artificial Intelligence (611 citations), Theoretical Computer Science (16 citations) and Hardware and Architecture (89 citations). Yves Bertot has collaborated with scholars based in France, Cuba and India. Frequent co-authors include Pierre Castéran, Laurent Théry, Gilles Kahn, Loïc Pottier, Gilles Dowek, Laurence Rideau, Paul Zimmermann, Ekaterina Komendantskaya, Pierre-Yves Strub and Assia Mahboubi. Their work appears in journals such as Mathematical Structures in Computer Science, ACM SIGPLAN Notices, Journal of Automated Reasoning, Formal Aspects of Computing and Electronic Notes in Theoretical Computer Science.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026