An improved rule for while loops in deductive program verification

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

Volumn 3785 LNCS, Issue , 2005, Pages 315-329

  Beckert, Bernhard ^a   Schlager, Steffen ^b   Schmitt, Peter H ^b  

^a University of Koblenz   (Germany)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SOFTWARE; INFORMATION ANALYSIS; STORAGE ALLOCATION (COMPUTER);

DEDUCTIVE PROGRAM VERIFICATION SYSTEMS; LOOP INVARIANTS; SOFTWARE VERIFICATION SYSTEM;

COMPUTER SCIENCE;

EID: 33646794659     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11576280_22     Document Type: Conference Paper

References (22)

1. W. Ahrendt, T. Baar, B. Beckert, R. Bubel, M. Giese, R. Hähnle, W. Menzel, W. Mostowski, A. Roth, S. Schlager, and P. H. Schmitt. The KeY tool. Software and System Modeling, 4:32-54, 2005.
2. W. Ahrendt, T. Baar, B. Beckert, M. Giese, E. Habermalz, R. Hähnle, W. Menzel, and P. H. Schmitt. The KeY approach: Integrating object oriented design and formal verification. In M. Ojeda-Aciego, I. P. de Guzman, G. Brewka, and L. M. Pereira, editors, Proceedings, Logics in Artificial Intelligence (JELIA), Malaga, Spain, LNCS 1919. Springer, 2000.
3. K. R. Apt. Ten years of Hoare logic: A survey - part I. ACM Transactions on Programming Languages and Systems, 1981.
4. B. Beckert. A dynamic logic for the formal verification of Java Card programs. In I. Attali and T. Jensen, editors, Java on Smart Cards: Programming and Security. Revised Papers, Java Card 2000, International Workshop, Cannes, France, LNCS 2041, pages 6-24. Springer, 2001.
5. B. Beckert, S. Schlager, and P. H. Schmitt. An Improved Rule for While Loops in Deductive Program Verification. Technical Report in Computing Science 2005-26, Fakultät für Informatik, Universität Karlsruhe, Germany, September 2005. Available at http://i12www.ira.uka.de/~schlager/publications/ TRInvRule.ps.gz.
6. B. Beckert and P. H. Schmitt. Program verification using change information. In Proceedings, Software Engineering and Formal Methods (SEFM), Brisbane, Australia, pages 91-99. IEEE Press, 2003.
7. A. Borgida, J. Mylopoulos, and R. Reiter. On the frame problem in procedure specifications. IEEE Transactions on Software Engineering, 21(10):785-798, 1995.
8. N. Cataño and M. Huisman. Chase: A static checker for JML's assignable clause. In Proceedings, Verification, Model Checking and Abstract Interpretation (VMCAI), LNCS 2575, pages 26-40. Springer, 2003.
9. D.L. Detlefs, K. R. M. Leino, G. Nelson, and J.B. Saxe. Extended static checking. Research Report 159, Compaq Systems Research Center, 1998.
10. M. D. Ernst. Dynamically Discovering Likely Program Invariants. PhD thesis, University of Washington, Seattle, August 2000.
11. D. Harel. Dynamic Logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, Volume II: Extensions of Classical Logic. Reidel, 1984.
12. D. Harel, D. Kozen, and J. Tiuryn. Dynamic Logic. The MIT Press, 2000.
13. D. Kozen and J. Tiuryn. Logic of programs. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 14, pages 89-133. Elsevier, 1990.
14. G.T. Leavens, A.L. Baker, and C. Ruby. JML: A notation for detailed design. In Haim Kilov, Bernhard Rumpe, and Ian Simmonds, editors, Behavioral Specifications of Businesses and Systems, chapter 12, pages 175-188. Kluwer Academic Publisher, 1999.
15. G.T. Leavens, A. L. Baker, and C. Ruby. Preliminary design of JML: A behavioral interface specification language for Java. Technical Report 98-06z, Iowa State University, Department of Computer Science, December 2004.
16. Object Modeling Group. UML 2.0 OCL Specification, October 2003.
17. Object Modeling Group. UML 2.0 Superstructure Specification, October 2004.
18. J. H. Perkins and M.D. Ernst. Efficient incremental algorithms for dynamic detection of likely invariants. In Proceedings of the ACM SIGSOFT 12th Symposium on the Foundations of Software Engineering (FSE 2004), pages 23-32, Newport Beach, CA, USA, November 2-4, 2004.
19. P. Rümmer. A Language for Sequential, Parallel and Quantified Updates of Firstorder Structures, 2005. Forthcoming.
20. R. Sasse. Proof obligations for correctness of modifies clauses. Studienarbeit, Fakultät für Informatik, Universität Karlsruhe, 2004. Available at http://i12www.ira.uka.de/"key/doc/2004/sasse2004.pdf.
21. N. Schirmer. A verification environment for sequential imperative programs in Isabelle/HOL. In F. Baader and A. Voronkov, editors, Proceedings, Logic for Programming, Artificial Intelligence, and Reasoning(LPAR), LNAI 3452, pages 398-414. Springer, 2004.
22. F. Spoto and E. Poll. Static analysis for JML's assignable clauses. In Proceedings, Foundations of Object-Oriented Languages (FOOL10), 2003.