Refinement Methodology for Ada

Václav Rajlich · IEEE Transactions on Software Engineering · 1987

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).

Read the paper · More papers on PaperTik