AADEBUG'03 F. Gaucher, E. Jahier, B. Jeannet and F. Maraninchi "Automatic State Reaching for Debugging Reactive Programs" Fifth International Workshop on Automated and Algorithmic Debugging September 8-10, Ghent, Belgium

Abstract : Reactive systems are made of programs that permanently interact with their environment. Debuggers generally provide support for data and state inspection, given a sequence of inputs. But, because the reactive programs and their environments are interdependent, a very useful feature is to be able go the other way around; namely, given a state, obtain a sequence of inputs that leads to that state. This problem is equivalent to general safety properties verification, which is notoriously undecidable in presence of numeric variables. However, a lot of progress has been done in recent years through the development of model checking and abstract interpretation based techniques.

In this article, we take advantage of those recent advances to implement a fully automatic state reaching capability inside a debugger of reactive programs. To achieve that, we have connected a debugger, a verification tool, and a testing tool. One of the key contributions of our proposal is the proper handling of numeric variables.

Keywords automated debugging of reactive programs, state reaching, input sequence generation, test, counter-example generation, abstract-interpretation.

Last modified: Wed Oct 13 16:54:58 MEST 2004