Newsletter 96
December 14, 2004

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

  LICS 2005 - Second Call for Papers
  CIE 2005 - Final Call for Papers
  MFPS XXI - Call for Papers
  CALCO 2005  - Call for Papers
  CALCO-Jnr 2005 - Call for Abstracts
  CADE-20 - Call for Papers
  FroCoS 2005 - Call for Papers
  WRS '05 - Call for Papers
  RULE '05 - Call for Papers
  PPDP 2005 - Call for Papers
  CLASE 2005 - Call for Papers
  TGC '05 - Call for Papers
  TIME 2005 - Call for Papers
  SPIN 2005 - Call for Papers
  ESSLLI'05 Student Session - Call for Papers
  KI 2005 - Call for Workshop and Tutorial Proposals
  STACS 2005 - Call for Participation
  Spring School on Infinite Games and their Applications
  PhD Position at CWI Amsterdam
  2 Chairs in Computer Science, Durham, UK
  Lecturer in Mathematical Logic and Philosophy of Mathematics, Bristol, UK
  Assistant professor, Philosophy, Stanford University
  Research Associate at University of Kent at Canterbury, UK
  ACKERMANN AWARD - Call for Submissions

  Chicago, Illinois, June  26th-29th, 2005
  Second Call for Papers
* The LICS Symposium is an annual international forum on theoretical and
  practical topics in computer science that relate to logic broadly
  construed.  We invite submissions on topics that fit under that rubric.
  Suggested, but not exclusive, topics of interest for submissions include:
  automata theory, automated deduction, categorical models and logics,
  concurrency and distributed computation, constraint programming,
  constructive mathematics, database theory, domain theory, finite model
  theory, formal aspects of program analysis, formal methods, hybrid systems,
  lambda and combinatory calculi, linear logic, logical aspects of
  computational complexity, logics in artificial intelligence, logics of
  programs, logic programming, modal and temporal logics, model checking,
  probabilistic systems, process calculi, programming language semantics,
  reasoning about security, rewriting, specifications, type systems and type
  theory, and verification.  We welcome submissions in emergent areas, such as
  bioinformatics and quantum computation, if they have a substantial
  connection with logic.
* Authors are required to submit a paper title and a short abstract
  of about 100 words before submitting the extended abstract of the
  paper. All submissions will be electronic.
    Titles & short abstracts due: 5th January 2005
    Extended abstracts due: 10th January 2005
* Invited speakers: Michael Benedikt, Bell Laboratories; Solomon Feferman,
  Stanford University; Walter Fontana, Harvard Medical School; Jane
  Hillston, University of Edinburgh; Glynn Winskel, University of Cambridge
* Program committee: Jiri Adamek, Luca de Alfaro, Andrei Bulatov,
  Hubert Comon-Lundh, Philippa Gardner, Martin Grohe, Neil Immerman,
  Marta Kwiatkowska, Maurizio Lenzerini, Guy McCusker, Larry Moss,
  Prakash Panangaden (chair), Frank Pfenning, Toniann Pitassi,
  Uday Reddy, Thomas Schwentick, Peter Selinger, N. Shankar,
  Igor Walukiewicz
* For more information see LICS website

  Amsterdam, The Netherlands, June 8-12, 2005
  Call for Papers
* This international conference is being organised within the network
  "Computability in Europe"  (CiE), and participation is invited from all
  interested researchers. A particular focus of the meeting is on aspects of
  'New Computational Paradigms'. These include connections between
  computation and physical systems, but also extends to new perspectives on
  models of computation arising from basic research in mathematical logic
  and theoretical computer science. CiE 2005 will have 3-hour tutorials on
  Quantum Computation (H. Buhrman) and Computability over the Reals (K.
  Weihrauch) and invited talks by S. Abramsky, J.D. Hamkins, U. Kohlenbach,
  J. van Leeuwen, Y. Matiyasevich, Y.N. Moschovakis and U. Schoening. There
  will be two-hour special sessions on Biological Computation, Complexity,
  Epistemology and Methodology of Computing, Proofs and Computation, Real
  Computation, and Relative Computation.
* The Programme Committee cordially invites all researchers (European and
  non-European) in the area of computability theory to submit their papers
  (in PDF-format, at most 10 pages) for presentation at CiE 2005. We plan to
  publish a proceedings volume with the Springer LNCS. The deadline for
  submission of papers is December 17th, 2004.  Notification of Authors:
  January 20th, 2005. Deadline for Final Version:  February 15th, 2005.
* Programme committee: Klaus Ambos-Spies (Heidelberg), Albert Atserias
  (Barcelona), Barry Cooper (Leeds, co-chair), Sergei Goncharov
  (Novosibirsk), Benedikt Loewe (Amsterdam, co-chair), Dag Normann (Oslo),
  Helmut Schwichtenberg (Mnchen), Andrea Sorbi (Siena), Ivan Soskov (Sofia),
  Leen Torenvliet (Amsterdam), John Tucker (Swansea), Johan van Benthem
  (Amsterdam/Stanford), Peter van Emde Boas (Amsterdam), Jiri Wiedermann
* Sponsors: ASL, EATCS, NW
* For further information, visit the conference homepage:
  or contact one of the organisers: Barry Cooper, Benedikt Lowe,
  Leen Torenvliet, Peter van Emde Boas.

  May 18 - May 21, 2005
  University of Birmingham
  Edgbaston, Birmingham, UK
  Call for Papers
* The Twenty-first Conference on the Mathematical Foundations of
  Programming Semantics will take place at the University of
  Birmingham, UK from Wednesday, May 18 through Saturday, May 21, 2005.
* The invited speakers for MFPS XXI are: Samson Abramsky, Oxford;
  Andrej Bauer, IMFM, Slovenia; Cliff Jones, Newcastle; Catuscia Palamidessi,
  INRIA; Gordon Plotkin, Edinburgh (to be confirmed); John Reynolds, CMU.
  There also will be a plenary talk on security.
* There will be three special sessions:
  - Special Session on Quantum Computing organized by Samson Abramsky,
    Michael Mislove (Tulane) and Prakash Panangaden (McGill).
  - Special Session on Security organized by Catherine Meadows (NRL)
  - Special Session on Domain Theory and Topology, organized by
    Martin Escardo and Achim Jung (Birmingham).
* The remainder of the program will be composed of papers selected by the
  Program Committee from submissions received in response to this Call
  for Papers. The Program Committee is being chaired by Martin Escardo
  (Birmingham), and includes: Ulrich Berger, Swansea; Lars Birkedal, ITU,
  Denmark; Stephen Brookes, CMU; Thierry Coquand, Goteberg; Pierre-Louis
  Curien, PPS, Paris VII; Vincent Danos, PPS, Paris VII; Marcelo Fiore,
  Cambridge; Achim Jung Birmingham, UK; Catherine Meadows, NRL; Michael
  Mislove, Tulane; Luke Ong, Oxford; Prakash Panangaden, McGill; Brigitte
  Pientka, McGill; Phil Scott, Ottawa; Roberto Segala, Verona; Alex Simpson,
  Edinburgh; James Worrell, Tulane; Steve Zdancewic, Penn.
* Submissions should consist of original work that has not been published
  elsewhere.  Submissions should be no longer than 12 pages, and they
  should be in the form of either PostScript or pdf files that can be
  printed on a standard printer. They can be made using the link that
  will be available on the MFPS 21 Home Page. Submissions will open in
  early January.
* Submissions must be received by midnight, Pacific Standard Time on
  Friday, February 15, 2005.
* For more information see webpage.

  September 3-6, 2005,
  Swansea, Wales, UK
  Call for Papers
* CMCS - the International Workshop on Coalgebraic Methods in Computer
  Science, and WADT - the Workshop on Algebraic Development Techniques,
  are joining their forces and reputations into a new high level
  bi-annual conference. Starting in 2005, CALCO will bring together
  researchers and practitioners to exchange new results related to
  foundational aspects and both traditional and emerging uses of
  algebras and coalgebras in computer science.
* CALCO 2005 will be preceded by a CALCO Young Researchers Workshop,
  CALCO-jnr, dedicated to presentations by PhD students and by those who
  completed their doctoral studies within the past few years.
* We invite submission of technical papers that report results of
  theoretical work on the mathematics of algebras and coalgebras, the
  way these results can support methods and techniques for software
  development, as well as experience with the transition of resulting
  technologies into industrial practise.
* Prospective authors are invited to submit full papers in English
  presenting original research. Submitted papers must be unpublished
  and not submitted for publication elsewhere. Experience papers are
  welcome, but they must clearly present general lessons learned that
  would be of interest and benefit to a broad audience of both
  researchers and practitioners. Proceedings will be published in the
  Springer LNCS series. Final papers will be no more than 15 pages long
  in the format specified by Springer. It is recommended that
  submissions adhere to that format and length
* Invited Speakers: The so-far confirmed invited speakers for CALCO 05 are:
  Samson Abramsky, Christopher Strachey Professor of Computer Science,
  University of Oxford, UK; Vladimiro Sassone, Professor of Informatics,
  University of Sussex, UK.
* Important Dates (all in 2005):
    Jan 21 - Abstract submission due
    Jan 31 - Technical paper submissions due
* For more information see webpage

  2 September 2005,
  University of Wales Swansea, UK
  Call for Abstracts
* The CALCO Young Researchers Workshop, CALCO-jnr, is a CALCO satellite
  event dedicated to presentations by PhD students and by those who
  completed their doctoral studies within the past few years. Attendance
  at the workshop is open to all - it is anticipated that many CALCO
  conference participants will want to attend the CALCO-jnr workshop
  (and vice versa).
* Some grants supporting the participation of young researchers from
  developing countries will be provided by IFIP <>.
* CALCO-jnr presentations will be selected according to originality,
  significance, and general interest, on the basis of submitted 2-page
  abstracts, by the organisers. A booklet with the abstracts of the
  accepted presentations will be available at the workshop.
* After the workshop, the author(s) of each presentation will be invited
  to submit a full 10-15 page paper on the same topic. They will also be
  asked to write (anonymous) reviews of papers submitted by other
  authors on related topics; further reviewing, and the final selection
  of papers, will be carried out by the organisers, assisted by members
  of the CALCO PC.
* The volume of selected papers from the workshop will be published as a
  technical report at Swansea by the end of 2005. Authors will retain
  copyright, and are also encouraged to disseminate the results reported
  at CALCO-jnr by subsequent publication elsewhere.
* 30 April: Firm deadline for 2-page abstract submission
* For more details see webpage

  Call for papers
  Tallinn, Estonia, July 22 - July 27, 2005,
* Theme: CADE is the major forum for the presentation of research in all
  aspects of automated deduction.
  - Logics of interest include propositional, first-order, equational,
    higher-order, classical, intuitionistic, constructive, modal,
    temporal, many-valued, substructural, description, and meta-logics,
    logical frameworks, type theory and set theory.
  - Methods of interest include saturation, resolution, tableaux,
    sequent calculi, term rewriting, induction, unification, constraint
    solving, decision procedures, model generation, model checking,
    natural deduction, proof planning, proof presentation, proof checking,
    and explanation.
  - Applications of interest include hardware and software development,
    systems analysis and verification, deductive databases, functional and
    logic programming, computer mathematics, natural language processing,
    computational linguistics, robotics, planning, knowledge
    representation, and other areas of AI.
* Submission categories include full papers(15 pages) and system
  descriptions (5 pages).
* Submission deadline: for title and abstract:  February 25, 2005, for
  full paper: March 4, 2005
* Program Committee :Franz Baader(TU Dresden),Peter
  Baumgartner(MPI),Amy Felty(U Ottawa),Ian Horrocks(U. Manchester),
  Deepak Kapur(U New Mexico),Chris Lynch(Clarkson U),Fabio Massacci(U
  Trento), Ilkka Niemela(TU Helsinki), Robert Nieuwenhuis(UPC
  Barcelona), Dale Miller (INRIA/Ecole Polytechnique), Tobias Nipkow(TU
  Munich), Frank Pfenning(CMU), Andreas Podelski(MPI), Manfred
  Schmidt-Schauss(Frankfurt U), Peter Schmitt(U Karlsruhe), Stephan
  Schulz(TU Munich), Carsten Schurmann(Yale U), Aaron Stump(Washington
  U), Geoff Sutcliffe(U of Miami), Tanel Tammet(Tallinn TU), Cesare
  Tinelli(U Iowa), Ashish Tiwari(SRI), Moshe Vardi(Rice U), Miroslav
  Velev(CMU), Andrei Voronkov(Manchester), Toby Walsh(CCC Cork)

  Vienna, Austria, September 19-21, 2005
  First Call for Papers
* Theme of FroCoS: The development of general techniques and methods
  for the combination, modularization and integration of systems (with
  emphasis on logic-based ones), and of their practical use.
* Topics of interest include (but are not limited to): Combination of
  logics; combination of decision procedures, of satisfiability procedures,
  and of constraint solving techniques; combinations and modularity in
  term rewriting; integration of equational and other theories into
  deductive systems; combination of deduction systems and computer
  algebra; integration of data structures; model/problem analysis and
  decomposition; hybrid methods for deduction, resolution and
  constraint propagation; hybrid systems in computational linguistics,
  knowledge representation, natural language semantics, and human computer
  interaction; logical modelling of multi-agent systems; logical
  aspects of combining and modularizing programs and specifications.
* Submission categories include full papers, for work on foundations,
  applications, implementation techniques, and problem sets (up to 15 pages),
  as well as system descriptions (up to 8 pages), for describing
  publicly available systems.
* Submission deadline: May 2, 2005 for titles and abstracts, and
  May 9, 2005 for papers. See the conference web page for details.
* Program committee: Alessandro Armando (U Genova), Franz Baader (TU Dresden),
  Clark W. Barrett (NYU New York), Frederic Benhamou (LINA, U Nantes),
  Michel Bidoit (LSV, CNRS & ENS Cachan), Jacques Calmet (U Karlsruhe),
  Juergen Giesl (RWTH Aachen), Bernhard Gramlich - Chair (TU Wien),
  Deepak Kapur (UNM Albuquerque), Maarten Marx (U Amsterdam), Joachim
  Niehren (INRIA Futurs, U Lille), Christophe Ringeissen (LORIA-INRIA Nancy),
  Manfred Schmidt-Schauss (U Frankfurt), Cesare Tinelli (U Iowa),
  Ashish Tiwari (SRI Menlo Park), Frank Wolter (U Liverpool).

  (affiliated with RDP 2005)
  Call for Papers
  Nara, Japan, April 22nd, 2005
* Theme. Reduction strategies in rewriting and programming.
  Research in this field ranges from primarily theoretical questions
  about reduction strategies to very practical application
  and implementation issues. New types of reduction strategies,
  new results on rewriting/computation under particular strategies,
  work leading to a deeper  understanding of reduction strategies in
  rewriting and  programming, both in theory and practice.
* All submissions must be done electronically.  Please email your
  submission to
* Submission Deadline : January  21, 2005 (abstracts)
                        January  31, 2005 (full papers)
* Program committee. Sergio Antoy (Portland), Eduardo Bonelli (Stevens),
  Roberto Di Cosmo (Paris VII, Co-Chair), Bernhard Gramlich (Wien),
  Stefano Guerrini (Roma), Salvador Lucas (Valencia), Aart Middeldorp
  (Innsbruck), Yoshihito Toyama (Tohoku, Co-Chair)

  April 19-23, 2005
  Nara, Japan
  Affiliated to RDP'05
* Rule-based programming is currently experiencing a renewed period of
  growth with the emergence of new concepts and systems that allow a
  better understanding and better usability. On the theoretical side,
  after the in-depth study of rewriting concepts during the eighties,
  the nineties saw the emergence of the general concepts of rewriting
  logic and of the rewriting calculus. On the practical side, new
  languages and systems such as ASF+SDF, BURG, CHRS, Claire, ELAN,
  Maude, and Stratego have shown that rules are a useful programming
* The practical application of rule-based programming prompts research
  into the algorithmic complexity and optimization of rule-based
  programs as well as into the expressivity, semantics and
  implementation of rule-based languages.
* The purpose of this workshop is to bring together researchers from the
  various communities working on rule-based programming to foster
  fertilisation between theory and practice, as well as to favour the
  growth of this programming paradigm.
* Papers (of at most 15 pages) should be submitted electronically as
  PostScript or PDF files to one of the program committee chairs:
  Horatiu Cirstea ( or Narciso Marti-Oliet
  ( The message should also contain a text-only
  abstract and author information.
* Papers should be received by January 31, 2005.
* For more information see:

  Call for Papers
  Lisboa, Portugal, 11-13 July 2005
* Submission Deadline: 13 February 2005
* Topics (not exhaustive): Logic, Constraint, and Functional
  Programming; Applications of Declarative Programming; Methodologies
  for Program Design and Development; Declarative Aspects of
  Object-Oriented Programming; Concurrent Extensions to Declarative
  Languages; Declarative Mobile Computing; Integration of Paradigms;
  Proof Theoretic and Semantic Foundations; Type and Module Systems;
  Program Analysis and Verification; Program Transformation; Abstract
  Machines and Compilation; Programming Environments
* Program Committee: Pedro Barahona (Univ. Nova de Lisboa, Portugal)
  Amy Felty (Univ. Ottawa, Canada, Chair) Gopal Gupta (Univ. Texas at
  Dallas, USA) Michael Hanus (Univ. Kiel, Germany) Kohei Honda (Queen
  Mary & Westfield Coll., UK) Michael Maher (National ICT, Australia)
  Maria Chiara Meo (Univ. G. D'annunzio, Italy) Gopalan Nadathur
  (Univ. Minnesota, USA) Atsushi Ohori (JAIST, Japan) Carsten
  Schuermann (Yale Univ., USA) German Vidal (Technical Univ. Valencia,
  Spain) Joe Wells (Heriot-Watt Univ., UK) Elena Zucca (Univ. Genova,

  Satellite event of ETAPS 2005,
  Edinburgh, 3rd April 2005
* This workshop will provide an avenue for work that extends
  traditional methods that derive from constructive logic for
  synthesizing complex software. After more than 30 years of research,
  program synthesis using constructive logic constitutes a mature
  field with an established theory and set of best practices. Recent
  years have seen an interest in providing analogous results to other
  logical systems and programming languages. This workshop will bring
  together researchers and practitioners to share ideas on the
  foundations, techniques, tools, and applications of constructive
  logic and its methods to automated software engineering technology.
* This workshop will provide an avenue for work that extends
  traditional methods that derive from constructive logic for
  synthesizing complex software.
* There are two kinds of submission accepted: short (no longer than 2
  pages) and long (no longer than 10 pages) papers. Submissions should
  include author's full name(s), affiliation(s) and address(es),
  phone- and fax-number(s) and email address(es). Papers in PS or
  PDF-format should be emailed to the address iman 'at symbol',
  with the subject heading "CLASE submission". All valid submissions will be
  reviewed by at least two members of the program committee.
* Publication Final versions of accepted full papers are to
  be published in a special issue of the Electronic Notes in Computer
  Science (ENTCS).  Authors of accepted short papers will have the
  opportunity to submit expanded versions of their papers for a second
  round of review for publication in the special issue.
* Submission deadline: 10th January 2005
* For more details see web page.

  April 7-9, 2005
  Edinburgh, UK
  Colocated with ETAPS 2005
  Call for Papers
* Computing technology has become ubiquitous, from global applications
  to miniscule embedded devices. Trust in computing is vital to help
  protect public safety, national security, and economic prosperity. A
  new area of research, known as global computing, has recently emerged
  that aims at defining new models of computation based on code and data
  mobility over wide area networks with highly dynamic topologies, and
  that aims at providing infrastructures to support coordination and
  control of components originated from different, possibly untrusted,
  sources. Trustworthy Global Computing aims at guaranteeing safe and
  reliable network usage, also by providing tools and framework for
  reasoning about behaviour and properties of applications.
* Contributions must be in PostScript or PDF and consist of no more than
  15 pages in the Springer LNCS style
* Proceedings will be published by Springer Verlag in the LNCS
  series,immediately after the conference, to give the authors the
  opportunity to take into account discussions and suggestions at the
* Submission deadline: January 14, 2005
* For more information see webpage:

(TIME 2005)
  Call for Papers
  Burlington, Vermont, USA, June 23-25, 2005
* Theme: Research on time-related problems within areas such as
  Artificial Intelligence, Databases, and Logic and Computer-Aided
  Verification. Special emphasis: NEW DIRECTIONS IN TIME RESEARCH.
* All submissions must be done electronically through the symposium web page.
* Submission Deadline : January 22, 2005.
* General Chair: Pierre Wolper (Univ. Liege, Belgium)
* Program Co-Chairs: Jan Chomicki (Univ. Buffalo, USA),
  David Toman (Univ. Waterloo, Canada)
* Organization Chair: X. Sean Wang (Univ. Vermont, USA)

  Call for Papers
  San Francisco, USA, August 22-24, 2005
* SPIN 2005 solicits previously unpublished, currently unsubmitted,
  original contributions addressing theoretical, experimental and
  applied problems in model checking of software artifacts. Although
  authors are encouraged to compare their work with existing model
  checkers such as SPIN, the scope of the workshop is not limited to
  topics directly related to the SPIN system.  Accepted contributions
  will be included in the workshop proceedings which will be published
  by Springer Verlag in the Lecture Notes in Computer Science series.
* Submission deadline: April 1 (abstracts) and April 8, 2005 (papers)
* Invited Speakers: Rajeev Alur (U. Penn), Dawson Engler (Stanford),
  David Wagner (Berkeley). Invited Tutorials: Modex/Feaver (Gerard
  Holzmann and Theo Ruys), BLAST (Tom Henzinger, Ranjit Jhala and
  Rupak Majumdar), Java PathFinder (Willem Visser).
* Program committee: George Avrunin (U. Mass), Dennis Dams (Bell
  Labs), Stefan Edelkamp (U. Dortmund), Cormac Flanagan (UC Santa
  Cruz) Jaco Geldenhuys (Tampere U.), Patrice Godefroid (Bell Labs;
  chair), Susanne Graf (Verimag), Gerard Holzmann (NASA JPL), Sarfraz
  Khurshid (UT Austin), Stefan Leue (U. Konstanz), Rupak Majumdar
  (UCLA), Laurent Mounier (Verimag), Shaz Qadeer (Microsoft), Theo
  Ruys (U. Twente), Willem Visser, (NASA Ames), Pierre Wolper
  (U. Liege).

  8-19 August, Edinburgh
  Student Session
  Call for Papers
* We invite papers for oral and poster presentation from the areas of
  Logic, Language and Computation. The ESSLLI Student Session encourages
  submissions from students at any level, undergraduate, as well as
  postgraduate. This year, unlike in the past, papers can be submitted
  for oral OR poster presentation separately.
* Student authors are invited to submit a full paper, not to exceed 7
  pages of length exclusive of references. Papers are to be submitted
  with clear indications of the selected modality of presentation, i.e.
  oral or poster. The submissions will be reviewed by the student
  session program committee and selected reviewers.
* The preferred formats of submissions are PostScript, PDF, or plain text,
  although other formats will also be accepted.
* The paper and a separate identification page must be sent electronically
* Deadline: 15th February 2005.
* For more information, see:
  or write to:
* ESSLI'05 web page:

  September 11-14, 2005
  Koblenz, Germany
  Call for Workshop and Tutorial Proposals
* KI 2005 is the  28th edition  of  the German Conference  on Artificial
  Intelligence, which  traditionally brings together academic  and
  industrial researchers from all areas of AI.
* The technical  programme  of KI 2005 will  comprise  paper  and poster
  presentations and  a  variety of  specialised workshops  together with
  invited talks from different areas of AI. As an additional component
  of the  KI conference series tutorials will be  offered.  Calls  for
  workshop and tutorial proposals are below.  The call for technical
  papers  will be published separately;  the deadline for submission of
  technical paper is April 15, 2005.  KI-2005 is organized back-to-back
  with TABLEAUX 2005, overlapping on September 14  with an invited talk.
* Workshop/tutorial proposals must be submitted by February 18, 2005.
* For detailed information on workshop proposals see:
* For information on tutorial proposals see:

  February 24-26, 2005
  University of Stuttgart
  Call for Participation
* The program consists of three invited talks and 54 papers selected
  from 217 submissions.
* Registration is now open on the conference web page:
* The conference is fee is 250 EUR (including proceedings, lunches and
  conference dinner) for early registration until January 20th, 2005.
* The invited speakers are:
  - Manindra Agrawal (Singapore)
  - Mireille Bousquet-Melou (Universite Bordeaux 1)
  - Uwe Schoening (Universitaet Ulm)
* Before STACS on Wednesday, February 23 at 4pm, Manindra Agrawal will give
  a lecture on PRIMES is in P in the faculty colloquium.  The colloquium
  is open for participants of STACS05.

  Bonn, Germany, 15th to 19th March 2005
* Description. This school, organized by the EU Training and Research
  Network GAMES (Games and Automata for Synthesis and Validation),
  gives an introduction to the algorithmic theory of infinite
  games, an active and expanding area of research with applications
  in modelling, verifying, and synthesizing reactive systems and
  close ties to logic and semantics. The tutorials are directed to
  young researchers who want to enter the field; topics covered include
  set-theoretic and automata theoretic foundations, games and
  model-checking, games and semantics, and algorithmic synthesis of e.g.
  distributed, timed, and infinite-state systems.
* Speakers. P. Abdulla, L. de Alfaro, P. Bouyer, J. Duparc, E. Graedel,
  L. Ong, W. Thomas, I. Walukiewicz, Th. Wilke.
* Applications. Applicants should write until 5th January 2005 to with a short CV, list of
  publications (if applicable), and a letter of reference; they will be
  notified about acceptance by 15th January. The fee is 100 Euro for
  attendance, course material, lunches, and social events; accomodation is
  extra (a list of places to stay will be announced).

  The Coordination and Component Based Software group in SEN3 at CWI has
  an open position for a PhD student (OIO) for four years.
* The PhD student will perform research in the context of the BSIK project
  BRICKS (Basic Research in Informatics for Creating the Knowledge
  Society). BRICKS addresses the need for a strong impulse in fundamental
  research in informatics.
* The main aim of the present PhD research project is the development of
  compositional methods, tools, and formal techniques for the dynamic
  composition of components, the validation of their composition, and the
  validation  of components themselves.
* The candidate for the PhD position should have a masters degree in
  computer science or mathematics, with a clear interest in questions in
  the field of theoretical computer science. Ideally, the candidate has a
  background in such topics in theoretical computer science as automata
  theory, semantics and proof theory.
* For more information on these vacancies you can contact either of:
  - F. Arbab, telephone +31-20-5924056, e-mail
  - F.S. de Boer, telephone +31-20-592-4139, email

* The Department of Computer Science at the University of Durham is to
  make 2 appointments at the level of Chair.  These are non-fixed-term
  positions and are tenable from 1st April 2005 or from a mutually
  acceptable date thereafter.
* Applicants should have research interests related to the research
  currently pursued within the Department, and persons with research
  interests in aspects of Software Engineering are particularly encouraged
  to apply.
* Further details can be found at:
* Potential candidates are encouraged to contact Professor Iain Stewart
  (Head of Department) for informal discussions: e-mail:; tel: +44 (0)191 334 1720.
* The closing date for applications is 31st January 2005.

  Bristol Institute for Research in the Humanities and Arts
  University of Bristol, UK
* The Departments of Philosophy and Mathematics intend to make a joint
  appointment in the area of mathematical and philosophical logic and
  foundations of mathematics. You will have an outstanding record of
  research or outstanding research potential in one or other of these
  areas. You will contribute to the research theme 'Science, Knowledge,
  and Reality' and will be expected to promote research co-operation
  between the two departments and between the Faculty of Arts and the
  Faculty of Science.
* Grade: Lecturer Grade B
* Salary: GBP 27,989 - 35,883
* Contact for informal enquiries:
  Professor A Bird  Tel. +44 117 928 7826
  Professor P Welch  Tel. +44 117 928 9052
* Timescale of appointment: Permanent contract
* Closing date for applications: 9.00 am on 21 January 2005

  Stanford University, Stanford, CA.
  Dept. of Philosophy.
* Assistant professor, tenure track, beginning September 2005.
  Ph.D. required by start of appointment. AOS: Logic. AOC: Open.
  Teaching load: 4 quarter courses/year (three quarter system).
  Includes advanced undergraduate classes and the opportunity to
  teach one graduate course or seminar each year.
* A successful candidate should have serious interest and competence in
  philosophical issues and the ability to interact effectively with a
  large and diverse philosophy department. The department has teaching
  needs at the upper division undergraduate and graduate level in logic;
  in particular it needs someone who will do an outstanding job at
  teaching the course in first order logic to a diverse audience
  (including students from philosophy, mathematics, linguistics,
  cognitive science, and computer science).
* Candidates should submit a CV, cover letter describing teaching
  experience as well as research interests and accomplishments, at least
  three confidential letters of recommendation, and evidence of excellent
  teaching ability.
* Send materials to:
    Professor Debra Satz, Chair,
    Dept. of Philosophy, Stanford University, Stanford, CA
  Stanford is an affirmative action/equal opportunity employer.
* Application deadline: December 1, 2004.
* See for more information about the
  Stanford Dept. of Philosophy and for
  extensive information about logic at Stanford.

  GBP 19,460-21,640 pa
  Full-time and fixed term for 30 months, to start early 2005
* The post is in association with the EPSRC project "A Theory of Tracing
  Pure Functional Programs". The overall aim of the project is to develop
  a semantical theory of tracing pure functional languages, eager and
  lazy, including: tractable formal definitions of traces, views of traces
  and fault location methods; theorems proving the correctness of the
  methods. The theory will allow existing systems to be improved and novel
  systems to be built. Candidates should have a good working knowledge of
  programming language semantics, in particular operational semantics for
  functional languages. A PhD degree in Computer Science (or related) is
  highly desirable.
* Enquiries about the project should be addressed to Dr Olaf Chitil,, and further information can be found at
* Closing date for receipt of completed applications is:
  12 noon Friday, 7 January 2005.

  Call for Submissions
* The EACSL Board has decided to launch the ACKERMANN Award,
  the EACSL Outstanding Dissertation Award for Logic in Computer Science.
* The ACKERMANN Award will be presented to the recipients
  at the annual conference of the EACSL (CSL'xx).
  The jury is entitled to give more than one award per year.
  The first ACKERMANN Award will be presented at CSL'05.
* Eligible for the 2005 ACKERMANN Award are PhD dissertations
  in topics specified by the EACSL and LICS conferences,
  which were formally accepted as PhD theses at a university or
  equivalent institution between 1.1.2003 and 31.12.2004.
* The deadline for submission is 31.3.2005
  Submission details follow below.
* The award consists of
  - a diploma,
  - an invitation to present the thesis at the CSL conference,
  - the publication of the abstract of the thesis and the
    laudatio in the CSL proceedings,
  - travel support to attend the conference.
* The jury consists of seven members,
  three of them ex officio, namely the president (J. Makowsky, Haifa)
  and the vice-president (D. Niwinski, Warsaw)
  of EACSL, and one member of the LICS organizing committee
  (to be announced later).
  The other members of the jury are currently
  - B. Courcelle (Bordeaux)
  - E. Graedel (Aachen)
  - M. Hyland (Cambridge)
  - A. Razborov (Moscow and Princeton)
* The candidate or his/her supervisor has to submit
  a) the thesis (ps or pdf file);
  b) a detailed description (not longer than 20 pages)
     of the thesis in ENGLISH (ps or pdf file);
  c) a supporting letter by the PhD advisor and
     two supporting letters by other senior faculty or researchers
     in equivalent positions (in English);
  d) a copy of the document asserting that the thesis was accepted
     as a PhD thesis at a recognized University (or equivalent institution)
     and that the candidate has received his/her PhD within
     the specified period;
  e) a short CV of the candidate.
* For more details see:

Back to the LICS web page.