Refinement Methodology for Ada

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

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on software engineering Vol. SE-13; no. 4; pp. 472 - 478
Main Author: Rajlich, V.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.04.1987
Institute of Electrical and Electronics Engineers
IEEE Computer Society
Subjects:
Ada
Applied sciences
Computer languages
Computer programming
Computer science
Computer science; control theory; systems
Data structures
Design
Design methodology
Exact sciences and technology
information hiding
Interfaces
life-cycle
methodologies
Methods
Packaging
Procedures
Process design
program design language
programming language constructs
Programming languages
Programming profession
programming-in-the-large
Software
Software design
Testing
Trademarks
Life cycle
Package(program)
Programming language
Methodology
ADA language
Program design
Software engineering
ISSN:0098-5589, 1939-3520
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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).
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0098-5589
1939-3520
DOI:10.1109/TSE.1987.233183