Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Discovering non-terminating inputs for multi-path polynomial programs

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

This paper investigates the termination problems of multi-path polynomial programs (MPPs) with equational loop guards. To establish sufficient conditions for termination and nontermination simultaneously, the authors propose the notion of strong/weak non-termination which under/over-approximates non-termination. Based on polynomial ideal theory, the authors show that the set of all strong non-terminating inputs (SNTI) and weak non-terminating inputs (WNTI) both correspond to the real varieties of certain polynomial ideals. Furthermore, the authors prove that the variety of SNTI is computable, and under some sufficient conditions the variety of WNTI is also computable. Then by checking the computed SNTI and WNTI varieties in parallel, termination properties of a considered MPP can be asserted. As a consequence, the authors establish a new framework for termination analysis of MPPs.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Cook B, Podelski A, and Rybalchenko A, Proving program termination, Communications of the ACM, 2011, 54(5): 88–98.

    Article  Google Scholar 

  2. Yang L, Zhou C, Zhan N, and Xia B, Recent advances in program verification through computer algebra, Frontiers of Computer Science in China, 2010, 4(1): 1–16.

    Article  Google Scholar 

  3. Turing A M, On computable numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, 1936, 42(2): 230–265.

    MathSciNet  Google Scholar 

  4. Tiwari A, Termination of linear programs, Proceedings of CAV 2004 (ed. by Alur R and Peled D A), LNCS 3114, Springer, Berlin, 2004, 70–82.

    Google Scholar 

  5. Bradley A R, Manna A, and Sipma H B, Termination of polynomial programs, Proceedings of VMCAI 2005 (ed. by Cousot R), LNCS 3385, Springer, Berlin, 2005, 113–129.

    Google Scholar 

  6. Braverman M, Termination of integer linear programs, Proceedings of CAV 2006 (ed. by Ball T and Jones R B), LNCS 4144, Springer, Berlin, 2006, 372–385.

    Google Scholar 

  7. Harris W R, Lal A, Nori A V, and Rajamani S K, Alternation for termination, Proceedings of SAS 2010 (ed. by Cousot R and Martel M), LNCS 6337, Springer, Berlin, 2010, 304–319.

    Google Scholar 

  8. Colón M A and Sipma H B, Synthesis of linear ranking functions, Proceedings of TACAS 2001 (ed. by Margaria T and Wang Y), LNCS 2031, Springer, Berlin, 2001, 67–81.

    Google Scholar 

  9. Podelski A and Rybalchenko A, A complete method for the synthesis of linear ranking functions, Proceedings of VMCAI 2004 (ed. by Steffen B and Levi G), LNCS 2937, Springer, Berlin, 2004, 239–251.

    Google Scholar 

  10. Xia B and Zhang Z, Termination of linear programs with nonlinear constraints, Journal of Symbolic Computation, 2010, 45(11): 1234–1249.

    Article  MATH  MathSciNet  Google Scholar 

  11. Xia B, Yang L, Zhan N, and Zhang Z, Symbolic decision procedure for termination of linear programs, Formal Aspects of Computing, 2011, 23(2): 171–190.

    Article  MATH  MathSciNet  Google Scholar 

  12. Xu M, Chen L, Zeng Z, and Li Z, Termination analysis of linear loops, International Journal of Foundations of Computer Science, 2010, 21(6): 1005–1019.

    Article  MATH  MathSciNet  Google Scholar 

  13. Xu M and Li Z, Symbolic termination analysis of solvable loops, Journal of Symbolic Computation, 2013, 50: 28–49.

    Article  MATH  MathSciNet  Google Scholar 

  14. Cook B, Gulwani S, Lev-Ami T, Rybalchenko A, and Sagiv M, Proving conditional termination, Proceedings of CAV 2008 (ed. by Gupta A and Malik S), LNCS 5123, Springer, Berlin, 2008, 328–340.

    Google Scholar 

  15. Sankaranarayanan S, Sipma H B, and Manna Z, Non-linear loop invariant generation using Gröbner bases, Proceedings of POPL 2004 (ed. by Jones N D and Leroy X), ACM Press, New York, 2004, 318–329.

    Google Scholar 

  16. Müller-Olm M and Seidl H, Computing polynomial program invariants, Information Processing Letters, 2004, 91(5): 233–244.

    Article  MATH  MathSciNet  Google Scholar 

  17. Kapur D, A quantifier-elimination based heuristic for automatically generating inductive assertions for programs, Journal of Systems Science and Complexity, 2006, 19(3): 307–330.

    Article  MATH  MathSciNet  Google Scholar 

  18. Rodríguez-Carbonell E and Kapur D, Generating all polynomial invariants in simple loops, Journal of Symbolic Computation, 2007, 42(4): 443–476.

    Article  MATH  MathSciNet  Google Scholar 

  19. Kovács L, Reasoning algebraically about P-solvable loops, Proceedings of TACAS 2008 (ed. by Ramakrishnan C R and Rehof J), LNCS 4963, Springer, Berlin, 2008, 249–264.

    Google Scholar 

  20. Chen Y, Xia B, Yang L, Zhan N, and Zhou C, Discovering non-linear ranking functions by solving semi-algebraic systems, Proceedings of ICTAC 2007 (ed. by Jones C B, Liu Z, and Woodcock J), LNCS 4711, Springer, Berlin, 2007, 34–49.

    Google Scholar 

  21. Gupta A, Henzinger T A, Majumdar R, Rybalchenko A, and Xu R, Proving non-termination, Proceedings of POPL 2008 (ed. by Necula G C and Wadler P), ACM Press, New York, 2008, 147–158.

    Google Scholar 

  22. Cook B, Podelski A, and Rybalchenko A, Termination proofs for systems code, Proceedings of PLDI 2006 (ed. by Schwartzbach M I and Ball T), ACM Press, New York, 2006, 415–426.

    Google Scholar 

  23. Velroyen H and Rümmer P, Non-termination checking for imperative programs, Proceedings of TAP 2008 (ed. by Beckert B and Hähnle R), LNCS 4966, Springer, Berlin, 2008, 154–170.

    Google Scholar 

  24. Brockschmidt M, Ströder T, Otto C, and Giesl J, Automated detection of non-termination and NullPointerExceptions for Java bytecode, Proceedings of FoVeOOS 2011 (ed. by Beckert B, Damiani F, and Gurov D), LNCS 7421, Springer, Berlin, 2011, 123–141.

    Google Scholar 

  25. Cousot P, Proving program invariance and termination by parametric abstraction, Lagrangian relaxation and semidefinite programming, Proceedings of VMCAI 2005 (ed. by Cousot R), LNCS 3385, Springer, Berlin, 2005, 1–24.

    Google Scholar 

  26. Shen L, Wu M, Yang Z, and Zeng Z, Finding positively invariant sets of a class of nonlinear loops via curve fitting, Proceedings of SNC 2009 (ed. by Kai H and Sekigawa H), ACM Press, New York, 2009, 185–190.

    Google Scholar 

  27. Cox D, Little J, and O’Shea D, Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, UTM, Springer, Berlin, 3 edition, 2007.

    Book  Google Scholar 

  28. Xia B and Yang L, An algorithm for isolating the real solutions of semi-algebraic systems, Journal of Symbolic Computation, 2002, 34(5): 461–477.

    Article  MATH  MathSciNet  Google Scholar 

  29. Xia B, Discoverer: A tool for solving semi-algebraic systems, ACM Sigsam Bulletin, 2007, 41(2): 102–103.

    Google Scholar 

  30. Mayr E W, Membership in polynomial ideals over Q is exponential space complete, Proceedings of STACS 1989 (ed. by Monien B and Cori R), LNCS 349, Springer, Berlin, 1989, 400–406.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chongqing Key Laboratory of Automated Reasoning and Cognition, CIGIT, Chinese Academy of Sciences, Chongqing, 400714, China

    Jiang Liu & Hengjun Zhao

  2. Department of Computer Science and Technology, East China Normal University, Shanghai, 200241, China

    Ming Xu

  3. State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, 100190, China

    Naijun Zhan & Hengjun Zhao

Authors
  1. Jiang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ming Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Naijun Zhan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hengjun Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hengjun Zhao.

Additional information

This research was supported by the National Basic Research Program of China under Grant No. 2014CB340700, the National Science and Technology Major Project of China under Grant No. 2012ZX01039-004, the National Natural Science Foundation of China under Grant Nos. 91118007, 11071273, 61202131, 11401218, cstc2012ggB40004, cstc2013jjys40001, SRFDP under Grant No. 20130076120010, the Open Project of Shanghai Key Laboratory of Trustworthy Computing under Grant No. 07dz22304201307, and West Light Foundation of Chinese Academy of Sciences.

This paper was recommended for publication by Editor LI Ziming.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, J., Xu, M., Zhan, N. et al. Discovering non-terminating inputs for multi-path polynomial programs. J Syst Sci Complex 27, 1286–1304 (2014). https://doi.org/10.1007/s11424-014-2145-6

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-014-2145-6

Keywords

Search

Navigation