A complete invariant generation approach for P-solvable loops

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

Volumn 5947 LNCS, Issue , 2010, Pages 242-256

  Kovács, Laura ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

GENERATION TECHNIQUES; POLYNOMIAL INVARIANTS; PRIME IDEAL;

BEAM PLASMA INTERACTIONS; COMPUTER AIDED LANGUAGE TRANSLATION;

ALGORITHMS;

EID: 77951116922     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11486-1_21     Document Type: Conference Paper

References (19)

1. Buchberger, B.: An Algorithm for Finding the Basis Elements of the Residue Class Ring of a Zero Dimensional Polynomial Ideal. J. of Symbolic Computation 41(3-4), 475-511 (2006)
2. Cox, D., Little, J., O'Shea, D.: Ideal, Varieties, and Algorithms. An Introduction to Computational Algebraic Geometry and Commutative Algebra, 2nd edn. Springer, Heidelberg (1998)
3. Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall, Englewood Cliffs (1976)
4. Everest, G., van der Poorten, A., Shparlinski, I.,Ward, T.: Recurrence Sequences. Mathematical Surveys and Monographs, vol.104. American Mathematical Society (2003)
5. German, S.M., Wegbreit, B.: A Synthesizer of Inductive Assertions. IEEE Transactions on Software Engineering 1, 68-75 (1975)
6. Gosper, R.W.: Decision Procedures for Indefinite Hypergeometric Summation. Journal of Symbolic Computation 75, 40-42 (1978)
7. Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics, 2nd edn. Addison-Wesley Publishing Company, Reading (1989)
8. Hoare, C.A.R.: An Axiomatic Basis for Computer Programming. Comm. of ACM 12(10), 576-580 (1969)
9. Kaldewaij, A.: Programming. The Derivation of Algorithms. Prentince-Hall (1990)
10. Kapur, D.: A Quantifier Elimination Based Heuristic for Automatically Generating Inductive Assertions for Programs. J. of Systems Science and Complexity 19(3), 307-330 (2006)
11. Kauers,M.: Algorithms for Nonlinear Higher Order Difference Equations. PhD thesis, RISCLinz, Johannes Kepler University Linz, Austria (2005)
12. Kauers, M., Zimmermann, B.: Computing the Algebraic Relations of C-finite Sequences and Multisequences. J. of Symbolic Computation 43(11), 787-803 (2008)
13. Kovacs, L.: Aligator: A Mathematica Package for Invariant Generation. In: Proc. of IJCAR, pp. 275-282 (2008)
14. Kovacs, L.: Reasoning Algebraically About P-Solvable Loops. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.4963, pp. 249-264. Springer, Heidelberg (2008)
15. Müller-Olm, M., Seidl, H.: Computing Polynomial Program Invariants. Indormation Processing Letters 91(5), 233-244 (2004)
16. Paule, P., Schorn, M.: A Mathematica Version of Zeilberger's Algorithm for Proving Binomial Coefficient Identities. J. of Symbolic Computation 20(5-6), 673-698 (1995)
17. Rodriguez-Carbonell, E., Kapur, D.: Automatic Generation of Polynomial Invariants of Bounded Degree using Abstract Interpretation. Science of Comp. Programming 64(1) (2007)
18. Rodriguez-Carbonell, E., Kapur, D.: Generating All Polynomial Invariants in Simple Loops. J. of Symbolic Computation 42(4), 443-476 (2007)
19. Sankaranaryanan, S., Sipma, H.B., Manna, Z.: Non-Linear Loop Invariant Generation using Gröbner Bases. In: Proc. of POPL (2004)