Skip to main content
SpringerLink
Log in

Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems

  • Conference paper
Book cover Theoretical Aspects of Computing – ICTAC 2007 (ICTAC 2007)

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

Included in the following conference series:

Abstract

Differing from [6] this paper reduces non-linear ranking function discovering for polynomial programs to semi-algebraic system solving, and demonstrates how to apply the symbolic computation tools, DISCOVERER and QEPCAD, to some interesting examples.

The work is in part supported by the projects NKBRPC-2002cb312200, 2004CB318003, 2005CB321902, and NSFC-60493200, 60421001, 60573007.

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. 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)

    Chapter  Google Scholar 

  2. Bradley, A., Manna, Z., Sipma, H.: Terminaition of polynomial programs. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 113–129. Springer, Heidelberg (2005)

    Google Scholar 

  3. Cook, B., Podelski, A., Rybalchenko, A.: TERMINATOR: Beyond safety. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 415–418. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Collins, G.E., Hong, H.: Partial cylindrical algebraic decomposition for quantifier elimination. J. of Symbolic Computation 12, 299–328 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  5. Colón, M., Sipma, H.B.: Synthesis of linear ranking functions. In: Margaria, T., Yi, W. (eds.) ETAPS 2001 and TACAS 2001. LNCS, vol. 2031, pp. 67–81. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Cousot, P.: Proving program invariance and termination by parametric abstraction, Langrangian Relaxation and semidefinite programming. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 1–24. Springer, Heidelberg (2005)

    Google Scholar 

  7. Dams, D., Gerth, R., Grumberg, O.: A heuristic for the automatic generation of ranking functions. In: Workshop on Advances in Verification (WAVe 2000), pp. 1–8 (2000)

    Google Scholar 

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

    MATH  Google Scholar 

  9. Dolzman, A., Sturm, T.: REDLOG: Computer algebra meets computer logic. ACM SIGSAM Bulletin 31(2), 2–9

    Google Scholar 

  10. Floyd, R.W.: Assigning meanings to programs. In: Proc. Symphosia in Applied Mathematics, vol. 19, pp. 19–37 (1967)

    Google Scholar 

  11. Hoare, C.A.R.: An axiomatic basis for computer programming. Comm. ACM 12(10), 576–580 (1969)

    Article  MATH  Google Scholar 

  12. Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, Heidelberg (1995)

    Google Scholar 

  13. 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)

    Google Scholar 

  14. Sankaranarayanan, S., Sipma, H.B., Manna, Z.: Non-linear loop invariant generation using Gröbner bases. In: ACM POPL 2004, pp. 318–329 (2004)

    Google Scholar 

  15. Tarski, A.: A Decision for Elementary Algebra and Geometry. University of California Press, Berkeley (1951)

    MATH  Google Scholar 

  16. Tiwari, A.: Termination of linear programs. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 70–82. Springer, Heidelberg (2004)

    Google Scholar 

  17. International Conference on Verified Software: Theories, Tools and Experiments, ETH Zürich (October 10-13, 2005)

    Google Scholar 

  18. Wu, W.-T.: Basic principles of mechanical theorem proving in elementary geometries. J. Syst. Sci. Math. 4, 207–235 (1984)

    Google Scholar 

  19. Xia, B., Xiao, R., Yang, L.: Solving parametric semi-algebraic systems. In: Pae, S.-i., Park, H. (eds.) ASCM 2005. Proc. the 7th Asian Symposium on Computer Mathematics, Seoul, December 8-10, pp. 8–10 (2005)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  21. Xia, B., Zhang, T.: Real Solution Isolation Using Interval Arithmetic. Comput. Math. Appl. 52, 853–860 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  22. Yang, L.: Recent advances on determining the number of real roots of parametric polynomials. J. Symbolic Computation 28, 225–242 (1999)

    Article  MATH  Google Scholar 

  23. Yang, L., Hou, X., Xia, B.: A complete algorithm for automated discovering of a class of inequality-type theorems. Sci. in China (Ser. F) 44, 33–49 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  24. Yang, L., Hou, X., Zeng, Z.: A complete discrimination system for polynomials. Science in China (Ser. E) 39, 628–646 (1996)

    MATH  MathSciNet  Google Scholar 

  25. Yang, L., Xia, B.: Automated Deduction in Real Geometry. In: Chen, F., Wang, D. (eds.) Geometric Computation, pp. 248–298. World Scientific, Singapore (2004)

    Google Scholar 

  26. Yang, L., Xia, B.: Real solution classifications of a class of parametric semi-algebraic systems. In: Proc. of Int’l Conf. on Algorithmic Algebra and Logic, pp. 281–289 (2005)

    Google Scholar 

  27. Yang, L., Zhan, N., Xia, B., Zhou, C.: Program verification by using DISCOVERER. In: Proc. VSTTE 2005, Zürich (October 10-October 13, 2005) (to appear)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LMAM & School of Mathematical Sciences, Peking University,  

    Yinghua Chen & Bican Xia

  2. Institute of Theoretical Computing,, East China Normal University,  

    Lu Yang

  3. Lab. of Computer Science, Institute of Software, Chinese Academy of Sciences,  

    Naijun Zhan & Chaochen Zhou

Authors
  1. Yinghua Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bican Xia
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lu Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Naijun Zhan
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Chaochen Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Cliff B. Jones Zhiming Liu Jim Woodcock

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, Y., Xia, B., Yang, L., Zhan, N., Zhou, C. (2007). Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems. In: Jones, C.B., Liu, Z., Woodcock, J. (eds) Theoretical Aspects of Computing – ICTAC 2007. ICTAC 2007. Lecture Notes in Computer Science, vol 4711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75292-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75292-9_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75290-5

  • Online ISBN: 978-3-540-75292-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation