Primitive program schemata with procedures
Римма Ивановна Подловченко · Automatic Control and Computer Sciences · 2014
Algebraic models of program are widely used for the analysis of program behavior. In this paper we study the equivalence problem for algebraic models of programs with procedures and equivalent transformations of program schemata. Among the algebraic models of programs with procedures we selected a subclass of gateway models and the corresponding primitive program schemata, since in the early papers it was proved that equivalence problem is decidable in this subclass. In this paper we show that in the case when the semantics of basic program statements is specified by decidable balanced left-cancellative semigroup we construct a complete system of equivalent transformations for a particular subclass of primitive program schemata.