Software - Practice and Experience (SPE), Volume 11, 1981

Volume 11, Number 1, January 1981

• Mary Shaw, Guy T. Almes, Joseph M. Newcomer, Brian K. Reid, William A. Wulf: A Comparison of Programming Languages for Software Engineering. 1-52
• Nadia Magnenat-Thalmann, Daniel Thalmann: A Graphical Pascal Extension Based on Graphical Types. 53-62
• Gary D. Knott: Procedures for Managing Extendible Array Files. 63-84
• M. Kronental, J. W. Roberts, K. H. Timmesfeld, I. C. Wand: The LTPL-E Tasking Proposals. 85-97
• Leslie M. Goldschlager: Short Algorithms for Space-Filling Curves. 99-100

Volume 11, Number 2, February 1981

• Siba N. Mohanty: Software Cost Estimation. 103-121
• Arthur H. J. Sale: Forward-declared Procedures, Parameter-lists and Scope. 123-130
• Bjarne Stroustrup: 'Long Return': A Technique for Improving the Efficiency of Inter-module Communication. 131-143
• James P. Black, David J. Taylor, David E. Morgan: A Case Study in Fault Tolerant Software. 145-157
• Abraham Silberschatz: On the Access-control Mechanism of the Program Component Manager. 159-166
• Peter J. L. Wallis: Handling Type Information when Compiling a Language with User-defined Types. 167-173
• Martin L. Kersten, Anthony I. Wasserman: The Architecture of the PLAIN Data Base Handler. 175-186
• Uday G. Gujar, David M. Fellows: FORTRAN Routines with Optional Arguments. 187-193
• Colin C. Charlton, Paul H. Leng: Editors: Two for the Price of One. 195-202

Volume 11, Number 3, March 1981

• B. Negus, M. J. Hunt, J. A. Prentice: DIALOG: A Scheme for the Quick and Effective Production of Interactive Applications Software. 205-224
• Mark Rain: The Structure of the MARY/2 Compiler. 225-235
• Arthur J. Bernstein, J. Robert Ensor: A Modula Based Language Supporting Hierarchical Development and Verification. 237-255
• Jim Welsh, Andrew M. Lister: A Comparative Study of Task Communication in Ada. 257-290
• Paolo Ancilotti, Norma Lijtmaer, Maurelio Boari, Antonio Natali: Linguistic Mechanisms for Resource Management Strategies. 291-314
• Michel Banâtre, André Couvert, D. Herman, Michel Raynal: An Experience in Implementing Abstract Data Types. 315-320

Volume 11, Number 4, April 1981

• Per Brinch Hansen: Edison-a Multiprocessor Language. 325-361
• Per Brinch Hansen: The Design of Edison. 363-396
• Per Brinch Hansen: Edison Programs. 397-414

Volume 11, Number 5, May 1981

• P. G. Thomas, B. E. Staff: A Design Language for the Definition of a Retrieval System Interface for Casual Users of a Relational Database. 417-424
• M. Lemoine, J. Mullor: Software Transferability: A Practical Approach. 425-433
• W. Morven Gentleman: Message Passing Between Sequential Processes: the Reply Primitive and the Administrator Concept. 435-466
• M. A. Maclean, J. E. L. Peck: CHEF: a Versatile Portable Text Editor. 467-477
• J. E. L. Peck, M. A. Maclean: The Construction of a Portable Editor. 479-489
• Ronald H. Perrott, P. S. Dhillon: An Experiment with Fortran and Pascal. 491-496
• Peter B. Henderson, Roger B. Gimson: Modularization of Large Programs. 497-520
• D. W. Singer: SCENARIOS: An Event Management Package. 521-529

Volume 11, Number 6, June 1981

• Paul S. Fisher, Jacob Slonim: Software Engineering: An Example of Misuse. 533-539
• Martin L. Griss, Anthony C. Hearn: A Portable LISP Compiler. 541-605
• Dalia Motzkin: A Stable Quicksort. 607-611
• Naveen Prakash, P. N. Gejji: Error Reporting and Recovery in Sangrah. 613-621
• Ravi Sethi: Uniform Syntax for Type Expressions and Declarators. 623-628
• Hans Lindstrom, Jan Skansholm: How to Make Your Own Simulation System. 629-637
• David Alex Lamb: Construction of a Peephole Optimizer. 639-647

Volume 11, Number 7, July 1981

