Supporting module reuse in refinement

Hayes I.J. (1996) Supporting module reuse in refinement. Science of Computer Programming, 27 2: 175-184. doi:10.1016/0167-6423(96)00006-8

Author Hayes I.J.
Title Supporting module reuse in refinement
Journal name Science of Computer Programming   Check publisher's open access policy
ISSN 0167-6423
Publication date 1996-01-01
Sub-type Article (original research)
DOI 10.1016/0167-6423(96)00006-8
Open Access Status DOI
Volume 27
Issue 2
Start page 175
End page 184
Total pages 10
Language eng
Subject 1703 Computational Theory and Mathematics
1712 Software
Abstract For the rigorous development of larger-scale software, the use of data abstractions is essential. For formal development in methods such as the VDM, B and the refinement calculus such abstractions are encapsulated in a module with state and operations. The principle of information hiding suggests that the state of a module should be inaccessible to the rest of a program. As an approach to refinement where an existing module is to be reused, we recommend relaxing the principle of information hiding to allow the program being developed to access the abstract state of the module directly. Eventually all references to the module state must be replaced by calls to module operations, but in the initial stages of refinement allowing only module operations is too restrictive. By allowing access to the module state the development method supports the reuse of existing modules more easily.
Q-Index Code C1
Q-Index Status Provisional Code
Institutional Status Unknown

Document type: Journal Article
Sub-type: Article (original research)
Collection: Scopus Import - Archived
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 1 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 1 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Tue, 14 Jun 2016, 13:13:21 EST by System User on behalf of Learning and Research Services (UQ Library)