Yves Bertot
Impact in
- Software top 5%
- Software Testing and Debugging Techniques
- Model-Driven Software Engineering Techniques
-
- Formal Methods in Verification
Papers in
-
- Logic, programming, and type systems 22
- Logic, Reasoning, and Knowledge 4
-
- Formal Methods in Verification 8
- Mathematics, Computing, and Information Processing 7
- Numerical Methods and Algorithms 6
- Polynomial and algebraic computation 4
- Co-authors
- Pierre Castéran (1 shared paper)Laurent Théry (3 shared papers)Gilles Kahn (2 shared papers)Loïc Pottier (3 shared papers)Gilles Dowek (1 shared paper)Laurence Rideau (4 shared papers)Ekaterina Komendantskaya (1 shared paper)Paul Zimmermann (2 shared papers)
In The Last Decade
Yves Bertot
30 papers receiving 705 citations
Yves Bertot's Hit Papers
Peers
Comparison fields: 5 of 57
- Software 138
- Computational Theory and Mathematics 471
- Artificial Intelligence 611
- Theoretical Computer Science 16
- Hardware and Architecture 89
Countries citing papers authored by Yves Bertot
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
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-authors
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.
All Works
Showing the 20 most-cited of 33 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Interactive Theorem Proving and Program Development Hit paper breakdown → | 2004 | 550 |
| 2 | 1999 | 40 | |
| 3 | 1998 | 30 | |
| 4 | 1992 | 25 | |
| 5 | Mathematics and Proof Presentation in Pcoq | 2001 | 18 |
| 6 | 2007 | 14 | |
| 7 | 1991 | 13 | |
| 8 | 2004 | 12 | |
| 9 | 1999 | 9 | |
| 10 | 2002 | 8 | |
| 11 | Implementing Proof by Pointing without a Structure Editor | 1997 | 8 |
| 12 | 2016 | 6 | |
| 13 | 2012 | 6 | |
| 14 | 2008 | 6 | |
| 15 | 2009 | 5 | |
| 16 | 2008 | 5 | |
| 17 | A Coq Formalization of a Type Checker for Object Initialization in the Java Virtual Machine | 2000 | 3 |
| 18 | 2005 | 3 | |
| 19 | 2011 | 3 | |
| 20 | 2003 | 3 |
About Yves Bertot
Yves Bertot is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Software, Computer Networks and Communications and General Health Professions, 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), Logic, Reasoning, and Knowledge (4 papers), Polynomial and algebraic computation (4 papers), Advanced Database Systems and Queries (3 papers) and Model-Driven Software Engineering Techniques (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, India and Spain. Frequent co-authors include Pierre Castéran, Laurent Théry, Gilles Kahn, Loïc Pottier, Gilles Dowek, Laurence Rideau, Ekaterina Komendantskaya, Paul Zimmermann, Pierre-Yves Strub and Xavier Leroy. 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.