--(1977b), 'Finite State Machine Theory and Program Design: A Survey', Computer Studies Quarterly, 1, to be published.

Transcription

1 References An asterisk indicates the most important references. Adelson-Velskii, G. M., and Landis, E. M. (1962), Dok. Akad. Nauk SSSR, 146, pp ; English translation in Soviet Math., 3, Amble, 0., and Knuth, D. E. (1974), 'Ordered Hash Tables', Comput. J., 17, Brinch Hansen, Per (1973), Operating System Principles (Prentice-Hall, --(1975a), 'The Programming Language Concurrent Pascal', Trans. LE.E.E. on Software Engineering, 1, 2. --(1975b ), 'Concurrent Pascal Report' (Information Science, California Institute of Technology). --(1976), 'SOLO Operating System', Software Practice and Experience, 6, (four papers). Coleman, D. (1977a), 'The Systematic Design of File-processing Programs', Software Practice and Experience, 7, (1977b), 'Finite State Machine Theory and Program Design: A Survey', Computer Studies Quarterly, 1, to be published. *Dahl, 0. J., Dijkstra, E. W., and Hoare, C. A. R. (1972), Structured Programming (Academic Press, London) Dahl, 0. J., Myhrhand, B., and Nygaard, K. (1970), 'The SIMULA 67 Common Base Language' (Norwegian Computing Centre, Oslo, Publication No. S-22). Dijkstra, E. W. (1968), 'Goto Statement Considered Harmful', Communs Ass. comput. Mach., 11, 147-8,538, (1972), 'Notes on Structured Programming', in 0. J. Dahl, E. W. Dijkstra and C. A. R. Hoare, Structured Programming (Academic Press, London). --(1973), 'Hierarchical Ordering of Sequential Processes', in C. A. R. Hoare and R. H. Perrot (eds), Operating System Techniques (Academic Press, London). --(1976), A Discipline of Programming (Prentice-Hall, Englewood Cliffs, N.J.).

2 218 A Structured Programming Approach to Data *Gries, D. (1974), 'On Structured Programming- A Reply.to Smoliar', Communs Ass. comput. Mach., 17, Griffiths, M. (1975), 'Requirements for and Problems with Intermediate Languages for Programming Language Implementation' (Lecture notes for the NATO International Summer School, Marktoberdorf, W. Germany). Hetzel, W. C. (I 973), Program Test Methods (Prentice-Hall, Englewood Cliffs, N.J.). Hoare, C. A. R. (1962), 'Quicksort', Comput. J., 5, (1968), 'Record Handling', in F. Genuys,Programming Languages (Academic Press, London) ( 1972a), 'Proof of Connection of Data Representations', Acta Informatica, I, *(1972b), 'Notes on Data Structuring', in 0. J. Dahl, E. W. Dijkstra and C. A. R. Hoare, Structured Programming (Academic Press, London). --*(1974), 'Monitors: An Operating System Structuring Concept', Communs Ass. comput. Mach., 17, (1975), 'Recursive Data Structures',Int. J. comput. inf. Sci., 4, Hopcraft, J., and Ullman, J. (1969), Formal Languages and their Relation to Automata (Addison-Wesley, Reading, Mass.). Horowitz, E. (1975), Practical Strategies for Developing Large Software Systems (Addison-Wesley, Reading, Mass.). Hoskyns, J. (1973), Implications of Using Modular Programming, Guide No. 1 (John Hoskyns, New York). Jackson, M. J. (1975),Principles of Program Design (Academic Press, London). Jensen, K., and Wirth, N. (1975), Pascal: User Manual and Report (Springer Verlag, New York). *Knuth, D. E. (1968), The Art of Computer Programming, Volume 1 Fundamental Algorithms, 2nd ed. (Addison-Wesley, Reading, Mass.) chapter 2. --( 1973 ), The Art of Computer Programming, Volume 3 Searching and Sorting (Addison-Wesley, Reading, Mass.). --(1974), 'Structured Programming with Gotos', Comput. Surv., 6, Landin, P. J. (1966), 'The Next 700 Programming Languages', Communs Ass. comput. Mach., 9, Lister, A. M. (1975), Fundamentals of Operating Systems (Macmillan, London and Basingstoke ). Madnick, S. E. (1967), 'String Processing Techniques', Communs Ass. comput. Mach., 10, Naur, P. (1969), 'Programming by Action Clusters', BIT, 9,

3 References 219 Naur, P., and Randell, B. (eds) (1969), 'Software Engineering' (Scientific Affairs Division, NATO, Brussels). Newell, A., and Tonge, F. (1960), 'An Introduction to Information Processing Language V', Communs Ass. comput. Mach., 3, Peterson, W. W., Kasami, T., and Tokura, N. (1973), 'On the Capabilities of while, repeat and exit Statements', Communs Ass. comput. Mach., 16, Sussenguth, E. H. (1963), 'Use of Tree Structures for Processing Files', Communs Ass. comput. Mach., 6, Warnier, J. D. (1974), Logical Constuction of Programs (Stenfert Kroese N.V., Lei den). Wijngaarden, A. Van (ed.) (1969), 'Report on the Algorithmic Language ALGOL 68',Num. Math., 14, Wilkes, M. V. (1964), 'An Experiment with a Self-compiling Compiler for a Simple List-processing Language', in R. Goodman, Annual Review in Automatic Programming (Pergamon, Oxford). Wirth, N. (1971), 'Program Development by Stepwise Refinement', Communs. Ass. comput. Mach., 14, (1973), Systematic Programming (Prentice-Hall, --(1974), 'On the Composition of Well-structured Programs', Comput. Surv., 6, *(1975), Algorithms+ Data Structures= Programs (Prentice-Hall, Woodward, P.M., and Jenkins, D.P. (1961), 'Atoms and Lists', Comput. J., 4, Yourdon, E. (1975), Techniques of Program Structure and Design (Prentice-Hall,

4 Index abstraction, levels of 36 activation record 144 Adelson-Velskii, G. M., and Landis, E. M. 180 advanced data structures 80 input of 192 alternation 8 Amble, 0., and Knuth, D. E. 134 array 15, 16, 21 ff. assignment 81, 82, 89 average search length 119, 125, 126, 172 Backus-Naur Form (BNF) 96, 192, 198, 201, 208 binary search 1 23, 1 24, 15 8 ff binary search trees 158 ff. binary trees 125, 159 ff. linked 174 traversal of 187 blocking 108 BNF see Backus-Naur Form Brinch Hansen, Per 79, 111 case statement 9 circular list 1 06, 1 21 circular two-way list 108 class concept 68 ff. cluster 133 Cobol 28, 206 Coleman, D. 209 collision 129 comment statements 14 compound statement 13 Concurrent Pascal 68, 79 Dahl, 0. J., Myhrhand, B., and Nygaard, K. 79 data structure 16 Dijkstra, E. W. 20, 48, 52, 187, 209, 211 dispose 87 divide and rule 141, 150 ff. dot-notation 28, 55, 82 dynamic data structures 80 ff. enumeration types 17 ff. file processing programs, systematic design of 201 files 81, 121 finite state machines 208 freelist 87 function 7 functions and mappings 22, 116, 117 general trees 184, 185 Gries, D. 5 Griffiths, M. 150, 157 grammar, single symbol lookahead 198 hashing 128 ff. chained 138 open 133 ordered 134 heap 84,87 Hetzel, W. C. 5 Hoare, C. A. R. 20, 35, 65, 79, 94, 111, 112, 127, 153 Hopcroft, J., and Ullman, J. Ill Horowitz, E. 5 if statement 9 information structure 145 iterative forms of recursive algorithms 146 ff. Jackson,M.J. 2,48,51,114,209 Jensen, K., and Wirth, N. 20, 35

5 222 Index Kleene star operation 96, 193 Knuth, D. E. 20, 26, 94, 112, 127, 140, 157, 180 linear linked lists 64, 84 ff. operations on 104 linear search 118, 120 linked binary tree 173 list processing languages 94 Lister, A. M. 112 Madnick, S. E. 112 merge search 1 21 mode of array example 150 monitors Ill Naur, P. 48 Naur, P., and Randell, B. 5 new 83, 87 operating systems 109 outstanding orders example 201 packing 29, 34 Pascal ix, 6, 20, 23, 35, 75, 79, 87 Peterson, W. W., Kasami, T., and Tokura, N. 20 pointer 64, 81, 83 ff., 174 pointer to a binary tree 162 pointer to a sequence 100 ff. polynomial, input of 192 polynomial addition example 12 powerset 53 procedure 7 program correctness 3, 208 program design 3 notation 6 ff. program schemata 8 queues 108 ff., 191 Quicksort 153 ff. reachable set example 56 record types 27 ff. recursion 91, 96, 97, 141 ff., 166 ff. recursive descent 196 recursive type definition 96, 162 repeat statement 11 reservoir 87 searching and sparsity 11 7 ff. sequence of statements 8 sequence structures 95 ff. set structures 53 ff., 88 ff. Sieve of Eratosthenes example 66 side-effects unpleasant 8 2, 84, 102 SIMULA single symbollookahead grammar 198 SOLO operating system 79, 112 sorting problem example 37 sparse mappings and sets 116 stack 108, 144 ff. statement 6 stepwise refinement 4, 36 ff., 141, 154,209 stock update and report program example 40 storage management 82, 87 ff., 108, 174 structured type 1 5, 16 subrange type 19 Sussenguth, E. H. 184 synt~x 192 time-sharing 109 traversing binary trees 187 two-way circular lists 108 two-way lists 1 07 type 15, 16, 17 type discriminant 33 unstructured data types 17 ff. updating 81 value sharing 8 2 variable declaration 1 7, 18 variant record types 31 ff. Warnier, J. D. 209 while statement 11 Wirth, N. 4, 5, 20, 35, 48, 94, 111, 157, 180, 198 Y ourdon, E. 5