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.
Counterexample-guided abstraction refinement for symbolic model checking
2003461 citationsEdmund M. Clarke, Orna Grümberg et al.profile →
Handbook of Model Checking
2018302 citationsEdmund M. Clarke, Helmut Veith et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Helmut Veith'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 Helmut Veith with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Helmut Veith more than expected).
This network shows the impact of papers produced by Helmut Veith. 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 Helmut Veith. The network helps show where Helmut Veith may publish in the future.
Co-authorship network of co-authors of Helmut Veith
This figure shows the co-authorship network connecting the top 25 collaborators of Helmut Veith.
A scholar is included among the top collaborators of Helmut Veith 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 Helmut Veith. Helmut Veith is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Šimkus, Mantas, et al.. (2014). Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability. 591–594.3 indexed citations
6.
Sharygina, Natasha & Helmut Veith. (2013). Proceedings of the 25th International Conference on Computer Aided Verification - Volume 8044.3 indexed citations
7.
Holzer, Andreas, Daniel Kroening, Christian Schallhart, Michael Tautschnig, & Helmut Veith. (2012). Proving Reachability Using FShell (Competition Contribution). Oxford University Research Archive (ORA) (University of Oxford). 538–541.1 indexed citations
8.
Dawar, Anuj & Helmut Veith. (2010). Computer science logic : 24th international workshop, CSL 2010, 19th annual conference of the EACSL, Brno, Czech Republic, August 23 - 27, 2010, proceedings. Springer eBooks.2 indexed citations
Cervesato, Iliano, Helmut Veith, & Андрей Воронков. (2010). Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning. International Conference on Logic Programming.45 indexed citations
11.
Grümberg, Orna & Helmut Veith. (2008). 25 Years of Model Checking: History, Achievements, Perspectives. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)).54 indexed citations
12.
Christodorescu, Mihai, Somesh Jha, Johannes Kinder, Stefan Katzenbeisser, & Helmut Veith. (2007). Software transformations to improve malware detection. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 3(4). 253–265.24 indexed citations
13.
Veith, Helmut. (2003). Friends or Foes? Communities in Software Verification (Invited Lecture). 528–529.
Chaki, Sagar, et al.. (2001). Efficient Filtering in Publish-Subscribe Systems Using Binary Decision.. International Conference on Software Engineering. 443–452.10 indexed citations
16.
Baaz, Matthias, Petr Hájek, Franco Montagna, & Helmut Veith. (2001). Complexity of t-tautologies. Annals of Pure and Applied Logic. 113(1-3). 3–11.35 indexed citations
Veith, Helmut. (1995). Succinct Representation and Leaf Languages. Electronic colloquium on computational complexity. 2(48).3 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.