23 citations · 34 across the 8 of their papers we have counts for
10 papers
Empirically Evaluating the Use of Bytecode for Diversity-Based Test Case Prioritisation
Islam T. Elgendy, Robert M. Hierons, Phil McMinn
Regression testing assures software correctness after changes but is resource-intensive. Test Case Prioritisation (TCP) mitigates this by ordering tests to maximise early fault det…
Bounding Random Test Set Size with Computational Learning Theory
Neil Walkinshaw, Michael Foster, Jose Miguel Rojas +1
Random testing approaches work by generating inputs at random, or by selecting inputs randomly from some pre-defined operational profile. One long-standing question that arises in…
A Survey of the Metrics, Uses, and Subjects of Diversity-Based Techniques in Software Testing
Islam T. Elgendy, Robert M. Hierons, Phil McMinn
There has been a significant amount of interest regarding the use of diversity-based testing techniques in software testing over the past two decades. Diversity-based testing (DBT)…
Testing Causality in Scientific Modelling Software
Andrew G. Clark, Michael Foster, Benedikt Prifling +4
From simulating galaxy formation to viral transmission in a pandemic, scientific models play a pivotal role in developing scientific theories and supporting government policy decis…
Test case generation for agent-based models: A systematic literature review
Andrew G. Clark, Neil Walkinshaw, Robert M. Hierons
Agent-based models play an important role in simulating complex emergent phenomena and supporting critical decisions. In this context, a software fault may result in poorly informe…
Four-valued monitorability of -regular languages
Zhe Chen, Yunyun Chen, Robert M. Hierons +1
Runtime Verification (RV) is a lightweight formal technique in which program or system execution is monitored and analyzed, to check whether certain properties are satisfied or vio…
Characterizing Minimal Semantics-preserving Slices of predicate-linear, Free, Liberal Program Schemas
Sebastian Danicic, Robert M Hierons, Michael R Laurence
A program schema defines a class of programs, all of which have identical statement structure, but whose functions and predicates may differ. A schema thus defines an entire class…
Decidability and Complexity for Quiescent Consistency and its Variations
Brijesh Dongol, Robert M. Hierons
Quiescent consistency is a notion of correctness for a concurrent object that gives meaning to the object's behaviours in quiescent states, i.e., states in which none of the object…
Checking Finite State Machine Conformance when there are Distributed Observations
Robert M Hierons
This paper concerns state-based systems that interact with their environment at physically distributed interfaces, called ports. When such a system is used a projection of the glob…
Complexity of Data Dependence problems for Program Schemas with Concurrency
Sebastian Danicic, Robert M Hierons, Michael R Laurence
The problem of deciding whether one point in a program is data dependent upon another is fundamental to program analysis and has been widely studied. In this paper we consider this…