Tenth Annual ACM Symposium on

Principals of Programming Languages

Austin, January 24 - 26, 1983


Foreword | Organizing Committee | Papers Presented | Index

Foreword
 
    The papers in this volume were presented at the Tenth Annual ACM Symposium on the Principals of Programming Languages, sponsored jointly by SIGACT and SIGPLAN.. They were selected from 170 abstracts submitted in response to the program committee's call for papers.  We thank all those who submitted abstracts for their interest in POPL.

    Submissions were not formally refereed, but each was read by a majority of the program committee.  As usual, technical excellence was an essential criterion, but our selections were also influenced by factors such as topicality and the desire to balance between papers of theoretical and practical interest.  Because of this, and especially in light of the large number of abstracts submitted this year, we expect that revised or expanded versions of many of the submissions will eventually appear in refereed journals.

Program Committee
 
Alan Demers
Charles Fischer
Michael Fischer
William Harrison
Brian Kernighan
Albert Meyer
Susan Owicki
Tim Teitelbaum
Mitchell Wand
 
-top-

Organizing Committee

Conference Co-Chairmen

John R Wright
Xerox PARC
Palo Alto, CA  94304

Larry Landweber
University of Wisconsin
Madison, Wisconsin  53706

Program Co-Chairmen

Alan Demers
Tim Teitelbaum
Cornell University
Ithaca, NY 14853

Local Arrangements Chairman

Allen Emerson
University of Texas
Austin, Texas 78712

-top-

Papers Presented

Session I: January 24, 1983 - Chaired by William Harrison (IBM)
 

  • Five Paradigm Shifts in Programming Language Design and Their Realization in a Programming Language

  •         Vaughan R. Pratt (Stanford Univ.)
     
  • Uncovering Principals of Novice Programming

  •         Jeffrey Bonar (Univ. of Massachusetts, Amherst)
     
  • Code Generation for Silicon

  •         S. C. Johnson (Bell Laboratories)
     
  • Derivation of Efficient DAG Marking Algorithms

  •         R. J. R. Back
            Heikki Mannila
            Kari-Jouko Raiha  (Univ. of Helsinki)
     
  • Reasoning About Nonatomic Operations

  •         Leslie Lamport (SRI International)


    Session II: January 24, 1983 - Chaired by Michael Fischer (Yale Univ.)
     

  • Verifying Reachability Invariants of Linked Structures

  •         Greg Nelson (Xerox PARC)
     
  • Automatic Program Proving for Real-time Embedded Software

  •         Scott Johnson
            John Nagle (Ford Aerospace)
     
  • Making Variables Abstract: An Equational Theory for Russell

  •         Alan J. Demers (Cornell Univ.)
            James E. Donahue (Xerox PARC)
     
  • Transformational Programming - Applications to Algorithms and Systems

  •         Robert Paige (Rutgers Univ.)
     
  • Polymorphic Type Interface

  •         Daniel Leivant (Carnegie-Mellon Univ.)
     
  • Computer Experiments with the REVE Term Rewriting System Generator

  •         Pierre Lescanne (Centre de Recherche en Informatique de Nancy and MIT)


    Session III: January 25, 1983 - Chaired by Albert Meyer (MIT)
     

  • Precise Typing of Abstract Data Type Specifications

  •         Richard Keiburtz (Oregon Graduate Center)
     
  • Automatic Verification of Finite-state Concurrent Systems using Temporal Logic Specifications: A Practical Approach

  •         E. M. Clarke (Carnegie-Mellon Univ.)
            E. A. Emerson (Univ. of Texas, Austin)
            A. P. Sistla (Harvard Univ.)
     
  • "Sometimes" and "Not Never" Revisited; On Branching Versus Linear Time

  •         E. A. Emerson (Univ. of Texas, Austin)
            Joseph Y. Halpern (IBM Research)
     
  • How to Cook a Temporal Proof System for Your Pet Language

  •         Z. Manna (Stanford Univ.)
            A. Pnueli (The Weizmann Institute)
     
  • Structural Semantics for Polymorphic Data Types

  •         Daniel Leivant (Carnegie-Mellon Univ.)


    Session IV: January 25, 1983 - Chaired by Charles Fischer (University of Wisconsin)
     

  • Incremental Data Flow Analysis

  •         Barbara G. Ryder (Rutgers Univ.)
     
  • Conversion of Control Dependence to Data Dependence

  •         J. Allen
            Ken Kennedy
            Carrie Porterfield
            J. Warren (Rice Univ.)
     
  • Loops in Combinator-based Compilers

  •         Mitchell Wand (Indiana Univ.)
     
  • Compilation of Data-driven Programs for Synchronous Execution

  •         Janice E. Cuny
            Lawrence Snyder (Perdue Univ.)
     
  • Summarizing Graphs by Regular Expressions

  •         Mark Wegman (IBM)
     
  • A Program Form Based on Data Dependency in Predicate Regions

  •         Jeanne Ferrante (IBM)
            Karl Ottenstein (Michigan Technological Univ.)


    Session V: January 26, 1983 - Chaired by Brian Kernighan (Bell Laboratories)
     

  • Practical Use of a Polymorphic Applicative Language

  •         B. W. Lampson
            Eric Schmidt (Xerox PARC)
     
  • On the Unification of Data and Program Abstraction in Ada

  •         Peter Wegner (Brown Univ.)
     
  • Incremental Polymorphic Typechecking in B

  •         Lambert Meertens (Mathematical Center, Amsterdam)
     
  • Mechanisms for Compile-time Enforcement of Security

  •         Robert E. Strom (IBM)
     
  • Abstraction Mechanisms in the Beta Programming Language

  •         Bent Bruun Kristensen
            Ole Lehrmann Madsen (Aarhus University)
            Birger Moller-Pedersen
            Kristen Nygaard (Norwegian Computing Center)
     
  • Locality in Software Systems

  •         Naftaly H. Minsky (Rutgers Univ.)
    -top-