Abstract
This paper reduces the non-terminating determination for polynomial programs to semi-algebraic system solving, and demonstrates how to apply the symbolic computation tool DISCOVERER to some interesting examples. This method proceeds in three phases, by first constructing a semi-algebraic system according to the given polynomial program, and then calling DISCOVERER to solve frontal semi-algebraic system, finally analyzing the result from DISCOVERER with the initial state of polynomial program to determine whether the program terminates or not.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Godefroid, P., Klarlund, N., Sen, K.: DART: Directed Automated Random Testing. In: Sarkar, V., Hall, M.W. (eds.) Proc. of the ACM SIGPLAN 2005 Conference on Programming Language Design and Implementation (PLDI 2005), pp. 213–223. ACM (2005)
Gupta, A.K., et al.: Proving Non-Termination. In: POPL 2008, San Francisco, California, USA, January 7-12 (2008)
Sankaranarayanan, S., Sipma, H.B., Manna, Z.: Non-linear loop invariant generation using Gröbner bases. In: ACM POPL 2004, pp. 318–329 (2004)
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)
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)
Colón, M.A., Sankaranarayanan, S., Sipma, H.B.: Linear Invariant Generation Using Non-linear Constraint Solving. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 420–432. Springer, Heidelberg (2003)
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)
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)
Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, Heidelberg (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhao, X. (2011). Non-termination Analysis of Polynomial Programs by Solving Semi-Algebraic Systems. In: Jin, D., Lin, S. (eds) Advances in Multimedia, Software Engineering and Computing Vol.1. Advances in Intelligent and Soft Computing, vol 128. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25989-0_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-25989-0_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25988-3
Online ISBN: 978-3-642-25989-0
eBook Packages: EngineeringEngineering (R0)