Maton, Megan
ORCID: 0009-0005-8817-4279
(2026)
Investigating the Relationships Between Mutants, Oracles and Pseudo-Testedness.
PhD thesis, University of Sheffield.
Abstract
Test suites are critical in developing high-quality software, yet are commonly measured
using code coverage. Code coverage measures the quantity of test suite-executed code,
without requiring code behaviours be checked by an oracle (e.g., an assertion), leaving
code vulnerable to pseudo-testedness. Pseudo-tested code is executed by the test suite,
yet can be deleted without triggering test failures. Intuitively, pseudo-testedness can
be detected using deletion operators, but has not been explored at the statement level.
The relationship between pseudo-tested statement identification (PTSI) and other oracle-
based adequacy metrics, i.e., checked coverage, remains unclear, leaving open questions
about each technique’s role. Because PTSI relies on rule-based deletion mutation, it
only highlights the absence of a check. To move beyond identifying where checks are
missing, mutants must produce semantically incorrect behaviours that reveal the context
requiring the check. While large language models (LLMs) enable context-aware mutation
testing, current LLM-based tools are constrained to small code changes, such as lines
or AST nodes. To utilise the LLM’s capabilities, tools must move towards algorithm-
level approaches that guide the LLM to produce non-trivial, productive mutants. This
thesis aims to characterise these relationships and utilise them to refine the techniques.
First, this thesis explores pseudo-testedness across 23 projects, identifying that pseudo-
tested methods miss 48% of pseudo-tested statements. Secondly, compared with checked
coverage using dynamic and observation-based slicers, PTSI locates code with the lowest
median mutation scores (0.32 vs. 0.76 and 0.5) while executing at least 10x faster. Finally,
this thesis uses systematic hazard analysis to guide LLMs in generating algorithm-level
mutants that are uniquely subsuming and defect-matching compared with existing LLM-
and rule-based techniques. By characterising the relationships between mutants, oracles
and pseudo-testedness, this thesis enables the refinement of these techniques for test suite assessment.
Metadata
| Supervisors: | McMinn, Phil |
|---|---|
| Related URLs: |
|
| Publicly visible additional information: | “In reference to IEEE copyrighted material which is used with permission in this thesis, the IEEE does not endorse any of The University of Sheffield’s products or services. Internal or personal use of this material is permitted. If interested in reprinting/republishing IEEE copyrighted material for advertising or promotional purposes or for creating new collective works for resale or redistribution, please go to http://www.ieee.org/publications_standards/publications/rights/rights_link.html to learn how to obtain a License from RightsLink. If applicable, University Microfilms and/or ProQuest Library, or the Archives of Canada may supply single copies of the dissertation.” |
| Keywords: | software testing, mutation testing, pseudo-tested, large language model |
| Awarding institution: | University of Sheffield |
| Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Computer Science (Sheffield) |
| Date Deposited: | 09 Sep 2026 10:19 |
| Last Modified: | 09 Sep 2026 10:19 |
| Open Archives Initiative ID (OAI ID): | oai:etheses.whiterose.ac.uk:39289 |
Download
Final eThesis - complete (pdf)
Filename: paper.pdf
Licence:

This work is licensed under a Creative Commons Attribution NonCommercial NoDerivatives 4.0 International License
Export
Statistics
You do not need to contact us to get a copy of this thesis. Please use the 'Download' link(s) above to get a copy.
You can contact us about this thesis. If you need to make a general enquiry, please see the Contact us page.