Abstract:
The optimization of software for a certain algorithm is interpreted in a general case as a multi-step positional game of two players where the conditions depend on the optimization goals. At every step the minimizing player chooses statement which generate the associated program unit and the other player determines the conditions for unit termination. In particular cases the software may be optimized by determining extreme paths in weighted directed graphs. Formal problem statements, meaningful description of optimization procedures, and examples of their operation are provided..