What is he best known for?
The fields of study he is best known for:
- Programming language
- Algorithm
- Software
Robert M. Hierons spends much of his time researching Algorithm, Finite-state machine, Programming language, Theoretical computer science and Genetic algorithm.
He has included themes like Test, Test case, Path, Sequence and Mutation testing in his Algorithm study.
His biological study spans a wide range of topics, including Discrete mathematics, Equivalence, Model-based testing, State and System under test.
His Programming language study frequently intersects with other fields, such as Slicing.
His Theoretical computer science study combines topics from a wide range of disciplines, such as Transformation, Hill climbing, Search-based software engineering and Exploit.
His Genetic algorithm study combines topics in areas such as Metaheuristic and Metric.
His most cited work include:
- Search Algorithms for Regression Test Case Prioritization (558 citations)
- Using formal specifications to support testing (287 citations)
- Reformulating software engineering as a search problem (258 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of investigation include Algorithm, Finite-state machine, Theoretical computer science, Programming language and System under test.
His Algorithm research integrates issues from Transformation, Genetic algorithm and Mutation testing.
His work deals with themes such as Time complexity, Model-based testing, Set, State and Sequence, which intersect with Finite-state machine.
Robert M. Hierons studied Programming language and Slicing that intersect with Source code.
His work in System under test tackles topics such as Distributed computing which are related to areas like Controllability and Test.
His Program slicing research is multidisciplinary, incorporating elements of Program comprehension and Reverse engineering.
He most often published in these fields:
- Algorithm (27.50%)
- Finite-state machine (24.37%)
- Theoretical computer science (19.06%)
What were the highlights of his more recent work (between 2014-2021)?
- Finite-state machine (24.37%)
- Algorithm (27.50%)
- System under test (12.50%)
In recent papers he was focusing on the following fields of study:
His primary scientific interests are in Finite-state machine, Algorithm, System under test, Theoretical computer science and Model-based testing.
The Finite-state machine study combines topics in areas such as Test suite, Bounded function, Fault coverage, Parallel algorithm and Sequence.
His studies in Algorithm integrate themes in fields like Mutation testing and Fault detection and isolation.
His study in System under test is interdisciplinary in nature, drawing from both Software system and Tuple.
His Theoretical computer science research is multidisciplinary, relying on both Computational complexity theory, Computerized adaptive testing, Relation and Distributed testing.
His research in Model-based testing intersects with topics in Programming language, Probabilistic logic, Distributed computing and Integration testing.
Between 2014 and 2021, his most popular works were:
- Smart contracts vulnerabilities: a call for blockchain software engineering? (79 citations)
- SIP: Optimal Product Selection from Feature Models Using Many-Objective Evolutionary Optimization (59 citations)
- Multi-objective optimisation for regression testing (21 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Algorithm
- Software
His primary areas of study are Finite-state machine, Algorithm, System under test, Model-based testing and TRACE.
His Finite-state machine research incorporates themes from Parallel algorithm and Theoretical computer science.
His study focuses on the intersection of Algorithm and fields such as Sequence with connections in the field of Set.
He interconnects Test suite and Software system in the investigation of issues within System under test.
The concepts of his Test suite study are interwoven with issues in Programming language, Redundancy, Prime, Combinatorics and Controllability.
As a part of the same scientific study, Robert M. Hierons usually deals with the Greedy algorithm, concentrating on Process and frequently concerns with Mathematical optimization.
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.
