Proof reuse for deductive program verification

Proceedings of the Second International Conference on Software Engineering and Formal Methods. SEFM 2004

Volumn , Issue , 2004, Pages 77-86

  Beckert, Bernhard ^a   Klebanov, Vladimir ^a  

^a France   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

JAVA DYNAMIC LOGIC THEOREM; MATCHING ALGORITHMS; OBJECT CONSTRAINT LANGUAGE (OCL); SOFTWARE DESIGN;

ABSTRACTING; ALGORITHMS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; JAVA PROGRAMMING LANGUAGE; KNOWLEDGE ACQUISITION; MIDDLEWARE; OBJECT ORIENTED PROGRAMMING; PROBLEM SOLVING; TREES (MATHEMATICS);

COMPUTER SOFTWARE;

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

References (15)

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 (SoSysM), pages 1-42, 2004. To appear. Available at http://www.springerlink.com.
2. W. Ahrendt, T. Baar, B. Beckert, M. Giese, R. Hähnle, W. Menzel, W. Mostowski, and P. H. Schmitt. The KeY system: Integrating object-oriented design and formal methods. In R.-D. Kutsche and H. Weber, editors, Proceedings, International Conference on Fundamental Approaches to Software Engineering (FASE), Grenoble, France, LNCS 2306, pages 327-330. Springer, 2002.
3. M. Balser, W. Reif, G. Schellhorn, K. Stenzel, and A. Thums. Formal system development with KIV. In T. Maibaum, editor, Proc., Fundamental Approaches to Software Engineering (FASE), LNCS 1783. Springer, 2000.
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. S. D. Gathman. GNU Diff for Java. Available at www. bmsi.com/java/#diff, 2003.
6. D. Harel, D. Kozen, and J. Tiuryn. Dynamic Logic. MIT Press, 2000.
7. X. Huang, M. Kerber, J. Richts, and A. Sehn. Planning mathematical proofs with methods. Journal of Information Processing and Cybernetics (EIK), 30, 1994.
8. KeY Project. Website at www. key-project.org.
9. T. Kolbe and C. Walther. Reusing proofs. In European Conference on Artificial Intelligence, pages 80-84, 1994.
10. E. Melis and A. Schairer. Similarities and reuse of proofs in formal software verification. In Proceedings, European Workshop on Advances in Case-Based Reasoning (EWCBR), Dublin, Ireland, LNCS 1488, pages 76-78, 1998.
11. E. W. Myers. An O(ND) difference algorithm and its variations. Algorithmica, 1(2):251-266, 1986.
12. L. C. Paulson. Isabelle: A Generic Theorem Prover. LNCS 828. Springer, 1994.
13. W. Reif and K. Stenzel. Reuse of proofs in software verification. In Proceedings, Foundations of Software Technology and Theoretical Computer Science, LNCS 761, pages 284-293. Springer, 1993.
14. Sun Microsystems, Inc. Code Conventions for the Java Programming Language. Available at java.sun.com/docs/codeconv.
15. K. Zhang and D. Shasha. Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal on Computing, 18(6): 1245-1262, 1989.