DocumentCode :
281360
Title :
Software design using reusable algorithm abstractions
Author :
Harandi, M.T. ; Young, F.H.
Author_Institution :
Illinois Univ., Urbana, IL, USA
fYear :
1988
fDate :
11-15 Jul 1988
Firstpage :
93
Lastpage :
97
Abstract :
The work presented is concerned with partial automation of the design phase of software development, using a new type of design abstraction: task-oriented abstract algorithms. Task-oriented algorithm skeletons are free of data structure implementation details and restrictions. Using these abstract algorithms, software modules can be designed by a process of selecting appropriate abstract algorithms, specializing them to the particular situation, and then adding implementation details for data structures and subtasks. Recording this process represents the history of the design, providing a modifiable design document
Keywords :
data structures; software engineering; software portability; data structures; design abstraction; partial automation; reusable algorithm abstractions; software development; software engineering; software modules; software portability; software reusability; software reuse; task-oriented abstract algorithms;
fLanguage :
English
Publisher :
iet
Conference_Titel :
Software Engineering, 1988 Software Engineering 88., Second IEE/BCS Conference:
Conference_Location :
Liverpool
Type :
conf
Filename :
196367
Link To Document :
بازگشت