Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Model Checking Programs
2003806 citationsWillem Visser, Klaus Havelund et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Klaus Havelund
Since
Specialization
Citations
This map shows the geographic impact of Klaus Havelund'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 Klaus Havelund with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Klaus Havelund more than expected).
This network shows the impact of papers produced by Klaus Havelund. 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 Klaus Havelund. The network helps show where Klaus Havelund may publish in the future.
Co-authorship network of co-authors of Klaus Havelund
This figure shows the co-authorship network connecting the top 25 collaborators of Klaus Havelund.
A scholar is included among the top collaborators of Klaus Havelund 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 Klaus Havelund. Klaus Havelund is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Havelund, Klaus & Gerard J. Holzmann. (2023). Programming event monitors. International Journal on Software Tools for Technology Transfer. 26(1). 33–47.
Muscettola, Nicola, et al.. (2007). Verification of plan models using UPPAAL.2 indexed citations
10.
Havelund, Klaus, et al.. (2007). Formal Approaches to Software Testing and Runtime Verification: First Combined International Workshops FATES 2006 and RV 2006 Seattle, WA, USA, ... Papers (Lecture Notes in Computer Science).2 indexed citations
11.
Havelund, Klaus, Manuel Núñez, Grigore Roşu, & Burkhart Wolff. (2006). Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification.1 indexed citations
Havelund, Klaus & Grigore Roşu. (2001). Testing Linear Temporal Logic Formulae on Finite Execution Traces. NASA STI Repository (National Aeronautics and Space Administration).29 indexed citations
18.
Roşu, Grigore & Klaus Havelund. (2001). Synthesizing Dynamic Programming Algorithms fromLinear Temporal Logic Formulae. NASA Technical Reports Server (NASA).27 indexed citations
19.
Havelund, Klaus & Grigore Roşu. (2001). Monitoring Java Programs with Java PathExplorer. NASA Technical Reports Server (NASA).73 indexed citations
20.
Havelund, Klaus, et al.. (2000). Formal Analysis of the Remote Agent Before and After Flight. Formal Methods.44 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.