Skip to main content
SpringerLink
Log in

Program equivalence checking by two-tape automata

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

This paper shows how two-tape automata can be employed to design efficient equivalence checking procedures for sequential programs. The semantics of sequential programs is defined in terms of dynamic logic structures. If a dynamic frame is acyclic (i.e., all program statements are irreversible), then it can be specified by means of a two-tape deterministic automaton. Then the equivalence checking problem for sequential programs in which the semantics of operators is determined by acyclic dynamic frames can be reduced to the emptiness problem for two-tape automata (compound machines).

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. A. A. Lyapunov and Yu. I. Yanov, “On logical schemes of programs,” in: Proc. Conf. “Paths of development of Soviet mathematical machine building and instrument making,” Part. 3 (1956), pp. 5–8.

  2. Yu. I. Yanov, “On logical schemes of algorithms,” in: Problemy Kibernetiki, 1, Fizmatgiz, Moscow (1958), pp. 75–121.

  3. V. M. Glushkov, “Automata theory and formal transformations of microprograms,” Cybernetics, No. 5, 1–9 (1965).

  4. V. M. Glushkov and A. A. Letichevskii, “Theory of discrete transducers,” in: Selected Topics in Algebra and Logic, Nauka, Novosibirsk (1973), pp. 5–39.

  5. D. C. Luckham, D. M. Park, and M. S. Paterson, “On formalized computer programs,” J. of Computer and System Science, 4, No. 3, 220–249 (1970).

    MATH  MathSciNet  Google Scholar 

  6. M. S. Paterson, “Program schemata,” in: Machine Intelligence, 3, Univ. Press., Edinburg (1968), pp. 19–31.

  7. J. W. De Bekker and D. A. Skott, “Theory of programs: Unpublished notes,” in: IBM Seminar, Vienna (1969).

  8. R. I. Podlovchenko, “Semigroup models of programs,” Programmirovanie, No. 4, 3–13 (1981).

  9. A. P. Ershov, “Present state of the theory of program schemes,” in: Problemy Kibernetiki, 27, Nauka, Moscow (1973), pp. 87–110.

  10. A. A. Letichevskii, “Functional equivalence of discrete transducers. II,” Cybernetics, No. 2, 14–28 (1970).

  11. A. B. Godlevskii, “A case of a special problem of functional equivalence of discrete transducers,” Cybernetics, No. 3, 412–415 (1974).

  12. A. A. Letichevskii, “Equivalence of automata with a terminal state with respect to a free semigroup with right zero,” Dokl. Akad. Nauk SSSR, 182, No. 5 (1968).

    Google Scholar 

  13. A. A. Letichevskii, “Functional equivalence of discrete transducers. III,” Cybernetics, No. 1, 1–4 (1972).

  14. A. A. Letichevskii, “Equivalence of automata with respect to cancellation semigroup,” in: Problemy Kibernetiki, 27, Fizmatgiz, Moscow (1973), pp. 195–212.

  15. A. A. Letichevsky and L. B. Smikun, “On groups with solvable equivalence problem,” in: Abstracts of the 4th All-Union. Conf. on Mathematical Logic (1976), p. 77.

  16. M. A. Taitslin, “Equivalence of automata with respect to a commutative semigroup,” Algebra and Logic, 8, No. 5, 553–600 (1968).

    Google Scholar 

  17. L. P. Lisovik, “Metalinear schemes with writing constants,” Programmirovanie, No. 2, 29–38 (1985).

  18. L. P. Lisovik, “Standard schemes with stacks,” Dop. Akad. Nauk URSR, No. 12, 23–27 (1989).

  19. G. N. Petrosyan, “Inclusion problem over submemory for operational schemes and its decidable case,” System and Theoretical Programming, VTs SO AN SSSR, Novosibirsk (1974), pp. 130–151.

  20. V. K. Sabel’feld, “Transformations of unary linear recursion schemes,” Cybernetics, No. 5, 727–735 (1975).

  21. V. K. Sabel’feld, “A polynomial estimate of the complexity of recognition of logic-term equivalence,” Dokl. Akad. Nauk SSSR, 249, No. 4, 793–796 (1979).

    MathSciNet  Google Scholar 

  22. V. K. Sabel’feld, “A new class of schemes with decidable functional equivalence,” in: Informatics: Support tools, Novosibirsk (1988), pp. 109–126.

  23. E. Ashcroft, Z. Manna, and A. Pnueli, “A decidable properties of monadic functional schemes,” J. of the ACM, 20, No. 3, 489–499 (1973).

    Article  MATH  MathSciNet  Google Scholar 

  24. M. S. Paterson, “Decision problems in computational models,” SIGPLAN Notices, 7, 74–82 (1972).

    Article  Google Scholar 

  25. V. E. Kotov and V. K. Sabel’feld, Theory of Program Schemes [in Russian], Nauka, Moscow (1991).

    MATH  Google Scholar 

  26. L. P. Lisovik, “Schemes of programs and transducers over labeled trees,” in: Mat. Voprosy Kibernetiki, 2, Nauka, Moscow (1996), pp. 281–320.

  27. L. G. Valiant, “The equivalence problem for deterministic finite-turn push-down automata,” Information and Control, 25, No. 2, 123–133 (1974).

    Article  MATH  MathSciNet  Google Scholar 

  28. A. A. Letichevsky, “Practical methods for the recognition of the equivalence of discrete transducers and program schemata,” Cybernetics, No. 4, 565–576 (1973).

  29. R. I. Podlovchenko and V. A. Zakharov, “A polynomial algorithm recognizing commutative equivalence of program schemes,” Dokl. RAN, 362, No. 6, 27–31 (1998).

    MathSciNet  Google Scholar 

  30. V. A. Zakharov, “Fast algorithms for checking the equivalence of operator programs on balanced frames,” in: Mat. Voprosy Kibernetiki, 7, Nauka, Moscow (1998), pp. 303–324.

  31. V. A. Zakharov, “An efficient and unified approach to the decidability of equivalence of propositional programs,” Lecture Notes in Computer Science, 1443, 247–259 (1998).

    Article  Google Scholar 

  32. V. A. Zakharov, “Fast algorithms for checking the equivalence of propositional operator programs on ordered semigroup frames,” Vestnik Mosk. Un-ta, Ser. 15, Vychisl. Matematika i Kibernetika, No. 3, 29–35 (1999).

  33. V. A. Zakharov, “On the efficient decidability of the equivalence problem for linear monadic recursive programs,” in: Mat. Voprosy Kibernetiki, 8, Nauka, Moscow (1999), pp. 255–273.

  34. V. A. Zakharov, “On the decidability of the equivalence problem for orthogonal sequential programs,” Grammars, 2, No. 3, 271–181 (1999).

    Article  MATH  MathSciNet  Google Scholar 

  35. V. A. Zakharov, “On the decidability of the equivalence problem for monadic recursive programs,” Theoretical Informatics and Applications, 34, No. 2, 157–171 (2000).

    Article  MATH  MathSciNet  Google Scholar 

  36. V. Zakharov and I. Zakharyaschev, “On the equivalence-checking problem for a model of programs related with multi-tape automata,” Lecture Notes in Computer Science, 3317, 293–305 (2005).

    Article  MathSciNet  Google Scholar 

  37. V. L. Shcherbina and V. A. Zakharov, “Efficient algorithms for checking the equivalence of programs in interrupt handling models,” Vestnik Mosk. Un-ta, Ser. 15, Vychisl. Matematika i Kibernetika, No. 2, 33–41 (2008).

  38. R. I. Podlovchenko, “Technique of traces in solving the equivalence problem in algebraic program models,” Cybernetics and Systems Analysis, No. 5, 692–702 (2009).

  39. R. I. Podlovchenko, “Hierarchy of program models,” Programmirovanie, No. 2, 3–14 (1981).

  40. R. Podlovchenko, D. Rusakov, and V. Zakharov, “On the equivalence problem for programs with mode switching,” Lecture Notes in Computer Science, 3845, 351–352 (2006).

    Article  Google Scholar 

  41. D. Harel, “Dynamic logics,” in: D. Gabbay and F. Guenthner (eds.), Handbook of Philosophical Logics (1984), pp. 497–604.

  42. J. H. Johnson, “Rational equivalence relations,” Theoretical Computer Science, 47, No. 1, 39–60 (1986).

    Article  MATH  MathSciNet  Google Scholar 

  43. M. Y. Vardi and P. Wolper, “Automata-theoretic techniques for modal logics of programs,” J. of Computer and System Science, 32, No. 2, 183–221 (1986).

    Article  MATH  MathSciNet  Google Scholar 

  44. A. Bouajjani, J. Esparza, and O. Maller, “Reachability analysis of pushdown automata: Application to model checking,” Lecture Notes in Computer Science, 1243, 135–150 (1997).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. M. V. Lomonosov Moscow State University, Moscow, Russia

    V. A. Zakharov

Authors
  1. V. A. Zakharov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. A. Zakharov.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 39–48, July–August 2010.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zakharov, V.A. Program equivalence checking by two-tape automata. Cybern Syst Anal 46, 554–562 (2010). https://doi.org/10.1007/s10559-010-9232-z

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-010-9232-z

Keywords

Search

Navigation