Equivalent Transformations of Program Schemes for “Entangling” Programs

By entangling program, we mean its equivalent transformation that complicates understanding the program's logic. Conventionally, equivalent transformations of programs are designed on the basis of their schemes. The problem of constructing schemes that can be used for designing equivalent transformations is discussed. A general approach to solving this problem is presented. An example of its application to ALGOL-like programs without procedures is described in the case when program schemes are constructed from the program's algebraic models.