Programming Methodology: A Collection of Articles by Members of IFIP WG2.3David Gries This volume is being published for two reasons. The first is to present a collection of previously published articles on the subject of programming methodology that have helped define the field and give it direction. It is hoped that the scientist in the field will find the volume useful as a reference, while the scientist in neighboring fields will find it useful in seriously acquainting himself with important ideas in programming methodology. The advanced student can also study it-either in a course or by himself -in order to learn significant material that may not appear in texts for some time. The second reason for this volume is to make public the nature and work on programming methodology of IFIP Working Group 2.3, hereafter called WG2.3. (IFIP stands for International Federation for Information Processing.) WG2.3 is one of many IFIP Working Groups that have been established to provide international forums for discussion of ideas in various areas. Generally, these groups publish proceedings of some of their meetings and occasionally they sponsor a larger conference that persons outside a group can attend. WG2.3 has been something of a maverick in this respect. From the beginning the group has shunned paperwork, reports, meetings, and the like. This has meant less pUblicity for IFIP and WG2.3, but on the other hand it has meant that meetings could be devoted almost wholly to scientific discussions. |
Contents
A History of WG2 3 | 1 |
Viewpoints on Programming | 7 |
Software engineering | 23 |
Copyright | |
7 other sections not shown
Other editions - View all
Programming Methodology: A Collection of Articles by Members of IFIP WG2.3 David Gries Limited preview - 2012 |
Programming Methodology: A Collection of Articles by Members of IFIP WG2.3 David Gries No preview available - 2011 |
Common terms and phrases
abstract acceptance test algebraic ALGOL ALGOL 60 algorithm allocation alternate anti-regressive array arrows assertions assignment axiomatization axioms begin Boolean C. A. R. Hoare CACM called cobegin complete components concept Concurrent Pascal condition consider construct contained critical region data structures data types defined definition diagram Dijkstra discussed disk buffer elements error example execution expression Figure formal function hardware hierarchical Hoare IFIP implementation initial input integer invariant iteration Lemma loop mechanism method modules monitor notation operating system output paper parallel programs possible primitive problem procedure produce program text programming language prove queue reader recovery block recursive representation resource result rules SA language schema semantics semaphore semicoroutine sequence SIMULA 67 software engineering solution specification statement stepwise refinement structured programming sufficiently-complete techniques termination theorem tion true understanding variables virtual machine interface waiting