Skip to main content
SpringerLink
Log in

Termination of Single-Path Polynomial Loop Programs

  • Conference paper
  • First Online:
Theoretical Aspects of Computing – ICTAC 2016 (ICTAC 2016)

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

Included in the following conference series:

Abstract

Termination analysis of polynomial programs plays a very important role in applications of safety critical software. In this paper, we investigate the termination problem of single-path polynomial loop programs (SPLPs) over the reals. For such a loop program, we first assume that the set characterized by its loop guards is closed, bounded and connected. And then, we give some conditions and prove that under such conditions, the termination of single-path loop programs is decidable over the reals.

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 EPUB and 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

References

  1. Bagnara, R., Mesnard, F.: Eventual linear ranking functions. In: Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming, pp. 229–238. ACM, Madrid (2013)

    Google Scholar 

  2. Bagnara, R., Mesnard, F., Pescetti, A., Zaffanella, E.: A new look at the automatic synthesis of linear ranking functions. Inf. Comput. 215, 47–67 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ben-Amram, A.: The hardness of finding linear ranking functions for Lasso programs. Electron.Proc. Theor. Comput. Sci. 161, 32–45 (2014)

    Article  Google Scholar 

  4. Ben-Amram, A., Genaim, S.: On the linear ranking problem for integer linear-constraint loops. In: POPL 2013 Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 51–62. ACM, Rome (2013)

    Google Scholar 

  5. Ben-Amram, A., Genaim, S.: Ranking functions for linear-constraint loops. J. ACM 61(4), 1–55 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bradley, A.R., Manna, Z., Sipma, H.B.: Linear ranking with reachability. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 491–504. Springer, Heidelberg (2005). doi:10.1007/11513988_48

    Chapter  Google Scholar 

  7. Bradley, A.R., Manna, Z., Sipma, H.B.: The polyranking principle. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1349–1361. Springer, Heidelberg (2005). doi:10.1007/11523468_109

    Chapter  Google Scholar 

  8. Bradley, A.R., Manna, Z., Sipma, H.B.: Termination of polynomial programs. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 113–129. Springer, Heidelberg (2005). doi:10.1007/978-3-540-30579-8_8

    Chapter  Google Scholar 

  9. Braverman, M.: Termination of integer linear programs. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 372–385. Springer, Heidelberg (2006). doi:10.1007/11817963_34

    Chapter  Google Scholar 

  10. Chen, C., Maza, M.: Quantifier elimination by cylindrical algebraic decomposition based on regular chains. In: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, pp. 91–98. ACM (2014)

    Google Scholar 

  11. Chen, H.Y., Flur, S., Mukhopadhyay, S.: Termination proofs for linear simple loops. In: Miné, A., Schmidt, D. (eds.) SAS 2012. LNCS, vol. 7460, pp. 422–438. Springer, Heidelberg (2012). doi:10.1007/978-3-642-33125-1_28

    Chapter  Google Scholar 

  12. Chen, Y., Xia, B., Yang, L., Zhan, N., Zhou, C.: Discovering non-linear ranking functions by solving semi-algebraic systems. In: Jones, C.B., Liu, Z., Woodcock, J. (eds.) ICTAC 2007. LNCS, vol. 4711, pp. 34–49. Springer, Heidelberg (2007). doi:10.1007/978-3-540-75292-9_3

    Chapter  Google Scholar 

  13. Colón, M.A., Sipma, H.B.: Synthesis of linear ranking functions. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 67–81. Springer, Heidelberg (2001). doi:10.1007/3-540-45319-9_6

    Chapter  Google Scholar 

  14. Cook, B., Gulwani, S., Lev-Ami, T., Rybalchenko, A., Sagiv, M.: Proving conditional termination. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 328–340. Springer, Heidelberg (2008). doi:10.1007/978-3-540-70545-1_32

    Chapter  Google Scholar 

  15. Cook, B., See, A., Zuleger, F.: Ramsey vs. lexicographic termination proving. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 47–61. Springer, Heidelberg (2013). doi:10.1007/978-3-642-36742-7_4

    Chapter  Google Scholar 

  16. Duistermaat, J., Kolk, J.: Multidimensional Real Analysis. Cambridge University Press, Cambridge (2004)

    Book  MATH  Google Scholar 

  17. Ganty, P., Genaim, S.: Proving termination starting from the end. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 397–412. Springer, Heidelberg (2013). doi:10.1007/978-3-642-39799-8_27

    Chapter  Google Scholar 

  18. Heizmann, M., Hoenicke, J., Leike, J., Podelski, A.: Linear ranking for linear Lasso programs. In: Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 365–380. Springer, Heidelberg (2013). doi:10.1007/978-3-319-02444-8_26

    Chapter  Google Scholar 

  19. Leike, J., Heizmann, M.: Ranking templates for linear loops. In: Ábrahám, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 172–186. Springer, Heidelberg (2014). doi:10.1007/978-3-642-54862-8_12

    Chapter  Google Scholar 

  20. Leike, J., Tiwari, A.: Synthesis for polynomial Lasso programs. In: McMillan, K.L., Rival, X. (eds.) VMCAI 2014. LNCS, vol. 8318, pp. 434–452. Springer, Heidelberg (2014). doi:10.1007/978-3-642-54013-4_24

    Chapter  Google Scholar 

  21. Liu, J., Xu, M., Zhan, N.J., Zhao, H.J.: Discovering non-terminating inputs for multi-path polynomial programs. J. Syst. Sci. Complex. 27, 1284–1304 (2014)

    MathSciNet  MATH  Google Scholar 

  22. Podelski, A., Rybalchenko, A.: A complete method for the synthesis of linear ranking functions. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 239–251. Springer, Heidelberg (2004). doi:10.1007/978-3-540-24622-0_20

    Chapter  Google Scholar 

  23. Sohn, K., Van Gelder, A.: Termination detection in logic programs using argument sizes (extended abstract). In: Proceedings of the Tenth ACM SIGACT- SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 216-226. ACM, Association for Computing Machinery, Denver (1991)

    Google Scholar 

  24. Stephen, B., Lieven, V.: Convex Optimization. Cambridge University Press, New York (2004)

    MATH  Google Scholar 

  25. Tiwari, A.: Termination of linear programs. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 70–82. Springer, Heidelberg (2004). doi:10.1007/978-3-540-27813-9_6

    Chapter  Google Scholar 

  26. Xia, B., Zhang, Z.: Termination of linear programs with nonlinear constraints. J. Symb. Comput. 45(11), 1234–1249 (2010)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

The author would like to thank the anonymous reviewers for their helpful suggestions. This research is partially supported by the National Natural Science Foundation of China NNSFC (61572024, 61103110).

Author information

Authors and Affiliations

  1. Chongqing Key Laboratory of Automated Reasoning and Cognition, CIGIT, CAS, Chongqing, China

    Yi Li

Authors
  1. Yi Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yi Li .

Editor information

Editors and Affiliations

  1. Universidade Federal de Pernambuco Centro de Informática, Recife, Pernambuco, Brazil

    Augusto Sampaio

  2. Deptartment of Electrical Engineering BL, National Taiwan University, Taipei, Taiwan

    Farn Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Li, Y. (2016). Termination of Single-Path Polynomial Loop Programs. In: Sampaio, A., Wang, F. (eds) Theoretical Aspects of Computing – ICTAC 2016. ICTAC 2016. Lecture Notes in Computer Science(), vol 9965. Springer, Cham. https://doi.org/10.1007/978-3-319-46750-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-46750-4_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-46749-8

  • Online ISBN: 978-3-319-46750-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation