H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 63 Citations 12,680 278 World Ranking 1278 National Ranking 43

Overview

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Operating system
  • Software

His primary areas of investigation include Theoretical computer science, Model checking, Algorithm, Programming language and Data-flow analysis. His Theoretical computer science research includes themes of Test suite, Distributed computing, Theory of computation and Specification language. His study in the field of Abstraction model checking and Formal equivalence checking is also linked to topics like Modal logic and Fixed point.

His studies in Algorithm integrate themes in fields like Equivalence and Multimodal logic. His Semantics, Operational semantics and Concurrency study, which is part of a larger body of work in Programming language, is frequently linked to Workbench, bridging the gap between disciplines. His Data-flow analysis research focuses on Control flow graph and how it relates to Herbrand interpretation and Global value numbering.

His most cited work include:

  • The concurrency workbench: a semantics-based tool for the verification of concurrent systems (516 citations)
  • Reactive, generative, and stratified models of probabilistic processes (325 citations)
  • Lazy code motion (247 citations)

What are the main themes of his work throughout his whole career to date?

The scientist’s investigation covers issues in Software engineering, Theoretical computer science, Model checking, Programming language and Formal methods. His study in Software engineering is interdisciplinary in nature, drawing from both Software, Software development, Service and Web service. He works mostly in the field of Theoretical computer science, limiting it down to concerns involving Data-flow analysis and, occasionally, Control flow graph.

His Model checking study is concerned with the larger field of Algorithm. His work on Algorithm is being expanded to include thematically relevant topics such as Program optimization. His Programming language study frequently draws connections between adjacent fields such as Code generation.

He most often published in these fields:

  • Software engineering (32.94%)
  • Theoretical computer science (22.26%)
  • Model checking (19.29%)

What were the highlights of his more recent work (between 2013-2021)?

  • Software engineering (32.94%)
  • Model checking (19.29%)
  • Programming language (17.80%)

In recent papers he was focusing on the following fields of study:

His primary areas of study are Software engineering, Model checking, Programming language, Theoretical computer science and Code generation. His Software engineering research incorporates elements of Runtime verification and Software. His research investigates the connection between Model checking and topics such as Benchmark that intersect with issues in Decomposition and Component.

His research integrates issues of Finite-state machine and Counterexample in his study of Theoretical computer science. As a member of one scientific family, Bernhard Steffen mostly works in the field of Counterexample, focusing on Redundancy and, on occasion, Algorithm. His Metamodeling study combines topics in areas such as Domain, Realization and Abstraction.

Between 2013 and 2021, his most popular works were:

  • The Open-Source LearnLib (81 citations)
  • The TTT Algorithm: A Redundancy-Free Approach to Active Automata Learning (79 citations)
  • Active learning for extended finite state machines (54 citations)

In his most recent research, the most cited papers focused on:

  • Programming language
  • Operating system
  • Software

Bernhard Steffen focuses on Software engineering, Theoretical computer science, Programming language, Software and Code generation. In the subject of general Software engineering, his work in Formal methods is often linked to Reuse, thereby combining diverse domains of study. As part of his studies on Theoretical computer science, Bernhard Steffen often connects relevant areas like Finite-state machine.

The study incorporates disciplines such as Window and Automaton in addition to Programming language. The various areas that he examines in his Software study include Runtime verification, Bridging, Toolbox and Formal language. He combines subjects such as Leverage, Artificial intelligence and Temporal logic with his study of Model checking.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Top Publications

The concurrency workbench: a semantics-based tool for the verification of concurrent systems

Rance Cleaveland;Joachim Parrow;Bernhard Steffen.
ACM Transactions on Programming Languages and Systems (1993)

817 Citations

Reactive, generative, and stratified models of probabilistic processes

Rob J. VanGlabbeek;Scott A. Smolka;Bernhard Steffen.
Information & Computation (1995)

662 Citations

Reactive, generative, and stratified models of probabilistic processes

R. van Glabbeek;S.A. Smolka;B. Steffen;C.M.N. Tofts.
logic in computer science (1990)

615 Citations

Lazy code motion

Jens Knoop;Oliver Rüthing;Bernhard Steffen.
programming language design and implementation (1992)

372 Citations

A linear-time model-checking algorithm for the alternation-free modal mu-calculus

Rance Cleaveland;Bernhard Steffen.
computer aided verification (1993)

369 Citations

Verification on Infinite Structures

Olaf Burkart;Didier Caucal;Faron Moller;Bernhard Steffen.
Handbook of Process Algebra (2001)

280 Citations

The Concurrency Workbench

Rance Cleaveland;Joachim Parrow;Bernhard Steffen.
computer aided verification (1990)

279 Citations

Optimal code motion: theory and practice

Jens Knoop;Oliver Rüthing;Bernhard Steffen.
ACM Transactions on Programming Languages and Systems (1994)

278 Citations

Partial dead code elimination

Jens Knoop;Oliver Rüthing;Bernhard Steffen.
programming language design and implementation (1994)

259 Citations

Model-driven development with the jABC

Bernhard Steffen;Tiziana Margaria;Ralf Nagel;Sven Jörges.
haifa verification conference (2006)

251 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

Top Scientists Citing Bernhard Steffen

Tiziana Margaria

Tiziana Margaria

University of Limerick

Publications: 102

Rance Cleaveland

Rance Cleaveland

University of Maryland, College Park

Publications: 59

Kim Guldstrand Larsen

Kim Guldstrand Larsen

Aalborg University

Publications: 47

Thomas Reps

Thomas Reps

University of Wisconsin–Madison

Publications: 45

Bengt Jonsson

Bengt Jonsson

Uppsala University

Publications: 37

Scott A. Smolka

Scott A. Smolka

Stony Brook University

Publications: 30

Frits W. Vaandrager

Frits W. Vaandrager

Radboud University Nijmegen

Publications: 29

Moshe Y. Vardi

Moshe Y. Vardi

Rice University

Publications: 29

Roberto Gorrieri

Roberto Gorrieri

University of Bologna

Publications: 29

Rajeev Alur

Rajeev Alur

University of Pennsylvania

Publications: 26

Orna Kupferman

Orna Kupferman

Hebrew University of Jerusalem

Publications: 25

Javier Esparza

Javier Esparza

Technical University of Munich

Publications: 25

Stefania Gnesi

Stefania Gnesi

Institute of Information Science and Technologies

Publications: 24

Holger Hermanns

Holger Hermanns

Saarland University

Publications: 23

Christel Baier

Christel Baier

TU Dresden

Publications: 22

Something went wrong. Please try again later.