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. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Liu, Z., Morisset, C., & Wang, S. (2011). A graph-based implementation for mechanized refinement calculus of OO programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6527 LNCS, pp. 258–273). https://doi.org/10.1007/978-3-642-19829-8_17
Mendeley helps you to discover research relevant for your work.