What is he best known for?
The fields of study he is best known for:
- Programming language
- Operating system
- Software
Klaus Havelund mostly deals with Programming language, Temporal logic, Model checking, Linear temporal logic and Java.
His research combines Theoretical computer science and Programming language.
His study in Temporal logic is interdisciplinary in nature, drawing from both Parameterized complexity, Rule-based machine translation and Automata theory.
His Model checking study combines topics in areas such as Program analysis, Formal verification and Software engineering.
His Software engineering research is multidisciplinary, incorporating perspectives in Partial order reduction, Virtual machine, Java bytecode and Program slicing.
In general Linear temporal logic, his work in Computation tree logic is often linked to TRACE linking many areas of study.
His most cited work include:
- Model checking programs (1316 citations)
- Model checking JAVA programs using JAVA PathFinder (719 citations)
- Rule-Based Runtime Verification (309 citations)
What are the main themes of his work throughout his whole career to date?
The scientist’s investigation covers issues in Programming language, Runtime verification, Software engineering, Temporal logic and Model checking.
His work on Programming language deals in particular with Java, Finite-state machine, Scala, Linear temporal logic and Promela.
As part of one scientific family, Klaus Havelund deals mainly with the area of Runtime verification, narrowing it down to issues related to the Instrumentation, and often Compiler.
Klaus Havelund combines subjects such as Python and Static analysis with his study of Software engineering.
The Interval temporal logic and Computation tree logic research Klaus Havelund does as part of his general Temporal logic study is frequently linked to other disciplines of science, such as TRACE, therefore creating a link between diverse domains of science.
His Model checking study also includes
- Embedded system which is related to area like Protocol,
- Software which is related to area like Systems design.
He most often published in these fields:
- Programming language (53.25%)
- Runtime verification (44.81%)
- Software engineering (26.62%)
What were the highlights of his more recent work (between 2017-2020)?
- Runtime verification (44.81%)
- Programming language (53.25%)
- Temporal logic (26.62%)
In recent papers he was focusing on the following fields of study:
His primary areas of study are Runtime verification, Programming language, Temporal logic, Theoretical computer science and Finite-state machine.
His research in Runtime verification intersects with topics in Property, Visualization and Formal specification.
Programming language is a component of his Scala, Specification language, Mesa, Garbage collection and Automated theorem proving studies.
Klaus Havelund interconnects Representation and Binary decision diagram in the investigation of issues within Temporal logic.
His work deals with themes such as System programming, Distributed computing and Mutation, which intersect with Finite-state machine.
His Software engineering research includes elements of Software verification and validation and Continuation.
Between 2017 and 2020, his most popular works were:
- Monitoring Events that Carry Data (30 citations)
- Runtime Verification: From Propositional to First-Order Temporal Logic (12 citations)
- Efficient Runtime Verification of First-Order Temporal Properties (11 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Operating system
- Software
Klaus Havelund mainly focuses on Runtime verification, Theoretical computer science, Formal specification, Temporal logic and Programming language.
His studies deal with areas such as Property and Field as well as Runtime verification.
The concepts of his Field study are interwoven with issues in Visualization, Computation, Software engineering and Specification mining.
His Formal specification study combines topics from a wide range of disciplines, such as Formal methods, Semantics, Syntax and Existential quantification.
The various areas that Klaus Havelund examines in his Temporal logic study include Finite-state machine, Regular expression and Stream processing.
His TRACE studies intersect with other subjects such as Raising, Macro, First order, Compact space and Linear temporal logic.
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.
