A Graph-Based Implementation for Mechanized Refinement Calculus of OO Programs

  • Zhiming Liu
  • Charles Morisset
  • Shuling Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6527)

Abstract

This paper extends the mechanization of the refinement calculus done by von Wright in HOL, representing the state of a program as a graph instead of a tuple, in order to deal with object-orientation. The state graph structure is implemented in Isabelle, together with definitions and lemmas, to help the manipulation of states. We then show how proof obligations are automatically generated from the rCOS tool and can be loaded in Isabelle to be proved. We illustrate our approach by generating the proof obligations for a simple example, including object access and method invocation.

Keywords

Isabelle Proof obligations rCOS Theorem proving 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Back, R.-J.: On the Correctness of Refinement Steps in Program Development. PhD thesis, Helsinki, Finland, Report A–1978–4 (1978)Google Scholar
  2. 2.
    Back, R.-J., Fan, X., Preoteasa, V.: Reasoning about pointers in refinement calculus. Technical Report 543, TUCS - Turku Centre for Computer Science, Turku, Finland (July 2003)Google Scholar
  3. 3.
    Carrington, D., Hayes, I., Nickson, R., Watson, G., Welsh, J.: A tool for developing correct programs by refinement. In: Proc. BCS 7th Refinement Workshop. Springer, Heidelberg (1996)Google Scholar
  4. 4.
    Cavalcanti, A., Naumann, D.A.: A weakest precondition semantics for refinement of object-oriented programs. IEEE Transactions on Software Engineering 26, 713–728 (2000)CrossRefGoogle Scholar
  5. 5.
    Chen, Z., Liu, Z., Ravn, A.P., Stolz, V., Zhan, N.: Refinement and verification in component-based model driven design. Science of Computer Programming 74(4), 168–196 (2009); UNU-IIST TR 388MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Chen, Z., Liu, Z., Stolz, V.: The rCOS tool. In: Modelling and Analysis in VDM: Proceedings of the Fourth VDM/Overture Workshop, number CS-TR-1099 in Technical Report Series. Newcastle University (May 2008)Google Scholar
  7. 7.
    Chen, Z., Morisset, C., Stolz, V.: Specification and validation of behavioural protocols in the rCOS modeler. In: Arbab, F., Sirjani, M. (eds.) FSEN 2009. LNCS, vol. 5961, pp. 387–401. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  8. 8.
    Depasse, C.: Constructing Isabelle proofs in a proof refinement calculus. Research Report, UCL (2001)Google Scholar
  9. 9.
    Filliâtre, J.-C.: Why: a multi-language multi-prover verification tool. Research Report 1366, LRI, Université Paris Sud (2003)Google Scholar
  10. 10.
    He, J., Liu, Z., Li, X.: rCOS: A refinement calculus of object systems. Theor. Comput. Sci. 365(1-2), 109–142 (2006); UNU-IIST TR 322MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Hoare, C.A.R., He, J.: Unifying Theories of Programming. Prentice-Hall, Englewood Cliffs (1998)MATHGoogle Scholar
  12. 12.
    Ke, W., Liu, Z., Wang, S., Zhao, L.: A graph-based operational semantics of oo programs. In: Breitman, K., Cavalcanti, A. (eds.) ICFEM 2009. LNCS, vol. 5885, pp. 347–366. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  13. 13.
    Klein, G., Nipkow, T.: A machine-checked model for a Java-like language, virtual machine, and compiler. ACM Trans. Program. Lang. Syst. 28(4), 619–695 (2006)CrossRefGoogle Scholar
  14. 14.
    Laibinis, L.: Mechanised Formal Reasoning About Modular Programs. PhD thesis, Abo Akademi (2000)Google Scholar
  15. 15.
    Lei, B., Liu, Z., Morisset, C., Li, X.: State based robustness testing for components. In: FACS 2008. ENTCS, vol. 260, pp. 173–188. Elsevier, Amsterdam (2008)Google Scholar
  16. 16.
    Liu, Z., Morisset, C., Stolz, V.: rCOS: theory and tools for component-based model driven development. In: Arbab, F., Sirjani, M. (eds.) FSEN 2009. LNCS, vol. 5961, pp. 62–80. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  17. 17.
    Morgan, C.: Programming from specifications, 2nd edn. Prentice Hall International, Englewood Cliffs (1994)MATHGoogle Scholar
  18. 18.
    Paige, R., Ostroff, J., Brooke, P.: Formalising eiffel references and expanded types in pvs. In: Proc. International Workshop on Aliasing, Confinement, and Ownership in Object-Oriented Programming (2003)Google Scholar
  19. 19.
    Paige, R.F., Ostroff, J.S.: ERC – An object-oriented refinement calculus for Eiffel. Form. Asp. Comput. 16(1), 51–79 (2004)CrossRefMATHGoogle Scholar
  20. 20.
    Sekerinski, E.: A type-theoretic basis for an object-oriented refinement calculus. In: Formal Methods and Object Technology. Springer, Heidelberg (1996)Google Scholar
  21. 21.
    Stolz, V.: An integrated multi-view model evolution framework. Innovations in Systems and Software Engineering (2009)Google Scholar
  22. 22.
    Utting, M.: An object-oriented refinement calculus with modular reasoning (1992)Google Scholar
  23. 23.
    van den Berg, J., Jacobs, B.: The loop compiler for java and jml. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 299–312. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  24. 24.
    von Wright, J.: Program refinement by theorem prover. In: BCS FACS Sixth Refinement Workshop – Theory and Practise of Formal Software Development. Springer, Heidelberg (1994)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Zhiming Liu
    • 1
  • Charles Morisset
    • 2
  • Shuling Wang
    • 1
    • 3
  1. 1.UNU-IISTMacauChina
  2. 2.Royal Holloway, Information Security GroupUniversity of LondonEghamU.K.
  3. 3.State Key Lab. of Computer Science, Institute of SoftwareChinese Academy of SciencesChina

Personalised recommendations