An algorithm for automated generation of invariants for loops with conditionals

Proceedings - Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2005

Volumn 2005, Issue , 2005, Pages 245-249

  Kovács, Laura Ildikó ^a   Jebelean, Tudor ^a  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATION; COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; THEOREM PROVING;

AUTOMATED GENERATION; COMBINATORIAL TECHNIQUES; IMPERATIVE PROGRAMS; INVARIANT PROPERTIES;

INVARIANCE;

EID: 33847182439     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SYNASC.2005.19     Document Type: Conference Paper

References (23)

1. J. H. Andrews. Testing Using Log File Analysis: Tools, Methods and Issues. In 13th Annual Int. Conference on Automated Software Engineering (ASE'98), 1998.
2. S. Bensalem, Y. Lakhnech, and H. Saidi. Powerful Techniques for the Automatic Generation of Invariants. In Static Analysis Symposium, volume 1102 of LNCS, pages 323-335, 1996.
3. B. Buchberger. Gröbner-Bases: An Algorithmic Method in Polynomial Ideal Theory. In Multidimensional Systems Theory - Progress, Directions and Open Problems in Multidimensional Systems, pages 184-232, 1985.
4. B. Buchberger. Symbolic Computation: Computer Algebra and Logic. In Frontiers of Combining Systems, volume 3 of Applied Logic Series, pages 193-219, 1996.
5. B. Buchberger. The PCS Prover in Theorema. In Proceedings of EUROCAST 2001, 2001. LNCS 2178.
6. J. E. Cook and A. L. Wolf. Discovering Models of Software Processes from Event-Based Data. ACM Transactions on Software Engineering and Methodology, 7(3):215-249, 1998.
7. E. W. Dijkstra. A Discipline of Programming. 1976.
8. M. D. e. a. Ernst. Dynamically Discovering Likely Program Invariants to Support Program Evaluation. Technical report, University of Washington, 2000.
9. R. W. Floyd. Assigning Meanings to Programs. In Proc. Symphosia in Applied Mathematics 19, pages 19-37, 1967.
10. R. W. Gosper. Decision Procedures for Indefinite Hypergeometric Summation. Proc. of the National Academy of Science, USA, 75(5-6):40-42, 1978.
11. C. A. R. Hoare. An Axiomatic Basis for Computer Programming. Comm. ACM, 12, 1969.
12. T. Jebelean, L. Kovács, and N. Popov. Large Experimental Program Verification in the Theorema System. In Proc. of ISOLA 2004, Cyprus, pages 92-99, 2004.
13. D. E. Knuth. The Art of Computer Programming, volume 2. 1969.
14. L. Kovács. Program Verification using Hoare Logic, 2003. CAVIS-03, Timisoara, Romania.
15. L. Kovács. Using Combinatorial and Algebraic Techniques for Automatic Generation of Loop Invariants. Technical Report 05-09, RISC-Linz, Austria, 2005.
16. L. Kovács and T. Jebelean. Automated Generation of Loop Invarinats by Recurrence Solving in Theorema. In Proc. of SYNASC'04, pages 451-464, Romania, 2004.
17. Z. Manna. Mathematical Theory of Computation. McGraw-Hill Computer Science Series, 1974.
18. M. Müller-Olm and H. Seidl. Computing polynomial program invariants. Information Processing Letters, 91 (5):233-244, 2004.
19. E. Rodriguez-Carbonell and D. Kapur. Automatic Generation of Polynomial Loop Invariants: Algebraic Foundations. In Proc. of ISSAC'04, pages 266-273, Spain, 2004.
20. S. Sankaranaryanan, B. S. Henry, and Z. Manna. Nonlinear Loop Invariant Generation using Gröbner Bases. In ACM POPL'04, Italy, 2004.
21. R. P. Stanley. Differentiably finite power series. European Journal of Combinatorics, 1(2):175-188, 1980.
22. A. Tiwari, H. Ruess, H. Saidi, and N. Shankar. A Technique for Invariant Generation. In TACAS 2001, volume 2031 of LNCS, pages 113-127, 2001.
23. S. Wolfram. The Mathematica Book, 3rd ed. 1996.