Customised induction rules for proving correctness of imperative programs

Proceedings - 3rd IEEE International Conference on Software Engineering and Formal Methods, SEFM 2005

Volumn , Issue , 2005, Pages 180-189

  Olsson, Ola ^a   Wallenburg, Angela ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC CONSTRUCTION; GAIN INFORMATION; IMPERATIVE LANGUAGES; IMPERATIVE PROGRAMS; INDUCTION VARIABLES; PROBLEM STRUCTURE; SYMBOLIC EXECUTION; USER INTERACTION;

MACHINERY; THEOREM PROVING; USER INTERFACES;

SOFTWARE ENGINEERING;

EID: 33845189059     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SEFM.2005.15     Document Type: Conference Paper

References (22)

1. D. Hutter A. Bundy, D. Basin and A. Ireland. Rippling: Meta-level Guidance for Mathematical Reasoning. Cambridge University Press, 2004.
2. Jean-Raymond Abrial. The B Book-Assigning Programs to Meanings. Cambridge University Press, August 1996.
3. Wolfgang Ahrendt, Thomas Baar, Bernhard Beckert, Richard Bubel, Martin Giese, Reiner Hähnle, Wolfram Menzel, Wojciech Mostowski, Andreas Roth, Steffen Schlager, and Peter H. Schmitt. The KeY tool. Software and Systems Modeling, 4(1):32-54, February 2005.
4. Bernhard 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. Bernhard Beckert and Steffen Schlager. Software verification with integrated data type refinement for integer arithmetic. In Eerke A. Boiten, John Derrick, and Graeme Smith, editors, Proceedings, IFM 2004, volume 2999 of LNCS, pages 207-226. Springer, 2004.
6. Robert Boyer and J. Strother Moore. A Computational Logic Handbook. Number 23 in Perspectives in Computing. Academic Press, 1988.
7. A. Bundy. The automation of proof by mathematical induction. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume I, chapter 13, pages 845-911. Elsevier Science, 2001.
8. A. Bundy, F. van Harmelen, C. Horn, and A. Smaill. The oyster-clam system. In M. E. Stickel, editor, 10th International Conference on Automated Deduction, pages 647-648. Springer, Berlin, Heidelberg, 1990.
9. Zhiqun Chen. JAVA CARD Technology for Smart Cards: Architecture and Programmer's Guide. JAVA Series. Addison-Wesley, June 2000.
10. Reiner Hähnle and Angela Wallenburg. Using a software testing technique to improve theorem proving. In Alexandre Petrenko and Andreas Ulrich, editors, Post Conference Proceedings, FATES 2003, volume 2931 of LNCS, pages 30-41. Springer-Verlag, 2004.
11. Sidney L. Hantler and James C. King. An introduction to proving the correctness of programs. ACMComputing Surveys (CSUR), 8(3):331-353, 1976.
12. David Harel, Dexter Kozen, and Jerzy Tiuryn. Dynamic Logic. Foundations of Computing. MIT Press, October 2000.
13. Ramin Hojati and Robert K. Brayton. Automatic datapath abstraction in hardware systems. In Proceedings of the 7th International Conference on Computer Aided Verification, pages 98-113. Springer-Verlag, 1995.
14. A. Ireland and A. Bundy. Productive use of failure in inductive proof. Journal of Automated Reasoning, 16(1-2):79-111, 1996.
15. Andrew Ireland, Michael Jackson, and Gordon Reid. Interactive proof critics. Formal Aspects of Computing, 11(3):302-325, 1999.
16. Matt Kaufmann and J. Strother Moore. An industrial strength theorem prover for a logic based on common lisp. Software Engineering, 23(4):203-213, 1997.
17. E. Rodrguez-Carbonell and D. Kapur. Automatic Generation of Polynomial Loop Invariants: Algebraic Foundations. In International Symposiumon Symbolic and Algebraic Computation 2004 (ISSAC04), pages 266-273. ACM Press, 2004.
18. K. Schneider, T. Kropf, and R. Kumar. Control-path oriented verification of sequential generic circuits with control and data path. In European Design and Test Conference (EDTC), pages 648-652, Paris, France, March 1994. IEEE Computer Society.
19. Konrad Slind. Derivation and use of induction schemes in higher-order logic. In Elsa L Gunter and Amy Felty, editors, Proc. TPHOL 1997, volume 1275 of LNCS, pages 275-290. Springer-Verlag, 1997.
20. Christoph Sprenger and Mads Dam. On the structure of inductive reasoning: Circular and tree-shaped proofs in the -calculus. In Gordon, Andrew D. (ed. ), FOSSACS 2003. Proceedings. LNCS 2620, 425-440 . Springer, 2003.
21. Angela Wallenburg. Induction rules for proving correctness of imperative programs. Licentiate Thesis 1L, Chalmers University of Technology and Göteborg University, Department of Computer Science and Engineering, Göteborg, Sweden, December 2004.
22. Christoph Walther. Mathematical induction. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming. Deduction Methodologies, volume 2, chapter 3, pages 127-227. Oxford University Press, 1994.