Abstract
Algebraic program models with procedures are designed to analyze program semantic properties on their models called program schemes. Liberisation and equivalence problems are stated for program models with procedures. A subclass of program models with procedures called special gateway models is investigated. A better complexity algorithm for the liberisation in such models is proposed. Primitive program schemes are defined as a subclass of the special gateway models. It is shown that the equivalence problem in such models is decidable if the equivalence problem is decidable in special program models without procedures. For some cases of decidability complexity is evaluated.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Podlovchenko, R.I. and Molchanov, A.E., About algebraic program models with procedures, Model. Analiz Inform. Sist., 2012, vol. 19, no. 5, pp. 100–114.
Podlovchenko, R.I., On the polynomial complexity of the equivalence checking problem in algebraic models of programs, Cybern. Syst. Analysis, 2012, vol. 48, pp. 653–659.
Podlovchenko, R.I., On an equivalence checking technique for algebraic models of programs, Progr. Compt. Software, 2011, vol. 37, pp. 292–298.
Podlovchenko, R.I., On a class of algebraic models of programs of practical interest, Progr. Compt. Software, 2013, vol. 39, pp. 124–134.
Lyapunov, A.A., In logic schemes of programs, Problemy kibernetiki, 1958, no. 1, pp. 46–74.
Janov, Ju.I., In logic schemes of algorithms, Problemy kibernetiki, 1958, no. 1, pp. 75–127.
Glushkov, V.M. and Letichevskij, A.A., Theory of discrete transformers, in Selected Questions of Algebra and Logic. Collection of Papers Novosibirsk; Nauka, 1973.
Ershov, A.P. and Sabelfeld, V.K., Sketches on scheme theory of recursive programs, in Translyatsiya i modeli programm (Translation and Models of Programs) Novosibirsk, 1980, pp. 23–53.
Zaharov, V.A., Quick algorithms of resolution of equivalence of operator programs on balanced scales, Matem. voprosy kibern., 1998, no. 7, pp. 303–324.
Zakharov, V.A., Program equivalence checking by two-tape automata, Cybern. Syst. Analysis, 2010, vol. 46, pp. 554–562.
Kotov, V.E. and Sabelfeld, V.K., Teorija skhem programm (Theory of Schemes of Programs) Moscow: Nauka, 1991.
Lisovik, L.P., Metalinear recursive schemes over marked trees, Programmirovanie, 1983, no. 5, pp. 13–22.
Podlovchenko, R.I. and Popov, S.V., The approximating relation on a program model set, Vest. Mos. Univ., Ser. 15, Vychisl. Matem. Kibern., 2001, no. 2, pp. 38–46.
Podlovchenko, R.I., From Janov schemes to the theory of program models, Matem. Voprosy Kibern., 1998, no. 7, pp. 281–302.
Podlovchenko, R.I., Abstract programs with procedures and finite automata with magazine, Intellekt. Sist., 1997, vol. 2, pp. 275–295.
Podlovchenko, R.I. and Dolgih, B.A., Two-stage modeling of programs with procedures, Matem. Vopr. Kibern., 2003, no. 12, pp. 47–56.
Podlovchenko, R.I., Algebraic program models and automata, Matem. Vopr. Kibern., 2003, no. 12, pp. 47–56.
Cousot, P., Constructive design of a hierarchy of semantics of transition system by abstract interpretation, Theor. Compt. Sci., 2002, vol. 277, pp. 47–103.
Senizergues, G., The equivalence problem for deterministic pushdown automata is decidable, Lecture Notes Compt. Sci., 1997, vol. 1256, pp. 271–281.
Zakharov, V.A., Kuzurin, N.N., Podlovchenko, R.I., and Scherbina, V.V., Using algebraic models of programs for detecting metamorphic malwares, Trudy Inst. Sist. Program., 2007, vol. 12, pp. 77–94.
Author information
Authors and Affiliations
Corresponding author
Additional information
The article is published in the original.
About this article
Cite this article
Podlovchenko, R.I., Molchanov, A.E. Equivalence problem solvability in gateway program models. Aut. Control Comp. Sci. 48, 581–588 (2014). https://doi.org/10.3103/S014641161407027X
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S014641161407027X