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 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.
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.
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.
Search Algorithms for Regression Test Case Prioritization
Z. Li;M. Harman;R.M. Hierons.
IEEE Transactions on Software Engineering (2007)
Using formal specifications to support testing
Robert M. Hierons;Kirill Bogdanov;Jonathan P. Bowen;Rance Cleaveland.
ACM Computing Surveys (2009)
Reformulating software engineering as a search problem
J Clarke;J J Dolado;Mark Harman;R Hierons.
IEE Proceedings - Software (2003)
M. Harman;L. Hu;R. Hierons;J. Wegener.
IEEE Transactions on Software Engineering (2004)
Using Program Slicing to Assist in the Detection of Equivalent Mutants
Robert Mark Hierons;Mark Harman;Sebastian Danicic.
Software Testing, Verification & Reliability (1999)
An overview of program slicing
Mark Harman;Robert Mark Hierons.
Software Focus (2001)
A multiple hill climbing approach to software module clustering
K. Mahdavi;M. Harman;R.M. Hierons.
international conference on software maintenance (2003)
How to Overcome the Equivalent Mutant Problem and Achieve Tailored Selective Mutation Using Co-evolution
Konstantinos Adamopoulos;Mark Harman;Robert M. Hierons.
genetic and evolutionary computation conference (2004)
A new representation and crossover operator for search-based optimization of software modularization
Mark Harman;Robert M. Hierons;Mark Proctor.
genetic and evolutionary computation conference (2002)
Testing from a Z Specification
Robert M. Hierons.
Software Testing, Verification & Reliability (1997)
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: