An extensible encoding of object-oriented data models in hol : wwwith an application to imp++

Journal of Automated Reasoning

Volumn 41, Issue 3-4, 2008, Pages 219-249

  Brucker, Achim D ^a   Wolff, Burkhart ^b  

^a SAP RESEARCH   (Germany)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

Hol; Object oriented data models; Theorem proving; Verification

Indexed keywords

ENCODING (SYMBOLS); INFORMATION THEORY; LINGUISTICS; PROBLEM SOLVING; PROGRAMMING THEORY; QUERY LANGUAGES; THEOREM PROVING;

CHARACTERISTIC SETS; CLASS INVARIANTS; CLASS MODELS; DATA TYPES; DENOTATIONAL SEMANTICS; DYNAMIC TYPES; HIGHER-ORDER LOGIC; HOARE-LOGIC; HOL; OBJECT STRUCTURES; OBJECT-ORIENTED DATA MODELS; OBJECT-ORIENTED SPECIFICATIONS; PROGRAMMING LANGUAGES; SHALLOW EMBEDDING; VERIFICATION;

OBJECT ORIENTED PROGRAMMING;

EID: 59249104834     PISSN: 01687433     EISSN: 15730670     Source Type: Journal    
DOI: 10.1007/s10817-008-9108-3     Document Type: Article

References (35)

1. W. Ahrendt T. Baar B. Beckert R. Bubel M. Giese R. Hähnle W. Menzel W. Mostowski A. Roth S. Schlager P.H. Schmitt 2005 The KeY tool Softw. Syst. Model. 4 1 32 54 doi:10.1007/s10270-004-0058-x
2. Andrews, P.B.: Introduction to Mathematical Logic and Type Theory: To Truth through Proof, 2nd edn. Kluwer, Dordrecht (2002)
3. M. Barnett K.R.M. Leino W. Schulte 2005 The Spec# programming system: an overview G. Barthe L. Burdy M. Huisman J.L. Lanet T. Muntean Construction and Analysis of Safe, Secure, and Interoperable Smart Devices (CASSIS) Lecture Notes in Computer Science 3362 Springer Heidelberg 49 69 doi:10.1007/b105030 Barnett, M., Leino, K.R.M., Schulte, W.: The Spec# programming system: an overview. In: Barthe, G., Burdy, L., Huisman, M., Lanet, J.L., Muntean, T. (eds.) Construction and Analysis of Safe, Secure, and Interoperable Smart Devices (CASSIS). Lecture Notes in Computer Science, vol. 3362, pp. 49-69. Springer, Heidelberg (2005). doi: 10.1007/b105030
4. D.A. Basin H. Kuruma K. Takaragi B. Wolff 2005 Verification of a signature architecture with HOL-Z J. Fitzgerald I.J. Hayes A. Tarlecki FM 2005: Formal Methods Lecture Notes in Computer Science 3582 Springer Heidelberg 269 285 doi:10.1007/11526841-19 Basin, D.A., Kuruma, H., Takaragi, K., Wolff, B.: Verification of a signature architecture with HOL-Z. In: Fitzgerald, J., Hayes, I.J., Tarlecki, A. (eds.) FM 2005: Formal Methods. Lecture Notes in Computer Science, vol. 3582, pp. 269-285. Springer, Heidelberg (2005). doi: 10.1007/11526841-19
5. Beckert, B., Hähnle, R., Schmitt, P.H. (eds.): Verification of object-oriented software: the KeY approach. In: Lecture Notes in Computer Science, vol. 4334. Springer, Heidelberg (2007). doi: 10.1007/978-3-540-69061-0
6. S. Berghofer M. Wenzel 1999 Inductive datatypes in HOL-lessons learned in formal-logic engineering Y. Bertot G. Dowek A. Hirschowitz C. Paulin L. Théry Theorem Proving in Higher Order Logics (TPHOLS) Lecture Notes in Computer Science 1690 Springer Heidelberg 19 36 doi:10.1007/3-540-48256-3-3 Berghofer, S., Wenzel, M.: Inductive datatypes in HOL-lessons learned in formal-logic engineering. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C., Théry, L. (eds.) Theorem Proving in Higher Order Logics (TPHOLS). Lecture Notes in Computer Science, vol. 1690, pp. 19-36. Springer, Heidelberg (1999). doi: 10.1007/3-540-48256-3-3
7. S. Böhme K.R.M. Leino B. Wolff 2008 HOL-Boogie-an interactive prover for the Boogie program-verifier O.A. Mohamed C. Muñoz S. Tahar Theorem Proving in Higher Order Logics Lecture Notes in Computer Science 5170 Springer Heidelberg 150 166 doi:10.1007/978-3-540-71067-7-15 Böhme, S., Leino, K.R.M., Wolff, B.: HOL-Boogie-an interactive prover for the Boogie program-verifier. In: Mohamed, O.A., Muñoz, C., Tahar, S. (eds.) Theorem Proving in Higher Order Logics. Lecture Notes in Computer Science, vol. 5170, pp. 150-166. Springer, Heidelberg (2008). doi: 10.1007/978-3-540-71067-7-15
8. Brucker, A.D.: An interactive proof environment for object-oriented specifications. PhD Thesis, ETH Zurich (2007). ETH Dissertation No. 17097
9. A.D. Brucker F. Rittinger B. Wolff 2003 HOL-Z 2.0: a proof environment for Z-specifications J. Univers. Comput. Sci. 9 2 152 172
10. Brucker, A.D., Wolff, B.: The HOL-OCL book. Tech. Rep. 525. ETH, Zurich (2006)
11. A.D. Brucker B. Wolff 2008 HOL-OCL-a formal proof environment for UML/OCL J. Fiadeiro P. Inverardi Fundamental Approaches to Software Engineering (FASE08) Lecture Notes in Computer Science 4961 Springer New York 97 100 doi:10.1007/978-3-540-78743-3-8 Brucker, A.D., Wolff, B.: HOL-OCL-a formal proof environment for UML/OCL. In: Fiadeiro, J., Inverardi, P. (eds.) Fundamental Approaches to Software Engineering (FASE08). Lecture Notes in Computer Science, no. 4961, pp. 97-100. Springer, New York (2008). doi: 10.1007/978-3-540-78743-3- 8
12. A.D. Brucker B. Wolff 2008 Extensible universes for object-oriented data models J. Vitek ECOOP 2008-Object-Oriented Programming Lecture Notes in Computer Science 5142 Springer New York 438 462 doi:10.1007/978-3-540-70592-5-19 Brucker, A.D., Wolff, B.: Extensible universes for object-oriented data models. In: Vitek, J. (ed.) ECOOP 2008-Object-Oriented Programming. no. 5142 in Lecture Notes in Computer Science, pp. 438-462. Springer, New York (2008). doi: 10.1007/978-3-540-70592-5-19
13. S. Drossopoulou S. Eisenbach 1999 Describing the semantics of Java and proving type soundness J. Alves-Foss Formal Syntax and Semantics of Java Lecture Notes in Computer Science 1523 Springer Heidelberg 41 82 doi:10.1007/3-540- 48737-9-2 Drossopoulou, S., Eisenbach, S.: Describing the semantics of Java and proving type soundness. In: Alves-Foss, J. (ed.) Formal Syntax and Semantics of Java, Lecture Notes in Computer Science, vol. 1523, pp. 41-82. Springer, Heidelberg (1999). doi: 10.1007/3-540-48737-9-2
14. M. Flatt S. Krishnamurthi M. Felleisen 1999 A programmer's reduction semantics for classes and mixins J. Alves-Foss Formal Syntax and Semantics of Java Springer Heidelberg 241 269 doi:10.1007/3-540-48737-9-7 Flatt, M., Krishnamurthi, S., Felleisen, M.: A programmer's reduction semantics for classes and mixins. In: Alves-Foss, J. (ed.) Formal Syntax and Semantics of Java, pp. 241-269. Springer, Heidelberg (1999). doi: 10.1007/3-540-48737-9-7
15. M. Huisman B. Jacobs 2000 Inheritance in higher order logic: modeling and reasoning M. Aagaard J. Harrison Theorem Proving in Higher Order Logics (TPHOLS) Lecture Notes in Computer Science 1869 Springer Heidelberg 301 319 doi:10.1007/3-540-44659-1-19 Huisman, M., Jacobs, B.: Inheritance in higher order logic: modeling and reasoning. In: Aagaard, M., Harrison, J. (eds.) Theorem Proving in Higher Order Logics (TPHOLS). Lecture Notes in Computer Science, vol. 1869, pp. 301-319. Springer, Heidelberg (2000). doi: 10.1007/3-540-44659-1-19
16. A. Igarashi B.C. Pierce P. Wadler 2001 Featherweight java: a minimal core calculus for Java and GJ ACM Trans. Program. Lang. Syst. 23 3 396 450 doi:10.1145/503502.503505
17. B. Jacobs E. Poll 2004 Java program verification at Nijmegen: developments and perspective K. Futatsugi F. Mizoguchi N. Yonezaki Software Security-Theories and Systems (ISSS) Lecture Notes in Computer Science 3233 Springer Heidelberg 134 153 doi:10.1007/b102118 Jacobs, B., Poll, E.: Java program verification at Nijmegen: developments and perspective. In: Futatsugi, K., Mizoguchi, F., Yonezaki, N. (eds.) Software Security-Theories and Systems (ISSS). Lecture Notes in Computer Science, vol. 3233, pp. 134-153. Springer, Heidelberg (2004). doi: 10.1007/b102118
18. Leavens, G.T., Baker, A.L., Ruby, C.: JML: a notation for detailed design. In: Kilov, H., Rumpe, B., Simmonds, I. (eds.) Behavioral Specifications of Businesses and Systems, pp. 175-188. Kluwer, Dordrecht (1999)
19. Leino K.R.M., Müller P., 2005. Modular verification of static class invariants. In Fitzgerald J. Hayes I.J. Tarlecki A. (eds), FM 2005: Formal Methods, Lecture Notes in Computer Science 3582 26-42, Springer Heidelberg. doi:10.1007/11526841-4
20. C. Marché C. Paulin-Mohring 2005 Reasoning about Java programs with aliasing and frame conditions J. Hurd T.F. Melham Theorem Proving in Higher Order Logics (TPHOLS) Lecture Notes in Computer Science 3603 Springer Heidelberg 179 194 doi:10.1007/11541868-12 Marché, C., Paulin-Mohring, C.: Reasoning about Java programs with aliasing and frame conditions. In: Hurd, J., Melham, T.F. (eds.) Theorem Proving in Higher Order Logics (TPHOLS), Lecture Notes in Computer Science, vol. 3603, pp. 179-194. Springer, Heidelberg (2005). doi: 10.1007/11541868-12
21. Melham, T.F.: A package for inductive relation definitions in HOL. In: Archer, M., Joyce, J.J., Levitt, K.N., Windley, P.J. (eds.) International Workshop on the HOL Theorem Proving System and Its Applications (TPHOLS), pp. 350-357. IEEE Computer Society, Los Alamitos (1992)
22. Meyer, J., Poetzsch-Heffter, A.: An architecture for interactive program provers. In: Graf, S., Schwartzbach, M.I. (eds.) Tools and Algorithms for the Construction and Analysis of Systems (TACAS). Lecture Notes in Computer Science, vol. 1785, pp. 63-77. Springer, Heidelberg (2000)
23. O. Müller T. Nipkow D. von Oheimb O. Slotosch 1999 HOLCF = HOL + LCF J. Funct. Program. 9 2 191 223 doi:10.1017/S095679689900341X
24. W. Naraschewski M. Wenzel 1998 Object-oriented verification based on record subtyping in higher-order logic J. Grundy M.C. Newey Theorem Proving in Higher Order Logics (TPHOLS) Lecture Notes in Computer Science 1479 Springer Heidelberg 349 366 doi:10.1007/BFb0055146 Naraschewski, W., Wenzel, M.: Object-oriented verification based on record subtyping in higher-order logic. In: Grundy, J., Newey, M.C. (eds.) Theorem Proving in Higher Order Logics (TPHOLS). Lecture Notes in Computer Science, vol. 1479, pp. 349-366. Springer, Heidelberg (1998). doi: 10.1007/BFb0055146
25. T. Nipkow 1998 Winskel is (almost) right: towards a mechanized semantics textbook Form. Asp. Comput. 10 2 171 186 doi:10.1007/s001650050009
26. light is type-safe-definitely. In: ACM Symp. Principles of Programming Languages (POPL), pp. 161-170. ACM, New York (1998). doi: 10.1145/268946.268960
27. T. Nipkow L.C. Paulson M. Wenzel 2002 Isabelle/HOL-a proof assistant for higher-order logic Lecture Notes in Computer Science, vol. 2283 Springer Heidelberg doi:10.1007/3-540-45949-9 Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL-a proof assistant for higher-order logic. In: Lecture Notes in Computer Science, vol. 2283. Springer, Heidelberg (2002). doi: 10.1007/3-540-45949-9
28. OMG: UML 2.0 OCL specification (2003). ptc/03-10-14
29. OMG: Unified modeling language specification (version 1.5) (2003). formal/03-03-01
30. von Oheimb, D.: Analyzing Java in Isabelle/HOL: formalization, type safety and hoare logic. PhD Thesis, Technische Universität München (2001)
31. D. von Oheimb T. Nipkow 2002 Hoare logic for NanoJava: auxiliary variables, side effects, and virtual methods revisited L.H. Eriksson P.A. Lindsay FME 2002: Formal Methods-Getting IT Right Lecture Notes in Computer Science 2391 Springer Heidelberg 89 105 doi:10.1007/3-540-45614-7-6 von Oheimb, D., Nipkow, T.: Hoare logic for NanoJava: auxiliary variables, side effects, and virtual methods revisited. In: Eriksson, L.H., Lindsay, P.A. (eds.) FME 2002: Formal Methods-Getting IT Right. Lecture Notes in Computer Science, vol. 2391, pp. 89-105. Springer, Heidelberg (2002). doi: 10.1007/3-540-45614-7-6
32. Paulson, L.C.: A fixedpoint approach to (co)inductive and (co)datatype definitions. In: Plotkin, G., Stirling, C., Tofte M. (eds.) Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 187-211. MIT, Cambridge (2000)
33. G. Smith F. Kammüller T. Santen 2002 Encoding Object-Z in Isabelle/HOL D. Bert J.P. Bowen M.C. Henson K. Robinson ZB 2002: Formal Specification and Development in Z and B Lecture Notes in Computer Science 2272 Springer Heidelberg 82 99 doi:10.1007/3-540-45648-1-5 Smith, G., Kammüller, F., Santen, T.: Encoding Object-Z in Isabelle/HOL. In: Bert, D., Bowen, J.P., Henson, M.C., Robinson, K. (eds.) ZB 2002: Formal Specification and Development in Z and B. Lecture Notes in Computer Science, vol. 2272, pp. 82-99. Springer, Heidelberg (2002). doi: 10.1007/3-540-45648-1-5
34. Winskel, G.: The Formal Semantics of Programming Languages. MIT, Cambridge (1993)
35. K. Yatake T. Aoki T. Katayama 2005 Implementing application-specific object-oriented theories in HOL D.V. Hung M. Wirsing Theoretical Aspects of Computing-ICTAC 2005 Lecture Notes in Computer Science 3722 Springer Heidelberg 501 516 doi:10.1007/11560647-33 Yatake, K., Aoki, T., Katayama, T.: Implementing application-specific object-oriented theories in HOL. In: Hung, D.V., Wirsing, M. (eds.) Theoretical Aspects of Computing-ICTAC 2005. Lecture Notes in Computer Science, vol. 3722, pp. 501-516. Springer, Heidelberg (2005). doi: 10.1007/11560647-33