What is he best known for?
The fields of study he is best known for:
- Programming language
- Operating system
- Algorithm
His primary areas of study are Model checking, Theoretical computer science, Programming language, Abstraction model checking and Temporal logic.
His Model checking research incorporates themes from Mutual exclusion, Concurrency, Counterexample, Binary decision diagram and Computation.
His Theoretical computer science study combines topics in areas such as Finite-state machine, Algorithm and Compiler.
His work on Source code, Software and Transition system as part of general Programming language study is frequently linked to Context and AND gate, bridging the gap between disciplines.
Helmut Veith interconnects Formal verification and Symbolic trajectory evaluation in the investigation of issues within Abstraction model checking.
His work is dedicated to discovering how Temporal logic, Discrete mathematics are connected with Graph and Topology and other disciplines.
His most cited work include:
- Counterexample-guided abstraction refinement for symbolic model checking (792 citations)
- Modular verification of software components in C (297 citations)
- Progress on the State Explosion Problem in Model Checking (157 citations)
What are the main themes of his work throughout his whole career to date?
His scientific interests lie mostly in Model checking, Theoretical computer science, Programming language, Discrete mathematics and Software.
His research in Model checking intersects with topics in Distributed algorithm, Distributed computing and Temporal logic.
His studies in Theoretical computer science integrate themes in fields like Amortized analysis and Counterexample.
Many of his studies on Programming language apply to Test suite as well.
His study in Discrete mathematics is interdisciplinary in nature, drawing from both Fragment and Combinatorics.
His Source code research focuses on Software verification and how it connects with Software metric and Formal methods.
He most often published in these fields:
- Model checking (34.95%)
- Theoretical computer science (31.18%)
- Programming language (29.03%)
What were the highlights of his more recent work (between 2014-2020)?
- Model checking (34.95%)
- Theoretical computer science (31.18%)
- Distributed computing (9.68%)
In recent papers he was focusing on the following fields of study:
The scientist’s investigation covers issues in Model checking, Theoretical computer science, Distributed computing, Distributed algorithm and Programming language.
His work on Abstraction model checking as part of general Model checking research is often related to Context, thus linking different fields of science.
His research integrates issues of Decidability, Formal verification and Temporal logic in his study of Abstraction model checking.
His work on Regular language as part of general Theoretical computer science study is frequently linked to Equivalence, therefore connecting diverse disciplines of science.
His Distributed algorithm study also includes fields such as
- Bounded function, which have a strong connection to Liveness, Counterexample, Fragment and Order,
- Partial order reduction and related Binary decision diagram.
In the field of Programming language, his study on SQL and Mathematical logic overlaps with subjects such as Embedded SQL and Dynamical systems theory.
Between 2014 and 2020, his most popular works were:
- Handbook of Model Checking (103 citations)
- Decidability of Parameterized Verification (85 citations)
- A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms (37 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Operating system
- Algorithm
His primary scientific interests are in Model checking, Distributed algorithm, Algorithm, Abstraction model checking and Parameterized complexity.
Model checking is a primary field of his research addressed under Programming language.
His Distributed algorithm study incorporates themes from Partial order reduction and Bounded function.
His study on Bounded function also encompasses disciplines like
- Upper and lower bounds together with Reachability,
- Liveness that intertwine with fields like Counterexample, Fault tolerance, Fragment, Asynchronous communication and Commutative property.
His Abstraction model checking study improves the overall literature in Theoretical computer science.
His work on Termination analysis as part of general Theoretical computer science research is frequently linked to Imperative programming, bridging the gap between disciplines.
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.
