Justyna Petke

Justyna Petke

Auto-generated profile, based on publicly available information

Justyna Petke

University College London, London, United Kingdom

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 April 2017 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Open access
JPJustyna Petke
Justyna Petke
SHSaemundur O. Haraldsson
Saemundur O. Haraldsson
MHMark Harman
Mark Harman
WLWilliam B. Langdon
William B. Langdon
DWDavid R. White
David R. White
JWJohn R. Woodward
John R. Woodward
Genetic improvement (GI) uses automated search to find improved versions of existing software. We present a comprehensive survey of this nascent field of research with a focus on the core papers in the area published between 1995 and 2015. We identified core publications including empirical studies, 96% of which use evolutionary algorithms (genetic programming in particular). Although we can trace the foundations of GI back to the origins of computer science itself, our analysis reveals a significant upsurge in activity since 2012. GI has resulted in dramatic performance improvements for a diverse set of properties such as execution time, energy and memory consumption, as well as results for fixing and extending existing system functionality. Moreover, we present examples of research work that lies on the boundary between GI and other areas, such as program transformation, approximate computing, and software repair, with the intention of encouraging further exchange of ideas between researchers in these fields.

6 July 2018 in IEEE Transactions on Software Engineering
Verified
Journal Article
Open access
HWHuayao Wu
Huayao Wu
CNChanghai Nie
Changhai Nie
JPJustyna Petke
Justyna Petke
YJYue Jia
Yue Jia
MHMark Harman
Mark Harman
We present an empirical comparison of three test generation techniques, namely, Combinatorial Testing (CT), Random Testing (RT) and Adaptive Random Testing (ART), under different test scenarios. This is the first study in the literature to account for the (more realistic) testing setting in which the tester may not have complete information about the parameters and constraints that pertain to the system, and to account for the challenge posed by faults (in terms of failure rate). Our study was conducted on nine real-world programs under a total of 1683 test scenarios (combinations of available parameter and constraint information and failure rate). The results show significant differences in the techniques' fault detection ability when faults are hard to detect (failure rates are relatively low). CT performs best overall; no worse than any other in 98% of scenarios studied. ART enhances RT, and is comparable to CT in 96% of scenarios, but its computational cost can be up to 3.5 times higher than CT when the program is highly constrained. Additionally, when constraint information is unavailable for a highly-constrained program, a large random test suite is as effective as CT or ART, yet its computational cost of test generation is significantly lower than that of other techniques.

29 June 2017 in IEEE Transactions on Software Engineering
Verified
Journal Article
Open access
JPJustyna Petke
Justyna Petke
MHMark Harman
Mark Harman
WLWilliam B. Langdon
William B. Langdon
WWWestley Weimer
Westley Weimer
Genetic improvement uses computational search to improve existing software while retaining its partial functionality. Genetic improvement has previously been concerned with improving a system with respect to all possible usage scenarios. In this paper, we show how genetic improvement can also be used to achieve specialisation to a specific set of usage scenarios. We use genetic improvement to evolve faster versions of a C++ program, a Boolean satisfiability solver called MiniSAT, specialising it for three applications. Our specialised solvers achieve between 4% and 36% execution time improvement, which is commensurate with efficiency gains achievable using human expert optimisation for the general solver. We also use genetic improvement to evolve faster versions of an image processing tool called ImageMagick, utilising code from GraphicsMagick, another image processing tool which was forked from it. We specialise the format conversion functionality to black & white images and colour images only. Our specialised versions achieve up to 3% execution time improvement.

16 April 2018 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
BBBobby Ralph Bruce
Bobby Ralph Bruce
JPJustyna Petke
Justyna Petke
MHMark Harman
Mark Harman
EBEarl T. Barr
Earl T. Barr
Reducing the energy consumption of software systems though optimisations techniques such as genetic improvement is gaining interest. However, efficient and effective improvement of software systems requires a better understanding of the code-change search space. One important choice practitioners have is whether to preserve the system's original output or permit approximation with each scenario having its own search space characteristics. When output preservation is a hard constraint, we report that the maximum energy reduction achievable by the modification operators is 2.69% (0.76% on average). By contrast, this figure increases dramatically to 95.60% (33.90% on average) when approximation is permitted, indicating the critical importance of approximate output quality assessment for code optimisation. We investigate synergy, a phenomenon that occurs when simultaneously applied source code modifications produce an effect greater than their individual sum. Our results reveal that 12.0% of all joint code modifications produced such a synergistic effect though 38.5% produce an antagonistic interaction in which simultaneously applied modifications are less effective than when applied individually. This highlights the need for more advanced search-based approaches.

4 December 2023
Verified
Book Chapter
Closed access
PDF file
ABAlexander Brownlee
Alexander Brownlee
JCJames Callan
James Callan
KEKarine Even-Mendoza
Karine Even-Mendoza
AGAlina Geiger
Alina Geiger
CHCarol Hanna
Carol Hanna
DSDominik Sobania
Dominik Sobania

31 March 2021 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
ABAymeric Blot
Aymeric Blot
JPJustyna Petke
Justyna Petke
Genetic improvement (GI) uses automated search to improve existing software. It has been successfully used to optimize various program properties, such as runtime or energy consumption, as well as for the purpose of bug fixing. GI typically navigates a space of thousands of patches in search for the program mutation that best improves the desired software property. While genetic programming (GP) has been dominantly used as the search strategy, more recently other search strategies, such as local search, have been tried. It is, however, still unclear which strategy is the most effective and efficient. In this article, we conduct an in-depth empirical comparison of a total of 18 search processes using a set of eight improvement scenarios. Additionally, we also provide new GI benchmarks and we report on new software patches found. Our results show that, overall, local search approaches achieve better effectiveness and efficiency than GP approaches. Moreover, improvements were found in all scenarios (between 15% and 68%). A replication package can be found online: https://github.com/bloa/tevc_2020_artefact .