Generating polynomial invariants with DISCOVERER and QEPCAD

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

Volumn 4700 LNCS, Issue , 2007, Pages 67-82

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

^a PEKING UNIVERSITY   (China)

^b EAST CHINA NORMAL UNIVERSITY   (China)

^c INSTITUTE OF SOFTWARE   (China)

Author keywords

DISCOVERER; Invariant generation; Polynomial programs; Program verification; QEPCAD; Quantifier elimination; Semi algebraic systems

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; PROBLEM SOLVING;

INVARIANT GENERATION; PROGRAM VERIFICATION; QUANTIFIER ELIMINATION; SEMI ALGEBRAIC SYSTEMS;

POLYNOMIALS;

EID: 38149006253     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75221-9_4     Document Type: Conference Paper

References (34)

1. Besson, F., Jensen, T., Talpin, J.-P.: Polyhedral analysis of synchronous languages. In: Cortesi, A., Filé, G. (eds.) SAS 1999. LNCS, vol. 1694, pp. 51-69. Springer, Heidelberg (1999)
2. Chen, Y., Xia, B., Yang, L., Zhan, N., Zhou, C.: Discovering non-linear ranking functions by solving semi-algebraic systems. In: ICTAC 2007. LNCS, Springer, Heidelberg (2007) (Invited paper)
3. Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In: Brakhage, H. (ed.) Automata Theory and Formal Languages. LNCS, vol. 33, pp. 134-183. Springer, Heidelberg (1975)
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., 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)
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. Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among the variables of a program. In: ACM POPL'78, pp. 84-97 (1978)
8. Davenport, J.H., Heintz, J.: Real Elimination is Doubly Exponential. J. of Symbolic Computation 5, 29-37 (1988)
9. Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall, Englewood Cliffs (1976)
10. Dolzman, A., Sturm, T.: REDLOG: Computer algebra meets computer logic. ACM SIGSAM Bulletin 31(2), 2-9
11. Floyd, R.W.: Assigning meanings to programs. Proc. Symphosia in Applied Mathematics 19, 19-37 (1967)
12. Gallo, G., Mishra, B.: Efficient Algorithms and Bounds for Wu-Ritt Characteristic Sets. In: Mora, T., Traverso, C. (eds.) Effective methods in algebraic geometry, Birkhäuser, Bosten. Progress in Mathematics, pp. 119-142 (1994)
13. German, S., Wegbreit, B.: A synthesizer of inductive assertions. IEEE Transactions on Software Engineering 1(1), 68-75 (1975)
14. Hoare, C.A.R.: An axiomatic basis for computer programming. Comm. ACM 12(10), 576-580 (1969)
15. Karr, M.: Affine relationships among variables of a program. Acta Informatica 6, 133-151 (1976)
16. Katz, S., Manna, Z.: Logical analysis of programma. Communications of the ACM 19(4), 188-206 (1976)
17. Kapur, D.: Automatically generating loop invariants using quantifier Ilimination. In: Proc. IMACS Intl. Conf. on Applications of Computer Algebra (ACA'04), Beaumont, Texas (July 2004)
18. Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, Heidelberg (1995)
19. Múller-Olm, M., Seidl, H.: Polynomial constants are decidable. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol. 2477, pp. 4-19. Springer, Heidelberg (2002)
20. Múller-Olm, M., Seidl, H.: Precise interprocedural analysis through linear algebra. In: ACM SIGPLAN Principles of Programming Languages, POPL 2004, pp. 330-341 (2004)
21. Rodriguez-Carbonell, E., Kapur, D.: An abstract interpretation approach for automatic generation of polynomial invariants. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol. 3148, pp. 280-295. Springer, Heidelberg (2004)
22. Rodriguez-Carbonell, E., Kapur, D.: Automatic generation of polynomial loop invariants: algebraic foundations. In: Proc. Intl. Symp on Symbolic and Algebraic Computation (ISSAC'04) (July 2004)
23. Rodriguez-Carbonell, E., Kapur, D.: Generating all polynomial invariants in simple loops. Journal of Symbolic Computation 42, 443-476 (2007)
24. Sankaranarayanan, S., Sipma, H.B., Manna, Z.: Non-linear loop invariant generation using Gröbner bases. In: ACM POPL'04, pp. 318-329 (2004)
25. Wegbreit, B.: The synthesis of loop predicates. Communications of the ACM 17(2), 102-112 (1974)
26. Wu, W.-T.: Basic principles of mechanical theorem proving in elementary geometrics. J. Syst. Sci. Math. 4, 207-235 (1984)
27. Xia, B., Xiao, R., Yang, L.: Solving parametric semi-algebraic systems. In: Pae, S.-l, Park, H. (eds.) Proc. the 7th Asian Symposium on Computer Mathematics (ASCM 2005), Seoul, December 8-10, pp. 153-156 (2005)
28. Xia, B., Yang, L.: An algorithm for isolating the real solutions of semi-algebraic systems. J. Symbolic Computation 34, 461-477 (2002)
29. Xia, B., Zhang, T.: Real Solution Isolation Using Interval Arithmetic. Comput. Math. Appl. 52, 853-860 (2006)
30. Yang, L.: Recent advances on determining the number of real roots of parametric polynomials. J. Symbolic Computation 28, 225-242 (1999)
31. 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)
32. Yang, L., Hou, X., Zeng, Z.: A complete discrimination system for polynomials. Science in China (Ser. E) 39, 628-646 (1996)
33. Yang, L., Xia, B.: Automated Deduction in Real Geometry. In: Chen, F., Wang, D. (eds.) Geometric Computation, pp. 248-298. World Scientific, Singapore (2004)
34. 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)