Seventh Annual ACM Symposium On

Principals of Programming Languages

Las Vegas, January 28 - 30, 1980


Foreword | Organizing Committee | Papers Presented | Index

Foreword

    The papers in this volume were presented at the Seventh Annual ACM Symposium on the Principals of Programming Languages, sponsored jointly by SIGACT and SIGPLAN.  These papers have not been formally referred and revisions of some of them may eventually appear in refereed journals.
 

Program Committee
Stephen Bourne
Irene Greif
David Gries
David Hansen
David Harel
Peter Hibbard
Butler Lampson
Alan Perlis
Mark Wegman
Robert Tarjan
 
-top-

Organizing Committee

Conference Co-chairmen

Paul Abrahams
Courant Institute
New York, NY 10012

Richard Lipton
University of California at Berkeley
Berkeley, CA 94720

Program Chairman

Stephen Bourne
Bell Laboratories
Murray Hill, NJ  07974

Local Arrangements Chairman

John Werth
University of Nevada
Las Vegas, NE  89154

Publicity Chairman

Jeff Ullman
Princeton University
Princeton, NJ  08540

-top-

Papers Presented

Session I: January 28, 1980 - Chaired by Butler Lapson (Xerox PARC)
 

  • Analysis of Pointer Rotation

  •         Norihisa Suzuki (Xerox PARC)
     
  • Data Types, Parameters and Type Checking

  •         Alan J. Demers
            James E. Donahue (Cornell Univ.)
     
  • A High-level Approach to Computer Document Formatting

  •         Brian K. Reid (Carnegie-Mellon University)
     
  • Experience with an Applicative String Processing Language

  •         James H. Morris (Xerox PARC)
            Eric Schmidt (Univ. of California, Berkeley)
            Philip Wadler (Carnegie-Mellon Univ.)
     
  • An Overview of the SUMMER Programming Language

  •         Paul Klint (Mathematisch Centrum)


    Session II: January 28, 1980 - Chaired by Mark Wegman, (IBM)
     

  • Analysis of Simple Programs over Different Sets of Primitives

  •         A. J. Kfoury (Boston Univ.)
     
  • Synchronous Schemes and their Decision Problems

  •         Zohar Manna (Stanford Univ. and Weizmann Institute)
            Amir Pnueli (Tel Aviv Univ.)
     
  • Qualified Data Flow Problems

  •         L. Howard Holley (IBM Cambridge Scientific Center)
            Barry K. Rosen (IBM T. J. Watson Research Center)
     
  • Interprocedural Data Flow Analysis in the Presence of Pointers, Procedure Variables and Label Variables

  •         William E. Weihl (IBM T. J. Watson Research Center)
     
  • Prime Subprogram Parsing of a Program

  •         Robert E. Tarjan (Stanford Univ.)
            Jacobo Valdes (Princeton Univ.)


    Session III: January 29, 1980 - Chaired by Peter Hibbard (Carnegie-Mellon Univ.)
     

  • On Specifying Verifiers

  •         V. R. Pratt (MIT)
     
  • A Case Study in Specifying the Semantics of a Programming Language

  •         Ravi Sethi (Univ. of Arizona)
     
  • Final Data Type Specifications: A New Data Type Specification Method

  •         Samuel Kamin (IRIA Laboria)
     
  • Expressiveness of the Operation Set of a Data Abstraction

  •         Deepak Kapur
            Srivas Mandayam (MIT)
     
  • On Proving Inductive Properties of Abstract Data Types

  •         David R. Musser (Univ. of Southern Calif.)

    Session IV: January 29, 1980 - Chaired by David Harel (IBM)
     

  • On the Temporal Analysis of Fairness

  •         Dov Gabbay (Bar Ilan Univ.)
            Amir Pnueli (Tel Aviv Univ.)
            Saharon Shelah (The HEbrew Univ.)
            Jonathan Stavi (Bar Ilan Univ.)
     
  • "Sometimes" is sometimes "Not Never" - On the Temporal Logic of Programs

  •         Laslie Lamport (SRI International)
     
  • Prepositional Logics of Programs: Systems, Models and Complexity

  •         Rohit Parikh (Boston Univ. and MIT)
     
  • A Dynamic Logic of Multiprocessing with Incomplete Information

  •         John H. Reif (Harvard Univ.)
            Gary L. Peterson (Univ. of Rochester)
     
  • Axiomatic Definitions of Programming Languages: A Theoretical Assessment

  •         Albert R. Meyer
            Joseph Y. Halpern (MIT)


    Debate: January 29, 1980
     

  • A formal debate on the programming language ADA is planned.  Following the formal presentations, comments from the floor will be entertained.

  • Session V: January 30, 1980 - Chaired by David Hanson (Univ. of Arizona)
     

  • Efficient Algorithms for Structural Similarity of Grammars

  •         H. B. Hunt III
            D. J. Rosenkrantz (SUNY Albany)
     
  • Theoretical and Empirical Studies on Using Program Mutation to Test the Functional Correctness of Programs

  •         Timothy A. Budd (Yale Univ.)
            Richard A. DeMillo (Georgia Tech.)
            Richard J. Lipton (Univ. of California, Berkeley)
            Frederick G. Sayward (Yale Univ.)
     
  • "Type -completeness" as a Language Principal

  •         Alan Demers
            James Donahue (Cornell Univ.)
     
  • An Indeterminate Constructor for Applicative Programming

  •         Daniel P. Friedman
            David S. Wise (Indiana Univ.)
     
  • Formal Specification as a Design Tool

  •         John Guttag (MIT)
            J. J. Horning (Xerox PARC)
    -top-