Output details
11 - Computer Science and Informatics
Birmingham City University
Graph transformations for object-oriented refinement
<07> This paper defines for the first time the notion of oo structural refinement, and establishes the laws of oo programming as refinement calculi do for structured programming. The theories of soundness and completeness allows OO refactoring and design patterns to be used as refinement law, forming the foundation for correct by design of oo programs. Presenting refinement laws in graph transformations supports tool development.
It forms part of the foundation of the internationally known method of refinement of Component and Object Systems (rCOS) that is followed by a dozen of research groups in the world, and over projects in Mainland China.