A graph-based implementation for mechanized refinement calculus of OO programs

  • Authors:
  • Zhiming Liu;Charles Morisset;Shuling Wang

  • Affiliations:
  • UNU-IIST, Macau S.A.R., China;Royal Holloway, University of London;UNU-IIST, Macau S.A.R., China and State Key Lab. of Computer Science, Institute of Software, Chinese Academy of Sciences

  • Venue:
  • SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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.