Skip to main content
SpringerLink
Log in

Studies in the theory of algebraic models of programs with procedures

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

Algebraic models of programs with procedures extend algebraic models of programs that are free of procedures (simple models of programs). A specific feature of both types of models is that they are built for some formalization of software programs. Models of programs are intended for studying functional equivalence of formalized programs and constructing wide sets of equivalent transformations of programs. Two basic problems in the theory of algebraic models of programs are the equivalence problem and the problem of building complete systems of equivalent transformations. An increasing interest in models of programs with procedures is due to the abundance of results obtained for simple models of programs. The most suitable model of programs with procedures is a gateway model. A remarkable feature of these models is that every such model is induced by some simple model of programs. This paper gives a survey of the latest results obtained for gateway models of programs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Podlovchenko, R.I., Hierarchy of Program Models, Programmirovanie, 1981, no. 2, pp. 3–14.

    Google Scholar 

  2. Podlovchenko, R.I., Recursive programs and hierarchy of their models, Programmirovanie, 1991, no. 6, pp. 44–51.

    MathSciNet  Google Scholar 

  3. Zakharov, V.A., Program equivalence problem: Models, algorithms, and complexity, Doctoral (Phys.-Math.) Dissertation, 2012.

    Google Scholar 

  4. Podlovchenko, R.I., On an equivalence checking technique for algebraic models of programs, Program. Comput. Software, 2011, vol. 37, no. 6, pp. 292–298.

    Article  MathSciNet  MATH  Google Scholar 

  5. Zakharov, V.A., Equivalence checking of programs with the help of two-tape automata, Kibernetika i sistemnyi analiz, 2010, no. 4, pp. 39–48.

    Google Scholar 

  6. Podlovchenko, R.I., Equivalent transformations in mathematical models of computation, Moscow: MAKSPress, 2011.

    Google Scholar 

  7. Podlovchenko, R.I., Abstract programs with procedures and finite state machines with stacks, Intellektual’nye sistemy, 1997, vol. 2, no. 1–4, pp. 275–276

    Google Scholar 

  8. Podlovchenko, R.I., Special gateway–automaton models of recursive programs, Programmirovanie, 1994, no. 3, pp. 3–26.

    Google Scholar 

  9. Podlovchenko, R.I. and Molchanov, A.E., Equivalence problem solvability in gateway program models, Modelirovanie analiz informatsionnykh sistem, 2014, vol. 21, no. 2, pp. 56–70.

    Google Scholar 

  10. Podlovchenko, R.I., Primitive program schemes with procedures, Modelirovanie analiz informatsionnykh sistem, 2014, vol. 21, no. 4, pp. 116–131.

    Google Scholar 

  11. Molchanov, A.E., Equivalence problem solvability in biparametric gateway program models, Modelirovanie analiz informatsionnykh sistem, 2014, vol. 21, no. 4, pp. 104–115.

    Google Scholar 

  12. Podlovchenko, R.I., Analysis of a two-parameter algebraic model of programs by methods developed for one-parameter models, Program. Comput. Software, 2014, vol. 40, no. 3, pp. 107–116.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Moscow State University, Moscow, 119992, Russia

    R. I. Podlovchenko

Authors
  1. R. I. Podlovchenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. I. Podlovchenko.

Additional information

Original Russian Text © R.I. Podlovchenko, 2016, published in Programmirovanie, 2016, Vol. 42, No. 1.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Podlovchenko, R.I. Studies in the theory of algebraic models of programs with procedures. Program Comput Soft 42, 1–4 (2016). https://doi.org/10.1134/S0361768816010060

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0361768816010060

Keywords

Search

Navigation