POPL98


Program

 

Day 1, Monday, January 19, 1998

Invited Talk: 9:00-10:00.

Where Theory and Practice Meet: POPL Past and Future
John Reynolds, Carnegie Mellon University.

Session 1: 10:30-12:30. Chaired by Neil Jones, University of Copenhagen.

Higher-Order UnCurrying
John Hannan and Patrick Hicks

Alias Analysis of Executable Code
Samya Debray, Robert Muth and Matthew Weippert

Escape Analysis: Correctness Proof, Implementation and Experimental Results
Bruno Blanchet

Data Flow Analysis is Model Checking of Abstract Interpretations
David A. Schmidt

Session 2: 14:00-16:00. Chaired by Atsushi Ohori, Kyoto University.

Bridging the Gulf: a Common Intermediate Language for ML and Haskell
Simon Peyton Jones, John Launchbury, Mark Shields and Andrew Tolmach

Correctness of Monadic State: An Imperative Call-by-Need Calculus
Zena M. Ariola and Amr Sabry

A Functional Representation of Data Structures with a Hole
Yasuhiko Minamide

From System F to Typed Assembly Language
Greg Morrisett, David Walker, Karl Crary, and Neal Glew

Session 3: 16:30-18:30. Chaired by Jeanne Ferrante, University of California, San Diego.

Maximal Static Expansion
Denis Barthou, Albert Cohen and Jean-François Collard

Array SSA Form and its Use in Parallelization
Kathleen Knobe and Vivek Sarkar

Putting Pointer Analysis to Work
Rakesh Ghiya and Laurie J. Hendren

Edge Profiling versus Path Profiling: The Showdown
Thomas Ball, Peter Mataga and Mooly Sagiv

Reception: 19:00-20:30.

Invited Talk: 20:30-21:30.

From Principles to Programming Languages
Gérard Berry, École des Mines and INRIA, Sophia-Antipolis.

 

Day 2, Tuesday, January 20, 1998

Invited Talk: 9:00-10:00.

Global Trends in Flow Analysis
Mark Wegman, IBM.

Session 4: 10:30-12:30. Chaired by Martin Odersky, University of South Australia.

A Type System for Java Bytecode Subroutines
Raymie Stata and Martín Abadi

Java-light is Type-Safe -- Definitely
Tobias Nipkow and David von Oheimb

Classes and Mixins
Matthew Flatt, Shriram Krishnamurthi and Matthias Felleisen

Manufacturing Cheap, Resilient, and Stealthy Opaque Constructs
Christian Collberg, Clark Thomborson and Douglas Low

Session 5: 14:00-16:00. Chaired by Nevin Heintze, Bell Laboratories, Lucent Technologies.

From Polyvariant Flow Information to Intersection and Union Types
Jens Palsberg and Christina Pavlopoulou

Inference of Polymorphic and Conditional Strictness Properties
Thomas P. Jensen

Fast Interprocedural Class Analysis
Greg DeFouw, David Grove and Craig Chambers

Path-Sensitive Value-Flow Analysis
Rastislav Bodík and Sadun Anik

Session 6: 16:30-18:30. Chaired by Xavier Leroy, INRIA, Rocquencourt.

Local Type Inference
Benjamin C. Pierce and David N. Turner

Static Typing for Dynamic Messages
Susumu Nishimura

Second-order Unification and Type Inference for Church-style Polymorphism
Aleksy Schubert

Dynamic Typing as Staged Type Inference
Mark Shields, Tim Sheard and Simon Peyton Jones

 

Day 3, Wednesday, January 21, 1998

Invited Talk: 9:00-10:00.

Proofs, Types, and Safe Mobile Code
Peter Lee, Carnegie Mellon University.

Session 7: 10:30-12:30. Chaired by Davide Sangiorgi, INRIA, Sophia-Antipolis.

Parallel Beta Reduction is not Elementary Recursive
Andrea Asperti and Harry G. Mairson

Parallelization in Calculational Forms
Zhenjiang Hu, Masato Takeichi and Wei-Ngan Chin

Single and Loving it: Must-Alias Analysis for Higher-Order Languages
Suresh Jagannathan, Peter Thiemann, Stephen Weeks and Andrew Wright

Barrier Inference
Alexander Aiken and David Gay

Session 8: 14:00-16:00. Chaired by Andrew D. Gordon, University of Cambridge.

Secure Information Flow in a Multi-Threaded Imperative Language
Geoffrey Smith and Dennis Volpano

The SLam Calculus: Programming with Secrecy and Integrity
Nevin Heintze and Jon G. Riecke

A Typed Language for Distributed Mobile Processes
James Riely and Matthew Hennessy

Security Properties of Typed Applets
Xavier Leroy and François Rouaix


| POPL '98 Home page |