Newsletter 131
August 1, 2011

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

  Deadlines in the coming weeks
  LICS 2011 Report
  LICS 2012 - Test of Time Award
  CSL 2011/TYPES 2011 - Call for Participation
  Reachability Problems (RP) - Call for Participation
  CONCUR 2011 - Call for Participation
  RTA 2012 - Call for Workshop Proposals
  LATA 2012 -  Call for Papers
  AiML 2012 -  Call for Papers
  Special Issue of Studia Logica on Logic and Games
  COMPUTABILITY - New Journal by the Association CiE
  Security and Privacy in Complex Systems
  John Templeton Foundation Fellowships
  Ph.D. position in logic at Technical Unviersity Berlin

* CSL 2011
  Early Registration Deadline: 31st July 2011
* TYPES 2011
  Early Registration Deadline: 31st July 2011
* RP 2011
  Early Registration Deadline: 31st July 2011
* CONCUR 2011
  Early Registration Deadline: 31st July 2011
* QEST 2011
  Early Registration Deadline: 31st July 2011
* TGC 2011
  Early Registration Deadline: 31st July 2011
* Special Issue of Studia Logic on Logic and Games
  Submission deadline: 15th August 2011

* This year, LICS was hosted by the Fields Institute in Toronto, Canada.
  The conference was a great success with high-quality presentations and
  lively discussions among the participants, encouraged by the setting in a
  research institute. The attendance was a little lower than usual, though.
* For the first time LICS was preceded by a tutorial day  with two fantastic
  tutorials by
  - Albert Atserias on Finite Model Theory and
  -  Prakash Panangaden on Semantics.
  The tutorials were very well received and the tradition will be continued in
  the following years.
* At LICS, the test-of-time awards were presented to
  - Patrice Godefroid and Pierre Wolper for their paper
     "A partial approach to model checking"
  - Joshua S. Hodas and Dale A. Miller for their paper
     "Logic Programming in a fragment of intuitionistic linear logic"
  - Dexter C. Kozen for his paper
     "A completeness theorem for Kleene algebras of regular events"
  Dale and Dexter gave excellent talks on the background on their work.
* Next year, LICS will be organised in Dubrovnik, Croatia, from June 25 to 28, 2012.
* We thank the local organisers Matt Valeriote and his team and the PC Chair, Martin
  Grohe, and the PC for their hard work to organise this year's LICS.

* The LICS Test-of-Time Award recognizes a small number of papers from the LICS proceedings
  from 20 years prior that have best met the "test of time".
* The LICS 2012 ToT Award committee consists of
  - Martin Grohe,
  - Prakash Panangaden,
  - Andre Scedrov (Chair), and
  - Ashish Tiwari.
* The committee will select between 0 to 3 papers
  that appeared in LICS 1992 proceedings. All papers are nominated by default, but the
  committee welcomes input from our community: please send your comments to
  Andre Scedrov ( which will be shared only among the committee members.
* LICS 2012 ToT award will be presented during the business meeting at LICS 2012
  to be held in Dubrovnik from June 22 to 25, 2012.
* The list of papers from LICS 1992 is available at
* The information about LICS ToT award and the list of past winners is available at

    Bergen, Norway
    Call for Participation
    8-11 September,
    12-15 September,
  - Types for Proofs and Programs (TYPES) is a forum to present
    new and on-going work in all aspects of type theory and its
    applications, especially in computer programming and in formalized
    and computer-assisted reasoning, see:
  - 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.
    A preliminary program for CSL'11 is now available:
* The pre-conference workshop Epsilon Calculus and Constructivity
  on Sunday 11 September is free for TYPES/CSL'11 participants
  Early registration deadline: 1 August 2011
* BOOKING a hotel room at a reduced rate can be done via:
  NB limited availability, and the offer expires 1 August 2011,

   September 28 - 30, 2011
   Genova, Italy
* REGISTRATION IS OPEN (see website)
  Early registration deadline: July 31, 2011
* The Reachability Workshop is specifically aimed at gathering together scholars from
  diverse disciplines and backgrounds interested in reachability problems that appear
  in Algebraic structures, Computational models, Hybrid systems, Logic, and Verification.
* Topics of interest include: Reachability problems in infinite state
  systems, rewriting systems, dynamical and hybrid systems;
  reachability problems in logic and verification; reachability
  analysis in different computational models, counter/ timed/
  cellular/ communicating automata; Petri-Nets; computational aspects
  of algebraic structures (semigroups, groups and rings); frontiers
  between decidable and undecidable reachability problems;
  predictability in iterative maps and new computational paradigms.
* Previous RP editions took place in Brno (Czech Republic, 2010),
  Palaiseau (France, 2009), Liverpool (UK, 2008), Turku (Finland, 2007).
  The fifth edition will be held in Genova, a historic city in Liguria, Italy.
  - Krishnendu Chatterjee, IST Austria
    Graph Games with Reachability Objectives: Mixing Chess, Soccer and Poker
  - Bruno Courcelle, Labri, Universitè Bordeaux 1
    Automata for monadic second-order model-checking
  - Joost-Pieter Katoen, RWTH Aachen
    Timed Automata as Observers of Stochastic Processes
  - Jean-Francois Raskin, CFV, Universitè Libre de Bruxelles
    Reachability Problems for Hybrid Automata
* The preliminary program is available at the RP webpage
  The early registration deadline is 31st of July.
  Early (until July 31)
  Regular fee    200    250
  Student fee    150    200
* Late (after July 31): +50
  September is a very busy period in Genova (there are several other
  conferences and events right before and after RP). We have an
  option for a limited number of rooms in the hotels in the city
  center.  Our University can also offer (a limited number of)
  accomodations in Casa Paganini (student residence) at very
  convenient prices.
  Travel information and on-line registration/booking forms are
  available under the RP webpage:
* For further information, please contact the RP 2011 organizers:
  Giorgio Delzanno:
  Igor Potapov:

    CONCUR: 22th Int. Conference on Concurrency Theory
    QEST: 8th Int. Conference on Quantitative Evaluation of SysTems
    TGC: 6th Int. Symposium on Trustworthy Global Computing
         6 Tutorials + 9 Workshops
         September 5 - September 10, 2011
         Aachen, Germany
  Online registration:
  Early registration deadline: July 31; Late registration deadline: August 25.
  Parosh Aziz Abdulla   (Uppsala University, Sweden)
  Wil van der Aalst     (Technical University Eindhoven, The Netherlands)
  Ursula Goltz          (Technical University Braunschweig, Germany)
  Rachid Guerraoui      (EPFL Lausanne, Switzerland)
  Geoffrey Smith        (Florida International University, USA)
  Lothar Thiele         (ETH Zurich, Switzerland)
  Peter Buchholz        (University of Dortmund, Germany)
  Krishnendu Chatterjee (IST Austria, Vienna, Austria)
  Kousha Etessami       (LFCS University of Edinburgh, UK)
  Boris Köpf            (IMDEA Software, Madrid, Spain)
  Aad van Moorsel       (Newcastle University, UK)
  Verena Wolf           (Saarland University, Germany)
* Affiliated Workshops --
  COMPMOD   Computational Models for Cell Processes
  EXPRESS   Expressiveness in Concurrency
  FOCLASA   Foundations of Coordination Languages and Software
  GASICS    Games for Design, Verification and Synthesis
  LAM       Logics, Agents, and Mobility
  MLQA      Models and Logics for Quantitative Analysis
  SECCO     Security Issues in Concurrency
  SOS       Structural Operational Semantics
  YR-CONCUR Young Researchers on Concurrency Theory
* Organization --
  General Chair:
  Joost-Pieter Katoen  (RWTH Aachen University, Germany)
  CONCUR PC Chairs:
    Joost-Pieter Katoen  (RWTH Aachen University, Germany)
    Barbara König        (University of Duisburg-Essen, Germany)
  QEST PC Chairs:
    Catuscia Palamidessi (INRIA and Ecole Polytechnique, France)
    Alma Riska           (EMC Corporation, USA)
  TGC PC Chairs:
    Roberto Bruni        (University of Pisa, Italy)
    Vladimiro Sassone    (University of Southhampton, UK)
* Contact
  For further questions, please contact

      Monday, May 28 - Saturday, Jun 2, 2012, Nagoya, Japan
      Call for Workshop Proposals
* RTA is the major forum for the presentation of research on all aspects
  of rewriting.
* Previous RTA meetings were held in Dijon (1985), Bordeaux (1987),
  Chapel Hill (1989), Como (1991), Montreal (1993), Kaiserslautern
  (1995), Rutgers (1996), Sitges (1997), Tsukuba (1998), Trento (1999),
  Norwich (2000), Utrecht (2001), Copenhagen (2002), Valencia (2003),
  Aachen (2004), Nara (2005), Seattle (2006), Paris (2007),
  Hagenberg/Linz (2008), Brasilia (2009), Edinburgh (2010) and Novi Sad
* We solicit proposals for satellite workshops of RTA 2012 that are
  related in topics to RTA.
* Workshops should have a length of 1 or 2 days. It is tradition at RTA
  that attendance to workshops is open to participants of parallel
  events, similar to the way FLoC workshops are run.  There will be
  three days (Monday, Tuesday and Saturday) reserved for workshops.
* Please submit your workshop proposal by email to
* Proposals should be written in plain text. The proposal should cover the
  following topics:
  1. Name of workshop
  2. A statement of the topics and goals of the workshop
  3. Names and addresses of the organizers
  4. Pointers to descriptions of previous editions of the workshop, if any
  5. A description of the submission selection process
  6. Plans for the publication of proceedings (informal proceedings
     distributed to participants, electronic journal,  proceedings with
     separate selection process, ...)
  7. Plans for invited speakers or special sessions (round-table
     discussion, tutorials, ...)
  8. Expected length of the workshop
  9. Expected number of attendees
  10.Any special needs (for system demonstrations ...)
* Workshop Selection Committee:
  Ashish Tiwari  (RTA 2012 program chair)
  Masahiko Sakai (RTA 2012 general chair).
* Important Dates
  September 19, 2011 | deadline for proposals
  September 30, 2011 | notification of acceptance
* Prospective workshop organizers are welcome to contact the workshop
  selection committee in advance before sending in a formal submission
  and to discuss any questions.

                   THEORY AND APPLICATIONS (LATA 2012)
   Call for Papers
   A Coruña, Spain
   March 5-9, 2012
  LATA is a yearly conference in theoretical computer science and its
  applications. Following the tradition of the International Schools in
  Formal Languages and Applications developed at Rovira i Virgili University
  in Tarragona since 2002, LATA 2012 will reserve significant room for young
  scholars at the beginning of their career. It will aim at attracting contributions
  from both classical theory fields and application areas (bioinformatics, systems
  biology, language technology, artificial intelligence, etc.).
  LATA 2012 will take place in A Coruña, at the northwest of
  Spain. The venue will be the Faculty of Computer Science,
  University of A Coruña.
  Topics of either theoretical or applied interest include, but are not limited to:
  - algebraic language theory
  - algorithms for semi-structured data mining
  - algorithms on automata and words
  - automata and logic
  - automata for system analysis and programme verification
  - automata, concurrency and Petri nets
  - automatic structures
  - cellular automata
  - combinatorics on words
  - computability
  - computational complexity
  - computational linguisticsx
  - data and image compression
  - decidability questions on words and languages
  - descriptional complexity
  - DNA and other models of bio-inspired computing
  - document engineering
  - foundations of finite state technology
  - foundations of XML
  - fuzzy and rough languages
  - grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.)
  - grammars and automata architectures
  - grammatical inference and algorithmic learning
  - graphs and graph transformation
  - language varieties and semigroups
  - language-based cryptography
  - language-theoretic foundations of artificial intelligence and artificial life
  - parallel and regulated rewriting
  - parsing
  - pattern recognition
  - patterns and codes
  - power series
  - quantum, chemical and optical computing
  - semantics
  - string and combinatorial issues in computational biology and bioinformatics
  - string processing algorithms
  - symbolic dynamics
  - symbolic neural networks
  - term rewriting
  - transducers
  - trees, tree languages and tree automata
  - weighted automata
  Eric Allender (Rutgers)
  Miguel Á. Alonso (A Coruña)
  Amihood Amir (Bar-Ilan)
  Dana Angluin (Yale)
  Franz Baader (Dresden)
  Patricia Bouyer (Cachan)
  John Case (Delaware)
  Volker Diekert (Stuttgart)
  Paul Gastin (Cachan)
  Reiko Heckel (Leicester)
  Sanjay Jain (Singapore)
  Janusz Kacprzyk (Warsaw)
  Victor Khomenko (Newcastle)
  Bakhadyr Khoussainov (Auckland)
  Claude Kirchner (Paris)
  Maciej Koutny (Newcastle)
  Salvador Lucas (Valencia)
  Sebastian Maneth (Sydney)
  Carlos Martín-Vide (Tarragona, chair)
  Giancarlo Mauri (Milano Bicocca)
  Aart Middeldorp (Innsbruck)
  Faron Moller (Swansea)
  Angelo Montanari (Udine)
  Joachim Niehren (Lille)
  Mitsunori Ogihara (Miami)
  Enno Ohlebusch (Ulm)
  Dominique Perrin (Marne-la-Vallée)
  Alberto Policriti (Udine)
  Alexander Rabinovich (Tel Aviv)
  Mathieu Raffinot (Paris)
  Jörg Rothe (Düsseldorf)
  Olivier H. Roux (Nantes)
  Yasubumi Sakakibara (Keio)
  Eljas Soisalon-Soininen (Aalto)
  Frank Stephan (Singapore)
  Jens Stoye (Bielefeld)
  Howard Straubing (Boston)
  Masayuki Takeda (Kyushu)
  Wolfgang Thomas (Aachen)
  Sophie Tison (Lille)
  Jacobo Torán (Ulm)
  Tayssir Touili (Paris)
  Esko Ukkonen (Helsinki)
  Frits Vaandrager (Nijmegen)
  Manuel Vilares (Vigo)
  Todd Wareham (Newfoundland)
  Pierre Wolper (Liège)
  Hans Zantema (Eindhoven)
  Thomas Zeugmann (Sapporo)
  Authors are invited to submit papers presenting original and
  unpublished research. Papers should not exceed 12 single-spaced
  pages (including eventual appendices) and should be formatted
  according to the standard format for Springer Verlag's LNCS series
  Submissions have to be uploaded at:
  The period for registration will be open since July 16, 2011 until
  March 5, 2012. The registration form can be found at the website
  of the conference:
  Paper submission: October 7, 2011 (23:59h, CET)
  Notification of paper acceptance or rejection: November 18, 2011
  Final version of the paper for the LNCS proceedings: November 27, 2011
  Early registration: December 5, 2011
  Late registration: February 24, 2012
  Starting of the conference: March 5, 2012
  Submission to the post-conference special issue: June 9, 2012

     COPENHAGEN, 22-25 AUGUST, 2012
