2023 - Research.com Computer Science in Germany Leader Award
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.
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.
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.
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.
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)
Reactive, generative, and stratified models of probabilistic processes
Rob J. VanGlabbeek;Scott A. Smolka;Bernhard Steffen.
Information & Computation (1995)
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)
Lazy code motion
Jens Knoop;Oliver Rüthing;Bernhard Steffen.
programming language design and implementation (1992)
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
Rance Cleaveland;Bernhard Steffen.
computer aided verification (1993)
Optimal code motion: theory and practice
Jens Knoop;Oliver Rüthing;Bernhard Steffen.
ACM Transactions on Programming Languages and Systems (1994)
Verification on Infinite Structures
Olaf Burkart;Didier Caucal;Faron Moller;Bernhard Steffen.
Handbook of Process Algebra (2001)
The Concurrency Workbench
Rance Cleaveland;Joachim Parrow;Bernhard Steffen.
computer aided verification (1990)
Partial dead code elimination
Jens Knoop;Oliver Rüthing;Bernhard Steffen.
programming language design and implementation (1994)
Model-driven development with the jABC
Bernhard Steffen;Tiziana Margaria;Ralf Nagel;Sven Jörges.
haifa verification conference (2006)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of Limerick
Uppsala University
University of Maryland, College Park
Aalborg University
Lero
Stony Brook University
Ludwig-Maximilians-Universität München
National Research Council (CNR)
Université Catholique de Louvain
French Institute for Research in Computer Science and Automation - INRIA
Shandong University of Science and Technology
University of Southern California
Indian Institute of Technology Madras
National Institute of Information and Communications Technology
University of Houston
Seoul National University
University of Helsinki
University of Colorado Boulder
Université Paris Cité
Dalhousie University
Osaka University
University of KwaZulu-Natal
Utrecht University
Columbia University
Université Paris Cité
MIT