Papapanagiotakis Bousy, Iason;
(2023)
Probability Guided Software Testing Efficiency.
Doctoral thesis (Ph.D), UCL (University College London).
Abstract
Asserting program correctness has been both a practical and theoretical challenge since the first days of computer science. The software engineering community has continuously iterated on testing and verification methods in search of ways to increase their confidence in their correctness assessment of programs. One particular issue that any practical method has had to consider is the finite and limited computational resources available to the correctness assessment process, giving birth to the field of testing efficiency. Throughout my PhD, I have focused on the question of testing efficiency and how a program’s usage profile interacts with a test partition when evaluating efficiency. I introduce a new systematic testing methodology, Probability Ordered Partition Testing (POPART), which is compared against the state-of-the-art in testing efficiency. I propose two different implementations for POPART, one based on probabilistic symbolic execution and the other on program instrumentation. POPART is then applied to the problem of program equivalence and allows us to iteratively tighten bounds on a probabilistic definition of input-output equivalence.
| Type: | Thesis (Doctoral) |
|---|---|
| Qualification: | Ph.D |
| Title: | Probability Guided Software Testing Efficiency |
| Language: | English |
| Keywords: | Testing, Software, Probability, Efficiency, Equivalence |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery-pp.ucl.ac.uk/id/eprint/10170895 |
Archive Staff Only
 |
View Item |
