{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T18:33:42Z","timestamp":1781375622704,"version":"3.54.1"},"reference-count":71,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,2,5]],"date-time":"2010-02-05T00:00:00Z","timestamp":1265328000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci. China"],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s11704-009-0074-7","type":"journal-article","created":{"date-parts":[[2010,2,5]],"date-time":"2010-02-05T11:38:01Z","timestamp":1265369881000},"page":"1-16","source":"Crossref","is-referenced-by-count":34,"title":["Recent advances in program verification through computer algebra"],"prefix":"10.1007","volume":"4","author":[{"given":"Lu","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chaochen","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Naijun","family":"Zhan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bican","family":"Xia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,2,5]]},"reference":[{"key":"74_CR1","first-page":"447","volume":"13","author":"D. Harel","year":"1985","unstructured":"Harel D, Pnueli A. On the development of reactive systems. Logics and Models of Concurrency Systems, 1985, 13: 447\u2013498","journal-title":"Logics and Models of Concurrency Systems"},{"key":"74_CR2","unstructured":"Lions J L. The ARIANE 5 flight 501 failure report. European Space Agency (ESA), 1996"},{"issue":"4","key":"74_CR3","first-page":"11","volume":"25","author":"R. Skeel","year":"1992","unstructured":"Skeel R. Roundoff error and the Patriot missile. SIAM News, 1992, 25(4): 11\u201311","journal-title":"SIAM News"},{"key":"74_CR4","doi-asserted-by":"crossref","unstructured":"Reeves G, Neilson T. The mars rover spirit FLASH anomaly. In: Proceedings of IEEE Aerospace Conference\u201905. 2005","DOI":"10.1109\/AERO.2005.1559723"},{"key":"74_CR5","unstructured":"International Conference on Verified Software: Theories, Tools and Experiments, ETH Z\u00fcrich, Oct. 10\u201313, 2005"},{"key":"74_CR6","doi-asserted-by":"crossref","unstructured":"Queille J P, Sifakis J. Verification of concurrent systems in CESAR. In: Proceedings of Int. Symp. On Programming. 1982, 337\u2013351","DOI":"10.1007\/3-540-11494-7_22"},{"key":"74_CR7","doi-asserted-by":"crossref","unstructured":"Clarke E M, Emerson E A. Synthesis of synchronization skeletons for branching time temporal logic. In: Proceedings of IBM Workshop on Logics of Programs. 1981, 52\u201371","DOI":"10.1007\/BFb0025774"},{"key":"74_CR8","unstructured":"Nipkow T, Paulson C P, Wenzel M. Tutorial on ISABELLE\/HOL. Springer-Verlag, 2009"},{"key":"74_CR9","doi-asserted-by":"crossref","unstructured":"Owre S, Rushby J M, Shankar N. PVS: a protype verification system. In: Proceedings of CADE\u201992. 1992, 748\u2013752","DOI":"10.1007\/3-540-55602-8_217"},{"issue":"5\/6","key":"74_CR10","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/S0747-7171(06)80007-6","volume":"15","author":"C. Paulin-Mohring","year":"1993","unstructured":"Paulin-Mohring C, Werner B. Synthesis of ML programs in the system Coq. J. Symbolic Logic, 1993, 15(5\/6): 607\u2013640","journal-title":"J. Symbolic Logic"},{"key":"74_CR11","doi-asserted-by":"crossref","unstructured":"Cousot P, Cousot R. Abstraction interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proceedings of ACM POPL\u201977. 1977, 238\u2013252","DOI":"10.1145\/512950.512973"},{"key":"74_CR12","doi-asserted-by":"crossref","unstructured":"Cousot P, Cousot R. Systematic design of program analysis frameworks. In: Proceedings of ACM POPL\u201979. 1979, 269\u2013282","DOI":"10.1145\/567752.567778"},{"issue":"2","key":"74_CR13","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/MC.1985.1662795","volume":"18","author":"B. Moszkowski","year":"1985","unstructured":"Moszkowski B. A temporal logic for multilevel reasoning about hardware. IEEE Computers, 1985, 18(2): 10\u201319","journal-title":"IEEE Computers"},{"issue":"5","key":"74_CR14","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0020-0190(91)90122-X","volume":"40","author":"C. Zhou","year":"1991","unstructured":"Zhou C, Hoare C A R, Ravn A. A calculus of durations. Inf. Processing Letters, 1991, 40(5): 269\u2013276","journal-title":"Inf. Processing Letters"},{"issue":"3","key":"74_CR15","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(94)00202-T","volume":"138","author":"R. Alur","year":"1995","unstructured":"Alur R, Courcoubetis C, Halbwachs N, et al. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 1995, 138(3): 3\u201334","journal-title":"Theoretical Computer Science"},{"key":"74_CR16","first-page":"4","volume":"736","author":"Z. Manna","year":"1993","unstructured":"Manna Z, Pnueli A. Verifying hybrid systems. In: Proceedings of Hybrid Systems. LNCS 736, 1993, 4\u201335","journal-title":"LNCS"},{"key":"74_CR17","first-page":"77","volume":"736","author":"L. Lamport","year":"1993","unstructured":"Lamport L. Hybrid systems in TLA +. In: Proceedings of Hybrid Systems. LNCS 736, 1993, 77\u2013102","journal-title":"LNCS"},{"key":"74_CR18","first-page":"591","volume":"571","author":"Y. Kesten","year":"1992","unstructured":"Kesten Y, Pnueli A. Timed and hybrid statecharts and their textual representation. In: Proceedings of Formal Techniques in Real-Time and Fault-Tolerant Systems. LNCS 571, 1992, 591\u2013619","journal-title":"LNCS"},{"key":"74_CR19","doi-asserted-by":"crossref","unstructured":"Rodriguez-Carbonell E, Kapur D. An abstract interpretation approach for automatic generation of polynomial invariants. In: Proceedings of Static Analysis Symposium (SAS\u201904). 2004, 280\u2013295","DOI":"10.1007\/978-3-540-27864-1_21"},{"key":"74_CR20","doi-asserted-by":"crossref","unstructured":"Rodriguez-Carbonell E, Kapur D. Automatic generation of polynomial loop invariants: algebraic foundations. In: Proceedings of Intl. Symp on Symbolic and Algebraic Computation (ISSAC\u201904). 2004","DOI":"10.1145\/1005285.1005324"},{"key":"74_CR21","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan S, Sipma H B, Manna Z. Non-linear loop invariant generation using Gr\u00f6bner bases. In: Proceedings of ACM POPL\u201904. 2004, 318\u2013329","DOI":"10.1145\/964001.964028"},{"key":"74_CR22","first-page":"134","volume":"33","author":"G. E. Collins","year":"1975","unstructured":"Collins G E. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. Automata Theory and Formal Languages, LNCS 33, 1975, 134\u2013183","journal-title":"LNCS"},{"key":"74_CR23","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0747-7171(08)80152-6","volume":"12","author":"G. E. Collins","year":"1991","unstructured":"Collins G E, Hong H. Partial cylindrical algebraic decomposition for quantifier elimination. J. of Symbolic Computation, 1991, 12: 299\u2013328","journal-title":"J. of Symbolic Computation"},{"key":"74_CR24","first-page":"1","volume":"11","author":"G. Lafferre","year":"2001","unstructured":"Lafferre G, Pappas G J, Yovine S. Symbolic reachability computaion for families of linear vector fields. J. of Symbolic Computation, 2001, 11: 1\u201323","journal-title":"J. of Symbolic Computation"},{"key":"74_CR25","unstructured":"Yang L, Zhan N, Xia B, et al. Program verification by using DISCOVERER. In: Proceedings of VSTTE\u201905. 2005, 575\u2013586"},{"key":"74_CR26","unstructured":"Kapur D. Automatically generating loop invariants using quantifier Elimination. In: Proceedings of IMACS Intl. Conf. on Applications of Computer Algebra (ACA\u201904). 2004"},{"key":"74_CR27","doi-asserted-by":"crossref","unstructured":"Henzinger T A, Wong-Toi H. Linear phase-portrait approximations for nonlinear hybrid systems. In: Proceedings of Hybrid Systems\u201995. 1995, 377\u2013388","DOI":"10.1007\/BFb0020961"},{"key":"74_CR28","doi-asserted-by":"crossref","unstructured":"Podelski A, Rybalchenko A. A complete method for the synthesis of linear ranking functions. In: Proceedings of VMCAI\u201904. 2004, 239\u2013251","DOI":"10.1007\/978-3-540-24622-0_20"},{"key":"74_CR29","doi-asserted-by":"crossref","unstructured":"Tiwari A. Termination of linear programs. In: Proceedings of CAV\u201904. 2004, 70\u201382","DOI":"10.1007\/978-3-540-27813-9_6"},{"key":"74_CR30","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1006\/jsco.1998.0274","volume":"28","author":"L. Yang","year":"1999","unstructured":"Yang L. Recent advances on determining the number of real roots of parametric polynomials. J. Symbolic Computation, 1999, 28: 225\u2013242","journal-title":"J. Symbolic Computation"},{"key":"74_CR31","first-page":"33","volume":"44","author":"L. Yang","year":"2001","unstructured":"Yang L, Hou X, Xia B. A complete algorithm for automated discovering of a class of inequality-type theorems. Sci. in China (Ser. F), 2001, 44: 33\u201349","journal-title":"Sci. in China (Ser. F)"},{"key":"74_CR32","first-page":"628","volume":"39","author":"L. Yang","year":"1996","unstructured":"Yang L, Hou X, Zeng Z. A complete discrimination system for polynomials. Science in China (Ser. E), 1996, 39: 628\u2013646","journal-title":"Science in China (Ser. E)"},{"key":"74_CR33","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1006\/jsco.2002.0572","volume":"34","author":"B. Xia","year":"2002","unstructured":"Xia B, Yang L. An algorithm for isolating the real solutions of semi-algebraic systems. J. Symbolic Computation, 2002, 34: 461\u2013477","journal-title":"J. Symbolic Computation"},{"key":"74_CR34","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1016\/j.camwa.2006.06.003","volume":"52","author":"B. Xia","year":"2006","unstructured":"Xia B, Zhang T. Real solution isolation using interval arithmetic. Comput. Math. Appl., 2006, 52: 853\u2013860","journal-title":"Comput. Math. Appl."},{"key":"74_CR35","doi-asserted-by":"crossref","unstructured":"Yao Y. Termination of nonlinear programs over intervals. Journal of Software (in press, in Chinese)","DOI":"10.3724\/SP.J.1001.2010.03722"},{"key":"74_CR36","doi-asserted-by":"crossref","unstructured":"Xu M, Chen L, Li Z B. Reachability computation of a class of nonlinear systems. In: Proceedings of International Conference on Computer and Information Science\u201909. 2009, 706\u2013710","DOI":"10.1109\/ICIS.2009.146"},{"key":"74_CR37","unstructured":"Xu M, Chen L, Zeng Z, et al. Reachability analysis of rational eigenvalue linear systems. To appear in International Journal of Systems Science"},{"key":"74_CR38","doi-asserted-by":"crossref","unstructured":"Floyd R W. Assigning meanings to programs. In: Proceedings of Symphosium on Applied Mathematics. 1967, 19\u201337","DOI":"10.1090\/psapm\/019\/0235771"},{"issue":"10","key":"74_CR39","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C. A. R. Hoare","year":"1969","unstructured":"Hoare C A R. An axiomatic basis for computer programming. Comm. ACM, 1969, 12(10): 576\u2013580","journal-title":"Comm. ACM"},{"key":"74_CR40","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/BF01966091","volume":"6","author":"P. Naur","year":"1966","unstructured":"Naur P. Proofs of algorithms by general snapshops. BIT, 1966, 6: 310\u2013316","journal-title":"BIT"},{"issue":"1","key":"74_CR41","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/TSE.1975.6312821","volume":"1","author":"S. German","year":"1975","unstructured":"German S, Wegbreit B. A synthesizer of inductive assertions. IEEE Transactions on Software Engineering, 1975, 1(1): 68\u201375","journal-title":"IEEE Transactions on Software Engineering"},{"key":"74_CR42","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF00268497","volume":"6","author":"M. Karr","year":"1976","unstructured":"Karr M. Affine relationships among variables of a program. Acta Informatica, 1976, 6:133\u2013151","journal-title":"Acta Informatica"},{"issue":"4","key":"74_CR43","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1145\/360032.360048","volume":"19","author":"S. Katz","year":"1976","unstructured":"Katz S, Manna Z. Logical analysis of programms. Communications of the ACM, 1976, 19(4): 188\u2013206","journal-title":"Communications of the ACM"},{"issue":"2","key":"74_CR44","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1145\/360827.360850","volume":"17","author":"B. Wegbreit","year":"1974","unstructured":"Wegbreit B. The synthesis of loop predicates. Communications of the ACM, 1974, 17(2): 102\u2013112","journal-title":"Communications of the ACM"},{"key":"74_CR45","doi-asserted-by":"crossref","unstructured":"Besson F, Jensen T, Talpin J P. Polyhedral analysis of synchronous languages. In: Proceedings of SAS\u201999. 1999, 51\u201369","DOI":"10.1007\/3-540-48294-6_4"},{"key":"74_CR46","doi-asserted-by":"crossref","unstructured":"Cousot P. Proving program invariance and termination by parametric abstraction, Langrangian relaxation and semidefinite programming. In: Proceedings of VMCAI 2005. 2005, 1\u201324","DOI":"10.1007\/978-3-540-30579-8_1"},{"key":"74_CR47","doi-asserted-by":"crossref","unstructured":"Cousot P, Halbwachs N. Automatic discovery of linear restraints among the variables of a program. In: Proceedings of ACM POPL\u201978. 1978, 84\u201397","DOI":"10.1145\/512760.512770"},{"key":"74_CR48","doi-asserted-by":"crossref","unstructured":"Col\u00f3n M, Sankaranarayanan S, Sipma H B. Linear invariant generation using non-linear constraint solving. In: Proceedings of CAV\u201903. 2003, 420\u2013432","DOI":"10.1007\/978-3-540-45069-6_39"},{"key":"74_CR49","doi-asserted-by":"crossref","unstructured":"Mueller-Olm M, Seidl H. Polynomial constants are decidable. In: Proceedings of 9th Static Analysis Symposium (SAS\u201902). 2002, 4\u201319","DOI":"10.1007\/3-540-45789-5_4"},{"key":"74_CR50","doi-asserted-by":"crossref","unstructured":"Mueller-Olm M, Seidl H. Precise interprocedural analysis through linear algebra. In: Proceedings of ACM POPL\u201904. 2004, 330\u2013341","DOI":"10.1145\/964001.964029"},{"key":"74_CR51","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/j.jsc.2007.01.002","volume":"42","author":"E. Rodriguez-Carbonell","year":"2007","unstructured":"Rodriguez-Carbonell E, Kapur D. Generating all polynomial invariants in simple loops. Journal of Symbolic Computation, 2007, 42: 443\u2013476","journal-title":"Journal of Symbolic Computation"},{"key":"74_CR52","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0747-7171(88)80004-X","volume":"5","author":"J. H. Davenport","year":"1988","unstructured":"Davenport J H, Heintz J. Real elimination is doubly exponential. J. of Symbolic Computation, 1988, 5: 29\u201337","journal-title":"J. of Symbolic Computation"},{"key":"74_CR53","doi-asserted-by":"crossref","unstructured":"Col\u00f3n M, Sipma H B. Synthesis of linear ranking functions. In: Proceedings of TACAS\u201901. 2001, 67\u201381","DOI":"10.1007\/3-540-45319-9_6"},{"key":"74_CR54","unstructured":"Dams D, Gerth R, Grumberg O. A heuristic for the automatic generation of ranking functions. In: Proceedings of Workshop on Advances in Verification (WAVe\u201900). 2000, 1\u20138"},{"key":"74_CR55","doi-asserted-by":"crossref","unstructured":"Chen Y, Xia B, Yang L, et al. Discovering non-linear ranking functions by solving semi-algebraic systems. In: Proceedings of ICTAC\u201907. 2007, 34\u201349","DOI":"10.1007\/978-3-540-75292-9_3"},{"key":"74_CR56","doi-asserted-by":"crossref","unstructured":"Bradley A, Manna Z, Sipma H. Termination of polynomial programs. In: Proceedings of VMCAI\u201905. 2005","DOI":"10.1007\/978-3-540-30579-8_8"},{"key":"74_CR57","doi-asserted-by":"crossref","unstructured":"Braverman M. Termination of integer linear programs. In: Proceedings of CAV\u201906. 2006, 372\u2013385","DOI":"10.1007\/11817963_34"},{"issue":"3","key":"74_CR58","first-page":"102","volume":"41","author":"B. Xia","year":"2007","unstructured":"Xia B. DISCOVERER: a tool for solving semi-algebraic systems. ACM SIGSAM Bulletin, 2007, 41(3): 102\u2013103","journal-title":"ACM SIGSAM Bulletin"},{"key":"74_CR59","doi-asserted-by":"crossref","unstructured":"Chen Y, Xia B, Yang L, et al. Generating polynomial invariants with DISCOVERER and QEPCAD. In: Proceedings of Formal Methods and Hybrid Real-Time Systems\u201907 (the Festschrift Symposium for Dines Bjorner and Zhou Chaochen). 2007, 67\u201382","DOI":"10.1007\/978-3-540-75221-9_4"},{"key":"74_CR60","doi-asserted-by":"crossref","unstructured":"Xia B, Yang L, Zhan N. Program verification by reduction to semialgebraic systems solving. In: Proceedings of ISoLA\u201908. 2008, 277\u2013291","DOI":"10.1007\/978-3-540-88479-8_20"},{"key":"74_CR61","first-page":"402","volume":"1","author":"Y. Li","year":"2009","unstructured":"Li Y. Automatic discovery of non-linear ranking function of loop programs. ICCSIT, 2009, 1: 402\u2013406","journal-title":"ICCSIT"},{"key":"74_CR62","first-page":"488","volume":"3653","author":"A. Bradley","year":"2005","unstructured":"Bradley A, Manna Z, Sipma H. Termination analysis of integer linear loops. LNCS 3653, 2005, 488\u2013502","journal-title":"LNCS"},{"issue":"5","key":"74_CR63","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1007\/BF02948785","volume":"14","author":"L. Yang","year":"1999","unstructured":"Yang L. Recent advances in automated theorem proving on inequalities. J. of Computer Science and Technology, 1999, 14(5): 434\u2013446","journal-title":"J. of Computer Science and Technology"},{"key":"74_CR64","unstructured":"Xia B, Yang L, Zhan N, et al. Symbolic decision procedure for termination of linear programs. (DOI:10.1007\/s00165-009-0144-5), Formal Aspects of Computing (in press)"},{"key":"74_CR65","doi-asserted-by":"crossref","unstructured":"Bi Z, Shan M. Termination analysis of linear programs with conditionals. In: Proceedings of International Conference on Advanced Computer Theory and Engineering\u201908. 2008, 450\u2013456","DOI":"10.1109\/ICACTE.2008.16"},{"issue":"1\u20132","key":"74_CR66","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/S0304-3975(00)00399-6","volume":"255","author":"V. D. Blondel","year":"2001","unstructured":"Blondel V D, Bournez O, Koiran P, et al. Deciding stability and mortality of piecewise affine dynamical systems. Theoretical Computer Science, 2001, 255(1\u20132): 687\u2013696","journal-title":"Theoretical Computer Science"},{"key":"74_CR67","unstructured":"Xia B, Zhang Z. Termination of linear programs with nonlinear constraints. arXiv:0904.3588v1, 2009"},{"key":"74_CR68","doi-asserted-by":"crossref","unstructured":"Wu B, Shen L, Bi Z. Termination of loop programs with polynomial guards. In: Proceedings of the 2010 International Conference on Computational Science and Its Applications, LNCS (in press)","DOI":"10.1007\/978-3-642-12189-0_42"},{"key":"74_CR69","doi-asserted-by":"crossref","unstructured":"Wu B, Shen L, Bi Z, et al. Termination of a class of the programs with polynomial guards. In: Proceedings of International Conference on Information Management and Engineering. 2009, 274\u2013277","DOI":"10.1109\/ICIME.2009.102"},{"key":"74_CR70","doi-asserted-by":"crossref","unstructured":"Bi Z, Shan M, Wu B. Termination analysis of P-solvable loops with assignments only. In: Proceedings of 2008 International Symposium on Information Science and Engineering. 2008, 125\u2013129","DOI":"10.1109\/ISISE.2008.155"},{"key":"74_CR71","doi-asserted-by":"crossref","unstructured":"Kov\u00e1cs L. Automated invariant generation by algebraic techniques for imperative program verification in theorema. Dissertation for the Doctoral Degree. Hohannes Kepler University of Linz, 2007","DOI":"10.1109\/ISoLA.2006.46"}],"container-title":["Frontiers of Computer Science in China"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-009-0074-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11704-009-0074-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-009-0074-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T23:30:16Z","timestamp":1739835016000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11704-009-0074-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,5]]},"references-count":71,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["74"],"URL":"https:\/\/doi.org\/10.1007\/s11704-009-0074-7","relation":{},"ISSN":["1673-7350","1673-7466"],"issn-type":[{"value":"1673-7350","type":"print"},{"value":"1673-7466","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,5]]}}}