• Gordon A. Rose, Jim Welsh: Formatted Programming Language. 649-670
• Thoshiaki Kurokawa: A New Fast and Safe Marking Algorithm. 671-682
• Ronald H. Perrott, D. K. Stevenson: Considerations for the Design of Array Processing Languages. 683-688
• Geoffrey Hunter: Partitioned and Prioritized Access to Timesharing Services: the Reserved Availability. 689-696
• Michael B. Feldman: Data Abstraction, Structured Programming, and the Practicing Programmer. 697-710
• K. Lunn, Keith H. Bennett: Message Transport on the Cambridge Ring-A Simulation study. 711-716
• R. A. Freak: A Fortran to Pascal Translator. 717-716
• Richard L. Wexelblat: The Consequences of One's First Programming Language. 733-740
• A. W. Colijn: A Note on the Multics Command Language. 741-744
• Leslie M. Goldschlager: Recursion in Small Storage. 745-751
• Darrel C. Ince: Decision Tables in Algol 68. 753-756
• Tomasz Kowaltowski: Parameter Passing Mechanisms and Run Time Data Structures. 757-765

Volume 11, Number 8, August 1981

• William M. Waite, Lynn Robert Carter: An Analysis/Synthesis Interface for Pascal Compilers. 769-787
• Peter J. L. Wallis: Designing Storage Management Schemes for Block-structured Languages. 789-801
• Jeffrey S. Rohl: Eliminating Recursion from Combinatoric Procedures. 803-817
• L. V. Atkinson, S. D. North: COPAS-A Conversational Pascal System. 819-829
• P. J. Brown: Dynamic Program Building. 831-843
• Hannu Pohjanpalo: MROS-68K, a Memory Resident Operating System for MC6800H. 845-852
• David R. Hanson: Is Block Structure Necessary? 853-866
• R. R. Oldehoeft, W. D. Ralph, M. H. Tindall: An Interactive Manager for Pascal Software. 867-873

Volume 11, Number 9, September 1981

• R. S. Scowen: A Survey of some Text Editors. 883-906
• Martin Grayson: RNFREE-Keyword Free-format Input. 907-911
• S. J. Young: Improving the Structure of Large Pascal Programs. 913-927
• Arthur H. J. Sale: The Implementation of Case Statements in Pascal. 929-942
• D. R. McGregor, J. R. Malone: Design for a Robust, Simple and Highly Reliable Filestore. 943-947
• I. S. Torsun, M. M. Al-Jarrah: Dynamic Analysis of COBOL Programs. 949-961
• Paul Klint: Interpretation Techniques. 963-973
• Thomas A. Cargill: Full-screen Editing in a Hostile Environment. 975-981
• Hasse Hansson, Jørgen Steensgaard-Madsen: Document Preparation Systems. 983-997

Volume 11, Number 10, October 1981

• Richard Barnett, Richard C. Beckwith: The Community File Station. 1001-1008
• G. K. Wood, J. Larmouth: Distributing Viewdata and Teletext Services to a User Community. 1009-1017
• Eric S. Roberts, Arthur Evans Jr., C. Robert Morgan, Edmund M. Clarke: Task Management in Ada-A Critical Evaluation for Real-time Multiprocessors. 1019-1051
• Hanan Samet: Experience with Software Conversion. 1053-1069
• J. Larmouth: Fortran 77 Portability. 1071-1117

Volume 11, Number 11, November 1981

• Donald E. Knuth, Michael F. Plass: Breaking Paragraphs into Lines. 1119-1184
• W. D. Shepherd: Ancilla-A Server for the Cambridge Model Distributed System. 1185-1195
• George Logothetis, Prateek Mishra: Compiling Short-circuit Boolean Expressions in One Pass. 1197-1214
• T. J. Roper, Chris J. Barter: A Communicating Sequential Process Language and Implementation. 1215-1234

Volume 11, Number 12, December 1981

• Nazim H. Madhavji, I. R. Wilson: Dynamically Structured Data. 1235-1260
• Mordechai Ben-Ari: Cheap Concurrent Programming. 1261-1264
• Richard J. Orgass: Files in an Interactive Environment. 1265-1271
• Tung Yun Mei: LCCD, A Language for Chinese Character Design. 1273-1292
• Frank M. Brown: Design of a MUMPS Interpreter. 1293-1297
• Alistair C. Kilgour: Generalized non-Recursive Traversal of Binary Trees. 1299-1306
• Tan Watanabe, Tsuneharu Ohsawa, Hisao Kuma, Wakunaga Tsukada: Micro MUMPS: An Interactive Database Language for Micro-Computers. 1307-1314
• J. D. Bishop, G. J. Smith: Experiences with a Status Database. 1315-1329
• Jørgen Steensgaard-Madsen: Modular Programming with Pascal. 1331-1337