Skip to main content
SpringerLink
Log in

A Method of Proving the Invariance of Linear Inequalities for Linear Loops

  • SOFTWARE–HARDWARE SYSTEMS
  • Published:
Cybernetics and Systems Analysis Aims and scope

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

References

  1. R. W. Floyd, “Assigning meanings to programs,” in: J. T. Schwartz (ed.), Mathematical Aspects of Computer Science, Proc. of Symp. on Appl. Math., Vol. 19, Amer. Math. Soc., Providence, RI (1967), pp. 19–32.

    Chapter  Google Scholar 

  2. C. A. R. Hoare, “An axiomatic basis for computer programming,” Comm. ACM., No. 12 (10), 576–580, ACM, New York (1969).

  3. A. B. Godlevskii, Yu. V. Kapitonova, S. L. Krivoi, and A. A. Letichevskii, “Iterative methods of program analysis,” Cybernetics, 25, No. 2, 139–152 (1989).

    Article  MathSciNet  Google Scholar 

  4. M. S. Lvov, “Invariant equalities of small degrees in the programs defined over a field,” Cybernetics, 24, No. 1, 108–110 (1988).

    Google Scholar 

  5. A. Letichevsky and M. Lvov, “Discovery of invariant equalities in programs over data fields,” Appl. Algebra in Eng., Commun. Comput., No. 4, 21–29 (1993).

  6. M. Lvov, “About one algorithm of program polynomial invariants generation,” in: Proc. Workshop on Invariant Generation, WING 2007, M. Giese and T. Jebelean (eds.), Techn. Rep. No. 07-07 in RISC Report Series, University of Linz, Austria (2007), pp. 85–99 (electronic).

    Google Scholar 

  7. M. Mu ller-Olm and H. Seidl, “Computing polynomial program invariants,” Inf. Process. Lett., 91, No. 5, 233–244 (2004).

    Article  Google Scholar 

  8. M.Mu ller-Olm and H. Seidl, “Precise interprocedural analysis through linear algebra,” in: Proc. 31st ACMSIGPLAN-SIGACT Symp. on Principles of Program. Languages; SIGPLAN Notices – POPL’04, 39, No. 1, 330–341 (2004).

  9. S. Sankaranarayanan, H. Sipma, and Z. Manna, “Non-linear loop invariant generation using Grobner bases,” in: Proc. Symp. on Principles of Program. Languages, Venice, Italy; ACM, New York (2004), pp. 318–329.

  10. E. Rodriguez-Carbonell and D. Kapur, “Automatic generation of polynomial loop invariants: Algebraic foundations,” in: Proc. of Intern. Symp. on Symbolic and Algebraic Comp., Santander, Spain; ACM, New York (2004), pp. 266–273.

  11. L. I. Kovács and T. Jebelean, “An algorithm for automated generation of invariants for loops with conditionals,” in: Proc. Intern. Symp. on Symbolic and Numeric Algorithms for Sci. Comp., Timisoara, Romania; IEEE Comput. Soc., (2005), pp. 245–249.

  12. M. S. Lvov, “Polynomial invariants for linear loops,” Cybernetics and Systems Analysis, 46, No. 4, 660–668 (2010).

    Article  MATH  MathSciNet  Google Scholar 

  13. M. S. Lvov and V. A. Kreknin, “Nonlinear invariants of linear loops and eigenpolynomials of linear operators,” Cybernetics and Systems Analysis, 48, No. 2, 268-281 (2012).

    Article  Google Scholar 

  14. P. Cousot and N. Halbwachs, “Automatic discovery of linear restraints among variables of a program” in: Conf. Record of the Fifth Annual ACM SIGPLAN-SIGACT Symp. on Principles of Program. Languages, Tucson, Arizona; ACM Press, New York (1978), pp. 84–97.

  15. S. L. Krivoi and S. G. Raksha, “Search for invariant linear relationships in programs,” Cybernetics, 20, No. 6, 796–803 (1984).

    Article  MathSciNet  Google Scholar 

  16. A. B. Godlevskii, Yu. V. Kapitonova, S. L. Krivoi, and A. A. Letichevskii, “Iterative methods of program analysis: Equalities and inequalities,” Cybernetics, 36, No. 3, 307–318 (1990).

    Article  MathSciNet  Google Scholar 

  17. M. S. Lvov, “Invariant inequalities in programs interpreted over ordered fields,” Cybernetics, 22, No. 5, 560–566 (1986).

    Article  MathSciNet  Google Scholar 

  18. M. S. Lvov, “On invariant inequalities for flowchart states of programs interpreted over a vector space,” Cybernetics, 21, No. 2, 111–112 (1985).

    Google Scholar 

  19. B. L. Van der Waerden, Algebra [Russian translation], 2nd Edition, GRFML, Moscow (1979).

    Google Scholar 

  20. V. Hodge and D. Pido, Methods of Algebraic Geometry [Russian translation], Vol. 1, Izd-vo Inostr. Lit., Moscow (1954).

    Google Scholar 

  21. B. Buchberger, G. E. Collins, and R. Loos (eds.), Computer Algebra: Symbolic and Algebraic Computations [Russian translation], Mir, Moscow (1986).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kherson State University, Kherson, Ukraine

    M. S. Lvov

Authors
  1. M. S. Lvov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. S. Lvov.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 180–187, July–August, 2014.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lvov, M.S. A Method of Proving the Invariance of Linear Inequalities for Linear Loops. Cybern Syst Anal 50, 643–648 (2014). https://doi.org/10.1007/s10559-014-9653-1

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-014-9653-1

Keywords

Search

Navigation