Skip to main content

Signature-Based Method of Deciding Program Termination

  • Conference paper
  • First Online:
Computer Mathematics
  • 689 Accesses

Abstract

We present a method based on the discriminant sequence and Gröbner bases to verify the termination of a class of linear program. This method relates the program termination to the existence of real zeros of polynomial system with constraint conditions. To avoid the wrong determination due to approximate computation, we use Gröbner bases and revised sign list to count sign changes of characteristic polynomial of a trace matrix. This method need not solve the equations of polynomial system but count the number of real zeros which satisfy the constraint condition by using symbolic computation. The number of real zeros of polynomial in the linear program can always be computed correctly. Therefore, the termination of the program can be decided accurately.

This paper is supported partially by No. 20071311 of Education Committee of Tianjin Municipality. The research is also supported by Talent Foundation in TUTE through grant KYQD06005 and Natural Science Foundation of TUTE under grant No. KJY12-09 and KJ20080039.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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. Yang, L., Zhan, N., Xia, B., et al. Program verification by Using DISCOVERER. Proc.VSTTE’05, Zurich. (2005)

    Google Scholar 

  2. Tiwari, A.: Termination of Linear Programs, pp. 70–82. CAV’04, USA (2004). LNCS

    Google Scholar 

  3. Yang, L., Xia, B.C.: Automated Proving and Discovery of Inequalities. Science Press, China (2008)

    Google Scholar 

  4. Li, J., Li, Y., Feng, Y.: Termination of a class of nonlinear loop programs. J. Sichuan Univ. (Eng. Sci. Edition) 41(1), 129–133 (2009)

    MathSciNet  Google Scholar 

  5. Cox, D.A., Little, J.B., O’Shea, Donald, B.: Using Algebric Geometry. Springer, New York (1998)

    Book  Google Scholar 

  6. Mirshra, B.: Algorithmic Algebra. Springer, New York (1993)

    Book  Google Scholar 

  7. Yang, L., Zhang, J.Z., Hou, X.R.: Nonlinear Algebraic Equation System and Automated Theorem Proving. ShangHai Scientific and Technological Education Publishing House, Shanghai (1996)

    Google Scholar 

  8. Zhou, C.Z.: Formal Techniques for software Embeded System. East-China Normal University, Shanghai (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yaohui Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, Y., Song, Y., Wu, Z. (2014). Signature-Based Method of Deciding Program Termination. In: Feng, R., Lee, Ws., Sato, Y. (eds) Computer Mathematics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43799-5_22

Download citation

Publish with us

Policies and ethics