Gerhard Schellhorn

2.2k total citations
45 papers, 378 citations indexed

About

Gerhard Schellhorn is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Gerhard Schellhorn has authored 45 papers receiving a total of 378 indexed citations (citations by other indexed papers that have themselves been cited), including 29 papers in Artificial Intelligence, 27 papers in Computational Theory and Mathematics and 20 papers in Computer Networks and Communications. Recurrent topics in Gerhard Schellhorn's work include Formal Methods in Verification (26 papers), Logic, programming, and type systems (18 papers) and Distributed systems and fault tolerance (16 papers). Gerhard Schellhorn is often cited by papers focused on Formal Methods in Verification (26 papers), Logic, programming, and type systems (18 papers) and Distributed systems and fault tolerance (16 papers). Gerhard Schellhorn collaborates with scholars based in Germany, United Kingdom and United States. Gerhard Schellhorn's co-authors include Wolfgang Reif, Frank Ortmeier, John Derrick, Heike Wehrheim, Dominik Haneberg, Andreas Thums, Gidon Ernst, Martin Leucker, Michael Balser and Richard Banach and has published in prestigious journals such as SHILAP Revista de lepidopterología, Reliability Engineering & System Safety and Theoretical Computer Science.

In The Last Decade

Gerhard Schellhorn

41 papers receiving 337 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Gerhard Schellhorn Germany 11 211 186 153 120 59 45 378
Friedrich von Henke Germany 8 190 0.9× 247 1.3× 149 1.0× 165 1.4× 84 1.4× 13 427
Konrad Slind United States 10 194 0.9× 125 0.7× 204 1.3× 78 0.7× 50 0.8× 31 418
Pierre Bieber France 11 135 0.6× 78 0.4× 92 0.6× 93 0.8× 84 1.4× 28 312
Ramesh Bharadwaj United States 8 146 0.7× 192 1.0× 72 0.5× 227 1.9× 104 1.8× 38 399
Malcolm Wallace United Kingdom 7 159 0.8× 52 0.3× 85 0.6× 119 1.0× 57 1.0× 14 257
Elisabeth A. Strunk United States 8 80 0.4× 50 0.3× 99 0.6× 92 0.8× 82 1.4× 14 266
Zhibin Yang China 10 103 0.5× 89 0.5× 45 0.3× 96 0.8× 49 0.8× 32 241
Hubert Garavel France 12 230 1.1× 385 2.1× 142 0.9× 230 1.9× 73 1.2× 31 551
Sascha Konrad United States 10 282 1.3× 168 0.9× 67 0.4× 232 1.9× 231 3.9× 20 482
S. Gerhart United States 8 131 0.6× 133 0.7× 43 0.3× 171 1.4× 101 1.7× 15 296

Countries citing papers authored by Gerhard Schellhorn

Since Specialization
Citations

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

Fields of papers citing papers by Gerhard Schellhorn

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Gerhard Schellhorn

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

All Works

20 of 20 papers shown
1.
Derrick, John, et al.. (2022). Modularising Verification Of Durable Opacity. Logical Methods in Computer Science. Volume 18, Issue 3. 1 indexed citations
2.
Schellhorn, Gerhard. (2020). Verification of ASM Refinements Using Generalized Forward Simulation. Zenodo (CERN European Organization for Nuclear Research). 6 indexed citations
3.
Schellhorn, Gerhard & Wolfgang Ahrendt. (2020). Reasoning about Abstract State Machines: The WAM Case Study. Zenodo (CERN European Organization for Nuclear Research). 7 indexed citations
4.
Derrick, John, et al.. (2017). Mechanized proofs of opacity: a comparison of two techniques. Formal Aspects of Computing. 30(5). 597–625. 2 indexed citations
5.
Ernst, Gidon, et al.. (2016). Modular, crash-safe refinement for ASMs with submachines. Science of Computer Programming. 131. 3–21. 5 indexed citations
6.
Schellhorn, Gerhard, et al.. (2014). Two approaches for proving linearizability of multiset. Science of Computer Programming. 96. 297–314. 1 indexed citations
7.
Haneberg, Dominik, et al.. (2011). Mondex: engineering a provable secure electronic purse. 5. 159–184. 2 indexed citations
8.
Schellhorn, Gerhard. (2009). Completeness of fair ASM refinement. Science of Computer Programming. 76(9). 756–773. 7 indexed citations
9.
Banach, Richard & Gerhard Schellhorn. (2009). Atomic actions, and their refinements to isolated protocols. Formal Aspects of Computing. 22(1). 33–61. 6 indexed citations
10.
Balser, Michael, et al.. (2008). Interactive Verification of Concurrent Systems using Symbolic Execution.. OPUS (Augsburg University). 7 indexed citations
11.
Schellhorn, Gerhard. (2008). Completeness of ASM Refinement. Electronic Notes in Theoretical Computer Science. 214. 25–49. 7 indexed citations
12.
Boiten, Eerke, John Derrick, & Gerhard Schellhorn. (2008). Relational concurrent refinement part II: Internal operations and outputs. Formal Aspects of Computing. 21(1-2). 65–102. 7 indexed citations
13.
Ortmeier, Frank & Gerhard Schellhorn. (2007). Formal Fault Tree Analysis - Practical Experiences. Electronic Notes in Theoretical Computer Science. 185. 139–151. 46 indexed citations
14.
Haneberg, Dominik, et al.. (2007). A Modeling Framework for the Development of Provably Secure E-Commerce Applications. OPUS (Augsburg University). 6. 8–8. 6 indexed citations
15.
Schellhorn, Gerhard, et al.. (2006). The Mondex Challenge: Machine Checked Proofs for an Electronic Purse. OPUS (Augsburg University). 4 indexed citations
16.
Schellhorn, Gerhard. (2004). ASM refinement and generalizations of forward simulation in data refinement: a comparison. Theoretical Computer Science. 336(2-3). 403–435. 28 indexed citations
17.
Ortmeier, Frank, et al.. (2003). Safety analysis of the height control system for the Elbtunnel. Reliability Engineering & System Safety. 81(3). 259–268. 10 indexed citations
18.
Reif, Wolfgang, et al.. (2001). Correctness of Efficient Real-Time Model Checking.. JUCS - Journal of Universal Computer Science. 7. 194–209. 1 indexed citations
19.
Leucker, Martin, Gerhard Schellhorn, & Wolfgang Reif. (2000). Parallel Model Checking for the Alternation-Free Mu-Calculus. RWTH Publications (RWTH Aachen). 20 indexed citations
20.
Balser, Michael, et al.. (1999). KIV 3.0 for Provably Correct Systems. 6 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