Premium
PEDANT: A computerized support to program modularity under limited memory conditions
Author(s) -
Mosedale T. W.
Publication year - 1973
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380030205
Subject(s) - modularity (biology) , computer science , generality , block (permutation group theory) , modular design , subroutine , programming language , realization (probability) , modular programming , software , theoretical computer science , software engineering , mathematics , psychology , statistics , genetics , geometry , psychotherapist , biology
Experience with conventional methods of defining subroutines shows that analytical algorithms lose generality once programmed, and can only be applied in new circumstances after laborious reprogramming; one consequence of this is the disparate abundance of existing program‐packages for mathematical statistics. Standard building‐blocks in modular form are therefore required, which are capable of embodying individual algorithms such that they can then be applied freely by a user unfamiliar with programming languages. This generalized approach presupposes the availability of a flexible switchboard for data between each building‐block. A system has been developed on this principle to facilitate the realization of composite technical calculations; it is based on a standard manner of supplying each conventionally programmed algorithm with data. The organization necessary for implementation in a typical batch operating‐system (Siemens DOS) is explained: This involves well‐defined data interfaces within each building‐block supported by standard software, which organizes the data transfer.