Abstract
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.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.REFERENCES
Rice, H.G., Classes of Recursively Enumerable Sets and Their Decision Problems, Trans. Am. Math. Soc., 1953, vol. 74, no. 2.
Lyapunov, A.A., On Logical Program Schemes, Probl. Kibern., Moscow: Fizmatgiz, 1958, issue 1, pp. 46–74.
Yanov, Yu.I., On Logical Algorithm Schemes, Probl. Kibern., Moscow: Fizmatgiz, 1958, issue 1, pp. 75–127.
Podlovchenko, R.I., Hierarchy of Program Models, Programmirovanie, 1981, no. 2, pp. 3–14.
Podlovchenko, R.I., On a General Solution to the Problem of Equivalent Transformations of Program Schemes. Part I, Programmirovanie, 2000, no. 1, pp. 64–77.
Podlovchenko, R.I., On a General Solution to the Problem of Equivalent Transformations of Program Schemes. Part II, Programmirovanie, 2000, no. 2, pp. 3–11.
Ershov, A.P., The Current State of the Theory of Program Schemes, Probl. Kibern., Moscow: Nauka, 1973, issue 27, pp. 87–110.
Kotov, V.E. and Sabel'fel'd, V.K., Teoriya skhem programm (Theory of Program Schemes), Moscow: Nauka, 1991.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Podlovchenko, R.I. Equivalent Transformations of Program Schemes for “Entangling” Programs. Programming and Computer Software 28, 106–116 (2002). https://doi.org/10.1023/A:1014885019688
Issue Date:
DOI: https://doi.org/10.1023/A:1014885019688