Newsletter 83
January 18, 2003

* Past issues of the newsletter are available at
* Instructions for submitting an announcement to the newsletter
  can be found at

  ETAPS 2003: Call for Participation
  Joint Conference CSL'03 and KGC: Call for Papers
  ICC'03: Call for Papers
  Fourth Panhellenic Logic Symposium: Call for Papers
  EWSCS'03: Call for Participation
  First APPSEM-II Workshop: Call for Participation
  International Workshop in Formal Methods: Call for Papers
  GPCE 2003: Call for Contributions
  Methods and Models for Codesign: Call for Papers
  Special Issue of HOSC: Krivine's Abstract Machine
  Special Isssue of TCS: Game Theory Meets Theoretical Computer Science

  Warsaw, Poland, April, 5-13, 2003
  Call for Participation
* The European Joint Conferences on Theory and Practice of Software (ETAPS)
  is the primary European forum for academic and industrial researchers working
  on topics related to Software Science. It is a confederation of five main
  conferences, 15 workshops and 7 tutorials.
* Registration: To register for ETAPS 2003 visit the conference Web page:
* Grants: A grant from the European Commission, High-Level Scientific
  Conferences, has been approved for supporting the participation in the
  Conference of young researchers (up to the age of 35 years at
  the time of the conference) who are nationals of a Member State or an
  Associated State, and who are actively participating in one of the
  ETAPS 2003 main conferences or in a satellite event.
* The organizers offer additional limited support possibilities for
  ETAPS 2003 participants who are not eligible for the EC-HSC grants above.
* Important dates:
  January 31 - Grant Application Deadline
  February 5 - Discount Registration Deadline
  March 3    - Early Registration Deadline
* Main conferences:
  CC 2003: International Conference on Compiler Construction,
  ESOP 2003, European Symposium on Programming,
  FASE 2003, Fundamental Approaches to Software Engineering,
  TACAS 2003, Tools and Algorithms for the Construction and Analysis
    of Systems,
  FOSSACS 2003, Foundations of Software Science and Computation Structures,
* Invited speakers:
  Samson Abramsky, Oxford University, UK
  Tony Hoare, Microsoft Research, Cambridge, UK
  Peter Lee, Carnegie Mellon University, USA
  Xavier Leroy, INRIA and Trusted Logic, France
  Catherine Meadows, Naval Research Laboratory, USA
  Barbara Ryder, Rutgers University, USA
  Michal Young, Oregon University, USA
