This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Refinement Methodology for Ada
April 1987 (vol. 13 no. 4)
pp. 472-478
V. Rajlich, Department of Computer Science, Wayne State University
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).
Index Terms:
software design, Ada, information hiding, life-cycle, methodologies, program design language, programming-in-the-large, programming language constructs
Citation:
V. Rajlich, "Refinement Methodology for Ada," IEEE Transactions on Software Engineering, vol. 13, no. 4, pp. 472-478, April 1987, doi:10.1109/TSE.1987.233183
Usage of this product signifies your acceptance of the Terms of Use.