Data-Flow Analysis of Extended Finite State Machines

In this paper, we present a static data-flow analysis for synchronous programs, which is used to improve the run-time efficiency of the generated code. Our optimization techniques are based on extended finite state machines (EFSMs) which are obtained by a translation from synchronous guarded actions. In order to avoid a potential state space explosion of that translation, the subsequent analysis does not necessarily consider monolithic EFSMs, but is able to cope with a set of concurrent EFSMs, where invariants of the individual parts are collected and shared. Experiments show the potential of the optimizations: optimized programs generally have a smaller size and a better run-time performance.