David Déharbe

847 total citations
28 papers, 126 citations indexed

About

David Déharbe is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Software. According to data from OpenAlex, David Déharbe has authored 28 papers receiving a total of 126 indexed citations (citations by other indexed papers that have themselves been cited), including 20 papers in Artificial Intelligence, 17 papers in Computational Theory and Mathematics and 11 papers in Software. Recurrent topics in David Déharbe's work include Formal Methods in Verification (16 papers), Logic, programming, and type systems (14 papers) and Software Testing and Debugging Techniques (6 papers). David Déharbe is often cited by papers focused on Formal Methods in Verification (16 papers), Logic, programming, and type systems (14 papers) and Software Testing and Debugging Techniques (6 papers). David Déharbe collaborates with scholars based in Brazil, France and United Kingdom. David Déharbe's co-authors include Silvio Ranise, Tjark Weber, David R. Cok, Giles Reger, Alain Giorgetti, Matthias Heizmann, Jean-François Couchot, Pascal Fontaine, Sylvain Conchon and Aina Niemetz and has published in prestigious journals such as SHILAP Revista de lepidopterología, Science of Computer Programming and International Journal on Software Tools for Technology Transfer.

In The Last Decade

David Déharbe

23 papers receiving 116 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
David Déharbe Brazil	8	78	73	47	25	24	28	126
Dmitriy Traytel Switzerland	6	100 1.3×	82 1.1×	42 0.9×	22 0.9×	27 1.1×	36	146
Ivan S. Zapreev Netherlands	4	54 0.7×	93 1.3×	68 1.4×	16 0.6×	16 0.7×	6	125
Claire Loiseaux France	3	88 1.1×	137 1.9×	86 1.8×	24 1.0×	17 0.7×	3	165
Swen Jacobs Germany	8	74 0.9×	122 1.7×	53 1.1×	19 0.8×	41 1.7×	21	145
Peter Lammich Germany	7	98 1.3×	78 1.1×	29 0.6×	33 1.3×	21 0.9×	36	140
Jan Vytopil Netherlands	4	77 1.0×	104 1.4×	53 1.1×	51 2.0×	30 1.3×	7	144
Kåre J. Kristoffersen Denmark	7	56 0.7×	117 1.6×	56 1.2×	54 2.2×	20 0.8×	9	153
O. Grumberg Israel	3	48 0.6×	91 1.2×	61 1.3×	21 0.8×	15 0.6×	4	123
J. P. Queille France	5	54 0.7×	65 0.9×	51 1.1×	26 1.0×	30 1.3×	7	127
Bertrand Jeannet France	8	74 0.9×	125 1.7×	68 1.4×	63 2.5×	19 0.8×	14	165

Countries citing papers authored by David Déharbe

Since Specialization

Citations

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

Fields of papers citing papers by David Déharbe

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of David Déharbe

This figure shows the co-authorship network connecting the top 25 collaborators of David Déharbe. A scholar is included among the top collaborators of David Déharbe 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 David Déharbe. David Déharbe is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Weber, Tjark, Sylvain Conchon, David Déharbe, et al.. (2019). The SMT Competition 2015–2018. FreiDok plus (Universitätsbibliothek Freiburg). 11(1). 221–259. 12 indexed citations

Burdy, Lilian & David Déharbe. (2018). Teaching an Old Dog New Tricks - The Drudges of the Interactive Prover in Atelier B.. 415–419. 1 indexed citations

Cok, David R., David Déharbe, & Tjark Weber. (2016). The 2014 SMT Competition. 9(1). 207–242. 8 indexed citations

Déharbe, David, et al.. (2014). Integrating SMT solvers in Rodin. Science of Computer Programming. 94. 130–143. 8 indexed citations

Déharbe, David, et al.. (2014). BEval: A Plug-in to Extend Atelier B with Current Verification Technologies. SHILAP Revista de lepidopterología. 139. 53–58.

Déharbe, David. (2011). Integration of SMT-solvers in B and Event-B development environments. Science of Computer Programming. 78(3). 310–326. 14 indexed citations

Déharbe, David, Marie-Claude Gaudel, & Ana Cavalcanti. (2011). Theoretical Aspects of Computing. 2 indexed citations

Cavalcanti, Ana, David Déharbe, Marie-Claude Gaudel, & Jim Woodcock. (2010). Proceedings of the 7th International colloquium conference on Theoretical aspects of computing. 2 indexed citations

Déharbe, David, et al.. (2009). Combining Decision Procedures by (Model-)Equality Propagation. Electronic Notes in Theoretical Computer Science. 240. 113–128.

10.

Déharbe, David, et al.. (2008). A prototype implementation of a distributed Satisfiability Modulo Theories solver in the ToolBus framework. Journal of the Brazilian Computer Society. 14(1). 71–86. 2 indexed citations

11.

Déharbe, David, et al.. (2007). Developing Java Card Applications with B. Electronic Notes in Theoretical Computer Science. 184. 81–96. 5 indexed citations

12.

Déharbe, David & Pascal Fontaine. (2006). haRVey: combining reasoners. HAL (Le Centre pour la Communication Scientifique Directe). 152–156.

13.

Ringeissen, Christophe, et al.. (2004). Manipulating algebraic specifications with term-based and graph-based representations. The Journal of Logic and Algebraic Programming. 59(1-2). 63–87. 3 indexed citations

14.

Couchot, Jean-François, Frédéric Dadeau, David Déharbe, Alain Giorgetti, & Silvio Ranise. (2004). Proving and Debugging Set-Based Specifications. Electronic Notes in Theoretical Computer Science. 95. 189–208. 2 indexed citations

15.

Déharbe, David & Silvio Ranise. (2003). Light-weight theorem proving for debugging and verifying units of code. Iris (University of Trento). 220–228. 23 indexed citations

16.

Ranise, Silvio & David Déharbe. (2003). Applying Light-Weight Theorem Proving to Debugging and Verifying Pointer Programs. Electronic Notes in Theoretical Computer Science. 86(1). 105–119. 7 indexed citations

17.

Déharbe, David, et al.. (2002). FERUS: Um Ambiente de Desenvolvimento de Especificações CASL. 396–401. 1 indexed citations

18.

Déharbe, David & Silvio Ranise. (2002). BDD-Driven First-Order Satisfiability Procedures (Extended Version). HAL (Le Centre pour la Communication Scientifique Directe). 24. 2 indexed citations

19.

Déharbe, David, et al.. (2000). Variable Ordering of BDDs with Parallel Genetic Algorithms.. Parallel and Distributed Processing Techniques and Applications. 1 indexed citations

20.

Déharbe, David, et al.. (1998). Formal verification of VHDL: the model checker CV. 95–98.

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