[Haskell] ISMM'07: call for participation

Greg Morrisett greg at eecs.harvard.edu
Tue Sep 4 14:02:03 EDT 2007

                     ISMM'07 CALL FOR PARTICIPATION
                         and Accepted Papers

          2007 ACM International Symposium on Memory Management
                     co-located with OOPSLA 2007
                      Sponsored by ACM SIGPLAN
                    21-22 October 2007, Montreal


To register for the symposium, see the OOPSLA registration page
at http://www.oopsla.org/oopsla2007.  Note that the deadline for
early registration and reduced rates is Thursday, 13 September.

ISMM is a forum for research in management of dynamically allocated
memory. Areas of interest include but are not limited to: explicit
storage allocation and deallocation; garbage collection algorithms and
implementations; compiler analyses to aid memory management;
interactions with languages, operating systems, and hardware,
especially the memory system; and empirical studies of allocation and
referencing behavior in programs that make significant use of dynamic

This year's symposium is being held in conjunction with OOPSLA
in Montreal on October 21st and 22nd.  Invited speakers include
Peter O'Hearn (Queen Mary, University of London) and David Kirk
(Chief Scientist NVIDIA).  In addition to presentation of the papers
listed below, there will be an exciting "wild and crazy" ideas session
where participants will have a chance to discuss half-baked
and interesting ideas.  All are welcome!

Invited talks and papers to be presented at the symposium:

Keynote: Separation Logic and Concurrent Resource Management
               Peter O'Hearn
Safe Manual Memory Management
               David Gay, Robert Ennals, & Eric Brewer
Detecting and Eliminating Memory Leaks Using Cyclic Memory Allocation
               Huu Hai Nguyen & Martin Rinard
Page Access Tracking to Improve Memory Management
               Reza Azimi, Livio Soares, Michael Stumm,
               Angela Demke Brown, & Tom Walsh
Effective Prefetch for Mark-Sweep Garbage Collection
               Robin Garner, Stephen Blackburn, & Daniel Frampton
Accordion Arrays:  Selective Compression of Unicode Arrays in Java
               Craig Zilles
Decrypting the Java Gene Pool:  Predicting Object Lifetimes with Micro-
               Sebastien Marion, Richard Jones, & Chris Ryder
Allocation-Phase Aware Scheduling Policies to Improve Garbage Collection
               Feng Xian, Witawas Srisa-an, & Hong Jiang
Intelligent Selection of Application-Specific Garbage Collectors
               Jeremy Singer, Gavin Brown, Ian Watson, & John Cavazos
Keynote:  NVIDIA CUDA Software and GPU Parallel Computing Architecture
               David Kirk
Heap Space Analysis for Java Bytecode
	      Elvira Albert, Samir Genaim, & Miguel Gomez-Zamalloa
Uniqueness Inference for Compile-Time Object Deallocation
	      Sigmund Cherem & Radu Rugina
A Correct and Useful Incremental Copying Garbage Collector
	      Martin Kero, Johan Nordlander, & Per Lindgren
Overlooking Roots:  A Framework for Making Nondeferred Reference-
Counting Garbage Collection Fast
               Pramod Joisha
Stopless:  A Real-Time Garbage Collector for Modern Platforms
               Filip Pizlo, Daniel Frampton, Erez Petrank,
               & Bjarne Steensgaard
Mark-Sweep or Copying?  A "Best of Both Worlds" Algorithm and a
Hardware-Supported Real-Time Implementation
               Sylvain Stanchina & Matthias Meyer

More information about the Haskell mailing list