* Workshops:
  SE-WMT - Structured Programming: The Hard Core of Software Engineering
    (special event to honour W.M.Turski's 65th birthday)
  AVIS - Automated Verification of Infinite-State Systems
  CMCS - Coalgebraic Methods in Computer Science
  COCV - Compiler Optimization Meets Compiler Verification
  Feyerabend - Feyerabend - Redefining Computing
  FAMAS - Formal Approaches to Multi-Agent Systems
  FICS - Fixed Points in Computer Science
  LDTA - Language Description, Tools and Applications
  RSKD - Rough Sets in Knowledge Discovery and Soft Computing
  SC - Software Composition
  TACoS -  Test and Analysis of Component Based Systems
  USE -  Unanticipated Software Evolution
  UniGra - Uniform Approaches to Graphical Specification Techniques
  WITS - Workshop on Issues in the Theory of Security
  WOOD - Workshop on Object-Oriented Developments
* Tutorials:
  Foundations of Constraint Programming
  XML Documents Using Tree Automata
  Multi-Media Instruction in Safe and Secure Systems
  Advanced Compilation Techniques for the Itanium Processor Family
  Formal Development of Critical Systems with UML
  An Inside Look at Rotor, Microsoft's "Shared Source"
    Implementation of the Common Language Infrastructure
  Theory and Practice of Co-Verification Process: UniTesk Story
* For more information and to register visit the Web page:

  (Annual Conference of the European Association for Computer Science Logic
    and 8th Kurt Goedel Colloquium)
  Vienna, August 25 - 30, 2003
  Call for Papers
* Topics include:
  automated deduction and interactive theorem proving,
  constructive mathematics and  type theory, equational logic and term
  rewriting, fuzzy logic, modal and temporal logics, computational proof
  theory, linear logic, finite model theory, bounded arithmetic, logical
  aspects of computational complexity, higher order logic, logic
  programming and constraints, lambda and combinatory calculi, logical
  foundations of programming paradigms, model checking, specification and
  extraction and transformation of programs, categorical logic and
  topological semantics, game semantics, domain theory, database theory.
* Program committee:  Matthias Baaz (chair), Arnold Beckmann, Lev Beklemishev,
  Maarten de Rijke, Chris Fermueller, Didier Galmiche, Harald Ganzinger,
  Erich Graedel, Petr Hajek, Martin Hyland, Reinhard Kahle, Helene Kirchner,
  Daniel Leivant, Johann Makowsky (co-chair), Jerzy Marcinkowski, Franco
  Montagna, Robert Nieuwenhuis, Michel Parigot, Jeff Paris, Helmut
  Schwichtenberg, Jerzy Tiuryn
* Invited speakers (tentative):
  Sergei Artemov (CUNY, USA)
  Bruno Buchberger (Johannes Kepler University)
  Dov Gabbay (King's College London)
  Helmut Veith (Vienna University of Technology)
  Nikolai Vorobjov (University of Bath)
  Andrei Voronkov (University of Manchester)
* Invited tutorials (tentative):
  Ahmed Bouajjani (University Paris 7)
  Georg Moser (University of Muenster)
  Richard Zach (University of Calgary)
  Nikolai Vorobjov (University of Bath)
  Igor Walukiewicz (University of Bordeaux)
* Submission is in two stages
  Deadline for title and abstract:  March 31, 2003
  Deadline for the full paper: April 7, 2003
* For the required format of submissions see the Website:

  (affiliated with LICS 2003)
  Ottawa, Canada, June 26 - 27, 2003
  Call for Papers
* 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 and machine-independent characterizations of
  complexity classes, logics closely related to complexity classes,
  software that applies ICC ideas, type systems for controlling
* All submissions must be done electronically.  Please email your
  submission to
* Submission Deadline : March 28, 2003
* Program committee. 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
  Universitat Munchen) Neil Jones (University of Copenhagen) Bruce
  Kapron (University of Victoria) Karl-Heinz Niggl (Technische
  Universitat Ilmenau) Luke Ong (University of Oxford)

  July 7-10, 2003, Thessaloniki, Greece
  Call for Paapers
* Original papers on all aspects of logic are solicited.
  Authors are invited to submit an extended abstract of at most five
  pages with a statement classifying the paper in one of the following
  areas: Mathematical Logic, Set Theory, Logic in Computer Science,
  History of Logic, Philosophy of Logic, other Logic related area
* Invited talks: D. Bjorner, P. Peppas, K. Sagonas, I. Soskov
* Tutorials:
  Philosophy  of Logic: W. Demopoulos
  Complexity of Logic-Related Problems: E. Koutsoupias
  Logic-Based Information Integration: M. Lenzerini
  Set Theory:  A. Louveau
* Scientific committee: S. Cosmadakis, C. Dimitracopoulos), A. Kakas,
  A. Kechris, L. Kirousis (Chair), Ph. Kolaitis, G. Koletsos, E. Kranakis,
  M. Mytilinaios, Th. Pheidas, A. Sinachopoulos, P. Spirakis, Th. Tzouvaras,
  S. Zachos
* Address for submission:
* Important dates
  Submission: March 28, 2003
  Notification: May 9, 2003
  Camera-ready abstracts: May 30, 2003

  Palmse, Estonia, 2-7 March 2003
  Call for Participation
* EWSCS is a series of regional-scope international winter schools held
  annually in Estonia. The main objective of EWSCS is to expose Estonian,
  Baltic, and Nordic graduate students in computer science (but also
  interested students from elsewhere) to frontline research topics usually
  not covered within the regular curricula. The subject of the schools
  is general computer science, with a bias towards theory, this comprising
  both algorithms, complexity and models of computation, and semantics,
  logic and programming theory. The working language of the schools is
  English. This time the focus of the winter school will be on
  randomness, cryptography and abstract interpretation.
