FORMALIZATION AND EXPLICATION OF THE MICHAEL JACKSON METHOD OF PROGRAM DESIGN

被引：11

作者：

HUGHES, JW

机构：

[1] Computation Department, University of Manchester, Institute of Science and Technology, Manchester, M60 1QD

来源：

SOFTWARE-PRACTICE & EXPERIENCE | 1979年 / 9卷 / 03期

关键词：

Finite state transducers; General sequential machines; Program design; Programming methodologies; Regular sets; Structured programming;

D O I：

10.1002/spe.4380090304

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

The key to Jackson's Program Design Method is the definition of the inputs and outputs of a program as labelled trees and the recognition of a correspondence between them. This paper gives a more formal definition of the trees and the correspondence. These definitions are then used to explain his basic method and methods for ‘structure clashes’ by reference to formal language theory. Copyright © 1979 John Wiley & Sons, Ltd.

引用

页码：191 / 202

页数：12

共 8 条

[1]

Jackson M.A., Principles of Program Design, (1975)

[2]

Ginsburg S., Mathematical Theory of Context‐free Languages, pp. 97-102, (1965)

[3]

Aho A.V., Ullman J.D., The Theory of Parsing, Translation and Compiling, Vol. 1 Parsing, (1972)

[4]

Noonan R.E., Structured programming and formal specification, IEEE Trans, on Software Engrg., 5E–1, 4, (1975)

[5]

Wirth N., Algorithms + Data Structures = Programs, (1976)

[6]

Coleman D., The systematic design of file processing programs, Software—Practice and Experience, 7, pp. 371-381, (1977)

[7]

Henderson P., Snowden R., An experiment in structured programming, BIT, 12, pp. 38-53, (1972)

[8]

Huffman D., Canonical forms for information loss‐less finite state logical machines, IRE Trans. Information Theory, 5 IT, (1969)

← 1 →