Newsletter 125
January  1, 2010

* 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
  body to

  LICS deadline
  Upcoming deadlines
  LICS 2010 - Final Call for Papers
  IJCAR 2010 - Call for Papers
  ITP 2010 - Call for Papers
  CIE 2010 - Call for Papers
  GALOP 2010 - Call for Papers
  ICLP 2010 - Call for Papers
  MEMOCODE 2010 - Call for Papers
  CSL 2010 - Call for Papers
  ASPOCP 2010 - Call for Papers
  CLODEM 2010 - Call for Papers
  HYLO 2010 - Call for Papers
  Verification of Sequential and Concurrent Programs by Apt, de Boer and Olderog
  2 Ph.D. Studentships at Oxford and Paris

* A happy new year to all of you who have celebrated the change of
  year just now.
* Remember that the LICS abstract deadline is approaching fast.
  I am sure you are all busy preparing your LICS submissions, so do
  not forget to register your abstract before or on the 10th of January.

* CAV 2010
* CiE
* GALOP 2010
* CSL 2010
* ASPOCP 2010
* CLODEM 2010
* HYLO 2010

                          CALL FOR PAPERS
               July 11-14, 2010, Edinburgh, Scotland, UK
* Important Dates:
  Titles & Short Abstracts Due: January 10, 2010
  Extended Abstracts  Due:      January 17, 2010
  Author Notification:          March 21, 2010
  Camera-ready Papers Due:      April 29, 2010
* 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 in connection with logic,
  automated deduction, categorical models and logics, concurrency and
  distributed computation, constraint programming, constructive
  mathematics, database theory, decidable theories, domain theory,
  finite model theory, first-order logic, formal aspects of program
  analysis, formal methods, game semantics, 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.
* LICS 2010 will be organized as part of the "Fifth Federated Logic
  Conference" (FLoC) 2010 to be held in Edinburgh from July 9 to 21.
  For information regarding FLoC 2010 and the participating meetings,
  please visit
* 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 at midnight (GMT); late submissions will not be possible.
  Submission will be open at
* Short Presentations:
  LICS 2010 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 2010 submission site in a time frame to
  be advertised on the LICS 2010 website.
* 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 committee may decline to make
  the award or split it among several papers.
* Program Committee:
  Program Chair:
   Jean-Pierre Jouannaud
   INRIA and Tsinghua University, Beijing, China
  Program Committee:
   Parosh Abdullah, Uppsala University
   Albert Atserias, Univ. Politecnica de Catalunya
   Franz Baader, Technische Universitaet Dresden
   Krishnendu Chatterjee, IST, Vienna
   Yijia Chen, Jiao Tong University, Shanghai
   Veronique Cortier, CNRS and Universite de Nancy
   Vincent Danos, University of Edinburgh
   Martin Escardo, University of Birmingham
   Javier Esparza, Technische Universitaet Muenchen
   Amy Felty, University of Ottawa
   Herman Geuvers, Radboud University Nijmegen
   Dan Ghica, University of Birmingham
   Robert Harper, Carnegie Mellon University
   Jean-Pierre Jouannaud, INRIA and Tsinghua Univ.
   Naoki Kobayashi, Tohoku University, Sendai
   Orna Kupferman, Hebrew University, Jerusalem
   Stephane Lengrand, CNRS and Polytechnique
   Jose Meseguer, UI at Urbana-Champaign
   John Mitchell, Stanford University
   Eugenio Moggi, Universita di Genova
   Anca Muscholl, Universite de Bordeaux
   Mogens Nielsen, University of Aarhus
   Makoto Tatsuta, NII, Tokyo
   Wolfgang Thomas, RWTH Aachen
   Pawel Urzyczyn, Warsaw University
   Victor Vianu, UC at San Diego

                          Call for Papers
                  Edinburgh, UK, July 16-19, 2010
    as part of FLoC 2010 - Federated Logic Conference
* Important dates:
  Abstract submission deadline:                     January 15, 2010
  Paper submission deadline:                        January 22, 2010
  Notification of paper decisions:                    March 15, 2010
  Final version of papers due:                        April 19, 2010
  Conference dates:                                 July 16-19, 2010
* IJCAR is the premier international joint conference on all topics
  in automated reasoning. The IJCAR technical program will consist
  of presentations of high-quality original research papers,
  system descriptions, and invited talks.
* IJCAR 2010 is a merger of leading events in automated reasoning:
  CADE (Conference on Automated Deduction),
  FroCoS (Workshop on Frontiers of Combining Systems),
  FTP (Workshop on First-order Theorem Proving), and
  TABLEAUX (Conference on Analytic Tableaux and Related Methods)
* IJCAR 2010 invites submissions related to all aspects of automated
  reasoning, including foundations, implementations, and applications.
  Original research papers and descriptions of working automated deduction
  systems are solicited.
* The proceedings of IJCAR 2010 will be published by Springer-Verlag in
  the LNAI/LNCS series.
  Submission details: Submission is electronic, through
* Authors are strongly encouraged to use LaTeX and the Springer "llncs"
  format, which can be obtained from
  The page limit is 15 pages for full papers, and 7 pages for system
* Program co-chairs:
  Juergen Giesl (RWTH Aachen University, Germany)
  Reiner Haehnle (Chalmers University of Technology, Sweden)
* Conference chair:
  Alan Bundy (University of Edinburgh, UK)
* Student Travel Awards:
  Travel awards will be available to enable selected students to attend the
  conference. Details will be published in March 2010.
* Program Committee:
 Carlos Areces (INRIA Nancy Grand Est, France)
 Alessandro Armando (University of Genova, Italy)
 Franz Baader (Technical University of Dresden, Germany)
 Peter Baumgartner (NICTA Canberra, Australia)
 Bernhard Beckert (University of Koblenz, Germany)
 Christoph Benzmueller (International University Bruchsal, Germany)
 Nikolaj Bjorner (Microsoft Research, USA)
 Maria Paola Bonacina (Universita` degli Studi di Verona, Italy)
 Alan Bundy (University of Edinburgh, UK)
 Gilles Dowek (Ecole Polytechnique, France)
 Christian Fermueller (Vienna University of Technology, Austria)
 Ulrich Furbach (University of Koblenz, Germany)
 Didier Galmiche (LORIA Nancy, France)
 Silvio Ghilardi (University of Milano, Italy)
 Martin Giese (University of Oslo, Norway)
 Juergen Giesl (RWTH Aachen University, Germany)
 Rajeev Gore (The Australian National University, Australia)
 Bernhard Gramlich (Vienna University of Technology, Austria)
 Reiner Haehnle (Chalmers University of Technology, Sweden)
 Ullrich Hustadt (University of Liverpool, UK)
 Deepak Kapur (University of New Mexico, USA)
 Viktor Kuncak (EPFL Lausanne, Switzerland)
 Rustan Leino (Microsoft Research, USA)
 Carsten Lutz (University of Bremen, Germany)
 George Metcalfe (University of Bern, Switzerland)
 Aart Middeldorp (University of Innsbruck, Austria)
 Neil Murray (University at Albany - SUNY, USA)
 Tobias Nipkow (Technical University of Munich, Germany)
 Nicola Olivetti (LSIS, University of Aix-Marseille, France)
 Nicolas Peltier (LIG Grenoble, France)
 Frank Pfenning (Carnegie Mellon University, USA)
 Brigitte Pientka (McGill University, Canada)
 Andre Platzer (Carnegie Mellon University, USA)
 Christophe Ringeissen (LORIA Nancy, France)
 Albert Rubio (UPC Barcelona, Spain)
 Renate Schmidt (The University of Manchester, UK)
 Carsten Schuermann (IT University of Copenhagen, Denmark)
 Roberto Sebastiani (University of Trento, Italy)
 Viorica Sofronie-Stokkermans (MPI-INF Saarbruecken, Germany)
 Aaron Stump (University of Iowa, USA)
 Geoff Sutcliffe (University of Miami, USA)
 Cesare Tinelli (University of Iowa, USA)
 Ashish Tiwari (SRI International, USA)
 Andrei Voronkov (The University of Manchester, UK)
 Christoph Weidenbach (MPI-INF Saarbruecken, Germany)

                  Call for Papers
         11-14 July 2010, Edinburgh, Scotland
* Important dates (midnight GMT):
  Abstract submission deadline:         15 January 2010
  Paper submission deadline:            22 January 2010
  Notification of paper decisions:        15 March 2010
  Camera-ready papers due from authors:    9 April 2010
  Conference dates:                     11-14 July 2010
* ITP brings together researchers working in all areas of interactive
  theorem proving.  It combines the communities of two venerable
  meetings: the TPHOLs conference and the ACL2 workshop.  The inaugural
  meeting of ITP will be held on 11-14 July 2010 in Edinburgh, Scotland,
  as part of the Federated Logic Conference (FLoC, 9-21 July 2010),
  co-located with the other FLoC conferences (CAV, ICLP, IJCAR, LICS,
  RTA, SAT) and workshops.
* The program committee welcomes submissions on all aspects of
  interactive theorem proving and its applications.  Examples of typical
  topics include formal aspects of hardware or software (specification,
  verification, semantics, synthesis, refinement, compilation, etc.);
  formalization of significant bodies of mathematics; advances in
  theorem prover technology (automation, decision procedures, induction,
  combinations of systems and tools, etc.); other topics including those
  relating to user interfaces, education, comparisons of systems, and
  mechanizable logics; and concise and elegant worked examples ("Proof
* Submission details:
  All papers must be submitted electronically, via EasyChair:
* In addition to regular submissions, described above, there will be a
  "rough diamonds" section.  Rough diamond submissions are limited to
  four pages and may consist of an extended abstract.  They will be
  refereed: they will be expected to present innovative and promising
  ideas, possibly in an early form and without supporting evidence.
  Accepted diamonds will be published in the main proceedings.  They
  will be presented at the conference venue in a poster session.
* Conference co-chairs:
  Matt Kaufmann, University of Texas at Austin, USA
  Larry Paulson, University of Cambridge, United Kingdom
* Program Committee:
 Thorsten Altenkirch, Nottingham University, United Kingdom
 David Aspinall, Edinburgh University, United Kingdom
 Jeremy Avigad, Carnegie Mellon University, USA
 Gilles Barthe, IMDEA, Spain
 Jens Brandt, University of Kaiserslautern, Germany
 Thierry Coquand, Chalmers University, Sweden
 Ruben Gamboa, University of Wyoming, USA
 Georges Gonthier, Microsoft Research, United Kingdom
 David Greve, Rockwell Collins Inc., USA
 Elsa Gunter, University of Illinois at Urbana-Champaign, USA
 John Harrison, Intel Corporation, USA
 Joe Hurd, Galois Inc., USA
 Matt Kaufmann, University of Texas at Austin, USA
 Gerwin Klein, NICTA, Australia
 Xavier Leroy, INRIA, France
 Assia Mahboubi, INRIA, France
 Panagiotis Manolios, Northeastern University, USA
 John Matthews, Galois Inc., USA
 J Moore, University of Texas at Austin, USA
 Cesar Munoz, NASA, USA
 Tobias Nipkow, TU Muenchen, Germany
 Michael Norrish, NICTA, Australia
 David Pichardie, INRIA Rennes, France
 Brigitte Pientka, McGill University, Canada
 Lee Pike, Galois Inc., USA
 Sandip Ray, University of Texas at Austin, USA
 Jose Luis Ruiz-Reina, Universidad de Sevilla, Spain
 Larry Paulson, University of Cambridge, United Kingdom
 David Russinoff, Advanced Micro Devices Inc., USA
 Peter Sewell, University of Cambridge, United Kingdom
 Konrad Slind, Rockwell Collins Inc., USA
 Sofiene Tahar, Concordia University, Canada
 Christian Urban, TU Muenchen, Germany

                Second call for papers
             Ponta Delgada (Azores), Portugal
                 June 30 to July 4, 2010
* Important dates:
  Submission Deadline: 20 January 2010
  Notification to Authors: 18 March 2010
  Deadline for Final Version: 8 April 2010
* Computability in Europe provides the largest international conference
  dealing with the full spectrum of computability-related research.
  CiE 2010 in the Azores is the sixth conference of the Series, held in a
  geographically unique and dramatic location, Europe's most Westerly
  outpost. The theme of CiE 2010 - "Programs, Proofs, Processes" - points
  to the usual CiE synergy of Computer Science, Mathematics and Logic,
  with important computability-theoretic connections to science and the
  real universe.
  Jeffrey Bub (Information, Computation and Physics),
  Bruno Codenotti (Computational Game Theory).
  Eric Allender, Jose L. Balcazar, Shafi Goldwasser,
  Denis Hirschfeldt, Seth Lloyd, Sara Negri, Toniann Pitassi, and Ronald
  de Wolf.
  Biological Computing, organizers: Paola Bonizzoni, Krishna Narayanan
    Invited speakers: Giancarlo Mauri, Natasha Jonoska, Stephane Vialette,
    Yasubumi Sakakibara
  Computational Complexity, organizers: Luis Antunes, Alan Selman
    Invited speakers: Eric Allender, Christian Glasser, John Hitchcock,
    Rahul Santhanam
  Computability of the Physical, organizers: Barry Cooper, Cris Calude
    Invited speakers: Giuseppe Longo, Yuri Manin, Cris Moore, David Wolpert
  Proof Theory and Computation, organizers: Martin Hyland, Fernando Ferreira
    Invited speakers: Thorsten Altenkirch, Samuel Mimram, Paulo Oliva, Lutz
  Reasoning and Computation from Leibniz to Boole, organizers: Benedikt
    Loewe, Guglielmo Tamburrini
    Confirmed speakers: Volker Peckhaus, Olga Pombo, Sara Uckelman
  Web Algorithms and Computation, organizers: Martin Olsen, Thomas Erlebach
    Confirmed speaker: Debora Donato
* CiE serves as an interdisciplinary forum for research in all aspects of
  computability and foundations of computer science, as well as the
  interplay of these theoretical areas with practical issues in computer
  science and with other disciplines such as biology, mathematics,
  philosophy, or physics.
* Formal systems, attendant proofs, and the possibility of their computer
  generation and manipulation (for instance, into programs) have been
  changing a whole spectrum of disciplines. The conference will address
  not only the more established lines of research of Computational
  Complexity and the interplay between Proofs and Computation, but also
  novel views that rely on physical and biological processes and models to
  find new ways of tackling computations and improving their efficiency.
* 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 junior female
  researchers (see below).
  Klaus Ambos-Spies (Heidelberg), Luis Antunes (Porto), Arnold Beckmann
  (Swansea), Paola Bonizzoni (Milano), Alessandra Carbone (Paris), Steve
  Cook (Toronto ON), Barry Cooper (Leeds), Erzsebet Csuhaj-Varju
  (Budapest), Fernando Ferreira (Lisbon, co-chair), Nicola Galesi (Rome),
  Luis Mendes Gomes (Ponta Delgada), Rosalie Iemhoff (Utrecht), Achim Jung
  (Birmingham), Michael Kaminski (Haifa), Jarkko Kari (Turku), Viv Kendon
  (Leeds), James Ladyman (Bristol), Kamal Lodaya (Chennai), Giuseppe Longo
  (Paris), Benedikt Loewe (Amsterdam), Elvira Mayordomo (Zaragoza,
  co-chair), Wolfgang Merkle (Heidelberg), Russell Miller (New York NY),
  Dag Normann (Oslo), Isabel Oitavem (Lisbon), Joao Rasga (Lisbon), Nicole
  Schweikardt (Frankfurt), Alan Selman (Buffalo NY), Peter van Emde Boas
  (Amsterdam), Albert Visser (Utrecht)

 Call for Papers
 March 20-21, 2010, Paphos, Cyprus
 Satellite event of ETAPS 2010
* GaLoP is an annual international workshop on game-semantic models
 for logics and programming languages and their applications. This is
 an informal workshop that welcomes work in progress, overviews of
 more extensive work, programmatic or position papers and tutorials
 as well as contributed papers.
 Accordingly, we ask for submission of both short abstracts outlining
 what will be presented at the workshop and longer papers describing
 completed work, either published or unpublished.
* Important dates:
   - January 25, 2010: Submission deadline
   - February 3, 2010: Notification date
* Submission link
* There will be no formal proceedings. In previous years, a special
 issue of the Annals of Pure and Applied Logic has been produced, and
 this possibility will be pursued again this year.
* Detailed information can be found on the webpage.

                      CALL FOR PAPERS
            Edinburgh, Scotland, U.K., July 16-19, 2010
               ICLP 2009 will be held as part of the
            Fifth Federated Logic Conference (FLoC 2010)
               Submission deadline: January 26, 2010
  Paper registration deadline:      January 26, 2010
  Submission deadline:              February 2, 2010
  Notification to authors:          March 20, 2010
  Camera-ready copy due:            April 21, 2010
  Conference:                       July 16-19, 2010
  Since the first  conference held in Marseilles in  1982, ICLP has been
  the premier international conference  for presenting research in logic
  programming.  Contributions (papers  and  posters) are  sought in  all
  areas of logic programming including but not restricted to:
  Theory:  Semantic  Foundations,  Formalisms, Non-monotonic  Reasoning,
     Knowledge Representation.
  Implementation:  Compilation,  Memory  Management,  Virtual  Machines,
  Environments:    Program    Analysis,   Transformation,    Validation,
     Verification, Debugging, Profiling, Testing.
  Language Issues: Concurrency,  Objects, Coordination, Mobility, Higher
     Order, Types, Modes, Assertions, Programming Techniques.
  Related  Paradigms:  Abductive   Logic  Programming,  Inductive  Logic
     Programming, Constraint Logic Programming, Answer-Set Programming.
  Applications:  Databases, Data  Integration  and Federation,  Software
     Engineering,  Natural Language Processing,  Web and  Semantic Web,
     Agents, Artificial Intelligence, Bioinformatics.
  The four  broad categories for  submissions are: (1)  technical papers
  for describing  technically sound,  innovative ideas that  can advance
  the state  of the  art of logic  programming; (2)  application papers,
  where the emphasis will be  on their impact on the application domain;
  (3) system and tool papers, where the emphasis will be on the novelty,
  practicality, usability  and general  availability of the  systems and
  tools described;  and (4) short  papers/posters, for ongoing  work not
  yet ready for full publication and research project overviews.
* All   papers  must   describe  original,   previously  unpublished
  research,  and must  not simultaneously  be submitted  for publication
  elsewhere.   They  must  be  written in  English.   Technical  papers,
  application  papers, and  system and  tool papers  must not  exceed 15
  pages. The  limit for short papers  / posters is  5 pages. Submissions
  must          be         made          in          TPLP         format
  (   via
  the      Easychair      submission      system,      available      at
  General Chair:
  Veronica Dahl                        (Simon Fraser University, Canada)
  Program Co-chairs:
  Manuel Hermenegildo                       (IMDEA Soft. and UPM, Spain)
  Torsten Schaub                        (University of Potsdam, Germany)
  Workshops Chair:
  Veronica Dahl                        (Simon Fraser University, Canada)
  Doctoral Consortium:
  Marcello Balduccini                         (Kodak Research Labs, USA)
  Prolog Programming Contest:
  Tom Schrijvers                                  (K.U. Leuven, Belgium)
  Maria Alpuente                       (Technical U. of Valencia, Spain)
  Pedro Cabalar                              (Corunya University, Spain)
  Manuel Carro                           (Technical U. of Madrid, Spain)
  Marina De Vos                                 (University of Bath, UK)
  James Delgrande                      (Simon Fraser University, Canada)
  Marc Denecker                                     (KU Leuven, Belgium)
  Agostino Dovier                           (University of Udine, Italy)
  Esra Erdem                      (Sabanci University, Istanbul, Turkey)
  Wolfgang Faber                         (University of Calabria, Italy)
  Thom Fruehwirth                           (University of Ulm, Germany)
  Maurizio Gabbrielli                     (University of Bologna, Italy)
  John Gallagher                          (Roskilde University, Denmark)
  Samir Genaim                           (Complutense University, Spain)
  Haifeng Guo                     (University of Nebraska at Omaha, USA)
  Joxan Jaffar                     (National U. of Singapore, Singapore)
  Tomi Janhunen                     (Helsinki U. of Technology, Finland)
  Michael Leuschel                          (U. of Duesseldorf, Germany)
  Stephen Muggleton                        (Imperial College London, UK)
  Alan Mycroft                                     (U. of Cambridge, UK)
  Gopalan Nadathur                        (University of Minnesota, USA)
  Lee Naish                            (Melbourne University, Australia)
  Enrico Pontelli                     (New Mexico State University, USA)
  Vitor Santos Costa                     (University of Porto, Portugal)
  Tom Schrijvers                                  (K.U. Leuven, Belgium)
  Tran Cao Son                        (New Mexico State University, USA)
  Peter J. Stuckey                     (Melbourne University, Australia)
  Terrance Swift                                     (CENTRIA, Portugal)
  Peter Szeredi                   (Budapest U. of Tech. and E., Hungary)
  Frank Valencia                           (Ecole Polytechnique, France)
  Wim Vanhoof                             (University of Namur, Belgium)
  Kewen Wang                            (Griffith University, Australia)
  Stefan Woltran                      (Vienna U. of Technology, Austria)
  Neng-Fa Zhou                        (City University of New York, USA)
  The ICLP  2009 program  will include several  workshops, held  also as
  part of FLoC. They are perhaps the best places for the presentation of
  preliminary work, undeveloped novel ideas,  and new open problems to a
  wide  and   interested  audience  with   opportunities  for  intensive
  discussions and project collaboration.

                                          FOR CODESIGN (MEMOCODE 2010)
                         Call for Papers
             July 26-28, 2010 in Grenoble, France.
  Abstract submission deadline:      February 26, 2010
  Paper submission deadline:         March 5, 2010
  Notification of acceptance:        April 30, 2010
  Poster submission deadline:        May 14, 2010
  Notification for Posters:          May 28, 2010
  Final Version for Papers:          May 28, 2010
* The eighth MEMOCODE conference will attract researchers and
  practitioners who create methods, tools, and architectures for the
  design of hardware/software systems. These systems face increasing
  design complexity including tighter constraints on timing, power, costs,
  and reliability. MEMOCODE seeks submissions that present novel formal
  methods and design techniques addressing these issues to create, refine,
  and verify hardware/software systems. We also invite
  application-oriented papers, and especially encourage submissions that
  highlight the design perspective of formal methods and models, including
  success stories and demonstrations of hardware/software codesign.
  Furthermore, we invite poster presentations describing ongoing work with
  promising preliminary results.
* Topics of interest for regular submissions include but are not limited to
  - system- and transaction-level modeling and verification, abstraction
  and refinement between different modeling levels, formal, semi-formal,
  and specification-driven verification,
  - design and verification methods for composition of concurrent systems:
  multi-core platform architectures, systems-on-chip, networks-on-chip,
  - non-traditional and domain-specific design languages for hardware and
  software, novel models of computation, and new design paradigms that
  unify hardware and software design,
  - system-level estimation of performance and power in heterogeneous
  hardware/software architectures,
  - applications and demonstrators of formal design methodologies and case
  studies of innovative system-level design flows, and
  - modeling and reuse of intellectual property at system-level.
  MEMOCODE will feature tutorials related to hardware/software codesign.
  Please send your tutorial proposals to
* General Chair:  Klaus Schneider (Kaiserslauten)
  Finance Chair:  James Hoe (CMU)
  Program Chairs: Barbara Jobstmann (CNRS) and Luca Carloni (Columbia)
  Design Contest: Joel Emer (Intel) and  Forrest Brewer (UCSB)
  Local Chairs:   Saddek Bensalem (UJF/CEA) and Christian Fabre (CEA)
  Tutorial Chair: Alain Girault (INRIA)
* Program Committee
  David Atienza (EPFL)
  Twan Basten (Eindhoven)
  Tevfik Bultan (UCSB)
  Robert de Simone (INRIA)
  Rainer Doemer (UCI)
  Rolf Drechsler (Bremen)
  Stephen Edwards (Columbia)
  Franco Fummi (Verona)
  Thierry Gautier (INRIA)
  Ganesh Gopalakrishnan (Utah)
  Josef Haid (Infineon)
  Franjo Ivancic (NEC)
  Christoph Kirsch (Salzburg)
  Daniel Kroening (Oxford)
  Yassine Lakhnech (UJF)
  Luciano Lavagno (Torino)
  Elizabeth Leonard (NRL)
  Rishiyur Nikhil (Bluespec, Inc.)
  John O'Leary (Intel)
  Roberto Passerone (Trento)
  Diego Puschini (CEA)
  Jan Reineke (UC Berkeley)
  Patrick Schaumont (VirginiaTech)
  Klaus Schneider (Kaiserslautern)
  Sanjit Seshia (UC Berkeley)
  Natasha Sharygina (Lugano)
  Satnam Singh (Microsoft)
  Michael Theobald (DE Shaw)
  Lothar Thiele (ETHZ)
  Fei Xie (Portland State)

                                                      LOGIC (CSL 2010)
                    First Call for Papers
           August 23-27, 2010, Brno, Czech Republic
* Important dates
  Submission (title & abstract):  March 26, 2010
  Notification:                   May 17, 2010
  Submission (full paper):        April 2, 2010
  Final papers:                   June 6, 2010
* Computer Science Logic (CSL) is the annual conference of the European
  Association for Computer Science Logic (EACSL). The conference is intended
  for computer scientists whose research activities involve logic, as well as
  for logicians working on issues significant for computer science. The 19th
  EACSL Annual Conference on Computer Science Logic (CSL 2010) and the 35th
  International Symposium on Mathematical Foundations of Computer Science
  (MFCS 2010) are federated and organized in parallel at the same place. The
  federated MFCS & CSL 2010 conference has common plenary sessions and social
  events for all participants. The technical program and proceedings of MFCS
  2010 and CSL 2010 are prepared independently. The MFCS & CSL 2010 conference
  is accompanied by satellite workshops on more specialized topics.
* Suggested topics of interest include (but are not limited to) automated
  deduction and interactive theorem proving, constructive mathematics and type
  theory, equational logic and term rewriting, automata and games, modal and
  temporal logic, model checking, decision procedures, logical aspects of
  computational complexity, finite model theory, computational proof theory,
  logic programming and constraints, lambda calculus and combinatory logic,
  categorical logic and topological semantics, domain theory, database theory,
  specification, extraction and transformation of programs, logical foundations
  of programming paradigms, verification and program analysis, linear logic,
  higher-order logic, nonmonotonic reasoning.
* Proceedings will be published in the Advanced Research in Computing and
  Software Science (ARCoSS) subline of the LNCS series.
* The Ackermann Award for 2010 will be presented to the recipients at CSL'10.
* Programme Committee
  Armin Biere (Linz)
  Lars Birkedal (ITU, Denmark)
  Nikolaj Bjorner (Redmond)
  Manuel Bodirsky (Paris)
  Mikolaj Bojanczyk (Warsaw)
  Iliano Cervesato (Doha)
  Krishnendu Chatterjee (Klosterneuburg)
  Agata Ciabattoni (Vienna)
  Anuj Dawar (Cambridge, co-chair)
  Azadeh Farzan (Toronto)
  Georg Gottlob (Oxford)
  Martin Hofmann (Munich)
  Orna Kupferman (Jerusalem)
  Christof Loeding (Aachen)
  Joao Marques-Silva (Dublin)
  Tobias Nipkow (Munich)
  Prakash Panangaden (Montreal)
  R. Ramanujam (Chennai)
  Simona Ronchi della Rocca (Torino)
  Alex Simpson (Edinburgh)
  Pascal Tesson (Quebec)
  Helmut Veith (Vienna, co-chair)
  Yde Venema (Amsterdam)
* CSL/MFCS Plenary Speakers
  David Basin (Zurich)
  Herbert Edelsbrunner (Klosterneuburg)
  Erich Gr¨adel (Aachen)
  Joseph Sifakis (Gieres)
* CSL Invited Speakers
  Peter O'Hearn (London)
  Jan Krajicek (Prague)
  Andrei Krokhin (Durham)
  Andrey Rybalchenko (Munich)
  Viktor Kuncak (Lausanne)

                                                       (ASPOCP 2010)
                        CALL FOR PAPERS
   Collocated with the International Conference on Logic Programming 2010
                          Edinburgh (Scotland, U.K)
                             July 16-19, 2010
* IMPORTANT DATES (tentative)
  Submission deadline:        March 26, 2010
  Notification:               April 16, 2010
  Camera-ready articles due:  April 30, 2010
  Workshop:                   July 20, 2010
 Since its introduction in the 1990s, answer set programming (ASP) has
 been widely applied to various knowledge-intensive tasks and
 combinatorial search problems. ASP was found to be closely related to
 SAT, which has led to a new method of computing answer sets using SAT
 solvers and techniques adapted from SAT. While this has been the most
 studied relationship, the relationship of ASP to other computing
 paradigms, such as constraint satisfaction, quantified Boolean
 formulas (QBF), or first-order logic (FOL) is also the subject of
 active research. New methods of computing answer sets are being
 developed based on the relation between ASP and other paradigms, such
 as the use of pseudo-Boolean solvers, QBF solvers, and FOL theorem
 provers. Furthermore, the practical application of ASP also fosters
 work on multi-paradigm problem-solving, and in particular language
 and solver integration. The most prominent examples in this area
 currently are the integration of ASP with description logics (in the
 realm of the Semantic Web) and constraint satisfaction.  This
 workshop will facilitate the discussion about crossing the boundaries
 of current ASP techniques, in combination with or inspired by other
 computing paradigms.
 Topics of interests include (but are not limited to):
 - Relating ASP to classical logic formalisms (SAT/FOL/QBF/SMT/DL).
 - Relating ASP to constraint programming.
 - Relating ASP to other logic programming paradigms.
 - Relating ASP to other nonmonotonic languages.
 - New methods of computing answer sets using algorithms or systems of
   other paradigms.
 - ASP and probabilistic reasoning.
 - ASP and machine learning.
 - Language extensions to ASP.
 - ASP and argumentation.
 - ASP and multi-agent systems.
 - Multi-paradigm problem solving involving ASP.
 - Evaluation and comparison of ASP to other paradigms.
 - Embedding ASP for challenging applications.
 - Hybridizing ASP with procedural approaches.
 - Enhanced grounding or beyond grounding.
 Marcello Balduccini   (Kodak Research Labs, USA)
 Stefan Woltran        (Vienna University of Technology, Austria)
 Gerhard Brewka        (University of Leipzig, Germany)
 Pedro Cabalar         (Corunna University, Spain)
 Wolfgang Faber        (University of Calabria, Italy)
 Michael Fink          (Vienna University of Technology, Austria)
 Martin Gebser         (University of Potsdam, Germany)
 Joohyung Lee          (Arizona State University, USA)
 Vladimir Lifschitz    (University of Texas at Austin, USA)
 Fangzhen Lin          (Hong Kong University of Science and Technology, China)
 Marco Maratea         (University of Genoa, Italy)
 Emilia Oikarinen      (Helsinki University of Technology, Finland)
 Axel Polleres         (DERI, National University of Ireland, Ireland)
 Ashish Sabharwal      (Cornell University, USA)
 Guillermo R. Simari   (Universidad Nacional del Sur, Argentina)
 Paolo Torroni         (University of Bologna, Italy)
 Miroslaw Truszczynski (University of Kentucky, USA)
 Dirk Vermeir          (Vrije Universiteit Brussel, Belgium)
 Jia-Huai You          (University of Alberta, Canada)

                   Call for Submissions
               July 15, 2010, Edinburgh, UK
         affiliated with LICS and IJCAR at FLoC'10
* The purpose of this workshop is to provide a forum for comparisons
 of different methods - e.g. tableaux, automata, games, resolution,
 reductions, SAT/SMT based methods, etc. - used in order to obtain
 decision procedures for various logics. Submitted work may compare
 such methods w.r.t. theoretical (e.g. ability to obtain optimal
 complexity results) or practical aspects (e.g. ease or efficiency
 of implementations).
* Submissions should be in the form of extended abstracts of at most 5
 A4 pages in PDF format, preferably using Springer LNCS style or a
 comparable format. Submissions may be based on new and original, or
 on already published or submitted work, but they should address the
 topic of the workshop.
* Important dates: Paper submission: 27 March 2010; Notification: 27
 April 2010

 (affiliated with LICS 2010)
 First Call for Papers
 July 10, 2010, Edinburgh, Scotland
* Theme.
 Hybrid logic is an extension of modal logic which allows us to
 refer explicitly to states of the model in the syntax of formulas.
 It is easy to justify interest in hybrid logic on applied grounds,
 with the usefulness of the additional expressive power, and moreover,
 hybridization often improves the behavior of the underlying modal formalism.
 The workshop HyLo 2010 is relevant to a wide range of people, including
 those interested in description logic, applied modal logics, temporal logic,
 memory logics, memoryful logics, reactive logic, labelled deduction, and
 feature logic.
* Submission. See the workshop web page.
 The proceedings have been accepted for publication in ENTCS.
* Submission deadline: March 30, 2010
* Invited speakers
 Moshe Vardi (Rice University, USA)
* Program committee.
 Carlos Areces (INRIA Lorraine, France)
 Patrick Blackburn (INRIA Lorraine, France)
 Thomas Bolander (Technical University of Denmark), Co-chair
 Torben Braüner (Roskilde University, Denmark), Co-chair
 Stephane Demri (ENS de Cachan, France)
 Mai Gehrke (Radboud Universiteit Nijmegen, The Netherlands)
 Valentin Goranko (Technical University of Denmark)
 Valeria de Paiva (Cuil Inc., USA)
 Thomas Schneider (University of Manchester)

  Krzysztof R. Apt, Frank S. de Boer and Ernst-Ruediger Olderog
  with a Foreword by Amir Pnueli
  3rd extended edition, xix + 502 pages
  ISBN: 978-1-84882-744-8
* Table of Contents
  Part I: In the Beginning
  Part II: Deterministic Programs
    While Programs
    Recursive Programs
    Recursive Programs with Parameters
    Object-Oriented Programs
  Part III: Parallel Programs
    Disjoint Parallel Programs
    Parallel Programs with Shared Variables
    Parallel Programs with Synchronization
  Part IV: Nondeterministic and Distributed Programs
    Nondeterministic Programs
    Distributed Programs
* For more information, please see

* 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.

  The Computer Science Department at Université du Québec à Montréal
  (UQAM) is looking for a candidate for a Canada Research Chair (level
  2) in software and knowledge engineering.
* The candidate must have obtained its PhD in computer science or
  software engineering within the last 10 yars and must be recognized by
  his peers as likely to become a leader in his field. The selected
  candidate must demonstrate excellent research abilities in software
  and knowledge engineering (e.g., requirements specification, software
  design, construction or maintenance, software management). He/she must
  demonstrate scientific and organizational leadership, and must develop
  an innovative and original research program. He/she must also have
  interest and abilities in training highly qualified personnel. Because
  UQAM is a French-speaking university, the candidate must have an
  excellent knowledge of French.
* For more details contact the Department Chair ( or see
* The deadline for submission is February 26, 2010.

Back to the LICS web page.