Patric Feldmeier
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Patric Feldmeier has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Gordon Fraser
University of Passau, Passau, Germany
8 shared publications - Florian Obermüller
University of Passau, Passau, Germany
3 shared publications - Siegfried Steckenbiller
University of Passau, Passau, Germany
2 shared publications - Ute Heuer
University of Passau, Passau, Germany
2 shared publications - Benedikt Fein
University of Passau, Passau, Germany
1 shared publication - Philipp Straubinger
University of Passau, Passau, Germany
1 shared publication
Latest Publications
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 25-35
Reasoning About Bugs in Learners’ Scratch Programs Using Large Language Models
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 25-35
Open AccessReasoning About Bugs in Learners’ Scratch Programs Using Large Language Models
- Open Access
- 3 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Evolutionary Learning and Optimization
- Vol. 6 (1) , 1-32
Learning by Viewing: Generating Test Inputs for Games by Integrating Human Gameplay Traces in Neuroevolution
Although automated test generation is common in many programming domains, games still challenge test generators due to their heavy randomisation and hard-to-reach program states. Neuroevolution combined with search-based software testing principles has been shown to be a promising approach for testing games, but the co-evolutionary search for optimal network topologies and weights involves unreasonably long search durations. Humans, on the other hand, tend to be quick in picking up basic gameplay. In this article, we therefore aim to improve the evolutionary search for game input generators by integrating knowledge about human gameplay behaviour. To this end, we propose a novel way of systematically recording human gameplay traces, and integrating these traces into the evolutionary search for networks using traditional gradient descent as a mutation operator. Experiments conducted on 10 diverse Scratch games demonstrate that the proposed approach reduces the average search time from 5 hours down to only 97 minutes and helps the test generator achieve higher program coverage by reaching the winning states of games more often.
- 3 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Evolutionary Learning and Optimization
- Vol. 6 (1) , 1-32
Open AccessLearning by Viewing: Generating Test Inputs for Games by Integrating Human Gameplay Traces in Neuroevolution
Although automated test generation is common in many programming domains, games still challenge test generators due to their heavy randomisation and hard-to-reach program states. Neuroevolution combined with search-based software testing principles has been shown to be a promising approach for testing games, but the co-evolutionary search for optimal network topologies and weights involves unreasonably long search durations. Humans, on the other hand, tend to be quick in picking up basic gameplay. In this article, we therefore aim to improve the evolutionary search for game input generators by integrating knowledge about human gameplay behaviour. To this end, we propose a novel way of systematically recording human gameplay traces, and integrating these traces into the evolutionary search for networks using traditional gradient descent as a mutation operator. Experiments conducted on 10 diverse Scratch games demonstrate that the proposed approach reduces the average search time from 5 hours down to only 97 minutes and helps the test generator achieve higher program coverage by reaching the winning states of games more often.
- Open Access
- 12 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-12
A Block-Based Testing Framework for Scratch
- 12 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Open AccessA Block-Based Testing Framework for Scratch
- Open Access
- 12 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-2
Introducing Block-Based Testing in Scratch
- 12 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-2
Open AccessIntroducing Block-Based Testing in Scratch
- Open Access
- 16 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 14-19
Combining Neuroevolution with the Search for Novelty to Improve the Generation of Test Inputs for Games
As games challenge traditional automated white-box test generators, the Neatest approach generates test suites consisting of neural networks that exercise the source code by playing the games. Neatest generates these neural networks using an evolutionary algorithm that is guided by an objective function targeting individual source code statements. This approach works well if the objective function provides sufficient guidance, but deceiving or complex fitness landscapes may inhibit the search. In this paper, we investigate whether the issue of challenging fitness landscapes can be addressed by promoting novel behaviours during the search. Our case study on two Scratch games demonstrates that rewarding novel behaviours is a promising approach for overcoming challenging fitness landscapes, thus enabling future research on how to adapt the search algorithms to best use this information.
- 16 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 14-19
Open AccessCombining Neuroevolution with the Search for Novelty to Improve the Generation of Test Inputs for Games
As games challenge traditional automated white-box test generators, the Neatest approach generates test suites consisting of neural networks that exercise the source code by playing the games. Neatest generates these neural networks using an evolutionary algorithm that is guided by an objective function targeting individual source code statements. This approach works well if the objective function provides sufficient guidance, but deceiving or complex fitness landscapes may inhibit the search. In this paper, we investigate whether the issue of challenging fitness landscapes can be addressed by promoting novel behaviours during the search. Our case study on two Scratch games demonstrates that rewarding novel behaviours is a promising approach for overcoming challenging fitness landscapes, thus enabling future research on how to adapt the search algorithms to best use this information.
- Open Access
- 4 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 47-51
PlayTest: A Gamified Test Generator for Games
Games are usually created incrementally, requiring repeated testing of the same scenarios, which is a tedious and error-prone task for game developers. Therefore, we aim to alleviate this game testing process by encapsulating it into a game called Playtest, which transforms the tiring testing process into a competitive game with a purpose. Playtest automates the generation of valuable test cases based on player actions, without the players even realising it. We envision the use of Playtest to crowdsource the task of testing games by giving players access to the respective games through our tool in the playtesting phases during the development process.
- 4 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 47-51
Open AccessPlayTest: A Gamified Test Generator for Games
Games are usually created incrementally, requiring repeated testing of the same scenarios, which is a tedious and error-prone task for game developers. Therefore, we aim to alleviate this game testing process by encapsulating it into a game called Playtest, which transforms the tiring testing process into a competitive game with a purpose. Playtest automates the generation of valuable test cases based on player actions, without the players even realising it. We envision the use of Playtest to crowdsource the task of testing games by giving players access to the respective games through our tool in the playtesting phases during the development process.
- Open Access
- 12 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 1508-1517
Learning by Viewing: Generating Test Inputs for Games by Integrating Human Gameplay Traces in Neuroevolution
- 12 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 1508-1517
Open AccessLearning by Viewing: Generating Test Inputs for Games by Integrating Human Gameplay Traces in Neuroevolution
- Open Access
- 10 October 2022
- Published by Association for Computing Machinery (ACM)
- p. 1-13
Neuroevolution-Based Generation of Tests and Oracles for Games
Game-like programs have become increasingly popular in many software engineering domains such as mobile apps, web applications, or programming education. However, creating tests for programs that have the purpose of challenging human players is a daunting task for automatic test generators. Even if test generation succeeds in finding a relevant sequence of events to exercise a program, the randomized nature of games means that it may neither be possible to reproduce the exact program behavior underlying this sequence, nor to create test assertions checking if observed randomized game behavior is correct. To overcome these problems, we propose Neatest, a novel test generator based on the NeuroEvolution of Augmenting Topologies (NEAT) algorithm. Neatest systematically explores a program’s statements, and creates neural networks that operate the program in order to reliably reach each statement—that is, Neatest learns to play the game in a way to reliably cover different parts of the code. As the networks learn the actual game behavior, they can also serve as test oracles by evaluating how surprising the observed behavior of a program under test is compared to a supposedly correct version of the program. We evaluate this approach in the context of Scratch, an educational programming environment. Our empirical study on 25 non-trivial Scratch games demonstrates that our approach can successfully train neural networks that are not only far more resilient to random influences than traditional test suites consisting of static input sequences, but are also highly effective with an average mutation score of more than 65%.
- 10 October 2022
- Published by Association for Computing Machinery (ACM)
- p. 1-13
Open AccessNeuroevolution-Based Generation of Tests and Oracles for Games
Game-like programs have become increasingly popular in many software engineering domains such as mobile apps, web applications, or programming education. However, creating tests for programs that have the purpose of challenging human players is a daunting task for automatic test generators. Even if test generation succeeds in finding a relevant sequence of events to exercise a program, the randomized nature of games means that it may neither be possible to reproduce the exact program behavior underlying this sequence, nor to create test assertions checking if observed randomized game behavior is correct. To overcome these problems, we propose Neatest, a novel test generator based on the NeuroEvolution of Augmenting Topologies (NEAT) algorithm. Neatest systematically explores a program’s statements, and creates neural networks that operate the program in order to reliably reach each statement—that is, Neatest learns to play the game in a way to reliably cover different parts of the code. As the networks learn the actual game behavior, they can also serve as test oracles by evaluating how surprising the observed behavior of a program under test is compared to a supposedly correct version of the program. We evaluate this approach in the context of Scratch, an educational programming environment. Our empirical study on 25 non-trivial Scratch games demonstrates that our approach can successfully train neural networks that are not only far more resilient to random influences than traditional test suites consisting of static input sequences, but are also highly effective with an average mutation score of more than 65%.