extended CFP: Dynamo '00

vcsreedh@capsl.udel.edu (V. C. Sreedhar)
24 Sep 1999 22:58:38 -0400

          From comp.compilers

Related articles
extended CFP: Dynamo '00 vcsreedh@capsl.udel.edu (1999-09-24)
| List of all articles for this month |

From: vcsreedh@capsl.udel.edu (V. C. Sreedhar)
Newsgroups: comp.compilers
Date: 24 Sep 1999 22:58:38 -0400
Organization: Compilers Central
Keywords: conference, CFP

***PLEASE NOTE THAT the deadline for submission is extended until October 04, 1999 ****

                                              ACM SIGPLAN Workshop on
                                  Dynamic and Adaptive Compilation and Optimization

                                            January 18, 2000 in conjunction with:
                      The 27th Annual ACM SIGPLAN-SIGACT Symposium on Principles of
                                                              Programming Languages
                                          Boston, Massachusetts, January 19-21, 2000
Important Dates:Submissions: October 04, 1999 Notification: November 5,
1999 Final papers due: December 5, 1999
Research on Dynamic and Adaptive Compilation and related areas has been
sporadic and spread out. The goal of the workshop is to bring together
researchers, practitioners, and implementors in these areas to present their
experience and work in a forum that will allow them to colloborate and
exchange ideas. The scope of Dynamo includes, but is not limited to:

      * New and innovative analyses and transformations that help dynamic and
          adaptive compilation.
      * Intermediate representations that help improve analyses and
          optimizations for dynamic and adaptive compilation.
      * Tools and techniques for supporting dynamic instrumentation and dynamic
      * Architectural and system support for dynamic and adaptive compilation.
      * Support for garbage collection, multithreading, and exceptions for
          dynamic and adaptive compilation.
      * Formal reasoning of dynamic and adaptive compilation.
      * Techniques for dynamically compiling large server, scientific, and
          other applications.
      * New techniques for partial evaluation, program specialization, etc.,
          for dynamic and adaptive compilation.
      * Language support and extensions for dynamic and adaptive compilation.
      * Performance analysis and empirical results related to dynamic and
          adaptive compilation.
      * Dynamic compiling techniques for supporting active networks and mobile

Dynamo'00 will include an invited talk, technical paper presentations, and a
discussion session whose format will be determined later. Attendance is
open, although enrollment will be capped at 80 people. Students are
encouraged to attend and may apply for support from the Conference
Attendance Program (http://www.cs.pitt.edu/~soffa/caps.html) especially if
they have a paper accepted and also attend POPL. Proceedings of the workshop
will be published by SIGPLAN.
Submit a 100-200 word ASCII abstract and a 5000 word (or less) paper --
i.e., approximately 10 pages, typeset 10 point on 16 point -- excluding
bibliography and figures. Submissions not meeting these criteria will not be
For electronic submission (encouraged) please see
Postal submissions(discouraged) must be sent to Jong-Deok Choi (IBM T. J.
Watson Research Center, 30 Saw Mill River Road, Hawthorne, NY 10532, Fax:
+1-914-784-7455, Tel: +1- 914-784-7961) and must be received on or before
October 04, 1999; 10 copies (printed double-sided, if possible) must be
Program Chair: Jong-Deok Choi(jdchoi@us.ibm.com)
General Chair: Vugranam C. Sreedhar(sreedhar@watson.ibm.com)
Program Committee
  R. Cytron (Washington University)
  E. Duesterwald (HP Lab)
  S. Eggers (University of Washington)
  J. Hollinsgworth (University of Maryland)
  U. Hölzle (University of California, Santa Barbara)
  R. Marlet (IRISA/INRIA)
  T. Mogensen (DIKU)
  S. Moon (SNU, Korea)
  T. Proebsting (Microsoft Research)

Post a followup to this message

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