CFP: 5th Int. Workshop on Implicit Computational Complexity

CFP: 5th International Workshop on Implicit Computational Complexity 

  The Implicit Computational Complexity Workshop (ICC'03) will be held on 26
  - 27 June 2003 in Ottawa, Canada as a satellite workshop of the Logic in
  Computer Science Conference (LICS'03).


  The synergy between Logic and Computational Complexity has gained
  importance and vigor in recent years, cutting across areas such as Proof
  Theory, Finite Model Theory, Computation Theory, Applicative Programming,
  Database Theory, and Philosophical Logic. Several machine-independent
  approaches to computational complexity have been developed that are based
  on notions borrowed primarily from mathematical logic. Examples include
  descriptive complexity (finite model theory), bounded arithmetic,
  set-existence principles, intrinsic theories, linear logics, and algebras
  of functions. Collectively these approaches might be termed Implicit
  Computational Complexity. Practically, implicit computational complexity
  provide a framework for a principled incorporation of computational
  complexity into areas such as formal methods in software development, the
  study of programming languages, and database theory.

  The mission of the workshop is to further the development of implicit
  computational complexity and its applications. Topics of interest include:

   * automatic complexity analysis of programs 
   * complexity analysis for functional languages 
   * complexity in database theory 
   * complexity in formal methods 
   * foundations of implicit computational complexity 
   * higher-type computational complexity 
   * logical & machine-independent characterizations of complexity classes  
   * logics closely related to complexity classes 
   * software that applies ICC ideas 
   * type systems for controlling complexity 


  The program will consist of invited talks, sessions of contributed papers,
  and software demonstrations.


   * Albert Atserias (Universitat Politècnica de Catalunya) 
   * Erich Grädel (Aachen University of Technology) 
   * Annie Liu (State University of New York at Stony Brook) 


  The deadline for submissions is **March 28, 2003**.  See the workshop
  webpage, http://www.cis.syr.edu/~royer/icc/ICC03/, for submission details.


   * Michael Benedikt (Bell Labs) 
   * Ralph Benzinger (McKinsey & Company, Berlin) 
   * Sam Buss (University of California/San Diego) 
   * Anuj Dawar (Cambridge University), chair 
   * Martin Grohe (Edinburgh) 
   * Jan Johannsen (Ludwig-Maximilians-Universität München) 
   * Neil Jones (University of Copenhagen) 
   * Bruce Kapron (University of Victoria) 
   * Karl-Heinz Niggl (Technische Universität Ilmenau) 
   * Luke Ong (University of Oxford) 


   * Robert Constable (Cornell University) 
   * Anuj Dawar (Cambridge University) 
   * Fernando Ferreira (University of Lisbon) 
   * Martin Hoffmann (Ludwig-Maximilians-Universität München) 
   * Neil Jones (University of Copenhagen) 
   * Daniel Leivant (University of Indiana/Bloomington) 
   * Jean-Yves Marion (Loria/Nancy) 
   * Luke Ong (University of Oxford) 
   * James Royer (Syracuse University), chair 
   * Helmut Schwichtenberg (Ludwig-Maximilians-Universität München) 


  This year the ICC workshop is supported in part by a generous grant by the
  Centre de Recherches Mathématiques of the Université de Montréal.


  March 28, 2003     The submission deadline 
  May 9,  2003       Notification of authors of accepted papers 
  June 26-27, 2003   Workshop Dates 
  June 22-25, 2003   LICS'03 Dates 


  The ICC home page:  http://www.cis.syr.edu/~royer/icc/ 
  The LICS home page: http://www.lfcs.informatics.ed.ac.uk/lics 


  Anuj Dawar
  University of Cambridge Computer Laboratory 
  William Gates Building 
  J.J. Thomson Avenue 
  Cambridge CB3 0FD, England
  tel: +44 1223 334408 
  fax: +44 1223 334678