Discovering non-linear ranking functions by solving semi-algebraic systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4711 LNCS, Issue , 2007, Pages 34-49

  Chen, Yinghua ^a   Xia, Bican ^a   Yang, Lu ^b   Zhan, Naijun ^c,d   Zhou, Chaochen ^c  

^a PEKING UNIVERSITY   (China)

^b EAST CHINA NORMAL UNIVERSITY   (China)

^c INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

^d NONE   (China)

Author keywords

Computer algebra; DISCOVERER; Loop termination; Polynomial programs; Program verification; QEPCAD; Ranking function; Semi algebraic systems

Indexed keywords

ALGEBRA; CALCULATIONS; DIFFERENCE EQUATIONS; POLYNOMIAL APPROXIMATION;

COMPUTER ALGEBRA; POLYNOMIAL PROGRAMS; RANKING FUNCTION;

PROBLEM SOLVING;

EID: 38049158356     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75292-9_3     Document Type: Conference Paper

References (27)

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)
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)
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)
4. Collins, G.E., Hong, H.: Partial cylindrical algebraic decomposition for quantifier elimination. J. of Symbolic Computation 12, 299-328 (1991)
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)
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)
7. Dams, D., Gerth, R., Grumberg, O.: A heuristic for the automatic generation of ranking functions. In: Workshop on Advances in Verification (WAVe'00), pp. 1-8 (2000)
8. Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall, Englewood Cliffs (1976)
9. Dolzman, A., Sturm, T.: REDLOG: Computer algebra meets computer logic. ACM SIGSAM Bulletin 31(2), 2-9
10. Floyd, R.W.: Assigning meanings to programs. In: Proc. Symphosia in Applied Mathematics, vol. 19, pp. 19-37 (1967)
11. Hoare, C.A.R.: An axiomatic basis for computer programming. Comm. ACM 12(10), 576-580 (1969)
12. Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, Heidelberg (1995)
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)
14. Sankaranarayanan, S., Sipma, H.B., Manna, Z.: Non-linear loop invariant generation using Gröbner bases. In: ACM POPL'04, pp. 318-329 (2004)
15. Tarski, A.: A Decision for Elementary Algebra and Geometry. University of California Press, Berkeley (1951)
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)
17. International Conference on Verified Software: Theories, Tools and Experiments, ETH Zürich (October 10-13, 2005)
18. Wu, W.-T.: Basic principles of mechanical theorem proving in elementary geometries. J. Syst. Sci. Math. 4, 207-235 (1984)
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)
20. Xia, B., Yang, L.: An algorithm for isolating the real solutions of semi-algebraic systems. J. Symbolic Computation 34, 461-477 (2002)
21. Xia, B., Zhang, T.: Real Solution Isolation Using Interval Arithmetic. Comput. Math. Appl. 52, 853-860 (2006)
22. Yang, L.: Recent advances on determining the number of real roots of parametric polynomials. J. Symbolic Computation 28, 225-242 (1999)
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)
24. Yang, L., Hou, X., Zeng, Z.: A complete discrimination system for polynomials. Science in China (Ser. E) 39, 628-646 (1996)
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)
26. Yang, L., Xia, B.: Real solution classifications of a class of parametric semialgebraic systems. In: Proc. of Int'l Conf. on Algorithmic Algebra and Logic, pp. 281-289 (2005)
27. Yang, L., Zhan, N., Xia, B., Zhou, C.: Program verification by using DISCOVERER. In: Proc. VSTTE'05, Zürich (October 10-October 13, 2005) (to appear)