Fred Mesnard

440 total citations
9 papers, 129 citations indexed

About

Fred Mesnard is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Software. According to data from OpenAlex, Fred Mesnard has authored 9 papers receiving a total of 129 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Artificial Intelligence, 9 papers in Computational Theory and Mathematics and 3 papers in Software. Recurrent topics in Fred Mesnard's work include Logic, programming, and type systems (9 papers), Formal Methods in Verification (9 papers) and Software Testing and Debugging Techniques (3 papers). Fred Mesnard is often cited by papers focused on Logic, programming, and type systems (9 papers), Formal Methods in Verification (9 papers) and Software Testing and Debugging Techniques (3 papers). Fred Mesnard collaborates with scholars based in Réunion, Italy and United States. Fred Mesnard's co-authors include Étienne Payet, Fausto Spoto, Roberto Bagnara, Salvatore Ruggieri, Alexander Serebrenik, Andy King, Enea Zaffanella and Lunjin Lu and has published in prestigious journals such as ACM Transactions on Programming Languages and Systems, Information and Computation and Electronic Notes in Theoretical Computer Science.

In The Last Decade

Fred Mesnard

9 papers receiving 122 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Fred Mesnard Réunion 7 107 98 36 28 14 9 129
Dilian Gurov Sweden 7 91 0.9× 92 0.9× 47 1.3× 21 0.8× 33 2.4× 38 140
Stefan Berghofer Germany 7 164 1.5× 120 1.2× 34 0.9× 12 0.4× 22 1.6× 19 181
Makarius Wenzel Germany 7 112 1.0× 75 0.8× 18 0.5× 16 0.6× 24 1.7× 16 131
Hendrik Tews Germany 8 144 1.3× 88 0.9× 29 0.8× 42 1.5× 29 2.1× 18 167
Carsten Fuhs Germany 7 100 0.9× 90 0.9× 45 1.3× 12 0.4× 14 1.0× 18 123
Jim Grundy United States 7 108 1.0× 103 1.1× 39 1.1× 56 2.0× 17 1.2× 21 157
Bern Martens Belgium 8 185 1.7× 148 1.5× 64 1.8× 21 0.8× 15 1.1× 28 213
Simona Orzan Netherlands 6 77 0.7× 92 0.9× 41 1.1× 19 0.7× 35 2.5× 11 129
Anca Browne United States 4 103 1.0× 132 1.3× 71 2.0× 18 0.6× 24 1.7× 7 164
Paul Hoogendijk Netherlands 6 119 1.1× 104 1.1× 20 0.6× 18 0.6× 19 1.4× 10 144

Countries citing papers authored by Fred Mesnard

Since Specialization
Citations

This map shows the geographic impact of Fred Mesnard'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 Fred Mesnard with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Fred Mesnard more than expected).

Fields of papers citing papers by Fred Mesnard

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Fred Mesnard. 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 Fred Mesnard. The network helps show where Fred Mesnard may publish in the future.

Co-authorship network of co-authors of Fred Mesnard

This figure shows the co-authorship network connecting the top 25 collaborators of Fred Mesnard. A scholar is included among the top collaborators of Fred Mesnard based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Fred Mesnard. Fred Mesnard is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

9 of 9 papers shown
1.
Bagnara, Roberto, et al.. (2012). A new look at the automatic synthesis of linear ranking functions. Information and Computation. 215. 47–67. 12 indexed citations
2.
Spoto, Fausto, Fred Mesnard, & Étienne Payet. (2010). A termination analyzer for Java bytecode based on path-length. ACM Transactions on Programming Languages and Systems. 32(3). 1–70. 53 indexed citations
3.
Payet, Étienne & Fred Mesnard. (2009). A non-termination criterion for binary constraint logic programs. Theory and Practice of Logic Programming. 9(2). 145–164. 4 indexed citations
4.
Spoto, Fausto, Lunjin Lu, & Fred Mesnard. (2009). Using CLP Simplifications to Improve Java Bytecode Termination Analysis. Electronic Notes in Theoretical Computer Science. 253(5). 129–144. 4 indexed citations
5.
Mesnard, Fred & Alexander Serebrenik. (2007). Recurrence with affine level mappings is P-time decidable for CLP. Theory and Practice of Logic Programming. 8(1). 111–119. 10 indexed citations
6.
Payet, Étienne & Fred Mesnard. (2006). Nontermination inference of logic programs. ACM Transactions on Programming Languages and Systems. 28(2). 256–289. 11 indexed citations
7.
King, Andy, et al.. (2005). Computing convex hulls with a linear solver. Theory and Practice of Logic Programming. 5(1-2). 259–271. 12 indexed citations
8.
Mesnard, Fred & Roberto Bagnara. (2005). cTI: a constraint-based termination inference tool for ISO-Prolog. Theory and Practice of Logic Programming. 5(1-2). 243–257. 12 indexed citations
9.
Mesnard, Fred & Salvatore Ruggieri. (2003). On proving left termination of constraint logic programs. ACM Transactions on Computational Logic. 4(2). 207–259. 11 indexed citations

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