POPL '00, List of accepted papers

Thomas Reps <reps@velveeta.cs.wisc.edu>
1 Oct 1999 10:12:02 -0400

          From comp.compilers

Related articles
POPL '00, List of accepted papers reps@velveeta.cs.wisc.edu (Thomas Reps) (1999-10-01)
| List of all articles for this month |
From: Thomas Reps <reps@velveeta.cs.wisc.edu>
Newsgroups: comp.compilers
Date: 1 Oct 1999 10:12:02 -0400
Organization: CS Department, University of Wisconsin
Keywords: conference



                  The 27th Annual ACM SIGPLAN-SIGACT Symposium on
                            Principles of Programming Languages


                      Boston, Massachusetts, January 19-21, 2000




                                      List of Accepted Papers


-----------------------------------------------------------------
    Paper: Efficient Algorithms for pre* and post*
                  on Interprocedural Parallel Flow Graphs
          By: Javier Esparza and Andreas Podelski
-----------------------------------------------------------------
    Paper: Resource Bound Certification
          By: Karl Crary, Stephanie Weirich
-----------------------------------------------------------------
    Paper: Type Systems for Distributed Data Structures
          By: Ben Liblit and Alexander Aiken
-----------------------------------------------------------------
    Paper: Shape Analysis for Mobile Ambients
          By: Hanne Riis Nielson and Flemming Nielson
-----------------------------------------------------------------
    Paper: Controlling Interference in Ambients
          By: Francesca Levi and Davide Sangiorgi
-----------------------------------------------------------------
    Paper: Transforming out Timing Leaks
          By: Johan Agat
-----------------------------------------------------------------
    Paper: Decidable Type Equivalence with Singleton Kinds
          By: Christopher A. Stone and Robert Harper
-----------------------------------------------------------------
    Paper: A Semantic Model of Types and Machine Instructions
                  for Proof-Carrying Code
          By: Andrew W. Appel and Amy P. Felty
-----------------------------------------------------------------
    Paper: On the Complexity of Flow-Sensitive Dataflow Analyses
          By: Robert Muth and Saumya Debray
-----------------------------------------------------------------
    Paper: Set-based vs. Path-based Type Checking
                  for Logic Programs
          By: Witold Charatonik, Andreas Podelski, and Jean-Marc Talbot
-----------------------------------------------------------------
    Paper: A Type System for Dynamic Web Documents
          By: Anders Sandholm and Michael I. Schwartzbach
-----------------------------------------------------------------
    Paper: Semantics-Preserving Procedure Extraction
          By: Raghavan Komondoor and Susan Horwitz
-----------------------------------------------------------------
    Paper: Implicit Parameters: Dynamic Scoping with Static Types
          By: Jeffrey R. Lewis and John Launchbury and Erik Meijer and
                  Mark B. Shields
-----------------------------------------------------------------
    Paper: Sparse Code Motion
          By: Oliver Ruething, Jens Knoop, Bernhard Steffen
-----------------------------------------------------------------
    Paper: Modular Refinement of Hierarchic Reactive Machines
          By: Rajeev Alur, Radu Grosu
-----------------------------------------------------------------
    Paper: (Optimal) duplication is not elementary recursive
          By: Andrea Asperti, Paolo Coppola, Simone Martini
-----------------------------------------------------------------
    Paper: Verifying Secrets and Conditional Secrecy
          By: Dennis Volpano and Geoffrey Smith
-----------------------------------------------------------------
    Paper: A Type System for Expressive Security Policies
          By: David Walker
-----------------------------------------------------------------
    Paper: Enforcing Trace Properties by Program Transformation
          By: Thomas Colcombet and Pascal Fradet
-----------------------------------------------------------------
    Paper: Analytic Constraint Solving and Interval Arithmetic
          By: Timothy J. Hickey
-----------------------------------------------------------------
    Paper: Temporals Abstract Interpretation
          By: Patrick Cousot and Radhia Cousot
-----------------------------------------------------------------
    Paper: First-class Macros Have Types
          By: Alan Bawden
-----------------------------------------------------------------
    Paper: Generalized Certificate Revocation
          By: Carl A. Gunter and Trevor Jim
-----------------------------------------------------------------
    Paper: Type Elaboration and Subtype Completion for Java Bytecode
          By: Todd Knoblock and Jakob Rehof
-----------------------------------------------------------------
    Paper: Projection Merging: Reducing Redundancies
                  in Inclusion Constraint Graphs
          By: Zhendong Su, Manuel Fahndrich, Alexander Aiken
-----------------------------------------------------------------
    Paper: A New Approach to Generic Functional Programming
          By: Ralf Hinze
-----------------------------------------------------------------
    Paper: Authentication primitives and their compilation
          By: Martin Abadi, Cedric Fournet, Georges Gonthier
-----------------------------------------------------------------
    Paper: Anytime, Anywhere: Modal Logics for Mobile Ambients
          By: Luca Cardelli and Andrew D. Gordon
-----------------------------------------------------------------
    Paper: A Framework for Combining Analysis and Verification
          By: Nevin Heintze, Joxan Jaffar and Razvan Voicu
-----------------------------------------------------------------
    Paper: Reducing Sweep Time for a Nearly Empty Heap
          By: Yoo C. Chung, Soo-Mook Moon, Kemal Ebcioglu, and Dan Sahlin
-----------------------------------------------------------------
  Debate: Language-Tools-Patterns <=> Rock-Scissors-Paper, or
                  Does One Dominate?
          By: Craig Chambers, Bill Harrison, John Vlissides


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.