MINIMAL MODIFICATION OF AUTOMATA-BASED PROGRAMS INDUCED BY CHANGES IN THEIR TEST SCENARIOS

Abstract

The article proposes modification method for automata-based programs induced by changes in their test scenarios. The method can also be used for constructing automata-based programs without using any prior knowledge of a program structure and without using evolutional algorithms (as was proposed by many authors before). The main feature of the method is a minimal requirement for program changes. Its essence lies in the reduction of the original problem to the problem of finding the shortest path in the acyclic weighted graph constructed from the original automaton and new test scenario.

Keywords

• automata-based programming
• test scenario
• Moore automaton