January 14, 2008
* Past issues of the newsletter are available at
* Instructions for submitting an announcement to the newsletter
can be found at
* To unsubscribe, send an email with "unsubscribe" in the
subject line to email@example.com
TABLE OF CONTENTS
LICS 2008 - Abstract Deadline TODAY
LICS 2008 - List of Workshops
Ackermann Award 2008 - Call for Nominations
* CONFERENCES AND WORKSHOPS
RUSSELL 2008 - PROOF THEORY MEETS TYPE THEORY
WORKSHOP ON MODAL FIXPOINT LOGICS
CSL 2008 - Call for Papers/Panels/Workshops
CAV 2008 - Call for Papers
AMAST 2008 - Call for Papers
CONCUR 2008 - Call for Papers
POSTDOCTORAL POSITION AT INRIA NANCY (FRANCE)
LOGIC IN COMPUTER SCIENCE (LICS) 2008
* The deadline for submitting a title and short abstract to LICS 2008
is TODAY, Monday January 14 11:59pm EST.
* The deadline for extended abstracts is
11:59pm EST, Monday, January 21, 2008.
LOGIC IN COMPUTER SCIENCE (LICS) 2008
There will be five workshops co-located with LICS 2008.
* June 21: (CoLocated with CSF)
(L.Bauer, S.Etalle, J.den Hartog, L.Vigano)
- Security and Rewriting, SecRet2008
(Dan Dougherty, Santiago Escobar)
* June 22:
- FCS-ARSPA-WITS (continued from the 21st)
- Proof-Carrying Code PCC08
(Ian Stark, David Aspinall)
* June 23:
- Intuitionist Modal Logics and Applications IMLA08
(Valeria de Paiva, Aleks Nanevski)
- International Workshop on Logical Frameworks and MetaLanguages (LFMTP)
(Andreas Abel, Christian Urban)
ACKERMANN AWARD 2008 - THE EACSL OUTSTANDING
DISSERTATION AWARD FOR LOGIC IN COMPUTER SCIENCE
Call for Nominations
* Eligible for the 2008 Ackermann Award are PhD dissertations in
specified by the EACSL and LICS conferences, which were formally
accepted as PhD theses at a university or equivalent institution
between 1.1.2006 and 31.12. 2007.
* The deadline for submission is 15.3.2008.
* Submission details are available at
* The award consists of
- a diploma,
- an invitation to present the thesis at the CSL conference,
- the publication of the abstract of the thesis and the laudation
in the CSL proceedings,
- travel support to attend the conference.
* The 2008 Ackermann Award will be presented to the recipients at the
annual conference of the EACSL (CSL'08).
* The jury consists of seven members:
- The president of EACSL, J. Makowsky (Haifa);
- The vice-president of EACSL, D. Niwinski (Warsaw);
- One member of the LICS organizing committee, G. Plotkin
- J. van Benthem (Amsterdam)
- B. Courcelle (Bordeaux);
- M. Grohe (Berlin);
- M. Hyland (Cambridge);
- A. Razborov (Moscow and Princeton).
- possibly one more member to be appointed by the EACSL Board
* 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.
* For the three years 2007-2009,
the Award is sponsored by Logitech, S.A., Romanel, Switzerland,
the worlds leading provider of personal peripherals.
RUSSELL'08 - PROOF THEORY MEETS TYPE THEORY
A "Small Workshop" of the European TYPES Project
Call for Participation and Contributed Talks
Swansea, Wales, 15-16 March 2008
* In 1908 the British Philosopher and Mathematician Bertrand Russell,
who was born and died in Wales, published the article "Mathematical
Logic as based on the Theory of Types" which contained a first
matured exposition of Type Theory. In the same year, Ernst Zermelo's
"Untersuchungen ueber die Grundlagen der Mengenlehre I" introduced
the basis of current axiomatic set theory as an alternative
approach to the foundations of Mathematics.
A central theme of Proof Theory is to compare these different
foundations. Proof Theory uses as its main tool ordinal notation
systems, the basis of which was laid by Oswald Veblen in his paper
"Continuous Increasing Functions of Finite and Transfinite
Ordinals", again in 1908.
A century later, Proof Theory and Type Theory are flourishing more
than ever before, and their manifold interconnections are driving
important developments in Mathematics and Computer Science.
At this workshop we meet and discuss cutting edge research at the
interface of Proof Theory and Type Theory.
* Topics of interest include, but are not limited to:
Proof Theory of Type Theory; Relationship between Type Theory and
Set Theory; Program extraction from proofs; Normalisation and
Cut-elimination; New approaches to ordinal analysis Universes and
reflection principles; Equality in Type Theory; Philosophical and
historical aspects of Proof Theory and Type Theory
* Invited Speakers: To be confirmed.
* Participation and Contributed Talks:
Please send an email to Anton Setzer (firstname.lastname@example.org)
as soon as possible, but no later than the 29th of February 2008.
WORKSHOP ON MODAL FIXPOINT LOGICS
Call for contributions
March 25-27, Amsterdam, the Netherlands
Organizers: Luigi Santocanale and Yde Venema.
* The aim of the workshop is to bring together researchers from
backgrounds, in particular, computer scientists and pure logicians,
in order to discuss modal fixpoint logics from various perspectives,
including those of model theory, proof theory, algebra and duality,
and automata theory.
* Deadline for submission of contributed papers: February 1, 2008.
* Invited speakers: Giovanna D'Agostino, Johan van Benthem, Marcello
Bonsangue, Dietmar Berwanger, Erich Graedel (to be confirmed),
Dexter Kozen (to be confirmed), Giacomo Lenzi, Damian Niwinski,
Colin Stirling, Thomas Studer, Albert Visser, Igor Walukiewicz,
and Thomas Wilke (to be confirmed).
* Further information can be found at
21st IEEE Computer Security Foundations Symposium (CSF)
Pittsburgh, PA, USA, June 23-25, 2008
Sponsored by the Technical Committee on Security and Privacy
of the IEEE Computer Society
* CSF 2008 website: http://www.cylab.cmu.edu/CSF2008/
CSF home page: http://www.ieee-security.org/CSFWweb/
CSF CFP: http://www.cs.chalmers.se/~andrei/CSF08/cfp.html
* The IEEE Computer Security Foundations (CSF) series brings together
researchers in computer science to examine foundational issues in
computer security. Over the past two decades, many seminal papers and
techniques have been presented first at CSF. The CiteSeer Impact page
(http://citeseer.ist.psu.edu/impact.html ) lists CSF as 38th out of
more than 1200 computer science venues, top 3.11% in impact based on
* This year's CSF will be colocated with the 23rd IEEE Symposium on
Logic in Computer Science (LICS). It will be held at Carnegie Mellon
University in Pittsburgh, Pennsylvania, USA.
* We are proud to announce a joint CSF/LICS invited speaker: David
* New theoretical results in computer security are welcome. Also welcome
are more exploratory presentations, which may examine open questions
and raise fundamental concerns about existing theories. Panel
proposals are sought as well as papers. Possible topics include, but
are not limited to:
- Access control
- Anonymity and Privacy
- Data and system integrity
- Database security
- Decidability and complexity
- Distributed systems security
- Electronic voting
- Executable content
- Formal methods for security
- Information flow
- Intrusion detection
- Language-based security
- Network security
- Resource usage control
- Security for mobile computing
- Security models
- Security protocols
- Trust and trust management
* While CSF welcomes submissions beyond these topics, note that the main
focus of CSF is foundational security: submissions that lack
foundational aspects risk rejection.
* Proceedings, published by the IEEE Computer Society Press, will be
available at the symposium, and selected papers will be invited for
submission to the Journal of Computer Security.
* Important Dates
Workshop proposals due: Tuesday, November 20, 2007
Papers due: Tuesday, January 29, 2008
Panel proposals due: Thursday, March 6, 2008
Notification: Monday, March 17, 2008
Camera-ready papers: Wednesday, April 9, 2008
Symposium: June 23-25, 2008
* There are PDF and HTML versions of this call for papers at
CAV 2008 - 20TH INTERNATIONAL CONFERENCE ON COMPUTER AIDED VERIFICATION
Call for Papers
Call for Nominations for CAV Award
July 7-14, 2008, Princeton, NJ, USA
* CAV 2008 is the 20th in a series dedicated to the advancement of the
theory and practice of computer-aided formal analysis methods for
hardware and software systems. CAV considers it vital to continue
its leadership in hardware verification, maintain its recent momentum in
software verification, and consider new domains such as biological
- CAV Award (please see website for Call for Nominations)
- Four pre-conference (July 7, 8), three post-conference (July 14)
* Important dates:
- Jan 28, 2008: Paper submission deadline
- Jan 28, 2008: Nominations for CAV Award deadline
- March 26, 2008: Author notification for papers
* Details available on conference website.
AMAST 2008 - 12th INTERNATIONAL CONFERENCE ON ALGEBRAIC METHODOLOGY
AND SOFTWARE TECHNOLOGY
Call for Papers
July 28-31, 2008, Urbana, Illinois, United States
* The major goal of the AMAST conferences is to promote research
towards setting software technology on a firm, mathematical basis.
Work towards this goal is a collaborative, international effort
with contributions from both academia and industry. The envisioned
virtues of providing software technology developed on a mathematical
basis include: correctness, which can be proved mathematically;
safety, so that developed software can be used in the implementation
of critical systems; portability, i.e., independence from computing
platforms and language generations; and evolutionary change, i.e.,
the software is self-adaptable and evolves with the problem domain.
* Topics of interest include: systems software technology;
application software technology; concurrent and reactive systems;
formal methods in industrial software development; formal techniques
for software requirements, design; evolutionary software/adaptive
systems; logic programming, functional programming, object
constraint programming and concurrency; program verification and
transformation; programming calculi; specification languages and
tools; formal specification and development case studies; logic,
category theory, relation algebra, computational algebra; algebraic
foundations for languages and systems, coinduction; theorem proving
and logical frameworks for reasoning; logics of programs; algebra
and coalgebra. For system demonstrations or ordinary papers:
software development environments; support for correct software
development; system support for reuse; tools for prototyping;
component based software development tools; validation and
verification; computer algebra systems; theorem proving systems.
* Important dates: Abstract submission due: 1 March 2008;
Paper submission due: 8 March 2008; Notification: 20 April 2008
19TH INTERNATIONAL CONFERENCE ON CONCURRENCY THEORY (CONCUR 08)
Call for Papers
Toronto, Canada, August 19-22, 2008
* Submission deadline: April 11, 2008
* CONCUR 08, the 19th International Conference on Concurrency Theory,
will take place in Toronto, Canada, on August 19-22, 2008. The
purpose of the CONCUR conferences is to bring together researchers,
developers, and students in order to advance the theory of
concurrency, and promote its applications (in a broad sense).
* CONCUR 08 will be collocated with the 27th Annual ACM SIGACT-SIGOPS
Symposium on the Principles of Distributed Computing (PODC 2008).
Furthermore, there will be a symposium celebrating the contributions
of Nancy Lynch and a number of workshops on topics related to CONCUR
and PODC. The overall event will take place at the University of
Toronto on August 17-24, 2008.
* CONCUR 08 welcomes two categories of papers:
- regular papers;
- tool papers.
* Submissions are solicited in all areas of semantics, logics,
verification and analysis of concurrent systems. The principal
topics include (but are not limited to):
- basic models of concurrency (such as abstract machines, domain
theoretic models, game theoretic models, process algebras, and
- logics for concurrency (such as modal logics, temporal logics and
- models of specialized systems (such as biology-inspired systems,
circuits, hybrid systems, mobile systems, multi-core processors,
probabilistic systems, real time systems, synchronous systems, and
- verification and analysis techniques for concurrent systems (such
as abstract interpretation, atomicity checking, model-checking,
race detection, run-time verification, state-space exploration,
static analysis, synthesis, testing, theorem proving and type
- related programming models (such as distributed or object-oriented).
* The link for submissions is
* Important dates
Abstract Submission: April 4, 2008
Paper Submission: April 11, 2008 (strict)
Notification: May 27, 2008
Final version due: June 17, 2008
* Program committee
Luca de Alfaro, University of California, Santa Cruz, USA
Pedro R. D'Argenio, Universidad Nacional de Cordoba, Argentina
Jos Baeten, Eindhoven University of Technology, the Netherlands
Christel Baier, Technical University Dresden, Germany
Eike Best, Carl von Ossietzky Universitaet Oldenburg, Germany
Dirk Beyer, Simon Fraser University, Canada
Patricia Bouyer, LSV, CNRS & ENS Cachan, France
Mario Bravetti, University of Bologna, Italy
Franck van Breugel (co-chair), York University, Canada
Ilaria Castellani, INRIA Sophia Antipolis, France
Marsha Chechik (co-chair), University of Toronto, Canada
Wan Fokkink, Vrije Universiteit Amsterdam/CWI, the Netherlands
Rob van Glabbeek, National ICT Australia
Arie Gurfinkel, Carnegie Mellon University, USA
Anna Ingolfsdottir, Reykjavik University, Iceland
Radha Jagadeesan, DePaul University, USA
Barbara Koenig, University of Duisburg-Essen, Germany
Marta Kwiatkowska, University of Oxford, UK
Orna Kupferman, Hebrew University, Israel
Kim Larsen, Aalborg University, Denmark
Nancy Lynch, MIT, USA
P. Madhusudan, UIUC, USA
Ugo Montanari, University of Pisa, Italy
Anca Muscholl, Universite Bordeaux, France
Catuscia Palamidessi, INRIA Futurs and LIX, France
Corina Pasareanu, Perot Systems/NASA Ames Research Center, USA
Scott Smolka, SUNY at Stony Brook, USA
Nobuko Yoshida, Imperial College London, UK
POSTDOCTORAL POSITION AT INRIA NANCY (FRANCE)
Field: Computational Linguistics
Topic: Surface realisation and large scale over-generation detection
* Deadline for application: February 15, 2008.
* Starting Date: 01 November 2008
* Employer: INRIA (French National Institute for Research in Computer
Science) Nancy Grand Est (France)
* Job Description: The Lorraine Laboratory of IT Research and its
Applications (Nancy, France) has a position for a Postdoctoral fellow
to work on the development of a surface realiser for French.
* Applicants must have a ** recent doctoral degree ** (PhD viva held in
may 2007 or later) or defend their PhD before the end of 2008. They
must have expertise in an area relevant to the project (linguistics,
computational linguistics, computer science), strong hands-on
experience in Natural Language Processing and a particular interest in
NL generation. A good knowledge of Haskell is a necessity.
* Further particulars and details of how to apply are available at:
* The official closing date is February 15, 2007, but applications will
be processed until the position is filled.
* Contact: Claire Gardent
Back to the LICS web page.