Skip to main content
SpringerLink
Log in

A Complete Invariant Generation Approach for P-solvable Loops

  • Conference paper
Perspectives of Systems Informatics (PSI 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5947))

Abstract

We present an algorithm for generating all polynomial invariants of P-solvable loops with assignments and nested conditionals. We prove termination of our algorithm. The proof relies on showing that the dimensions of the prime ideals from the minimal decomposition of the ideals generated at an iteration of our algorithm either remain the same or decrease at the next iteration of the algorithm. Our experimental results report that our method takes less iterations and/or time than other polynomial invariant generation techniques.

The author was supported by the Swiss NSF. This research was partly done in the frame of the Transnational Access Programme at RISC, Johannes Kepler University Linz, supported by the European Commission Framework 6 Programme for Integrated Infrastructures Initiatives under the project SCIEnce (contract No 026133).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Buchberger, B.: An Algorithm for Finding the Basis Elements of the Residue Class Ring of a Zero Dimensional Polynomial Ideal. J. of Symbolic Computation 41(3-4), 475–511 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  2. Cox, D., Little, J., O’Shea, D.: Ideal, Varieties, and Algorithms. An Introduction to Computational Algebraic Geometry and Commutative Algebra, 2nd edn. Springer, Heidelberg (1998)

    Google Scholar 

  3. Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall, Englewood Cliffs (1976)

    MATH  Google Scholar 

  4. Everest, G., van der Poorten, A., Shparlinski, I., Ward, T.: Recurrence Sequences. Mathematical Surveys and Monographs, vol. 104. American Mathematical Society (2003)

    Google Scholar 

  5. German, S.M., Wegbreit, B.: A Synthesizer of Inductive Assertions. IEEE Transactions on Software Engineering 1, 68–75 (1975)

    Google Scholar 

  6. Gosper, R.W.: Decision Procedures for Indefinite Hypergeometric Summation. Journal of Symbolic Computation 75, 40–42 (1978)

    MATH  MathSciNet  Google Scholar 

  7. Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics, 2nd edn. Addison-Wesley Publishing Company, Reading (1989)

    MATH  Google Scholar 

  8. Hoare, C.A.R.: An Axiomatic Basis for Computer Programming. Comm. of ACM 12(10), 576–580 (1969)

    Article  MATH  Google Scholar 

  9. Kaldewaij, A.: Programming. The Derivation of Algorithms. Prentince-Hall (1990)

    Google Scholar 

  10. Kapur, D.: A Quantifier Elimination Based Heuristic for Automatically Generating Inductive Assertions for Programs. J. of Systems Science and Complexity 19(3), 307–330 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  11. Kauers, M.: Algorithms for Nonlinear Higher Order Difference Equations. PhD thesis, RISC-Linz, Johannes Kepler University Linz, Austria (2005)

    Google Scholar 

  12. Kauers, M., Zimmermann, B.: Computing the Algebraic Relations of C-finite Sequences and Multisequences. J. of Symbolic Computation 43(11), 787–803 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  13. Kovacs, L.: Aligator: A Mathematica Package for Invariant Generation. In: Proc. of IJCAR, pp. 275–282 (2008)

    Google Scholar 

  14. Kovacs, L.: Reasoning Algebraically About P-Solvable Loops. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 249–264. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  15. Müller-Olm, M., Seidl, H.: Computing Polynomial Program Invariants. Indormation Processing Letters 91(5), 233–244 (2004)

    Article  MATH  Google Scholar 

  16. Paule, P., Schorn, M.: A Mathematica Version of Zeilberger’s Algorithm for Proving Binomial Coefficient Identities. J. of Symbolic Computation 20(5-6), 673–698 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  17. Rodriguez-Carbonell, E., Kapur, D.: Automatic Generation of Polynomial Invariants of Bounded Degree using Abstract Interpretation. Science of Comp. Programming 64(1) (2007)

    Google Scholar 

  18. Rodriguez-Carbonell, E., Kapur, D.: Generating All Polynomial Invariants in Simple Loops. J. of Symbolic Computation 42(4), 443–476 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  19. Sankaranaryanan, S., Sipma, H.B., Manna, Z.: Non-Linear Loop Invariant Generation using Gröbner Bases. In: Proc. of POPL (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. EPFL, Switzerland

    Laura Kovács

Authors
  1. Laura Kovács
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. (1941-2009), The Weizmann Institute of Science, Rehovot, Israel New York University, NY, USA

    Amir Pnueli

  2. Siberian Division of the Russian Academy of Sciences, A.P. Ershov Institute of Informatics Systems, 6, Acad. Lavrentiev pr., 630090, Novosibirsk, Russia

    Irina Virbitskaite

  3. Department of Computer Science, University of Manchester, Oxford Road, M13 9PL, Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kovács, L. (2010). A Complete Invariant Generation Approach for P-solvable Loops . In: Pnueli, A., Virbitskaite, I., Voronkov, A. (eds) Perspectives of Systems Informatics. PSI 2009. Lecture Notes in Computer Science, vol 5947. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11486-1_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11486-1_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11485-4

  • Online ISBN: 978-3-642-11486-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation