Newsletter 119
December 7, 2008

* Past issues of the newsletter are available at
* Instructions for submitting an announcement to the newsletter
  can be found at
* To unsubscribe, send an email with "unsubscribe" in the
  subject line to

  Upcoming deadlines
  LICS 2009 - Call for Papers
  MFPS XXV - Call for Papers
  GAMES 2009 - Call for Participation
  WOLLIC 2009 - Call for Papers
  CAV 2009 - Call for Papers
  RTA 2009 - Call for Papers
  ICALP 2009 - Call for Papers
  CIE 2009 - Call for Papers
  SAT 2009 - Call for Papers
  CSF 2009 - Call for Papers and Panels
  HYLO 2009 - Call for Papers
  ACKERMANN AWARD - Call for Nominations

* LICS 2009
* CAV 2009
* RTA 2009
* CIE 2009
* CSF 2009
* ICALP 2009
* CCC 2009
* CADE 2009
* WOLLIC 2009
* SAT 2009
* WOLLIC 2009

   Call for Papers
   August  11--14, 2009,
   Los Angeles, California, USA
* Colocated with the 16th International
  Static Analysis Symposium (SAS 2009),
  August 9--11
* 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, higher-order logic, hybrid systems, lambda and combinatory
  calculi, linear logic, logical aspects of computational complexity,
  logical frameworks, logics in artificial intelligence, logics of
  programs, logic programming, modal and temporal logics, model
  checking, probabilistic systems, process calculi, programming language
  semantics, proof theory, reasoning about security, rewriting, 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.
* Submission information:
  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.
  All deadlines are firm; late submissions will not be considered.
  Submission is open at
* Important Dates:
  Titles & Short Abstracts Due:  January 12, 2009
  Extended Abstracts  Due:       January 19, 2009
  Author Notification:           March 19, 2009
  Camera-ready Papers Due:       May 25, 2009.
* Affiliated Workshops:
  As in previous years, there will be a number of workshops affiliated
  with LICS 2009; information  will be posted at the LICS website.
* Program Chair:
    Andrew Pitts
    Computer Laboratory
    University of Cambridge, UK
* Program Committee:
  Rance Cleaveland, University of Maryland
  Karl Crary, Carnegie Mellon University
  Rocco De Nicola, Univ. degli Studi di Firenze
  Gilles Dowek, École polytechnique
  Neil Immerman, University of Massachusetts
  Radha Jagadeesan, DePaul University
  Claude Kirchner, INRIA
  Marta Kwiatkowska, Oxford University
  Benoit Larose, Concordia University
  Soren Lassen, Google Inc.
  Leonid Libkin, University of Edinburgh
  Paul-André Melliès, CNRS & Univ. Paris Diderot
  Eugenio Moggi, Università di Genova
  Andrzej Murawski, Oxford University
  Gopalan Nadathur, University of Minnesota
  Prakash Panangaden, McGill University
  Madhusudan Parthasarathy, UI Urbana-Champaign
  Nir Piterman, Imperial College London
  Andrew Pitts, University of Cambridge
  François Pottier, INRIA
  Vijay Saraswat, IBM TJ Watson Research Center
  Lutz Schröder, DFKI-Lab Bremen
  Nicole Schweikardt,  Univ Frankfurt am Main
  Alwen Tiu, Australian National University
  Hongseok Yang, Queen Mary Univ. of London
* Conference Chair:
  Jens Palsberg, UCLA
  Los Angeles, California, USA
* Workshops Chairs:
  Adriana Compagnoni, Stevens Inst. of Technology
  Philip J. Scott, University of Ottawa
* Publicity Chairs:
  Stephan Kreutzer, University of Oxford
  Nicole Schweikardt, Universitat Frankfurt am Main
* General Chair:
  Martín Abadi, Microsoft Research Silicon Valley and
              University of California, Santa Cruz
* Organizing Committee:
  M. Abadi (chair), S. Abramsky, G. Ausiello, F. Baader,
  S. Brookes, S. Buss, E. Clarke, A. Compagnoni, H. Gabow, J. Giesl,
  R. Jagadeesan, A. Jeffrey, J.-P. Jouannaud, P. Kolaitis,
  S. Kreutzer, R. E. Ladner, J. A. Makowsky, J. Marcinkowski, L. Ong,
  F. Pfenning, A. M. Pitts, N. Schweikardt, P. Scott, M. Veanes
* Short Presentations:
  LICS 2009 will have a session of short (10 minute) presentations.
  This session is intended for descriptions of work in progress,
  student projects, and relevant research being published elsewhere;
  other brief communications may be acceptable.  Submissions for these
  presentations, in the form of short abstracts (1 or 2 pages long),
  should be entered at the LICS 2009 submission site in a time frame
  to be determined.
* Kleene Award for Best Student Paper:
  An award in honour of the late S. C. Kleene will be given for the
  best student paper, as judged by the program committee.  Details
  concerning eligibility criteria and procedure for consideration for
  this award will be posted at the LICS website.  The program
  committee may decline to make the award or may split it among
  several papers.
* Sponsorship:
  The symposium is sponsored by the IEEE Technical Committee on
  Mathematical Foundations of Computing in cooperation with the
  Association for Symbolic Logic, and the European Association for
  Theoretical Computer Science.

    Twenty-fifth Conference on the Mathematical Foundations of Programming Semantics
    University of Oxford, Oxford, UK
        April 3 - 7, 2009
    Partially Supported by US Office of Naval Research
* In commemoration of the founding of denotational semantics in the
  work of Dana Scott and Christopher Strachey, the Twenty-fifth
  Conference on the Mathematical Foundations of Programming Semantics
  will take place on the campus of the University of Oxford, Oxford UK
  from April 3 - 7, 2009. MFPS conferences are devoted to those areas of
  mathematics, logic, and computer science that are related to models of
  computation, in general, and to the semantics of programming
  languages, in particular. The series has particularly stressed
  providing a forum where researchers in mathematics and computer
  science can meet and exchange ideas about problems of common
  interest. As the series also strives to maintain breadth in its scope,
  the conference strongly encourages participation by researchers in
  neighboring areas.
* TOPICS include, but are not limited to, the following:
  biocomputation; concurrent and distributed computation; constructive
  mathematics; domain theory and categorical models; formal languages;
  formal methods; game semantics; lambda calculus; logic; probabilistic
  systems; process calculi; programming-language theory; quantum
  computation; security; topological models; type systems; type theory.
  Neil Ghani, Strathclyde
  Marta Kwiatkowska, Oxford
  Catherine Meadows, Naval Research Lab
  Michael Mislove, Tulane
  Dana Scott, CMU
  David Schmidt, Kansas State
* In addition, there will be four SPECIAL SESSIONS:
  - A Session Honoring Bob Tennent on the occasion of his 65th
    birthday year, which is being organized by Dan Ghica (Birmingham) and
    Pete O'Hearn (QMW).
  - A Session on Security will be held in conjunction with Catherine
    Meadow's plenaary talk. It is being organized by Catherine Meadows
    and A. W. Roscoe (Oxford).
  - A Session Honoring Michael Mislove on the occasion of his 65th
    birthday year, which is being organized by Achim Jung (Birmingham),
    Samson Abramsky (Oxford) and Steve Brookes (CMU). It will be held in
    conjunction with Dana Scott's plenary address.
  - A Session on Mathematical Structured Programming will be held in
    conjunction with Neil Ghani's plenary address. It is being organized
    by Neil Ghani and Achim Jung.
* In addition, there will be five TUTORIAL TALKS on Quantum
  Information and Quantum Computing. These are being organized by Samson
  Abramsky (Oxford) and Bob Coecke (Oxford).  The talks will be given at
  the start of each day of the meeting. These talks are aimed at
  providing background for participants to take part in the Workshop on
  Quantum Physics and Logic (QPL VI) immediately following MFPS in
* The remainder of the program will consist of papers selected by the following PROGRAM COMMITTEE
  Andrej Bauer,  University of Ljubljana, Slovenia
  Stephen Brookes, CMU, USA
  Kostas Chatzikokolakis, TUE, The Netherlands
  Yuxin Deng, Shanghai Jiao Tong University, China
  Derek Dreyer, MPI-SWS, Germany
  Daniele Gorla, Sapienza Università di Roma, Italy
  Jean Goubault-Larrecq, ENS Cachan, France
  Joshua Guttman, MITRE, USA
  Matthew Hennessy, TCD, Ireland
  Jean Krivine, Harvard Medical School, USA
  Achim Jung, University of Birmingham, UK
  Pasquale Malacaria, Queen Mary University of London,  UK
  Keye Martin NRL, USA
  Catherine Meadows, NRL, USA
  Mike Mislove, Tulane University, USA
  MohammadReza Mousavi, TUE, The Netherlands
  Catuscia Palamidessi, INRIA, France  (chair)
  Prakash Panangaden, McGill University, Canada
  Peter Selinger, Dalhousie University, Canada
  Daniele Varacca, Université Paris Diderot, France
  from submissions received in response to this Call for Papers. The
  submissions will be organized through EasyChair, and further
  information will be sent out nearer the time that submissions are
  being accepted.
  - January  9        Title and Short Abstract submission deadline
  - January 16         Paper submission deadline
  - February 20        Notification to authors
  - March 13        Preliminary proceedings version due

GAMES Spring School 2009
  Call for Participation
  May 31 - June 6, 2009, Bertinoro, Italy
* This school is organised by the ESF Research Networking Programme
  Games for Design and Verification.
  It is addressed to Ph.D. students and young researchers
  with a background in computer science or mathematics who are
  interested in the field of game theory and its applications to logic,
  verification and automata theory.
  A more detailed list of topics can be found on the webpage.
* Deadline for application: February 28, 2009.
* Confirmed Lecturers: Krzysztof R. Apt (CWI and Univ. of Amsterdam),
  Erich Grädel (RWTH Aachen), Joseph Y. Halpern (Cornell Univ.),
  Marcin Jurdzinski (Univ. of Warwick), Stephan Kreutzer (Oxford Univ.),
  Antonín Kucera (Masaryk University), Christof Löding (RWTH Aachen),
  Jean-François Raskin (Univ. Libre de Bruxelles),
  Dov Samet (Tel-Aviv Univ.).

   Call for Papers
   Tokyo, Japan
   June 21-24, 2009
   (SPECIAL: There will be a screening of George Csicsery's
             "N is a Number: A Portrait of Paul Erdos"
              with kind permission of the film director)
* WoLLIC is an annual international forum on inter-disciplinary research
  involving formal logic, computing and programming theory, and natural
  language and reasoning.  Each meeting includes invited talks and
  tutorials as well as contributed papers.
  The Sixteenth WoLLIC will be held at the National Institute of Informatics
  in Tokyo, Japan, from June 21 to 24, 2009. It is jointly sponsored by
  the Association for Symbolic Logic (ASL), the Interest Group in Pure and
  Applied Logics (IGPL), the Association for Logic, Language and Information
  (FoLLI), the European Association for Theoretical Computer Science
  (EATCS), the Sociedade Brasileira de Computacao (SBC), and the
   Sociedade Brasileira de Logica (SBL).
    2009 will mark the 60-th anniversary of the publication of Paul Erdos'
    elementary proof of the Prime Number Theorem. WoLLIC will celebrate
    this by screening the documentary about Paul Erdos which was directed
    by George Csicsery "N is a number - A Portrait of Paul Erdos"
    Contributions are invited on all pertinent subjects, with particular
    interest in cross-disciplinary topics.  Typical but not exclusive
    areas of interest are: foundations of computing and programming;
    novel computation models and paradigms; broad notions of proof and belief;
    formal methods in software and hardware development; logical approach to
    natural language and reasoning; logics of programs, actions and resources;
    foundational aspects of information organization, search, flow, sharing,
    and protection.
    Proposed contributions should be in English, and consist of a scholarly
    exposition accessible to the non-specialist, including motivation,
    background, and comparison with related works.
    They must not exceed 10 pages (in font 10 or higher), with up to
    5 additional pages for references and technical appendices.
    The paper's main results must not be published or submitted
    for publication in refereed venues, including journals and other
    scientific meetings.
    It is expected that each accepted paper be presented at the meeting by
    one of its authors.
    Papers must be submitted electronically at
    A title and single-paragraph abstract should be submitted by
    February 28, and the full paper by March 8 (firm date).
    Notifications are expected by April 19, and final papers for
    the proceedings will be due by May 3 (firm date).
    Arnold Beckmann (Swansea U, UK)
    Carlos Caleiro (UT Lisbon, Portugal)
    Thomas Eiter (Tech U Wien, Austria)
    Sylvain Salvati (INRIA, France)
    Taisuke Sato (Tokyo Inst Tech, Japan)
    Michiel van Lambalgen (U Amsterdam, NL)
    Frank Wolter (U Liverpool, UK)
    ASL sponsorship of WoLLIC 2009 will permit ASL student members to
    apply for a modest travel grant (deadline: April 1, 2009).
    See for details.
    February 28, 2009: Paper title and abstract deadline
    March 8, 2009: Full paper deadline (firm)
    April 19, 2009: Author notification
    May 3, 2009: Final version deadline (firm)
    Toshiyasu Arai (Kobe U, Japan)
    Matthias Baaz (Tech U Wien)
    Alexandru Baltag (Oxford U)
    Josep Maria Font (U Barcelona)
    Silvio Ghilardi (U Milano)
    Katsumi Inoue (Nat Inst of Informatics, Japan)
    Marcus Kracht (U Bielefeld)
    Hiroakira Ono (JAIST, Japan) (Chair)
    Masanao Ozawa (Nagoya U)
    John Slaney (Australian Nat U)
    Mark Steedman (Edinburgh U)
    Hans Tompits (Tech U Wien)
    Makoto Kanazawa (Nat Inst of Informatics, Japan, co-chair)
    Anjolina de Oliveira (U Fed Pernambuco, Brazil)
    Ruy de Queiroz (U Fed Pernambuco, Brazil, co-chair)
    Ken Satoh (Nat Inst of Informatics, Japan)

   Call for Papers
   June 26 - July 2, 2009
   Grenoble, France
* Aims and Scope
  CAV 2009 is the 21st in a series dedicated to the advancement of the
  theory and practice of computer-aided formal analysis methods for
  hardware and software systems. CAV considers it vital to continue its
  leadership in hardware verification, maintain its recent momentum in
  software verification, and consider new domains such as biological
  systems. The conference covers the spectrum from theoretical results
  to concrete applications, with an emphasis on practical verification
  tools and the algorithms and techniques that are needed for their
  implementation. The proceedings of the conference will be published in
  the Springer-Verlag Lecture Notes in Computer Science series. A
  selection of papers will be invited to a special issue of the
  International Journal on Formal Methods and System Design.
* Topics of interest include:
  - Algorithms and tools for verifying models and implementations
  - Hardware verification techniques
  - Hybrid systems and embedded systems verification
  - Deductive, compositional, and abstraction techniques for verification
  - Program analysis and software verification
  - Verification techniques for security
  - Testing and runtime analysis based on verification technology
  - Applications and case studies
  - Verification in industrial practice  * Formal methods for biological systems
* Events
  There will be pre-conference workshops on June 26-28. The main
  conference will take place on June 28-July 2. There will be tutorials
  on the first day of the conference (June 28). Please see the
  conference website for details.
* CAV Award
  See below for nominations for the CAV Award, established
  "For a specific fundamental contribution or a series of outstanding
   contributions to the field of Computer Aided Verification."
  The award of $10,000 will be granted to an individual or a group of
  individuals chosen by the Award Committee from a list of
  nominations. The Award Committee may choose to make no award.
  The CAV Award shall be presented in an award ceremony at CAV and a
  citation will be published in a Journal of Record (currently, Formal
  Methods in System Design).
* Paper Submission
  There are two categories of submissions:
  - A. Regular papers. Submissions, not exceeding fourteen (14) pages
  using Springer's LNCS format, should contain original research, and
  sufficient detail to assess the merits and relevance of the
  contribution. For papers reporting experimental results, authors are
  strongly encouraged to make their data available with their
  submission. Submissions reporting on case studies in an industrial
  context are strongly invited, and should describe details, weaknesses
  and strength in sufficient depth. Simultaneous submission to other
  conferences with proceedings or submission of material that has
  already been published elsewhere is not allowed.
  - B. Tool presentations. Submissions, not exceeding six (6) pages
  using Springer's LNCS format, should describe the implemented tool and
  its novel features. A demonstration is expected to accompany a tool
  presentation. Papers describing tools that have already been presented
  in this conference before will be accepted only if significant and
  clear enhancements to the tool are reported and implemented.
* Papers exceeding the stated maximum length run the risk of rejection
  without review. The review process will include a feedback/rebuttal
  period where authors will have the option to respond to reviewer
  comments. Papers can be submitted in PDF or PS format. Submission is
  done with EasyChair. Informations about the submission procedure will
  be available at:
* Important Dates
  - Abstract submission:  January 18, 2009
  - Paper submission (firm): January 25, 2009
  - Author feedback/rebuttal period: March 5-8, 2009
  - Notification of acceptance/rejection: March 23, 2009
  - Final version due: April 17, 2009
* Program Chairs
  -   Ahmed Bouajjani, LIAFA, U Paris 7
  -   Oded Maler, CNRS-VERIMAG, Grenoble
* Program Committee
  - Parosh A. Abdulla, U Uppsala
  - Rajeev Alur, U Penn
  - Christel Baier, U Dresden
  - Clark Barrett, NYU
  - Armin Biere, Johannes Kepler U Linz
  - Nikolaj Bjorner, Microsoft Research Redmond
  - Roderick Bloem, TU Graz
  - Ahmed Bouajjani (co-chair), LIAFA, U Paris 7
  - Edmund Clarke, CMU
  - Byron Cook, Microsoft Research Cambridge
  - Martin Fraenzle, U Oldenburg
  - Aarti Gupta, NEC Labs America
  - John Harrison, Intel
  - Klaus Havelund, NASA JPL
  - Alan Hu, UBC Vancouver
  - Kevin Jones
  - Daniel Kroening, U Oxford
  - Robert Kurshan, Cadence Design Systems
  - Yassine Lakhnech,  U Grenoble
  - Oded Maler (co-chair), CNRS-VERIMAG
  - Kenneth McMillan, Cadence Research Labs
  - Markus Mueller-Olm, U Muenster
  - Kedar Namjoshi, Bell Labs, Alcatel-Lucent
  - Madhusudan Parthasarathy, U Ilinois Urbana-Champain
  - Sriram Rajamani, Microsoft Research India
  - Andrey Rybalchenko, MPI Saarbruecken
  - Philippe Schnoebelen, CNRS-LSV
  - Sanjit Seshia, UC Berkeley
  - Natarjan Shankar, SRI International
  - Fabio Somenzi, U Colorado Boulder
  - Ofer Strichman, Technion
  - Serdar Tasiran, Koc U Istanbul
  - Tayssir Touili, CNRS-LIAFA
  - Stavros Tripakis, Cadence Research Labs
  - Helmuth Veith, TU Darmstadt
* Organizing committee
  - Saddek Bensalem (Chair), VERIMAG, U Grenoble
  - Ylies Falcone, VERIMAG, U Grenoble
  - Peter Habermehl, LIAFA, U Paris 7
* Call for Nominations for the CAV Award
  Anyone can submit a nomination. The Award Committee can originate a
  nomination. Anyone, with the exception of members of the Award
  Committee, is eligible to receive the Award.
  The 2009 CAV Award Committee consists of Randy Bryant, Orna
  Grumberg, Moshe Vardi and Joseph Sifakis (in order of seniority).
* For the CAV Award in 2009, please send nominations to the CAV Award Committee Chair:
  Randy Bryant    Randy.Bryant (at)
  Nominations must be received by *January 25, 2009*.

RTA 2009 - 20th International Conference on Rewriting Techniques and Applications
  First Call for Papers
  June 29 - July 1, 2009, Brasilia, Brazil
* The 20th International Conference on Rewriting Techniques and Applications
  (RTA 2009) is organized as part of the Federated Conference on Rewriting,
  Deduction, and Programming (RDP 2009), together with the International
  Conference on Typed Lambda Calculi and Applications (TLCA 2009), and several
  workshops. The conference will be preceded by the 4th International School on
  Rewriting (ISR).
  - Abstract Submission:  January 19, 2009
  - Paper Submission:     January 26, 2009
  - Notification:         March 20, 2009
  - Final version:        April 10, 2009
  A prize of 500 Euro will be given to the best paper as judged by the program
  committee. The program committee may decline to make the award or may split
  it among several papers.
* Abstracts and papers must be submitted electronically through the EasyChair
  system at (the site will be opened later):
* Questions concerning submissions may be addressed to the PC chair,
  Ralf Treinen, treinen AT

   Call for Papers
   July 5 - 12, 2009
   Rhodes - Greece
* Affiliated Workshop Dates: July 5 and July 11-12
* The 36th International Colloquium on Automata, Languages and
  Programming, the main conference and annual meeting of the European
  Association for Theoretical Computer Science (EATCS), will take place
  from the 5th to the 12th of July 2009 in Rhodes, Greece. The main
  conference will take place from the 6th till the 11th of July, and
  will be preceded and followed by a series of Workshops.
  Following the successful experience of the last four editions, ICALP
  2009 will complement the established structure of the scientific
  program based on Track A on Algorithms, Automata, Complexity and
  Games, and Track B on Logic, Semantics, and Theory of Programming,
  corresponding to the two main streams of the journal Theoretical
  Computer Science, with a special Track C on Foundations of Networked
  Computation: Models, Algorithms and Information Management. The aim of
  Track C is to allow a deeper coverage of a particular topic, to be
  specifically selected for each year's edition of ICALP on the basis of
  its timeliness and relevance for the theoretical computer science
* Papers presenting original research on all aspects of theoretical
  computer science are sought.
  - Track A - Algorithms, Automata, Complexity and Games
  - Track B - Logic, Semantics, and Theory of Programming
  - Track C - Foundations of Networked Computation: Models, Algorithms
              and Information Management
  - Workshop proposals due: October 31, 2008
  - Workshop proposals notification: November 21, 2008
  - Submissions: February 10, 2009.
  - Notification: April 6, 2009
  - Final version due: April 27, 2009
  - Georg Gottlob (Oxford University)
  - Thomas Henzinger (Ecole Polytechnique Fédérale de Lausanne)
  - Kurt Mehlhorn (Max-Planck-Institut für Informatik, Saarbrücken)
  - Noam Nisan (Google, Tel Aviv, and Hebrew University)
  - Christos Papadimitriou (University of California at Berkeley)
  - Roger Wattenhofer (ETH Zurich)
  Track A
  - Susanne Albers, Univ. of Freiburg (PC chair)
  - Gerth Brodal, Univ. of Aarhus
  - Martin Dyer, Univ. of Leeds
  - Irene Finocchi, Univ. of Rome "La Sapienza"
  - Anna Gal, Univ. of Texas at Austin
  - Naveen Garg, IIT Delhi
  - Raffaele Giancarlo, Univ. of Palermo
  - Andrew Goldberg, Microsoft
  - Mordecai Golin, Hong Kong Univ.
  - Michel Habib, LIAFA, Paris 7
  - Thore Husfeldt, Lund Univ.
  - Kazuo Iwama, Univ. of Kyoto
  - Howard Karloff, AT&T Labs
  - Yishay Mansour, Tel Aviv Univ. and Google
  - Jiri Matoušek, Charles Univ. Prague
  - Marios Mavronicolas, Univ. of Cyprus
  - Piotr Sankowski, Univ of Warsaw & ETH Zurich
  - Raimund Seidel, Univ. of Saarbrücken
  - Paul Spirakis, CTI & Univ. of Patras
  - Dorothea Wagner, Univ. of Karlsruhe
  - Peter Widmayer, ETH Zurich
  - Ronald de Wolf, CWI Amsterdam
  Track B
  - Albert Atserias,Univ. Politecnica de Catalunya, Barcelona
  - Jos Baeten, Eindhoven Univ. of Technology
  - Gilles Barthe, IMDEA Software, Madrid
  - Mikolaj Bojanczyk, Warsaw Univ.
  - Christian Choffrut, Univ. Denis Diderot, Paris
  - Roberto di Cosmo, Univ. Denis Diderot, Paris
  - Thierry Coquand, Göteborg Univ.
  - Kousha Etessami, Univ. of Edinburgh
  - Kim Guldstrand Larsen, Aalborg Univ
  - Dexter Kozen, Cornell Univ., Ithaca, NY
  - Stephan Kreutzer, Oxford Univ.
  - Orna Kupferman, Hebrew Univ.
  - Dale Miller, Ecole Polytechnique, Palaiseau
  - Markus Müller-Olm, Univ. Münster
  - Anca Muscholl, Univ. Bordeaux 1
  - R. Ramanujam, Inst. of Math. Sciences, Chennai
  - Simona Ronchi Della Rocca, Univ. of Torino
  - Jan Rutten, CWI, Amsterdam
  - Vladimiro Sassone, Univ. of Southampton
  - Peter Sewell, Univ. of Cambridge
  - Howard Straubing, Boston College
  - Wolfgang Thomas, RWTH Aachen Univ. (PC chair)
  Track C
  - Hagit Attiya, Technion
  - Andrei Broder, Yahoo
  - Xiaotie Deng, City Univ. of Hong Kong
  - Danny Dolev, Hebrew Univ.
  - Michele Flammini, Univ. of L'Aquila
  - Pierre Fraigniaud, CNRS, Paris
  - Ashish Goel, Univ. of Stanford
  - Matthew Hennessy, Trinity College Dublin
  - Kohei Honda, Univ. of London
  - Elias Koutsoupias, Univ. of Athens
  - Alberto Marchetti Spaccamela, Univ. of Rome "La Sapienza" (PC co-chair)
  - Yossi Matias, Google and Tel Aviv Univ. (PC co-chair)
  - Silvio Micali, MIT
  - Muthu Muthukrishnan, Google, NY
  - Moni Naor, Weizmann Institute
  - Mogens Nielsen, Univ. of Aarhus
  - Harald Raecke, Univ. of Warwick
  - Jose Rolim, Univ. of Geneva
  - Christian Schindelhauer, Univ. of Freiburg
  - Roger Wattenhofer, ETH Zurich
  - Martin Wirsing, Univ. of Munich

  Call for Papers
  July 19 - 24, 2009, Heidelberg, Germany
* CiE 2009 is the fifth in a series of conferences organised by CiE
  (Computability in Europe), a European association of mathematicians,
  logicians, computer scientists, philosophers, physicists and others
  interested in new developments in computability and their underlying
  significance for the real world. Previous meetings took place in
  Amsterdam (2005), Swansea (2006), Siena (2007) and Athens (2008).
* TUTORIALS: Pavel Pudlak, Luca Trevisan.
* INVITED SPEAKERS: Manindra Agrawal, Jeremy Avigad, Phokion Kolaitis,
  Peter Koepke, Andrea Sorbi, Vijay Vazirani.
* SPECIAL SESSIONS on Algorithmic Randomness (E. Mayordomo, W. Merkle),
  Computational Model Theory (J. Knight, A. Morozov), Computation in
  Biological Systems - Theory and Practice (A. Carbone, E. Csuhaj-Varju),
  Optimization and Approximation (M. Halldorsson, G. Reinelt), Philosophical
  and Mathematical Aspects of Hypercomputation (J. Ladyman, P. Welch),
  Relative Computability (R. Downey, A. Soskova)
* CiE 2009 has a broad scope and bridges the gap from the theoretical
  methods of mathematical and meta-mathematical flavour to the applied and
  industrial questions of computational practice. The conference aims to
  bring together researchers who want to explore the historical and
  philosophical aspects of the field.
* We particularly invite papers that build bridges between different parts
  of the research community. Since women are underrepresented in mathematics
  and computer science, we emphatically encourage submissions by female
  authors. The Elsevier Foundation is supporting the CiE conference series
  in the programme "Increasing representation of female researchers in the
  computability community". This programme will allow us to fund child-care
  support, a mentoring system for young female researchers, and also a small
  number of grants for female researchers, covering their registration fees.
* CiE 2009 conference topics include, but not exclusively:
  admissible sets; analog computation; artificial intelligence; automata theory;
  classical computability and degree structures; computability theoretic aspects
  of programs; computable analysis and real computation; computable structures
  and models; computational and proof complexity; computational complexity;
  computational learning and complexity; concurrency and distributed
  computation; constructive mathematics; cryptographic complexity; decidability
  of theories; derandomization; domain theory and computability; dynamical
  systems and computational models; effective descriptive set theory; finite
  model theory; formal aspects of program analysis; formal methods; foundations
  of computer science; games; generalized recursion theory; history of
  computation; hybrid systems; higher type computability; hypercomputational
  models; infinite time Turing machines; Kolmogorov complexity; lambda and
  combinatory calculi; L-systems and membrane computation; mathematical models
  of emergence; molecular computation; natural computing; neural nets and
  connectionist models; philosophy of science and computation; physics and
  computability; probabilistic systems; process algebra; programming language
  semantics; proof mining; proof theory and computability; quantum computing and
  complexity; randomness; reducibilities and relative computation; relativistic
  computation; reverse mathematics; swarm intelligence; type systems and type
  theory; uncertain reasoning; weak arithmetics and applications
* Important dates:  Paper submission due: 20 Jan 2009;
  Notification: 16 Mar 2009; Final revisions: 17 Apr 2009
* PROGRAMME COMMITTEE Klaus Ambos-Spies (Heidelberg, co-chair), Giorgio Ausiello
  (Rome), Andrej Bauer (Ljubljana), Arnold Beckmann (Swansea), Olivier Bournez
  (Nancy), Vasco Brattka (Cape Town), Barry Cooper (Leeds), Anuj Dawar
  (Cambridge), Jacques Duparc (Lausanne), Pascal Hitzler (Karlsruhe), Rosalie
  Iemhoff (Utrecht), Margarita Korovina (Siegen/Novosibirsk), Hannes Leitgeb
  (Bristol), Daniel Leivant (Bloomington), Benedikt Loewe (Amsterdam),
  Giancarlo Mauri (Milan), Elvira Mayordomo (Zaragoza), Wolfgang Merkle
  (Heidelberg, co-chair), Andrei Morozov (Novosibirsk), Dag Normann (Oslo),
  Isabel Oitavem (Lisbon), Luke Ong (Oxford), Martin Otto (Darmstadt),
  Prakash Panangaden (Montreal), Ivan Soskov (Sofia), Viggo
  Stoltenberg-Hansen (Uppsala), Peter van Emde Boas (Amsterdam), Jan van
  Leeuwen (Utrecht), Philip Welch (Bristol), Richard Zach (Calgary)

SAT 2009 - 12th International Conference on Theory
and Applications of Satisfiability Testing
  Call for Papers
  June 30 - July 3, 2009, Swansea, United Kingdom
* The International Conference on Theory and Applications of
  Satisfiability Testing is the primary annual meeting for researchers
  studying the propositional satisfiability problem (SAT). SAT'09 is
  the twelfth SAT conference. SAT'09 features the SAT competition, the
  the Pseudo-Boolean evaluation, and the MAX-SAT evaluation.
* The topics of the conference span practical and
  theoretical research on SAT and its applications and include but are
  not limited to proof systems, proof complexity, search algorithms,
  heuristics, analysis of algorithms, hard instances, randomized
  formulae, problem encodings, industrial applications, solvers,
  simplifiers, tools, case studies and empirical results. SAT is
  interpreted in a rather broad sense: besides propositional
  satisfiability, it includes the domain of quantified boolean
  formulae (QBF), constraints programming techniques (CSP) for
  word-level problems and their propositional encoding and
  particularly satisfiability modulo theories (SMT).
* Important dates:  Abstract submission due: 20 Feb 2009;
  Paper submission: 27 Feb 2009; Notification: 29 Mar 2009.

   Call For Papers and Panels
   July 8-10, 2008
   Port Jefferson, New York, USA
* Sponsored by the Technical Committee on Security and Privacy
  of the IEEE Computer Society
* The IEEE Computer Security Foundations
  <> (CSF) series brings together
  researchers in computer science to examine foundational issues in computer
  security. Over the past two decades, many seminal papers and techniques have
  been presented first at CSF. CiteSeer
  <>  lists CSF as 38th out of more
  than 1200 computer science venues (top 3.11%) in impact based on citation
  frequency. CiteSeerX <>
  lists CSF 2007 as 7th out of 581 computer science venues (top 1.2%) in
  impact based on citation frequency.
  New theoretical results in computer security are welcome. Also welcome are
  more exploratory presentations, which may examine open questions and raise
  fundamental concerns about existing theories.
* Panel proposals are sought as well as papers. Possible topics
  include, but are not limited to:
  Access control
  Anonymity and Privacy
  Data and system integrity
  Database security
  Decidability and complexity
  Distributed systems security 	Electronic voting
  Executable content
  Formal methods for security
  Information flow
  Intrusion detection
  Language-based security 	Network security
  Resource usage control
  Security for mobile computing
  Security models
  Security protocols
  Trust and trust management
* While CSF welcomes submissions beyond these topics, note that the main focus
  of CSF is foundational security: submissions that lack foundational aspects
  risk rejection.
* Proceedings, published by the IEEE Computer Society Press, will be available
  at the symposium, and selected papers will be invited for submission to the
  Journal of Computer Security <> .
* Important Dates
  Papers due: 	Friday, February 6, 2009
  Panel proposals due: 	Thursday, March 6, 2008
  Notification: 	Friday, March 27, 2009
  Camera-ready papers:    	Friday, Apr 24, 2009
  Symposium: 	July 8-10, 2009
* Program Committee
  Martin Abadi
  Michael Backes
  Bruno Blanchet
  Veronique Cortier
  Anupam Datta
  Philippa Gardner
  Andrew D Gordon
  Joshua Gutmann
  Gavin Lowe
  Jon Millen
  John C Mitchell
  Andrew Myers
  Andre Sabelfeld
  Pierangela Samarati
  Vitaly Shmatikov
  Scott D Stoller
* Panel Proposals
  Proposals for panels are welcome. They should be no more than three pages in
  length, and should include the names of possible panelists and an indication
  of which of those panelists have confirmed a desire to participate. They
  should be submitted by email to the program chair.
* Five-minute Talks
  A session of five-minute talks was successful in the last four years, so we
  are likely to have one again in 2009. Abstracts will be solicited around
* Contacts
  General Chair
  Scott D. Stoller
* Program Chair
  John C Mitchell
* Publications Chair
  Jonathan Herzog

             "Conmemorating the Ten Years of HyLo"
   First Call for Papers
   15 - 17 July, 2007
   Nancy, France
  Hybrid logic is a branch of modal logic allowing direct reference
  to worlds/times/states. It is easy to justify interest in hybrid
  logic on the grounds of applications, as the additional expressive
  power is very useful.  In addition, hybrid-logical machinery
  improves the behaviour of the underlying modal formalism.  For
  example, it becomes considerably simpler to formulate modal proof
  systems, and one can prove completeness and interpolation results
  of a generality that is not available in orthodox modal logic.
  But more generally, the topic of HyLo 2009 is not only standard
  hybrid-logical machinery (like nominals, satisfaction operators,
  binders, etc) but also extensions of modal logic that increase
  its expressive power in one way or other.
  HyLo 2009 will be an special event, conmemorating the ten years
  since the organization of the first HyLo workshop in 1999.
  HyLo 2009 will be relevant to a wide range of people, including
  those interested in description logic, feature logic, applied
  modal logics, temporal logic, and labelled deduction. The workshop
  continues a series of previous workshops on hybrid logic. The
  workshop aims to provide a forum for advanced PhD students and
  researchers to present and discuss their work with colleagues and
* For more general background on hybrid logic, and many of the key
  papers, see the Hybrid Logics homepage (
  We invite the contribution of papers reporting new work from
  researchers interested in hybrid logic. Details about the submission
  procedure will be announced in the second call for papers. The accepted
  papers will appear in the workshop proceedings, and selected papers
  will be included in a special volume to conmemorate the 10th aniversary
  of the first Hybrid Logic Workshop.
  One author for each accepted paper must attend the workshop in order to
  present the paper.
  Carlos Areces (INRIA Nancy Grand Est, areces at
  Patrick Blackburn (INRIA Nancy Grand Est, blackbur at
  Carlos Areces (INRIA Nancy Grand Est, co-chair)
  Patrick Blackburn (INRIA Nancy Grand Est, co-chair)
  Thomas Bolander (Technical University of Denmark)
  Torben Brauner (Roskilde University)
  Stephane Demri (LSV Cachan)
  Santiago Figueira (University of Buenos Aires)
  Valentin Goranko (University of the Witwatersrand)
  Ian Hodkinson (Imperial College London)
  Ulrike Sattler (University of Manchester)
  Thomas Schneider (University of Manchester)
  Balder ten Cate (University of Amsterdam)
  Deadline for submissions: Sunday, 1st March 2009
  Notification of acceptance: Monday, 30th of April 2009
  Deadline for final versions: Friday, 1st of May 2009
  Workshop dates: 15 to 17 July, 2007

* Eligible for the 2009 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.2007 and 31.12. 2008.
* The deadline for submission is 15.3.2009.
* Submission details are available at
* 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 laudation
       in the CSL proceedings,
     - travel support to attend the conference.
* The 2009 Ackermann Award will be presented to the recipients at the
  annual conference of the EACSL (CSL'09).
* The jury consists of nine members:
     - The president of EACSL, J. Makowsky (Haifa);
     - The borad-member of EACSL, A. Dawar (Cambridge);
     - One member of the LICS organizing committee, G. Plotkin (Edinburgh);
     - P.-L. Curien (Paris)
     - A. Durand (Paris)
     - J. van Benthem (Amsterdam)
     - M. Grohe (Berlin);
     - M. Hyland (Cambridge);
     - A. Razborov (Moscow and Princeton).
* The jury is entitled to give more than one award per year.
* The previous Ackermann Award recipients were:
  2005: Mikolaj Bojanczyk, Konstantin Korovin, Nathan Segerlind;
  2006: Stefan Milius and Balder ten Cate;
  2007: Dietmar Berwanger, Stephane Lengrand and Ting Zhang.
  2008: Krishnendu Chatterjee
* For the three years 2007-2009,
  the Award is sponsored by Logitech, S.A., Romanel, Switzerland,
  the worlds leading provider of personal peripherals.

  2008 Ackermann Award of the EACSL
  September, 2008
* EACSL Homepage
* Ackermann Award Homepage:
* The Jury of the Ackermann Award has
  decided to give the 2008 Ackermann Awards to
	Krishnendu Chatterjee
  for his thesis
	Stochastic omega-regular games
* I would like to congratulate the recipients and their
  supervisors for their excellent theses.
* Previous Ackermann Award recipients were:
  2005: Mikolaj Bojanczyk, Konstantin Korovin, Nathan Segerlind;
  2006: Stefan Milius and Balder ten Cate;
  2007: Dietmar Berwanger, Stephane Lengrand and Ting Zhang
* The Jury consisted of
  J. van Benthem, B. Courcelle, M. Grohe, M. Hyland,
  J. Makowsky, D. Niwinski, G. Plotkin, A. Razborov.
* The Award Ceremony took place during the CSL'08 Conference.
* A detailed report is published in the CSL'08 Proceedings.
  I would like to thank all the Jury members for their work.

Back to the LICS web page.