ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 2

Volume 2, Number 1, January 1980

• David Harel:
  And/Or Programs: A New Approach to Structured Programming. 1-17
  
• Ajit B. Pai, Richard B. Kieburtz:
  Global Context Recovery: A New Strategy for Syntactic Error Recovery by Table-Drive Parsers. 18-41
  
• Nissim Francez:
  Distributed Termination. 42-55
  
• Gregory R. Andrews, Richard P. Reitman:
  An Axiomatic Approach to Information Flow in Programs. 56-76
  
• Christos H. Papadimitriou, Philip A. Bernstein:
  On the Performance of Balanced Hashing Functions When the Keys Are Not Equiprobable. 77-89
  
• Zohar Manna, Richard J. Waldinger:
  A Deductive Approach to Program Synthesis. 90-121
  
• D. B. Arnold, M. Ronan Sleep:
  Uniform Random Generation of Balanced Parenthesis Strings. 122-128
  
• Douglas Comer:
  A Note on Median Split Trees. 129-133
  

Volume 2, Number 2, April 1980

• Peter J. L. Wallis:
  External Representations of Objects of User-Defined Type. 137-152
  
• Ralph E. Griswold, David R. Hanson:
  An Alternative to the Use of Patterns in String Processing. 153-172
  
• R. G. G. Cattell:
  Automatic Derivation of Code Generators from Machine Descriptions. 173-190
  
• Jack W. Davidson, Christopher W. Fraser:
  The Design and Application of a Retargetable Peephole Optimizer. 191-202
  
• Charles N. Fischer:
  On Parsing and Compiling Arithmetic Expressions on Vector Computers. 203-224
  
• David C. Luckham, Wolfgang Polak:
  Ada Exception Handling: An Axiomatic Approach. 225-233
  
• Arthur J. Bernstein:
  Output Guards and Nondeterminism in ``Communicating Sequential Processes''. 234-238
  
• Perng-Yi Richard Ma, Ted G. Lewis:
  Design of a Machine-Independent Optimizing System for Emulator Development. 239-262
  

Volume 2, Number 3, July 1980

• Daniel G. Bobrow:
  Managing Reentrant Structures Using Reference Counts. 269-273
  
• Bruce W. Leverett, Thomas G. Szymanski:
  Chaining Span-Dependent Jump Instructions. 274-289
  
• Hanan Samet:
  A Coroutine Approach to Parsing. 290-306
  
• William E. Howden:
  Applicability of Software Validation Techniques to Scientific Programs. 307-320
  
• Manfred Broy, Bernd Krieg-Brückner:
  Derivation of Invariant Assertions During Program Development by Transformation. 321-337
  
• Edmund M. Clarke:
  Synthesis of Resource Invariants for Concurrent Programs. 338-358
  
• Krzysztof R. Apt, Nissim Francez, Willem P. de Roever:
  A Proof System for Communicating Sequential Processes. 359-385
  
• Marco A. Casanova, Philip A. Bernstein:
  A Formal System for Reasoning about Programs Accessing a Relational Database. 386-414
  
• Susan L. Graham, Michael A. Harrison, Walter L. Ruzzo:
  An Improved Context-Free Recognizer. 415-462
  

Volume 2, Number 4, October 1980

• Derek C. Oppen:
  Prettyprinting. 465-483
  
• Jacob T. Schwartz:
  Ultracomputers. 484-521
  
• George W. Ernst, William F. Ogden:
  Specification of Abstract Data Types in Modula. 522-543
  
• Carl E. Landwehr:
  An Abstract Type for Statistics Collection in Simula. 544-563
  
• David Gries, Gary Levin:
  Assignment and Procedure Call Proof Rules. 564-579
  
• Bernard M. E. Moret, Michael G. Thomason, Rafael C. Gonzalez:
  The Activity of a Variable and Its Relation to Decision Trees. 580-595
  

Last update Sat May 18 17:50:55 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page