[Prev][Next][Index][Thread]

CFP for Workshop on Principles on Abstract Machines

Dear TYPES readers,

The following announcement might be of interest for you.  Although not
explicitly mentioned in the CFP types play an important role in
abstract machines. Either the abstract machines rely on a compiler
which did type checking before generating the abstract machine code
(strong typing) or the abstract machine has to provide some kind of
runtime type checking (weak or loose typing). Type checking is also an
essential part of the byte-code verifier in the JVM.

                                                        --Stephan

----------------------------------------------------------

                FIRST CALL FOR PAPERS      

       Workshop on Principles of Abstract Machines 

               in conjunction with the 
   Joint International Symposia SAS'98 and PLILP/ALP'98 
                    Pisa, Italy 
              14-18. September 1998 
      (http://www.di.unipi.it/di/groups/lp/spa98)

-----------------------------------------------------------
This CFP is also available online:
  http://www.cs.uni-sb.de/~diehl/amworkshop
-----------------------------------------------------------

Recently the topic of abstract machines has got a new boost 
by the success of the Java Virtual Machine. For many years 
abstract machines have been designed for different sorts of 
languages including imperative, object-oriented, eager 
functional, lazy functional, constraint and logic languages, 
as well as hybrid languages. The goal of this workshop is to 
bring together researchers and developers working on different 
language paradigms. We are especially looking for papers which 
investigate principles underlying several abstract machines,
analyse the relation of language semantics and abstract 
machines or discuss implementation alternatives. 

Topics of interest include, but are not restricted to: 

    * relation to programming language semantics 
    * relation to program analyses (or non-standard semantics) 
    * comparison of implementation techniques 
    * just-in-time compilation 
    * garbage collection 
    * internet programming (e.g. security, fault-tolerance) 
    * analyses of abstract machine programs 
    * compiling other languages to JVM 
    * hybrid languages 
    * concurrency 

Important Dates

    Submission Deadline: Friday June 19 
           Notification: Friday July 24 
          Final version: Friday August 14 

Submission

The submission deadline is June 19. Papers must describe
original, previously unpublished work, and must not be 
simultaneously submitted for publication elsewhere. They 
must be written in English, must not exceed 10 pages 
(Springer LNCS format, excluding references and figures), 
and must contain a cover page containing the following: 
a 200-word abstract, keywords, postal and electronic
mailing addresses, and phone and fax numbers of one of 
the authors. Submission is electronic (up to exceptions) 
via e-mail to diehl@cs.uni-sb.de. 

Organizers

Stephan Diehl (Saarbruecken, Germany) diehl@cs.uni-sb.de 
Peter Sestoft (Copenhagen, Denmark)   sestoft@dina.kvl.dk 

Program Committee

    Michael Franz (Irvine, California) 
    Michael Hanus (Aachen, Germany) 
    Pieter Hartel (Southampton, UK) 
    Peter van Roy (Louvain-la-Neuve, Belgium)