* The schools' scientific programme consists of short courses by
  renowned specialists and a student session. The course list for
  EWSCS'03 is the following:
  Gregory Chaitin:  Algorithmic Information Theory
  Patrick Cousot: Abstract Interpretation
  Ivan Damgard: Theory and Practice of Multiparty Computation
  Johan Hastad: The PCP Theorem with Some Applications to Inapproximability
* The purpose of the student session is to give students an opportunity
  to present their own ongoing work (typically, thesis work) and get
  feedback. Registrants to EWSCS'03 are invited to propose short talks
  (20 min) or posters. The selection will be based on abstracts of
  150-400 words.
* The deadline for registration and submission of abstracts is 24
  January 2003. All registrants will be notified of acceptance to school
  and of acceptance of their talks/posters by 31 January 2003.
* For full details see:

  26th - 28th March 2003, Nottingham, United Kingdom
  First Announcement and Call for Participation
* The first annual workshop of  the IST working group APPSEM-II (Applied
  Semantics II) will be held  at the University of Nottingham from 26-28
  March 2003.  All  members of the working group  are invited to attend,
  but participation of non-members  from both academia and industry with
  interests  in application-oriented  programming language  semantics is
  actively encouraged. The purpose of  the workshop is to  present new
  results and plan future work in each of the nine themes of the group:
  A - Program structuring: OO programming, modules (Didier Remy);
  B - Proof assistants, functional programming, and dependent
    types (Thierry Coquand);
  C - Program analysis, generation, and configuration (Neil Jones);
  D - Specification and verification methods (Uday Reddy);
  E - Types and type inference in programming (Fritz Henglein);
  F - Games, sequentiality, and abstract machines (Pierre-Louis Curien);
  G - Semantic methods for distributed computing (Glynn Winskel);
  H - Resource models and web data (Peter O'Hearn, Philippa Gardner);
  I - Continuous phenomena in Computer Science (Achim Jung).
* For each theme there will  be a session of presentations, organised by
  the theme leader (in parentheses  above).  There will also be a number
  of invited presentations, an industrial panel session, a brainstorming
  session, and  a business meeting.   Following on from the  workshop an
  informal proceedings will be published on the web.
* Further  details regarding  registration,  accommodation, travel,  etc
  will  be available shortly.   In the  meantime, if  you would  like to
  attend  the workshop,  please email  by FRIDAY
  31ST JANUARY.  If you would like to give a talk, please also include a
  title,  short abstract (and  paper if  available), and  a list  of the
  themes to which it is relevant in order from most to least.
* Note that the fun of programming symposium in honour of Richard Bird's
  60th birthday  will be held in  Oxford during the two days before the
  workshop, so participants may like to attend both events.
* Useful links:
  APPSEM-II working group:
  First APPSEM-II workshop:
  Fun of programming symposium:

  Dublin City University, Dublin, Ireland, 10-11 July, 2003
  Call for Papers
* Submission deadline: 1 April, 2003
* For details see:

  September 22-25, 2003, Erfurt, Germany
  Part of NetObjectDays'03
  In Cooperation with ACM SIGPLAN and SIGSOFT
  Call for Contributions
* Important dates:
  Technical paper submission: Apr  6, 2003
  Workshop proposal submission: Apr  6, 2003
  Practitioner report submission: May 18, 2003
  Tutorials proposal submission: May 18, 2003
  Demonstration proposal submission: May 18, 2003
  Poster proposal submission: Jul 13, 2003
* For details see:

  June 24th-26th, 2003, Mont Saint-Michel, France
  Announcement and Call for Papers
* Programming models, formal analysis methods and verification techniques
  for high-level system design: towards convergence of formal methods
  and industrial trends.
* Opening speaker: Jose Meseguer (SRI)
* Invited speakers: Ahmed Jerraya (IMAG), Nancy Lynch (MIT), Ken
  McMillan (Cadence)
* General chair: Rajesh Gupta (University of California at San Diego)
* Prospective authors are invited to submit original
  and unpublished papers describing innovative techniques and results
  addressing one or several of the following topics:
  1. From general-purpose languages to formal semantic models
  2. Analysis and verification of system-level models
  3. System-level design methodologies
  4. Formal methods for various aspects of system -evel design
  5. Distribution, fault-tolerance, scheduling, non-functional
    requirements (portability, availability, maintainability, etc)
* Problem solving sessions: the technical program committee has identified
  the following specific problem areas where the need for innovation and
  community contribution is important:
  1. Levels of abstraction, notion of conformance and equivalence
  2. Hierarchical verification
  3. Should the space of implementation possibilities be determined
    by the abilities of high-level synthesis and validation ?
  4. Functional coverage, test generation, and incremental verification
  5. Post-fabrication verification, update and patch
* More details on the problem background and discussions can be found on
  the conference website at  We especially
  seek contributions addressing these problem areas while contributions
  within the larger scope of the conference charter are welcome. Papers
  submitted to problem solving sessions and general sessions will be
  reviewed in the same manner, and papers submitted to one session may
  be moved to another session if deemed appropriate by the committee.
* Conference proceedings will be published by ACM or IEEE Press.
  Selected papers from the conference will be published as a special
  volume by Kluwer Academic Publishers on a later date.
* Important dates
  Feb 1, 2003    - submission deadline (firm)
  March 15, 2003 - authors notification
  March 31, 2003 - final versions of accepted papers due and authors
    registration deadline

  Krivine's Abstract Machine
  Call for Papers
* The Krivine machine has been rediscovered many times and in many
  settings, be it by inventive power, by derivation, or by reconstruction.
  The goal of this special issue is to document the variety of these
  rediscoveries, derivations, and reconstructions.  The articles we are
  seeking can be either formal, informal, or experimental, as long as they
  are insightful and shed light on the Krivine machine or a variant of it.
* Submission deadline: February 14, 2003.
* Submissions, in pdf or ps format, should be sent to .
* Questions (e.g., about the appropriateness of a submission) and
  comments should be directed to Olivier Danvy .

  Game Theory Meets Theoretical Computer Science
  Guest Editors: Samson Abramsky and Marios Mavronicolas
  Call for Papers
* The Special Issue falls under both TCS-A (Algorithms, Automata,
  Complexity and Games) and TCS-B (Logic, Semantics and Theory of
* The coverage aim of the Special Issue is two-fold. Specifically,
  the Special Issue is intended to cover:
  research results in areas of Theoretical Computer Science which
  have benefited from the application of concepts, methods and techniques
  from (classical) Game Theory;
  research results and approaches to Game Theory that build upon tools
  from Theoretical Computer Science and address algorithmic questions,
  thus giving rise to the emerging discipline of Algorithmic Game Theory.
* High-calibre papers are solicited that address the intended issues.
  Topics of particular interest include (but are not limited to):
  Algorithmic Mechanism Design, Applications of Games to Model-Checking,
  Combinatorial Games, Computation of Equilibria in Games, Computational
  Complexity of Games, Computational Issues in Game Representations,
  Distributed Computing as a Game, Games as Models for Programming
  Languages and Logics, Game Models for Security and Cryptography,
  Game Paradoxes in Computer Science and Engineering, Game Semantics
  and Interactive Models of Computation, Game-Theoretic Approaches to
  Networking, Game-Theoretic Techniques in Computational Complexity
  Theory, Quantum Games, Reasoning about Games, Uses of Games in Finite
  Model Theory
* Only work that contains rigorous analysis and proofs is sought.
  Theoretical work accompanied by experimental results is especially
  valued. Surveys and tutorial expositions of permanent reference value
  will also be considered. All submitted papers must be original,
  exclusively submitted to this Special Issue.
* Authors are encouraged to submit their papers electronically.
  Please email a postscript file of your manuscript to either or, together with
  a plain text cover letter. Authors unable to submit electronically
  may send five copies of their manuscripts to one of the Guest Editors:
  Samson Abramsky, Computing Laboratory, Oxford University,
    Wolfson Building, Parks Road, Oxford, OX1 3QD, England
  Marios Mavronicolas, Department of Computer Science, University of
    Cyprus, P.O. Box 20537, Nicosia CY-1678, Cyprus
* Important Dates:
  Submission deadline: March 31, 2003 (firm)
  Decision deadline: July 15, 2003
  Final version due: August 31, 2003
  Publication date: October 2004 (tentative)
* Additional information may be obtained by communicating with
  either of the Guest Editors

Back to the LICS web page.