Skip to main content
SpringerLink
Log in

On an equivalence checking technique for algebraic models of programs

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

Abstract

In the paper, the equivalence checking problem for program schemas in balanced semigroup models of programs is studied. A method for constructing algorithms to resolve this problem is proposed in the case where a semigroup model of programs possesses the left cancellation property h 1 h 2 = h 1 h 3 ⟹ h 2 = h 3. The equivalence checking problem is shown to be decidable in time that polynomially depends on size of the schema being checked if the balanced semigroup model of programs possesses additionally the right cancellation property h 2 h 1 = h 3 h 1 ⟹ h 2 = h 3.

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.

  2. Glushkov, V.M. and Letichevsky, A.A., Theory of Discrete Transformations, in Izbrannye voprosy algebry i logiki (Selected Issues of Algebra and Logics), Novosibirsk: Nauka, 1973, pp. 5–39.

    Google Scholar 

  3. Letichevsky, A.A., Equivalence of Automata Relative to Semigroups with Cancellation, Problemy kibernetiki, 1973, vol. 27, pp. 195–212.

    Google Scholar 

  4. Podlovchenko, R.I., Trace Technique in Solving Equivalence Problem in Algebraic Models of Programs, Kibernetika i sistemnyi analiz, 2009, no. 5, pp. 25–37.

  5. Podlovchenko, R.I., On Polynomial Solvability of the Equivalence Problem in Algebraic Models of Programs, Kibernetika i sistemnyi analiz, 2011, no. 4.

  6. Podlovchenko, R.I. and Zakharov, V.A., Polynomial in Complexity Algorithm Recognizing Commutative Equivalence in Program Schemas, Dokl. Ross. Akad. Nauk, 1998, vol. 362, no. 6, pp. 744–747.

    MathSciNet  Google Scholar 

  7. Zakharov, V.A., Two-Tape Machinery for the Equivalence Checking of Sequential Programs, Proc. of the Int. Workshop on Program Understanding, Novosibirsk, 2009, pp. 28–40.

  8. Zakharov, V.A., Equivalence Checking of Programs with the Help of Two-Tape Automata, Kibernetika i sistemnyi analiz, 2010, no. 4, pp. 39–48.

Download references

Author information

Authors and Affiliations

  1. Computing Research Center, Moscow State University, Vorob’evy gory, 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, 2011, published in Programmirovanie, 2011, Vol. 37, No. 6.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Podlovchenko, R.I. On an equivalence checking technique for algebraic models of programs. Program Comput Soft 37, 292–298 (2011). https://doi.org/10.1134/S0361768811060065

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation