Newsletter 124
November  1, 2009

* 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
  FLOC 2010 - Second Announcement
  CAV 2010 - Call for Papers
  ICALP 2010 - Call for Papers
  WOLLIC 2010 - Call for Papers
  AIML 2010 - Call for Papers
  ESORICS 2010 - Call for Papers
  ICTAC 2010 - Call for Papers
  Stochastic Coalgebraic Logic by Ernst-Erich Doberkat
  Presburger Award - Call for Nominations
  Ackermanm Award 2009
  Ackermann Award 2010 - Call for Nominations
  2 Ph.D. Studentships at Oxford and Paris

* PODS 2010
* CAV 2010

  Edinburgh, Scotland, U.K.
  July 9-21, 2010
* In 1996, as part of its Special Year on Logic and Algorithms, DIMACS hosted
  the first Federated Logic Conference (FLoC). It was modeled after the
  successful Federated Computer Research Conference (FCRC), and synergetically
  brought together conferences that apply logic to computer science.  The
  second Federated Logic Conference (FLoC'99) was held in Trento, Italy,
  in 1999, the third (FLoC'02) was held in Copenhagen, Denmark, in 2002, and
  the fourth (FLoC'06) was held in Seattle, Washington, USA.
* We are pleased to announce the fifth Federated Logic Conference (FLoC'10)
  to be held in Edinburgh, Scotland, U.K. (, in July 2010,
  at the School of Informatics at University of Edinburgh (
* The following conferences will participate in FLoC:
  Int'l Conference on Computer-Aided Verification (CAV)
  Int'l Conference on Logic Programming (ICLP)
  Int'l Joint Conference on Automated Reasoning (IJCAR)
  Int'l Conference on Interactive Theorem Proving (ITP)
  IEEE Symposium on Logic in Computer Science (LICS)
  Int'l Conference on Rewriting Techniques and Applications (RTA)
  Int'l Conference on Theory and Applications of Satisfiability Testing (SAT)
* Pre-conference workshops will be held on July 9-10.  ITP, LICS, RTA, and SAT
  will be held in parallel on July 11-14, to be followed by mid-conference
  workshops on July 14-15. CAV, ICLP, and IJCAR will be held in parallel on
  July 16-19, to be followed by post-conference workshops on July 20-21.
  Plenary events involving all the conferences are planned. There will be
  receptions in the Edinburgh Castle and at the National Galleries of Scotland.
* The call for workshop proposals can be found at the FLoC web page
  ( Calls for papers will be issued in the
  near future. For additional information regarding the participating meetings,
  please check the FLoC web page later this summer.
* FLoC'10 Steering Committee:
   - General Chair: Moshe Y. Vardi
   - Conference Co-chairs: Leonid Libkin, Gordon Plotkin
   - CAV Representative: Edmund Clarke
   - ICLP Representative: Manuel Hermenegildo
   - IJCAR Representative: Alan Bundy
   - ITP Representative: Tobias Nipkow
   - LICS Representative: Martin Abadi
   - RTA Representative: Juergen Giesl
   - SAT Representative: Enrico Giunchiglia
   - EasyChair Representative: Andrei Voronkov

  Call for Papers
  July 15 - 19, 2010
  Edinburgh, United Kingdom
* Important Dates
  - Abstract submission: January 11, 2010
  - Paper submission (firm): January 15, 2010
  - Author feedback/rebuttal period: February 26 - March 1, 2010
  - Notification of acceptance/rejection: March 15, 2010
  - Final version due: April 16, 2010
* Aims and Scope
  CAV 2010 is the 22nd in a series dedicated to the advancement of the
  theory and practice of computer-aided formal analysis methods for
  hardware and software systems. This year, CAV is part of the 5th
  International Federated Logic Conference (FLoC 2010), which includes
  CAV and seven other conferences/symposia: CSF, ICLP, IJCAR, ITP, LICS,
  RTA and SAT. More details about FLoC 2010 can be found at
* 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 in System
* Topics of interest include:
  * Model checking techniques
  * Algorithms and tools for verifying models and implementations
  * Hardware verification techniques
  * Hybrid systems and embedded systems verification
  * Program analysis and software verification
  * Modeling and specification formalisms
  * Deductive, compositional, and abstraction techniques for verification
  * Testing and runtime analysis based on verification technology
  * Applications and case studies
  * Verification in industrial practice
  * Formal methods for biological systems
* Invited tutorial speakers
  * Robert Brayton: University of California, Berkeley, US
  * Kenneth Mcmillan: Cadence Berkeley Labs, US
  * Thomas Reps: University of Wisconsin-Madison, US
  * Andrey Rybalchenko: Max Planck Institute, Germany
* Invited speakers
  * Somesh Jha: University of Wisconsin-Madison, US
  * Pasquale Malacaria: Queen Mary University, United Kingdom
  * Maged  Michael: IBM, US
* CAV Award
  An annual award, called the CAV Award, has been established
       "For a specific fundamental contribution
       or a series of outstanding contributions
       to the field of Computer-Aided Verification."
  Nominations are welcome. Please see the Call for Nominations for the CAV
  Award on the conference website.
* Paper Submission
  There are two categories of submissions:
  * A. Regular papers.
  * B. Tool presentations.
  Please follow guidelines on the conference website:
* Program Chairs
  * Byron Cook: Microsoft Research, United Kingdom
  * Paul Jackson: University of Edinburgh, United Kingdom
  * Tayssir Touili: LIAFA-CNRS, France
* Program Committee
  Rajeev Alur: University of Pennsylvania, US
  Domagoj Babic: Synopsys, US
  Christel Baier: Technical University of Dresden, Germany
  Roderick Bloem:	Graz University of Technology, Austria
  Ahmed Bouajjani:  LIAFA-University of Paris 7, France
  Alessandro Cimatti:  FBK-irst, Italy
  Byron Cook: Microsoft Research, United Kingdom
  Javier Esparza: Munich University, Germany
  Azadeh Farzan: University of Toronto, Canada
  Martin Fränzle: University of  Oldenburg, Germany
  Ganesh Gopalakrishnan: University of Utah, US
  Mike Gordon: University of Cambridge, United Kingdom
  Orna Grumberg: Technion, Israel
  Ziyad Hanna:  Jasper, US
  Holger Hermanns: Saarland University, Germany
  Alan Hu: University of British Columbia, Canada
  Paul Jackson: University of Edinburgh, United Kingdom
  Kevin Jones: Green Plug, US
  Vineet Kahlon: NEC Labs, US
  Jean Krivine: Institut des Hautes Etudes Scientifiques, France
  Daniel Kroening: Oxford University, United Kingdom
  Sava Krstic: Intel Corporation, US
  Marta Kwiatkowska: Oxford University, United Kingdom
  Kenneth McMillan: Cadence, US
  David Monniaux: VERIMAG-CNRS, France
  Markus Müller-Olm: Muenster University, Germany
  Kedar Namjoshi: Bell Labs, US
  Doron Peled: Bar Ilan University, Israel
  Amir Pnueli: New York University, US
  Shaz Qadeer: Microsoft Research, US
  Jean-Francois Raskin: Brussels University, Belgium
  Natasha Sharygina: University of Lugano, Switzerland
  Tayssir Touili:  LIAFA-CNRS, France
  Helmut Veith: University of Darmstadt, Germany
  Kwangkeun Yi: Seoul National University, Korea
  Karen Yorav: IBM Haifa, Israel
  Greta Yorsh: IBM, US

  Call for Papers
  July 5 12, 2010, Bordeaux, France
* Important Dates:
  Submission Deadline: Feb 10, 2010
  Author Notification: Apr 6, 2010
  Final Manuscript Due: Apr 27, 2010
* The 37th 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 2010 in Bordeaux, France. The main
  conference will be preceded and followed by a series of Workshops.
* Papers presenting original research on all aspects of theoretical
  computer science are sought. Typical but not exclusive topics of
  interest are:
  Track A  Algorithms, Complexity and Games
  Topics: Algorithmic Game Theory - Approximation Algorithms -
    Combinatorics in Computer Science - Computational Biology -
    Computational Complexity - Computational Geometry - Cryptography -
    Data Structures - Design and Analysis of Algorithms - Internet
    Algorithmics - Machine Learning - Parallel, Distributed and External
    Memory Computing - Randomness in Computation - Quantum Computing
  Track B  Logic, Semantics, and Theory of Programming
    Topics: Algebraic and Categorical Models - Automata Theory, Formal
    Languages - Non-standard Approaches to Computability - Databases,
    Semi-Structured Data and Finite Model Theory - Principles of
    Programming Languages - Logics, Formal Methods and Model Checking -
    Models of Concurrent, Distributed, and Mobile Systems - Models of
    Reactive, Hybrid and Stochastic Systems - Program Analysis and
    Transformation - Specification, Refinement and Verification - Type
    Systems and Theory, Typed Calculi
  Track C  Foundations of Networked Computation: Models, Algorithms and Information Management
    Topics: Algorithmic Aspects of Networks - Auctions - Computing with
    Incentives - E-commerce, Privacy, Spam - Formal Methods for Network
    Information Management - Foundations of Trust and Reputation in
    Networks - Internet Algorithmics - Mobile and Wireless Networks -
    Models of Complex Networks · Models and Algorithms for Global
    Computing - Models of Mobile Computation - Networks Economics -
    Networks of Low Capability Devices - Overlay Networks and P2P Systems
    - Social Networks - Specification, Semantics, Synchronization of
    Networked Systems - Theory of Security in networks and Distributed
    Computing - Web Searching, Ranking · Web Mining and Analysis
* Invited Speakers:
 - Pierre Fraigniaud (CNRS and Univ. Paris Diderot)
 - Jean Goubault-Larrecq (ENS Cachan and LSV)
 - Burkhard Monien (Univ. Paderborn)
 - Joel Ouaknine, (Oxford Univ. Computing Lab.)
 - Roger Wattenhofer (ETH Zurich)
 - Emo Welzl (ETH Zurich)
* Program Committees: Track A.  Algorithms, Complexity and Games
  - Dimitris Achlioptas, Univ. Santa Cruz
  - Kwstis Daskalakis, MIT
  - Anuj Dawar, Cambridge Univ.
  - Xiaotie Deng, City Univ. Hong Kong
  - Philippe Flajolet, INRIA
  - Micelle Flammini, Univ. L\'Acquilla
  - Oscar Ibarra, UCSB (Santa Barbara)
  - Giuseppe Italiano, Univ. Roma 2
  - Kazuo Iwama, Univ. Kyoto
  - Klaus Jansen, Univ. Kiel
  - Elias Koutsoupias, Univ. Athens
  - Ludek Kucera, Charles Univ.
  - Daniel Marx, Budapest Univ.
  - Burkhard Monien, U Paderborn
  - Amin Coja Oghlan, Univ. Edinburgh
  - Tonyann Pitassi, Univ. Toronto
  - John Reif, Duke Univ.
  - Jose Rolim, Univ. Geneva
  - Paul Spirakis, Univ. Patras and RACTI (PC Chair)
  - Leslie Valiant, Harvard Univ.
  - Emo Welzl, ETH · Gerhard Woeginger, Univ. Eindhoven
  Track B  Logic, Semantics, and Theory of Programming
  - Samson Abramsky, Oxford Univ. (PC Chair)
  - Luca Aceto, Univ. Rejkjavik
  - Lars Birkedal, Univ. Copenhagen
  - Mikolaj Bojanczyk, Univ. Warsaw
  - Patricia Bouyer, CNRS, LSV Cachan
  - José Desharnais, Univ. Laval e
  - Gilles Dowek, Ecole Polytechnique & INRIA
  - Manfred Droste, Univ. Leipzig
  - Peter Dybjer, Univ. Chalmers
  - Jose Felix Costa, Univ. Lisbon
  - Phokion Kolaitis, IBM Almaden
  - Ugo dal Lago, Univ. Bologna
  - Daniel Leivant, Univ. Indiana
  - Andrzej Murawski, Oxford Univ.
  - Filip Murlak, Univ. Edinburgh
  - Flemming Nielsen, Univ. Copenhagen
  - Dominique Perrin, Univ. Paris Est
  - Alex Rabinovich, Univ. Tel Aviv
  - Lutz Schroder, Univ. Bremen
  - Ian Stark, Univ. Edinburgh
  Track C  Foundations of Networked Computation: Models, Algorithms and Information Management
  - Debora Donato, Yahoo! Research Barcelona
  - Faith Ellen, Univ. Toronto
  - Phil Gibbons, Intel Research Pittsburgh
  - Rob van Glabbeek, Stanford Univ. and National ICT Australia
  - Monika Henzinger, EPFL Lausanne
  - Christos Kaklamanis, Univ. of Patras
  - Fabian Kuhn, MIT
  - Miroslaw Kutylowski, Univ. Wroclaw
  - Christian Lengauer, Univ. Passau
  - Stefano Leonardi, Sapienza Univ. of Rome
  - Friedhelm Meyer auf der Heide, Univ. Paderborn (PC chair)
  - Dusko Pavlovic, Oxford Univ. and Kestrel Institute
  - Andrzej Pelc, Univ. du Quebec en Outaouais
  - Giuseppe Persiano, Univ. Salerno
  - Frank Pfenning, CMU
  - Geppino Pucci, Univ. Padova
  - Christian Scheideler, Univ. Paderborn
  - Nir Shavit, Tel Aviv Univ.
  - Berthold Vocking, RWTH Aachen o
  - Gerhard Weikum, MPI-Saarbrucken

  Call for Papers
  July 6th to 9th, 2010
  Universidade de Brasília, Brasília, Brazil
* Important Dates*
  February 28, 2010: Paper title and abstract deadline
  March 7, 2010: Full paper deadline (firm)
  April 12, 2010: Author notification
  May 3, 2010: Final version deadline (firm)
* 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
  Seventeenth WoLLIC will be held in Brasília, Brazil, from July 6th to 9th,
  2010. It is sponsored by the Association for Symbolic
  Logic<> (ASL),
  the Interest Group in Pure and Applied Logics
  <> (IGPL),
  the The Association for Logic, Language and
  Information<> (FoLLI),
  the European Association for Theoretical Computer
  Science<> (EATCS),
  the Sociedade Brasileira de Computação <> (SBC), and
  the Sociedade Brasileira de Lógica <> (SBL).
* Special Event
  2010 will mark the 50-th anniversary of the first publication of Paul
  Halmos' classic book *Naïve Set Theory* by Springer Verlag. WoLLIC will
  celebrate this by screening the documentary about Paul Halmos which was
  directed by George Csicsery: "I want to be a mathematician. A conversation
  with Paul Halmos"
* Paper submission*
  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
  the WoLLIC 2010 EasyChair website. (Please go to for instructions.) A title
  and single-paragraph abstract should be submitted by February 28, and the
  full paper by March 7 (firm date). Notifications are expected by April 12,
  and final papers for the proceedings will be due by May 3 (firm date).
* Invited Speakers*
  - Marcelo Finger* <>
  - Michiel van Lambalgen* <>
  - Johann (Janos) Makowsky* <>
  - Sebastiaan Terwijn <>*
* Programme Committee
  - Verónica Becher* <> (Buenos
  - Raffaella Bernardi* <> (Bolzano)
  - Ricardo Bianconi* <> (São Paulo)
  - Vasco Brattka* <> (Cape Town)
  - Balder ten Cate* <> (ENS, Cachan)
  - Bob Coecke* <> (Oxford)
  - Adriana Compagnoni* <> (Stevens)
  - Marcelo Coniglio* <> (Campinas)
  - Anuj Dawar* <> (Cambridge), chair
  - Valentin Goranko* <> (Copenhagen)
  - Masahito Hasegawa* <> (Kyoto U,
  - Rosalie Iemhoff* <> (Utrecht)
  - Makoto Kanazawa* <> (National
    Institute of Informatics, Japan)
  - Giuseppe Longo* <> (CNRS & ENS, Paris)
  - Mike Mislove* <> (Tulane)
  - Michael Norrish* <> (NICTA,
  - Bart Selman* <> (Cornell)
  - Scott Weinstein* <> (Penn)

  First Call for Papers
  Steklov Mathematical Institute,
  August 25-29, 2010
  Full papers submission deadline: 16 March 2010
  Full papers acceptance notification: 21 May 2010
  Short presentations submission deadline: 1 June, 2010
  Short presentations acceptance notification: 21 June, 2010
  Final version of full papers and abstracts due: 30 June 2010
  Conference: 25-29 August, 2010.
* Advances in Modal Logic is an initiative aimed at presenting
  the state of the art in modal logic and its various applications. The
  initiative consists of a conference series together with volumes based on
  the conferences. Information about the AiML series can be obtained at  . AiML-2010 is the eighth
  conference in the series.
  We invite submission on all aspects of modal logics, including:
  - history of modal logic
  - philosophy of modal logic
  - applications of modal logic
  - computational aspects of modal logic
     + complexity and decidability of modal and temporal logics
     + modal and temporal logic programming
     + model checking
     + theorem proving for modal logics
  - theoretical aspects of modal logic
     + algebraic  and categorical perspectives on modal logic
     + coalgebraic modal logic
     + completeness and canonicity
     + correspondence and duality theory
     + many-dimensional modal logics
     + modal fixed point logics
     + model theory of modal logic
     + proof theory of modal logic
  - specific instances and variations of modal logic
     + description logics
     + dynamic logics and other process logics
     + epistemic and deontic logics
     + modal logics for agent-based systems
     + modal logic and game theory
     + modal logic and grammar formalisms
     + provability and interpretability logics
     + spatial and temporal logics
     + hybrid logic
     + intuitionistic logic
     + substructural logics
  Carlos Areces               (INRIA, Nancy-Grand Est, France)
  Philippe Balbiani           (IRIT, Toulouse, France)
  Alexandru Baltag            (University of Oxford, UK)
  Lev Beklemishev             (Moscow State University, Russia)
  Johan van Benthem           (ILLC, University of Amsterdam, The Netherlands)
  Guram Bezhanishvili         (New Mexico State University, USA)
  Torben Brauner              (Roskilde University, Denmark)
  Patrick Blackburn           (INRIA, Nancy-Grand Est, France)
  Balder ten Cate             (LSV, ENS Cachan, France)
  Stephane Demri              (LSV, ENS Cachan, France)
  Melvin Fitting              (Lehman College, CUNY, USA)
  Silvio Ghilardi             (University of Milano, Italy)
  Robert Goldblatt            (Victoria University of Wellington, New Zealand)
  Rajeev Gore                 (The Australian National University, Australia)
  Andreas Herzig              (IRIT, Toulouse, France)
  Ian Hodkinson               (Imperial College London, UK)
  Wiebe van der Hoek          (University of Liverpool, UK)
  Rosalie Iemhoff             (University of Utrecht, The Netherlands)
  Alexander Kurz              (University of Leicester, UK)
  Martin Lange                (Ludwig-Maximilians University, Munich, Germany)
  Carsten Lutz                (University of Bremen, Germany)
  Larisa Maksimova            (Sobolev Inst. of Mathematics, Novosibirsk, Russia)
  Edwin Mares                 (Victoria University of Wellington, New Zealand)
  Larry Moss                  (Indiana University, USA)
  Martin Otto                 (Technical University of Darmstadt, Germany)
  Dirk Pattinson              (Imperial College London, UK)
  Mark Reynolds               (University of Western Australia, Australia)
  Renate Schmidt              (University of Manchester, UK)
  Nobu-Yuki Suzuki            (Shizuoka University, Japan)
  Yde Venema                  (ILLC, University of Amsterdam, The Netherlands)
  Igor Walukiewicz            (LABRI, Bordeaux, France)
  Frank Wolter                (University of Liverpool, UK)
  Michael Zakharyaschev       (Birkbeck College, London, UK)
  Valentin Shehtman (Moscow State University, Russia)
  Valentin Goranko (Technical University of Denmark, Denmark)

  Call for Papers
  20-22 September 2010
  Hotel AMARILIA, Vouliagmeni, Athens, Greece
  - Submission of papers: April 1, 2010
  - Notification to authors: June 10, 2010
  - Camera-ready copies: June 30, 2010
* ESORICS is the annual European research event in Computer Security. The
  Symposium started in 1990 and has been held in several European
  countries, attracting a wide international audience from both the
  academic and industrial communities.
* Papers offering novel research contributions in computer security are
  solicited for submission to the Symposium. The primary focus is on
  original, high quality, unpublished research and implementation
  experiences. We encourage submissions of papers discussing industrial
  research and development.
* Papers should focus on topics such as:
  - Access Control
  - Accountability
  - Anonymity
  - Applied Cryptography
  - Attacks and Viral Software
  - Authentication and Delegation
  - Data Integrity
  - Database Security
  - Inference Control
  - Identity Management
  - Information Flow Control
  - Intrusion Tolerance
  - Formal Security Methods
  - Language-based Security
  - Network Security
  - Privacy Enhancing Technologies
  - Risk Analysis and Management
  - Secure Electronic Voting
  - Security Architectures
  - Security Economics
  - Security for Mobile Code
  - Security for Dynamic Coalitions
  - Security in Location Services
  - Security in Social Networks
  - Security Models
  - Security Verification
  - System Security
  - Trust Models and Management
  - Trust Theories
  - Trustworthy User Devices
  Sokratis Katsikas, University of Piraeus (GR)
  Dimitris Gritzalis, AUEB (GR)
  Bart Preneel, K.U. Leuven (B)
  V. Atluri, Rutgers University (US)
  M. Backes, Saarland University and MPI-SWS (D)
  F. Bao, Institute for Infocomm Research (SG)
  J. Biskup, University of Dortmund (D)
  C. Blundo, Universita' di Salerno (I)
  X. Boyen, Stanford University (US)
  J. Camenisch, IBM Research Zurich (CH)
  S. Capkun, ETH Zurich (CH)
  R. Clayton, Cambridge University (UK)
  V. Cortier, LORIA-CNRS (F)
  F. Cuppens, IT TELECOM Bretagne (F)
  G. Danezis, Microsoft Research (UK)
  S. De Capitani di Vimercati, Universita' degli Studi di Milano (I)
  C. Diaz, K.U.Leuven (B)
  S. Foley, University College Cork (IE)
  C. Fournet, Microsoft Research (UK)
  D. Frincke, Pacific Northwest National Lab (US)
  D. Kesdogan, University of Siegen (D)
  D. Gollmann, Hamburg Univ. of Technology (D)
  T. Holz, Vienna University of Technology (A)
  B. Jacobs, University of Nijmegen (NL)
  S. Jajodia, George Mason University (US)
  T. Karygiannis, NIST (US)
  S. Katzenbeisser, T.U. Darmstadt (D)
  A. Kiayias, University of Athens (GR)
  M. Kudo, IBM Research Tokyo (J)
  K. Kursawe, Philips Research (NL)
  C. Lambrinoudakis, University of Piraeus (GR)
  J. Lopez, University of Malaga (E)
  W. Lee, Georgia Institute of Technology (US)
  I. Mavridis, University of Macedonia (GR)
  C. Mitchell, University of London (UK)
  J. Mitchell, Stanford University (US)
  A. Oprea, RSA Laboratories (US)
  R. Perlman, SUN Microsystems (US)
  A. Pfitzmann, T.U. Dresden (D)
  B. Pinkas, University of Haifa (IL)
  P. Ryan, University of Luxembourg (LU)
  M. Reiter, University of North Carolina (US)
  R. Safavi-Naini, University of Calgary (CA)
  P. Samarati, Universita' degli Studi di Milano (I)
  E. Snekkenes, Gjovik University College (NO)
  G. Spanoudakis, City University London (UK)
  I. Stamatiou, University of Ioannina (GR)
  P. Syverson, Naval Research Laboratory (US)
  B. Tsoumas, Ernst & Young and AUEB (GR)
  M. Waidner, IBM Corporation (US)
  D. Westhoff, HAW Hamburg (D)
  Nikolaos Kyrloglou, ACCI (GR)
  Marianthi Theoharidou, AUEB (GR)
  Sara Foresti, Universita' degli Studi di Milano (I)

  First Call for Papers
  Natal, Rio Grande do Norte, Brazil
  1-3 September, 2010
* Important Dates
  Submission of abstracts: March 08th, 2010;
  Submission deadline: March 15th, 2010;
  Notification of results: April 30th, 2010;
  Final version: May 16th, 2010
* Background and Objectives
  ICTAC  is  an  International  Colloquium  on  Theoretical  Aspects  of
  Computing  created   by  the  International   Institute  for  Software
  Technology of the United Nations University (UNU-IIST). The aim of the
  colloquium  is to  bring together  practitioners and  researchers from
  academia,  industry and  government to  present research  results, and
  exchange  experience,  ideas  and  solutions  for  their  problems  in
  theoretical  aspects  of  computing.  Beyond  these  scholarly  goals,
  another main  purpose of the  conference is to promote  cooperation in
  research  and education between  participants and  their institutions,
  from developing  and industrial  countries, as in  the mandate  of the
  United Nations University. The previous  six ICTAC events were held in
  Guiyang, China  (2004), Hanoi, Vietnam (2005),  Tunis, Tunisia (2006),
  Macau  (2007), Istanbul,  Turkey (2008)  and Banji  Selangor, Malaysia
  (2009).  ICTAC 2010  includes two  special tracks:  a track  on Formal
  Approaches to Testing, chaired by  Marie-Claude Gaudel, and a track on
  the Grand Challenge in Verified Software, chaired by Jim Woodcock.
* The topics of the conference include, but are not limited to the following.
  - automata theory and formal languages
  - principles and semantics of programming languages
  - logics and their applications
  - software architectures and their description languages
  - software specification, refinement, verification and testing,
  - model checking and theorem proving
  - formal techniques in software testing
  - models of object and component systems
  - coordination and feature interaction
  - integration of  theories, formal  methods and tools  for engineering
    computing systems
  - service-oriented development
  - service-oriented architectures: models and development methods
  - document-driven development
  - models of concurrency, security, and mobility
  - theory of parallel, distributed, and grid computing
  - real-time, embedded and hybrid systems
  - type and category theory in computer science
  - case studies, theories, tools and experiments of verified systems
  - domain-specific  modeling and  technology: examples,  frameworks and
* ICTAC 2010 will be held in Brazil, in the city of Natal, Rio Grande do
  Norte.   It will  be organized  jointly with  the 3rd  edition  of the
  Pernambuco  School on  Software  Engineering, to  be  held in  Recife,
  Pernambuco, on the the topic of Formal Component Based Development and
  Coordination.  ICTAC   2010  will  include   tutorials  and  technical
* Invited Speakers
  Paulo  Borba (Universidade Federal de Pernambuco, Brazil)
  Wolfram  Schulte (Microsoft Research)
* Special Tracks Chairs
  Marie-Claude Gaudel, France
  Jim Woodcock, UK
* Program Committee
  Bernhard Aichernig, Austria
  Keijiro Araki, Japan
  Jonathan Bowen, UK
  Christiano Braga, Brazil
  Michael Butler, UK
  Andrew Butterfield, UK
  Ana Cavalcanti, UK (chair)
  Jim Davies, UK
  David Deharbe, Brazil (chair)
  John Fitzgerald, UK
  Wan Fokkink, Netherlands
  Pascal Fontaine, France
  Marcelo Frias, Argentina
  Lindsay Groves, New Zealand
  Michael Hansen, Denmark
  Robert Hierons, UK
  Monzoo Kim, South Korea
  Maciej Koutny, UK
  Pascale Le Gall, France
  Martin Leucker, Germany
  Zhiming Liu, Macao
  Patricia Machado, Brazil
  Marius Minea, Romania
  Ali Mili, USA
  Michael Mislove, USA
  Tobias Nipkow, Germany
  Jose Nuno Oliveira, Portugal
  Paritosh Pandya, India
  Alberto Pardo, Uruguay
  Anders P Ravn, Denmark
  Leila Ribeiro, Brazil
  Markus Roggenbach, UK
  Augusto Sampaio, Brazil
  Bernhard Schaetz, Germany
  Gerhard Schellhorn, Germany
  Emil Sekerinski, Canada
  Natarajan Shankar, USA
  Marjan Sirjani, Iran
  Jin Song Dong, Singapore
  Dang Van Hung, Vietnam
  Daniel Varro, Hungary
  Helmut Veith, Germany
  Ji Wang, China
  Martin Wirsing, Germany
  Burkhart Wolff, France
  Husnu Yenigun, Turkey
  Naijun Zhan, China

  28. - 29. August, 2010
  Logic, Combinatorics and Computation in finite and infinite
  structures is a satellite workshop of the joint conferences
  Mathematical Foundations of Computer Science  &  Computer Science Logic
  Brno, Czech Republic, 23-27 August 2010.
* Organizers
  B. Courcelle,
  P. Hlin~ný, ;
  J. Makowsky,
* Presentation and topics (The following list is not limitative)
  - Logical expression of graph properties, graph decompositions, graph
      transformations and related notions.
  - Logical expression of properties of matroids, isotropic systems,
      graph drawings and knots.
  - Counting and enumeration problems.
  - Polynomials associated with graphs and other combinatorial structures.
  - Combinatorics in games, 0/1 laws and randomized computations
  - Constraint satisfaction problems and other logically based algorithmic problems.
  - Finite descriptions of infinite structures.
  - Proof complexity.
  Lectures will be surveys or presentations of technical results.
* Full articles based on the presentations may be submitted to the
  excellent electronic and freely accessible journal:
    Logical Methods in Computer Science
    (B. Courcelle is member of its editorial board).
* Contact B. Courcelle for suggestions, for receiving further information, for proposing to deliver a lecture.

  Stochastic Coalgebraic Logic.
  Ernst-Erich Doberkat (Technische Universität Dortmund, Germany)
  EATCS Monographs in Theoretical Computer Science.
  ISBN 978-3-642-02994-3,
  ca. 245 pp., 11/2009, Euro 79.95, US$ 99.00
* Coalgebraic logic is an important research topic in the areas of
  concurrency theory, semantics, transition systems and modal logics. It
  provides a general approach to modeling systems, allowing us to apply
  important results from coalgebras, universal algebra and category
  theory in novel ways. Stochastic systems provide important tools for
  systems modeling, and recent work shows that categorical reasoning may
  lead to new insights, previously not available in a purely
  probabilistic setting.
* This book combines coalgebraic reasoning, stochastic systems and
  logics. It provides an insight into the principles of coalgebraic
  logic from a categorical point of view, and applies these systems to
  interpretations of stochastic coalgebraic logics, which include
  well-known modal logics and continuous time branching logics. The
  author introduces stochastic systems together with their probabilistic
  and categorical foundations and gives a comprehensive discussion of
  the Giry monad as the underlying categorical construction, presenting
  many new, hitherto unpublished results. He discusses modal logics,
  introduces their probabilistic interpretations, and then proceeds to
  an analysis of Kripke models for coalgebraic logics.
* Table of Contents
  - Borel Sets, Measures and All That;
  - Modal Logics;
  - The Giry Monad: Randomized Morphisms;
  - Coalgebraic  Logic; Logics: The Grammars;
  - References;
  - List of Symbols;
  - Index
* For more details see

  Call for Nominations
* Starting in 2010, the European Association of Theoretical Computer
  Science (EATCS) confers each year at the conference ICALP the
                      Presburger Award
  to a young scientist (in exceptional cases to several young
  scientists) for outstanding contributions in theoretical computer
  science, documented by a published paper or a series of published
* The award is named after Mojzesz Presburger who accomplished his
  path-breaking work on decidability of the theory of addition (which
  today is called Presburger arithmetic) as a student in 1929.
* Nominations for the Presburger Award can be submitted by any member
  or group of members of the theoretical computer science community
  except the nominee and his/her advisors for the master thesis and the
  doctoral dissertation. Nominated scientists have to be at most 35
  years at the time of the deadline of nomination (i.e., for the
  Presburger Award of 2010 the date of birth should be in 1974 or
* The Presburger Award Committee of 2010 consists of
  - Stefano Leonardi (Rome),
  - Andrzej Tarlecki (Warsaw), and
  - Wolfgang Thomas (Aachen, chair).
* Nominations, consisting of a two page justification and (links to)
  the respective papers, should be sent to
    Wolfgang Thomas,
    RWTH Aachen,
    Informatik 7,
    52056 Aachen, Germany
* Deadline: 31st December 2009.

* The Ackermann Award 2009 was presented at CSL'09,
  held in Coimbra (Portugal) in September 2009.
* Jury report
  Eligible for the 2009 Ackermann Award were 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 Jury received 12 nominations for the Ackermann Award 2009.
  The candidates came from 10
  different nationalities from Europe, North America and Asia
  and received their PhDs in 9 different
  countries in Europe and North America.
  The topics covered the full range of Logic and Computer Science
  as represented by the LICS and CSL Conferences.
  All the submissions were of very high standard and contained
  outstanding results in their particular domain.
  In the past the Jury reached a consensus to give more than one award.
  This time, in spite of the extreme high quality of the nominated theses,
  the Jury decided finally, to give for the year 2009 only one award.
* The 2009 Ackermann Award laureate is
	Jakob Nordstrom
  for his thesis
	Short Proofs May Be Spacious:
	Understanding Space in Resolution
  issued by the Royal Institute of Technology, Stockholm, Sweden, May 2008,
  supervised by Prof. Johan Hastad.
* Citation
  Jakob Nordstrom receives the 2009 Ackermann Award
  of the European Association of Computer Science Logic (EACSL)
  for his thesis "Short Proofs May Be Spacious: Understanding Space in
  Resolution". The thesis greatly advances our understanding of
  space-related measures in proof complexity. It completely fills the last
  remaining gap in the picture of most basic relations between
  space and other fundamental complexity measures like length or
  width for the system of propositional resolution.
  The result confirms that space is indeed an inherently independent
  measure by exhibiting natural contradictions possessing very short
  and narrow refutations but no low-space refutation.
  This solution of a well-known open problem complements and contrasts with
  previously known simulations in the opposite direction.
* More information is available at the EACSL websites and
* The 2009 Ackermann Award was sponsored by LOGITECH.

  Call for Nominations
* Eligible for the 2010 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.2008 and 31.12. 2009.
* Submission details are available at
* The deadline for submission is
		March 15, 2010
  Nominations can be submitted from  January 1, 2010 on and should be sent
  to the chairman of the Jury by e-mail:
* 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 2010 Ackermann Award will be presented to the recipients at the
  annual conference of the EACSL (CSL'10) in Brno (Czech Republic)
  to be held 23-27 August 2010,
* The jury consists of 10 members:
     - The member of the board of EACSL as chairman of the Jury, J. Makowsky (Haifa)
     - The president of EACSL, D. Niwinski (Warsaw)
     - The vice-president of EACSL, A. Dawar (Cambridge)
     - One member of the LICS organizing committee, G. Plotkin (Edinburgh)
     - R. Alur (Philadelphia)
     - A. Atserias (Barcelona)
     - T. Coquand (Goeteborg)
     - P.-L. Curien (Paris)
     - A. Durand (Paris)
     - J. van Benthem (Amsterdam and Stanford)
* 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
  2009: Jakob Nordstrom
* For the three years 2010-2012,
  the Award is sponsored by the Kurt Goedel Society

* The University of Oxford and the University of Paris 7 announce two
  studentships on Logical Aspects of Complexity, under the auspices of
  the EU Marie Curie Network Mathematical Logic and Applications (MALOA):
* One studentship will be at Oxford and the other at Paris, funded for
  3 years starting in fall of 2010, at EU levels.  Participating
  researchers include Stephan Kreutzer and Michael Benedikt at Oxford
  and Arnaud Durand at Paris. Any student with an interest in logic and
  computational complexity theory should consider these positions.
* The network supports students whose primary institution is distinct
  from their nation of residence: thus a student hosted at Oxford must
  not be a UK national and the student hosted in Paris should not be a
  French national.  However as part of the studentship, the student will
  have extended visits at another network institution: the student in
  Paris would likely spend some time at Oxford and vice versa.
* The eligibility rules are spelled out at:
* Please contact Stephan Kreutzer (,
  Michael Benedikt ( or Arnaud Durand
  ( for more information, including details
  of the application process.
* Applications received by March 1 2010 will receive first priority.

Back to the LICS web page.