We present a conservative method to automatically fix faults in a finite state program by considering the repair problem as a game. The game consists of the product of a modified version of the program and an automaton representing the LTL specification. Every winning finite state strategy for the game corresponds to a repair. The opposite does not hold, but we show conditions under which the existence of a winning strategy is guaranteed. A finite state strategy corresponds to a repair that adds variables to the program, which we argue is undesirable. To avoid extra state, we need a memoryless strategy. We show that the problem of finding a memoryless strategy is NP-complete and present a heuristic. We have implemented the approach symbolically and present initial evidence of its usefulness. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Jobstmann, B., Griesmayer, A., & Bloem, R. (2005). Program repair as a game. In Lecture Notes in Computer Science (Vol. 3576, pp. 226–238). Springer Verlag. https://doi.org/10.1007/11513988_23
Mendeley helps you to discover research relevant for your work.