10. POPL 1983: Austin, Texas

• Vaughan R. Pratt: Five Paradigm Shifts in Language Design and their Realization in Viron, a Dataflow Programming Environment. 1-9 BibTeX
• Jeffrey Bonar, Elliot Soloway: Uncovering Principles of Novice Programming. 10-13 BibTeX
• Stephen C. Johnson: Code Generation for Silicon. 14-19 BibTeX
• Ralph-Johan Back, Heikki Mannila, Kari-Jouko Räihä: Derivation of Efficient DAG Marking Algorithms. 20-27 BibTeX
• Leslie Lamport: Reasoning About Nonatomic Operations. 28-37 BibTeX
• Greg Nelson: Verifying Reachability Invariants of Linked Structures. 38-47 BibTeX
• John Nagle, Scott Johnson: Practical Program Verification: Automatic Program Proving for Real-Time Embedded Software. 48-58 BibTeX
• Alan J. Demers, James E. Donahue: Making Variables Abstract: An Equational Theory for Russell. 59-72 BibTeX
• Robert Paige: Transformational Programming - Applications to Algorithms and Systems. 73-87 BibTeX
• Daniel Leivant: Polymorphic Type Inference. 88-98 BibTeX
• Pierre Lescanne: Computer Experiments with the Reve Term Rewriting System Generator. 99-108 BibTeX
• Richard B. Kieburtz: Precise Typing of Abstract Data Type Specifications. 109-116 BibTeX
• Edmund M. Clarke, E. Allen Emerson, A. Prasad Sistla: Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications: A Practical Approach. 117-126 BibTeX
• E. Allen Emerson, Joseph Y. Halpern: ``Sometimes'' and ``Not Never'' Revisited: On Branching Versus Linear Time. 127-140 BibTeX
• Zohar Manna, Amir Pnueli: How to Cook a Temporal Proof System for Your Pet Language. 141-154 BibTeX
• Daniel Leivant: Structural Semantics for Polymorphic Data Types. 155-166 BibTeX
• Barbara G. Ryder: Incremental Data Flow Analysis. 167-176 BibTeX
• John R. Allen, Ken Kennedy, Carrie Porterfield, Joe D. Warren: Conversion of Control Dependence to Data Dependence. 177-189 BibTeX
• Mitchell Wand: Loops in Combinator-Based Compilers. 190-196 BibTeX
• Janice E. Cuny, Lawrence Snyder: Compilation of Data-Driven Programs for Synchronous Execution. 197-202 BibTeX
• Mark N. Wegman: Summarizing Graphs by Regular Expressions. 203-216 BibTeX
• Jeanne Ferrante, Karl J. Ottenstein: A Program Form Based on Data Dependency in Predicate Regions. 217-236 BibTeX
• Butler W. Lampson, Eric E. Schmidt: Practical Use of a Polymorphic Applicative Language. 237-255 BibTeX
• Peter Wegner: On the Unification of Data and Program Abstraction in Ada. 256-264 BibTeX
• Lambert G. L. T. Meertens: Incremental Polymorphic Type Checking in B. 265-275 BibTeX
• Robert E. Strom: Mechanisms for Compile-Time Enforcement of Security. 276-284 BibTeX
• Bent Bruun Kristensen, Ole Lehrmann Madsen, Birger Møller-Pedersen, Kristen Nygaard: Abstraction Mechanisms in the Beta Programming Language. 285-298 BibTeX
• Naftaly H. Minsky: Locality in Software Systems. 299-312 BibTeX