Title :
Refinement Methodology for Ada
Author_Institution :
Department of Computer Science, Wayne State University
fDate :
4/1/1987 12:00:00 AM
Abstract :
This paper presents Refinement Methodology (RM) for the design of Ada® programs. The methodology combines stepwise refinement and the information hiding principle. The steps of the methodology are explained and illustrated by an example. A part of the methodology is a collection of rules by which procedures acquire parameters (called first and second rules for parameters).
Keywords :
Ada; information hiding; life-cycle; methodologies; program design language; programming language constructs; programming-in-the-large; software design; Computer languages; Computer science; Data structures; Design methodology; Packaging; Process design; Programming profession; Software design; Testing; Trademarks; Ada; information hiding; life-cycle; methodologies; program design language; programming language constructs; programming-in-the-large; software design;
Journal_Title :
Software Engineering, IEEE Transactions on
DOI :
10.1109/TSE.1987.233183