* 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-2012 is the ninth conference in the series.
  We invite submission on all aspects of modal logic, 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
  + model generation
  + 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
  + modal logics over non-boolean bases
  + 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
  + computationally light fragments of all such logics
  Papers on related subjects will also be considered.
  Hybrid logic is an extension of modal logic which allows us to refer explicitly
  to states of the model in the syntax of formulas. There will be a special
  session of AiML devoted to papers on hybrid logic. The scope of the special
  session is standard hybrid-logical machinery like nominals, satisfaction
  operators, and the downarrow binder, but also other extensions of modal
  logic can be considered. Papers for this session should be submitted the
  same way as others.
  Carlos Areces               (FaMAF, Universitad Nacional de Cordoba, Argentina)
  Philippe Balbiani           (IRIT, Toulouse, France)
  Lev Beklemishev             (Moscow State University, Russia)
  Guram Bezhanishvili         (New Mexico State University, USA)
  Nick Bezhanishvili          (Imperial College London, UK)
  Patrick Blackburn           (Roskilde University, Denmark)
  Thomas Bolander             (Technical University of Denmark)
  Torben Brauner              (Roskilde University, Denmark)
  Giovanna Corsi              (Universita' di Bologna, Italy)
  Giovanna D'Agostino         (Universita' di Udine, Italy)
  Stephane Demri              (LSV, ENS Cachan, France)
  Melvin Fitting              (Lehman College, CUNY, USA)
  Robert Goldblatt            (Victoria University of Wellington, New Zealand)
  Valentin Goranko            (Technical University of Denmark)
  Rajeev Gore                 (Australian National University, Australia)
  Andreas Herzig              (IRIT, Toulouse, France)
  Ian Hodkinson               (Imperial College London, UK)
  Wiebe van der Hoek          (University of Liverpool, UK)
  Alexander Kurz              (University of Leicester, UK)
  Tadeusz Litak               (University of Leicester, UK)
  Hiroakira Ono               (Japan Advanced Institute of Science and Technology)
  Martin Otto                 (Technical University of Darmstadt, Germany)
  Alessandra Palmigiano       (ILLC, University of Amsterdam, The Netherlands)
  Renate Schmidt              (University of Manchester, UK)
  Lutz Schroeder              (DFKI GmbH and University of Bremen, Germany)
  Valentin Shehtman           (Moscow State University, Russia)
  Dimiter Vakarelov           (Sofia University, Bulgaria)
  Yde Venema                  (ILLC, University of Amsterdam, The Netherlands)
  Heinrich Wansing            (Ruhr University Bochum, Germany)
  Frank Wolter                (University of Liverpool, UK)
  Michael Zakharyaschev       (Birkbeck College, London, UK)
  Silvio Ghilardi             (Universita' degli Studi di Milano, Italy)
  Lawrence Moss               (Indiana University, USA)
  Thomas Bolander   (Technical University of Denmark)
  Torben Brauner    (Roskilde University, Denmark)
  Full papers submission deadline: 16 March 2012
  Full papers acceptance notification: 18 May 2012
  Short presentations (abstracts) submission deadline: 1 June, 2012
  Short presentations acceptance notification: 7 June, 2012
  Final version of full papers and abstracts due: 15 June 2012
  Conference: 22-25 August, 2012.

  Call for Papers
  Guest editor: Thomas Ågotnes (University of Bergen)
* Formal logic and game theory can meet in many ways. While the use of
  games-for-logic, e.g., to define semantics of quantifiers or to
  compare logical models, goes back a long time, logic-for-games is a
  more recent and currently very active research direction which has
  been precipitated by the introduction of the notion of (multi-)agency
  in logic. If agents are assumed to be self-interested and to act
  rationally, then reasoning about action in a multi-agent setting
  requires reasoning about game theoretic concepts. Furthermore, logics
  capturing, e.g., the principles of action, belief, knowledge, time,
  preference and so on, can help explaining the foundations of game
  theoretic solutions, algorithms, etc.
* The goal of the special issue of Studia Logica on Logic and Games is
  to illustrate current trends and present recent advances in this
  field. We invite submissions on all topics in the intersection between
  formal logic and game theory, including the following topics (not an
  exhaustive list):
  o Logical formalisations of game properties
  o Logics for reasoning about strategic interaction
  o The use of logic to characterise or explain concepts, solutions,
     algorithms, etc., relevant for games
  o Logical-epistemic foundations of solution concepts
  o Reasoning about preferences
  o Logical aspects of social choice
  o Judgment aggregation
  o Game semantics
     Model comparison games (e.g., for comparing expressiveness, succinctness)
* The special issue will contain contributions from the following
   invited authors, in addition to selected submitted contributions:
  o Johan van Benthem, University of Amsterdam/Stanford University
  o Rohit Parikh, City University of New York
  o Michael Wooldridge, University of Liverpool
* Submission details: submitted papers should be between 15 and 20 pages
  long (including bibliography), and should be formatted according to
  the Studia Logica LaTex style. Only electronic submissions will be
  accepted. The authors should send an email with subject "Studia Logica
  Submission" to the guest editor (Thomas Agotnes,, with the file of the paper as an
  attachment, and the following information in the body of the email in
  plain text: paper title, author names, surface mail, email address of
  the contact author and a short abstract.
* Submission deadline: 15 August 2011
  All papers will be refereed according to the standards of the journal.
* For more details, see

  Now Accepting Submissions!
* First volume to be published in 2012
  as part of the celebrations of the Alan Turing Year
* Aims and Scope
  Computability is the journal of the Association Computability in Europe
  and it is published by IOS Press in Amsterdam.
* The journal Computability is a peer reviewed international journal that
  is devoted to publishing original research of highest quality, which is
  centered around the topic of computability.
* The subject is understood from a multidisciplinary perspective,
  recapturing the spirit of Alan Turing (1912-1954) by linking theoretical
  and real-world concerns from computer science, mathematics, biology,
  physics, computational neuroscience, history and the philosophy of
* Editor-in-Chief
  Vasco Brattka (Cape Town, South Africa)
* Managing Editors
  Paola Bonizzoni (Milan, Italy)
  S. Barry Cooper (Leeds, UK)
  Benedikt Loewe (Amsterdam, The Netherlands)
  Elvira Mayordomo (Zaragoza, Spain)
* Editorial Board
  Samson Abramsky (Oxford, UK)
  Manindra Agrawal (Kanpur, India)
  Eric Allender (Piscataway, USA)
  Jeremy Avigad (Pittsburgh, USA)
  Arnold Beckmann (Swansea, UK)
  Olivier Bournez (Palaiseau, France)
  Alessandra Carbone (Paris, France)
  Karine Chemla (Paris, France)
  Bruno Codenotti (Pisa, Italy)
  Stephen A. Cook (Toronto, Canada)
  Anuj Dawar (Cambridge, UK)
  Rodney G. Downey (Wellington, New Zealand)
  Natasha Jonoska (Tampa, USA)
  Ulrich Kohlenbach (Darmstadt, Germany)
  Russell Miller (New York, USA)
  Andrei Morozov (Novosibirsk, Russia)
  Prakash Panangaden (Montreal, Canada)
  Frank Stephan (Singapore)
  Vlatko Vedral (Oxford, UK)
  Rineke Verbrugge (Groningen, The Netherlands)
  Ning Zhong (Cincinnati, USA)
* Submission Guidelines
  The journal Computability invites submission of full papers of highest
  quality on all research topics related to computability.
* Computability accepts only submissions of original research papers that
  have not been published previously and that are not currently submitted
  elsewhere. Full versions of papers that have already been published in
  conference proceedings are eligible only if the conference version is
  clearly cited and the full version enhances the conference version
* Authors are requested to submit PDF manuscripts electronically via the
  online submission system. Authors can indicate non-binding wishes
  regarding Editorial Board Members who should handle their submission.
  Final versions of accepted papers have to be prepared using the journal
  style file and they need to be submitted together with all source files.
* Authors submitting a manuscript do so on the understanding that they
  have read and agreed to the terms of the IOS Press Author Copyright
  Agreement and that all persons listed as authors have given their
  approval for the submission of the paper.

IEEE SYSTEMS JOURNAL -  Special Issue on Security and Privacy in Complex Systems
  Call for Papers
* Today's information society relies on a globally interconnected
  infrastructure composed of diverse and widely distributed systems. It
  is of utmost importance to ensure proper protection to such complex
  systems, or systems-of-systems, to ensure security, privacy, and
  availability of the infrastructure as well as of resources and
  information it provides and manages. The problem is far from trivial,
  due to the criticality and the social impact of the applications and
  services relying on this global infrastructure, as well as the
  complexity given by the co-existence and co-operation of, possibly
  heterogeneous, component systems.
  The goal of this special issue is to collect high-quality
  contributions on security and privacy in complex systems and
  systems-of-systems. We solicit submissions from academia, industry,
  and government presenting novel and original research on all
  theoretical and practical aspects of security and privacy in complex
  systems. The focus of the special issue spans security and privacy
  theory, technology, methodology, and applications in complex systems.
  Submitted papers should therefore explicitly address issues in the
  complex system scenario.
* Topics of interest include, but are not limited, to the ones listed
  below provided that they are treated with specific focus on the
  complex system scenario: access control; anonymity; applied
  cryptography; authentication; biometric security and privacy;
  cyber warfare and security; complex systems security; computer
  forensics; critical infrastructure protection; data and
  application security; data protection; data/system integrity;
  dependability, reliability, and availability; formal methods
  for security and privacy; human factors in security and
  privacy; identity management; insider threats; intrusion detection
  and prevention; knowledge extraction/representation for security;
  legal and ethical issues; middleware security; network security;
  operating systems security and privacy; protection from cyberhacking;
  security engineering; secure environments and applications; secure
  interoperability; security and privacy metrics; security and privacy
  policies; security and privacy in cloud computing; security and privacy
  in ad hoc networks; security and privacy in e-services; security and
  privacy in grid computing; security and privacy in mobile systems;
  security and privacy in monitoring systems; security and privacy in
  industrial systems; security and privacy in pervasive/ubiquitous
  computing; security and privacy in sensor networks; security and
  privacy in smart grid and distributed generation systems; security
  and privacy in social applications and networks; security and
  privacy in wireless sensor networks; security architectures;
  security management in complex scenarios; social implications
  of security and privacy; surveillance systems; threats, vulnerabilities,
  and risk management; transportation systems; trust management;
  usable security for complex systems; verification and validation
  of complex systems; web service security.
* Important dates: Paper submission due: October 1, 2011; First
  notification to authors: January 15, 2012; Revised paper submission
  due: March 15, 2012; Second notification to authors: April 30, 2012;
  Publication date: 2012
* Guest Editors: Sushil Jajodia, George Mason University, USA
  (; Pierangela Samarati, Universita` degli Studi
  di Milano, Italy (

            Research Fellowship and Scholar Competition
              Submission deadline - December 16, 2011
* More than any other figure, Turing has left a coherent scientific agenda
  related to many of the 'Big Questions' concerning the relationship between
  the human mind, mechanism in nature, and the mathematics required to
  clarify and answer these questions. The very breadth and fundamental
  nature of Turing's impact makes the centenary celebration a hugely
  opportune period in which to reassert the role of basic thinking in
  relation to deep and intractable problems facing science.
* 'The Turing Centenary Research Project - Mind, Mechanism and Mathematics',
  supported by a major grant from the John Templeton Foundation, arises from
  the above-mentioned scientific agenda, and is aimed at researchers still
  within ten years of receiving their Ph.D. The participants in the research
  project will be the winners of the 'Mind, Mechanism and Mathematics'
  competition, designed to provide significant funding support for eight
  young researchers. Five of the winners will become JTF 'Turing Research
  Fellows' with an award of £75,000 each; and awards of £45,000 will be for
  JTF 'Turing Research Scholars' in the 16 to 25 age-group.
* The competition is organised in conjunction with the Turing Centenary
  Celebration, to be held June 22-25, 2012, at the Manchester City Hall and
  the University of Manchester. The award winners will be duly honoured on
  the June 23, 2012 centenary of Turing's birth.
* Further details:
  Honorary Chairs: Rodney Brooks and Sir Roger Penrose
* Submission deadline - December 16, 2011
  Award Notification - March 31, 2012
  Award Ceremony - Turing Centenary Day, June 23, 2012
  Commencement of the research project - July 1, 2012
* roposals will be judged relative to four research themes:
  - Chair of the Judges: S Barry Cooper (Leeds)
  - The Judges for Research Theme 1 (The Mathematics of Emergence: The
                                                       Mysteries of Morphogenesis):
    Luca Cardelli (Microsoft Research, Cambridge)
    Stuart Kauffman (Vermont/Santa Fe)
    Cris Moore (New Mexico/Santa Fe)
  - The Judges for Research Theme 2 (Possibility of Building a Brain:
                                      Intelligent Machines, Practice and Theory):
    Luciano Floridi (Oxford/Hertfordshire)
    Barbara Grosz (Harvard)
    Aaron Sloman (Birmingham)
  - The Judges for Research Theme 3 (Nature of Information: Complexity,
                                             Randomness, Hiddenness of Information):
    Eric Allender (Rutgers)
    Rodney Downey (Wellington)
    Manindra Agrawal (Kanpur)
  - The Judges for Research Theme 4 (How should we compute? New Models of
                                                            Logic and Computation):
  Samson Abramsky (Oxford)
  Gordon Plotkin (Edinburgh)
  Robert I. Soare (Chicago)
* Proposals should be made via the EasyChair submission page at:
* For further details, see:

* The Logic and Semantics Research Group at the Institute for
  Software Engineering and Theoretical Computer Science at
  the Technical University, Berlin, Germany, is offering a fully
  funded Ph.D. studentship in the area of logic or graph theory.
  The closing date for applications is 28th August 2011. See for further information.
* The research pursued in the group revolves around finite and
  computational model theory, algorithmic and structural graph
  theory, database theory, automata-theory and temporal and
  modal logics in the context of verification.
* Candidates must have a degree (master or diploma level) in
  Computer Science or Mathematics and must have a strong
  interest in theoretical computer science. Furthermore, candidates
  should have good knowledge in at least one of the following
  - Structural or algorithmic graph theory, such as graph
    decompositions, graph minor theory or matroid theory,
    parametrized and general graph  algorithms.
  - Logic, broadly construed, in particular areas such as finite
    and computational model theory, automata theory, database
    theory and verification
* Good command of English is expected. Knowledge of German is not
* The position is fully funded. The successful candidate will be expected to
  participate in teaching for up to four hours a week during term time,
  usually in form of tutorials and assistance with reading courses.
* See for further information on the application
* For further information please contact
  Stephan Kreutzer,
  tel:       +49 30 314 29088.

Back to the LICS web page.