[FOM] [CiE] Newsletter No.24, December 13, 2009

CiE cie at maths.leeds.ac.uk
Sun Dec 13 18:51:11 EST 2009

CiE Newsletter No.24, December 13, 2009


1. Computability Workshop, co-located with CiE 2010 in the Azores

2. CCC 2010: Submission deadline approaching!

3. TAMC 2010 - Call for Papers

4. TQC 2010 Conference (13-15 April 2010, Leeds, UK)

5. FLoC 2010: Call for Papers

6. EATCS Awards -- Call for Nominations

7. First Call for papers - Infinity 2010

8. Logic in Computer Science (LICS) - Call for Papers

9. Call for Papers: IWS 2010

10. CSR-2010: extended deadline, Last CfP

1. (from Andy Lewis) Computability Workshop, 
co-located with CiE 2010, in the Azores:

Co-located with the CIE conference in Portugal 2010, there will be a
Workshop on Computability. The workshop will take place on the 5th and 6th
of July after the CiE conference has finished on the 4th. For further
details, please see the website:


Andy Lewis.

2. (from John Rogers) CCC 2010: Submission deadline approaching!:

The submission deadline for the 2010 Conference on Computational
Complexity is this Tuesday, December 15th.  To be accepted, a paper
must be submitted by 19:59 Eastern Standard Time on the 15th.  The
submissions server can be found at
https://ccc10.cs.wisc.edu/submit/.  More information on the
conference, including local arrangements, is available at

John Rogers
CCC Publicity Chair
jrogers at cs.depaul.edu

3. (from Jan Krotochvil) TAMC 2010 - Call for Papers:

TAMC 2010 - 7th Annual Conference on Theory and Applications of Models of

June 7 - 11, 2010
Prague, Czech Republic

tamc2010 at tamc2010.cz

The conference will take place in the premisses of Charles University in the
historic center of Prague, the capital of the Czech Republic. Six previous
annual meetings were held in 2004-2009, in Beijing, Shanghai, Xi'an, and
ChangSha, with enthusiastic participation from researchers all around the
world. In 2010, the conference is organized for the first time in Europe.

John Hopcroft (Cornell University, USA)
ShangHua Teng (Boston University, USA)

Computational Geometry (organized by Jiri Matousek)
Proof Complexity (organized by Jan Krajicek)

Submission of papers:         February 10, 2010
Notification of acceptance:  March 20, 2010
Final version due:                March 30, 2010
Early registration:                April 10, 2010

M. Agrawal (Kanpur, India)
Jin-Yi Cai (Madison, USA)
S. Barry Cooper (Leeds, UK)
Angsheng Li (Beijing, China)

H. Bodlaender (Utrecht, NL)
J. Chen (ChangSha, China and Austin, USA)
W. Chen (Beijing, China)
B. S. Cooper (Leeds, UK)
J. Diaz (Barcelona, Spain)
Z. Ding (Beijing, China)
R. Downey (Wellington, New Zealand)
J. Fiala (Prague, Czech Republic)
F. Fomin (Bergen, Norway)
L. Hemaspaandra (Rochester, USA)
J. Kratochvil (Prague, Czech Republic, co-chair)
D. Kratsch (Metz, France)
A. Kucera (Brno, Czech Republic)
A. Kucera (Prague, Czech Republic)
A. Li (Beijing, China, co-chair)
Z. Liu (Beijing, China)
M. Ogihara (Miami, USA)
S. Oum (Daejeon, Korea)
A. Proskurowski (Eugene, USA)
X. Sun (Beijing, China)
J. Tarui (Tokyo, Japan)
C. Umans (Pasadena, USA)
P. van Emde Boas (Amsterdam, NL)
L. Wang (Hong Kong, China)
O. Watanabe (Tokyo, Japan)
B. Zhu (Bozeman, USA)

The three main themes of the conference continue to be Computability,
Complexity, and Algorithms. It aims to bring together researchers with
interests in theoretical computer science, algorithmic mathematics, and
applications to the physical sciences. Typical but not exclusive topics of
interest include:
- algorithmic graph theory and combinatorics,
- algorithmic algebra, number theory and coding theory,
- algorithms and data structures,
- automata and neural networks,
- computable mathematics,
- computational biology,
- computational complexity,
- computational game theory,
- computational geometry,
- continuous and real computation,
- cryptography,
- decidability and undecidability,
- generalized and higher type computation,
- learning theory,
- models of computation,
- natural computation,
- on-line algorithms,
- parallel algorithms,
- physical computability,
- proofs and computation,
- quantum computing,
- randomness,
- relative computability and degree structures,
- theoretical problems in networks and security,
- network information,
- network structures and algorithms,
- Turing definability.

The submission must not exceed 10 pages in Springer-Verlag Lecture Notes
LaTeX style. A clearly marked appendix that will be read at the discretion
of the program committee may be added. Simultaneous submission of papers to
any other conference with published proceedings or submitting papers
previously accepted for journal publication is not allowed. Only electronic
submissions in postscript or pdf formats are accepted.

Invited papers and accepted contributions will be published in the
conference proceedings in Lecture Notes in Computer Science,

DIMATIA - Center for Discrete Mathematics and ITI - Institute for
Theoretical Computer Science, Charles University, Prague

Further details are available on the conference web site

4. (from Viv Kendon) TQC 2010 Conference (13-15 April 2010, Leeds, UK):

                     ***   CALL FOR PAPERS   ***
             The 5th Conference on Theory of Quantum Computation,
                      Communication, and Cryptography
                           ---- TQC 2010 ----

Submission is now open for TQC 2010, which will be held at the
University of Leeds from 13th to 15th of April next year.
Submissions for consideration for contributed talks and posters are
invited in all areas of the scope of the conference.

     ** The submission deadline is Monday 4th January 2010. **

Full details of how to submit, and template files for preparation
of your manuscript, are available on the conference website:


Quantum computation, quantum communication, and quantum cryptography are
subfields of quantum information processing, an interdisciplinary field of
information science and quantum mechanics. TQC 2010 focuses on theoretical
aspects of these subfields. The objective of the conference is to bring
together researchers so that they can interact with each other and share
problems and recent discoveries. The conference will be held from April
13-15, 2010, at the University of Leeds. It will consist of invited talks,
contributed talks, and a poster session.

The scope of the conference includes, but is not limited to:

     * quantum algorithms
     * models of quantum computation
     * quantum complexity theory
     * simulation of quantum systems
     * quantum cryptography
     * quantum communication
     * quantum estimation and measurement
     * quantum noise
     * quantum coding theory
     * fault-tolerant quantum computing
     * entanglement theory

<> Post Proceedings:

As has happened for previous TQCs, a post-conference proceedings volume
will be published in Springer's Lecture Notes in Computer Science, to
which selected speakers (both invited and contributed) will be invited
to contribute.

<> Invited Speakers:

     * Julia Kempe (Tel-Aviv University)
     * Kae Nemoto (NII, Tokyo)
     * Frank Verstraete (University of Vienna)
     * Ronald de Wolf (CWI, Amsterdam)
     * Anton Zeilinger (University of Vienna)

<> Program Committee:

Dagmar Bruß (Heinrich-Heine-University, Düsseldorf)
Andrew Childs (University of Waterloo)
Matthias Christandl (Ludwig-Maximilians-University)
Wim van Dam (University of California, Santa Barbara; Chair)
Nilanjana Datta (University of Cambridge)
Aram Harrow (University of Bristol)
Peter Høyer (University of Calgary)
Rahul Jain (National University of Singapore)
Elham Kashefi (University of Edinburgh)
Debbie Leung (University of Waterloo)
Hoi-Kwong Lo (University of Toronto)
Juan Pablo Paz (University of Buenos Aires)
Francesco Petruccione (University of KwaZulu-Natal)
David Poulin (Université de Sherbrooke)
Martin Rötteler (NEC, Princeton)
Miklos Santha (Université Paris Sud)
Simone Severini (University College London; Co-chair)
Seiichiro Tani (NTT, Tokyo)
Jean-Pierre Tillich (INRIA, Rocquencourt)
Pawel Wocjan (University of Central Florida)
Takashi Yamamoto (Osaka University)

<> Local (University of Leeds) organising committee:

Katie Barr (Physics and Astronomy)
Katherine Brown (Physics and Astronomy)
Barry Cooper (Maths)
Peter Crompton (Maths)
Vladimir V. Kisil (Maths)
Viv Kendon (Physics and Astronomy; Chair)
Neil Lovett (Physics and Astronomy)
Mike Stannett (University of Sheffield)
Rob Wagner (Physics and Astronomy)

<> Conference series steering committee:

Yasuhito Kawano (NTT, Tokyo, Japan)
Michele Mosca (IQC, University of Waterloo, and 
Perimeter Institute, Waterloo, Canada)
Vlakto Vedral (CQC, University of Oxford, UK, and 
CQT, National University of Singapore)

<> Important Dates:

     * Submission deadline: Monday 4th January 2010 (23:59 local time)
     * Notification of acceptance/rejection: Thursday 11th February 2010
     * Conference: April 13-15, 2010
     * Post-proceedings submission deadline: End of May 2010
     * Final copy deadline: End of August 2010
     * Published: November 2010

To receive announcements, calls for papers, and reminders of deadlines,
subscribe to the mailing list by following this link:


To contact the organisers, please send emailto: tqc2010 at leeds.ac.uk

5. (from Nicole Schweikardt) FLoC 2010: Call for Papers:


Edinburgh, Scotland, U.K.
July 9-21, 2010


* The fifth Federated Logic Conference (FLoC'10) will be held in
Edinburgh, Scotland, U.K. (www.edinburgh.org), in July 2010, at the
School of Informatics at University of Edinburgh (www.inf.ed.ac.uk).

* The following conferences will participate in FLoC:
- CAV 2010:  Int'l Conference on Computer-Aided Verification
- CSF 2010:  IEEE Computer Security Foundations Symposium
- ICLP 2010: Int'l Conference on Logic Programming
- IJCAR 2010: Int'l Joint Conference on Automated Reasoning
- ITP 2010:  Int'l Conference on Interactive Theorem Proving
- LICS 2010: IEEE Symposium on Logic in Computer Science
- RTA 2010:  Int'l Conference on Rewriting Techniques and Applications
- SAT 2010:  Int'l Conference on Theory and Applications of
Satisfiability Testing

* Plenary events involving all the conferences are planned. In addition
to the participating conferences, FLoC'10 will host a number of
pre- and post-conference workshops. There will be receptions in the
Edinburgh Castle and at the National Galleries of Scotland.

* Travel support for US student participants is expected.

* Detailed calls for papers (as well as submission instructions) for each
of the participating conferences can be found at the FLoC'10 website at

* Important dates:
- CAV 2010:
  PC chairs: Byron Cook, Paul Jackson, Tayssir Touili
  Jan 11: abstract submission deadline
  Jan 15: paper submission deadline
- CSF 2010:
  PC chairs: Michael Backes, Andrew Myers
  Feb 04: abstract submission deadline
  Feb 08: paper submission deadline
- ICLP 2010:
  PC chairs: Manuel Hermenegildo, Torsten Schaub
  Jan 26: paper registration deadline
  Feb 02: paper submission deadline
- IJCAR 2010:
  PC chairs: Jürgen Giesl, Reiner Hähnle
  Jan 15: abstract submission deadline
  Jan 22: paper submission deadline
- ITP 2010:
  PC chairs: Matt Kaufmann, Lawrence C. Paulson
  Jan 15: abstract submission deadline
  Jan 22: paper submission deadline
- LICS 2010:
  PC chair: Jean-Pierre Jouannaud
  Jan 10: abstract submission deadline
  Jan 17: paper submission deadline
- RTA 2010:
  PC chair: Christopher Lynch
  Jan 15: abstract submission deadline
  Jan 22: paper submission deadline
- SAT 2010:
  PC chairs: Ofer Strichman, Stefan Szeider
  Feb 01: abstract submission deadline
  Feb 08: paper submission deadline

* 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

6. (from Burkhard Monien) EATCS Awards -- Call for Nominations:

One of the major activities of EATCS is to 
promote research in theoretical computer science. 
EATCS attempts to stimulate scientific excellence 
by supporting and encouraging the very best, 
truly creative scientists. Especially, this is 
done by sponsoring the following scientific awards:

The Goedel Prize, the EATCS Award and the Presburger Award.

Let me remind you that our Award Committees are 
waiting for nominations rather simultaneously. In tangible terms this means:

- EATCS Award Committee (chairman Emo Welzl)
   The deadline for nominations is: December 15, 2009.

- Presburger Award Committee (chairman Wolfgang Thomas)
   The deadline for nominations is: December 31, 2009.

- Goedel Prize Award Committee (chairman Jean-Pierre Jouannaud)
   The deadline for nominations is: January 31, 2010.

You will find the calls for nominations on the 
EATCS web-page (http://www.eatcs.org/).

With this email I would like to encourage you to 
submit nominations for eligible candidates to the 
corresponding Award Committees.

With kind regards,

Burkhard Monien
EATCS President

7. (from Yaroslav Sergeyev) First Call for papers - Infinity 2010:


Infinite and Infinitesimal in Mathematics, Computing, and Natural Sciences

17-21 May 2010, Grand Hotel San Michele, Cetraro, Italy


The goal of the Workshop is to create a 
multidisciplinary round table for an open 
discussion on modelling nature by using 
traditional and emerging computational paradigms. 
Mathematics and natural sciences offer discrete 
and continuous models to describe space, 
processes, and events occurring in nature. Very 
often both approaches use notions of infinite and 
infinitesimal in order to create coherent models. 
It is assumed that it is possible to work with 
infinitesimal quantities and/or to execute an 
infinite number of steps in algorithms. However, 
our abilities in computing are limited and only a 
finite number of computational steps can be executed by humans and machines.

The Workshop will discuss all aspects of the 
usage of infinity and infinitesimals in 
mathematics, computing, philosophy, and natural 
sciences. Fundamental ideas from theoretical 
computer science, logic, set theory, and 
philosophy will meet requirements and new fresh 
applications from physics, chemistry, biology, 
medicine, and economy. Researchers from both 
theoretical and applied sciences are very welcome 
to submit their papers and to use this excellent 
possibility to exchange ideas with leading 
scientists from different research fields. Papers 
discussing new computational paradigms and their 
impact on natural sciences are particularly solicited.

A special attention will be dedicated to the new 
methodology allowing one to execute numerical 
computations with finite, infinite, and 
infinitesimal numbers on a new type of a 
computational device - the Infinity Computer (EU 
patent 1728149). The new approach is based on the 
principle 'The part is less than the whole' 
introduced by Ancient Greeks that is applied to 
all numbers (finite, infinite, and infinitesimal) 
and to all sets and processes (finite and 
infinite). The new methodology evolves Cantor's 
ideas in a more applied way and introduces new 
infinite numbers that possess both cardinal and ordinal properties as usual
finite numbers. It gives the possibility to 
execute numerical computations of a new type and 
simplifies fields of mathematics where the usage 
of the infinity and/or infinitesimals is necessary.

There will be tutorials, discussion sections, and regular presentations.

Topics of the workshop include the following 
research streams and their interrelations with 
infinite and infinitesimal quantities

* Analytical computations
* Astronomy and infinity
* Complexity and computability
* Divergent processes and fractals
* Foundations of mathematics
* Infinity in economy
* Infinity in natural sciences
* Language theory
* Logic and infinity
* Modelling: continuous vs. discrete
* Numerical analysis
* Philosophy of mathematics
* Physics of particles and infinitesimals
* Quantum computing

More information at:
Yaroslav D. Sergeyev,  Ph.D., D.Sc.
Distinguished Professor, Dipartimento di Elettronica, Informatica
e Sistemistica Università' della Calabria, Via P. Bucci, Cubo
42-C, 87036 Rende (CS), Italia
Professor, N.I. Lobachevsky State University of Nizhni Novgorod,
e-mail: yaro at si.deis.unical.it tel./fax:(+39)-0984-494855

8. (from Stephan Kreutzer) Logic in Computer Science (LICS) - Call for Papers:

              Twenty-fifth Annual IEEE Symposium on

                     CALL FOR PAPERS

            July 11-14, 2010, Edinburgh, Scotland, UK


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 http://www.floc-conference.org.

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

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

Submission Instructions:
Every extended abstract must be submitted in the IEEE Proceedings
two-column camera-ready format and may be no longer than 10 pages
including references with a font size of 10pt.  Submissions
instructions including LaTeX style files are available from the LICS
2010 website.

The abstract must be in English and provide sufficient detail to allow
the program committee to assess the merits of the paper.  It should
begin with a succinct statement of the issues, a summary of the main
results, and a brief explanation of their significance and relevance
to the conference and to computer science, all phrased for the
non-specialist.  Technical development directed to the specialist
should follow. References and comparisons with related work should be
included.  If necessary, detailed proofs of technical results can be
included in a clearly-labelled appendix in the same two-column format
following the 10-page extended abstract or there can be a pointer to
an existing manuscript on a website. This material may be read at
the discretion of the program committee. Extended abstracts not
conforming to the above requirements concerning format and length
may be rejected without further consideration.

The results must be unpublished and not submitted for publication
elsewhere, including the proceedings of other symposia or workshops.
The PC chair should be informed of closely related work submitted to a
conference or journal in advance of submission.
All authors of accepted papers will be expected to sign copyright
release forms.  One author of each accepted paper will be expected to
present it at the conference.

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
   jeanpierre.jouannaud at gmail.com

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

Conference Chair:
   Martin Escardo, University of Birmingham
   m.escardo at cs.bham.ac.uk

Workshops Chairs:
   Adriana Compagnoni, Stevens IT, New-Jersey
   Maribel Fernandez, King's College London

Publicity Chairs:
   Stephan Kreutzer, University of Oxford
   Nicole Schweikardt, Univ. Frankfurt am Main

General Chair:
   Rajeev Alur, U. Penn, Philadelphia
   alur at cis.upenn.edu

Organizing Committee:
   M. Abadi, R. Alur (chair), G. Ausiello, F. Baader,
   P. Beame, S. Brookes, S. Buss, E. Clarke, A. Compagnoni,
   M. Escardo, M. Fernandez, L. Fortnow, J. Giesl, R.Jagadeesan,
   J.-P. Jouannaud, P. Kolaitis, S. Kreutzer, B. Larose,
   J. A. Makowsky, J. Palsberg, F. Pfenning, A. M. Pitts,
   N. Schweikardt, P. Scott, M. Valeriote

Advisory Board:
   M. Abadi, S. Abramski, Y. Gurevich, T. Henzinger, C. Kirchner,
   P. Kolaitis, D. Kozen, L. Ong, U. Martin, J. Mitchell, L. Pacholski,
   G. Plotkin, A. Scedrov, M. Y. Vardi, G. Winskel

Colocated events:
The following conferences are
colocated with LICS at FLoC 2010: CAV, ICLP, IJCAR, ITP, RTA, SAT, as
indicated on the FLoC homepage. There will also be a number of workshops
sponsored by the FLoC conferences. Details on workshops affiliated with
LICS can be found at the LICS 2010 website.

The symposium is sponsored by the IEEE Technical Committee on
Mathematical Foundations of Computing in cooperation with the
Association for Symbolic Logic and the European Association for
Theoretical Computer Science.

9. (from Cesar Munoz) Call for Papers: IWS 2010:

                            CALL FOR PAPERS
International Workshop on Strategies in Rewriting, Proving, and Programming
                               IWS 2010
                    (A satellite workshop of FLoC 2010)
                         July 9 2010, Edinburgh, UK

Abstract submission: March 26, 2010
Notification date: April 11, 2010
Abstract final version: April 25, 2010
Workshop: July 9, 2010
Submission of full paper for the proceedings: September 5, 2010

Strategies are ubiquitous in programming languages, automated
deduction and reasoning systems, yet only since about ten years have
they been studied in their own right. In the two communities of
Rewriting and Programming on one side, and of Deduction and Proof
engines (Provers, Assistants, Solvers) on the other side, workshops
have been launched to make progress towards a deeper understanding of
the nature of strategies, their descriptions, their properties, and
their usage, in all kinds of computing and reasoning systems. Since
more recently, strategies are also playing an important role in
rewrite-based programming languages, verification tools and techniques
like SAT/SMT engines or termination provers. Moreover strategies have
come to be viewed more generally as expressing complex designs for
control in computing, modeling, proof search, program transformation,
and access control.

Possible topics to address in this workshop include:
* Foundations for the definition and semantic description of strategies:
   models of search spaces, logical or mathematical formalisms
   to define strategies and prove properties about them.
* Properties of strategies and corresponding computations:
   logical or mathematical formalisms to  prove properties about them.
* Analysis and optimization techniques for strategies:
   analysis of the search space, evaluation and comparison of strategies.
* Integration of strategic deductions and/or strategic computations:
   interrelations, combinations and applications of deduction and computation
   under different strategies, control issues and strategies in the
   of systems, strategies in decision procedures for SMT.
* Strategy languages: essential constructs, meta-level features. Definition,
   design, implementation and application. Comparison of  strategies in
   (existing) systems.
* Concrete types of (reduction/evaluation) strategies in rewriting
   and programming, lambda calculi, normalization, narrowing, constraint
   solving, as well as their properties and characteristics (complexity,
   decidability, ...).
* Applications and case studies in which strategies play a major role.

FLoC 2010 provides an excellent opportunity  to foster exchanges between
the communities of Rewriting and Programming  on one side, and of Deduction
and Proof engines on the other side. This workshop is a joint follow-up of
two series of workshops, held since 1997: the Strategies workshops held by
the CADE-IJCAR  community and the Workshops on Reduction Strategies (WRS)
held by the RTA-RDP community.


The submission process is in two stages.

1) Before the workshop, authors are invited to submit an extended abstract
    (max. 5 pages) to be formatted in the EasyChair class style


    through the EasyChair submission site:


    Accepted abstracts will be presented at the workshop and included in
    the preliminary proceedings, available at the workshop.

2) After the workshop, authors will be invited to submit a
    full paper of their presentation (typically a 15-pages paper), which
    will be refereed  and considered for publication in the electronic
    journal: Electronic Proceedings in Theoretical Computer Science

Beyond original ideas and recent results not published nor submitted
elsewhere, we also invite authors to submit a 5-pages abstract describing
relevant work that has been or will be published elsewhere, or work in
progress. These submissions will be only considered for presentation
at the workshop and inclusion in the preliminary proceedings but not
in the final proceedings.

Helene Kirchner, INRIA Bordeaux - Sud-Ouest, France
Cesar Munoz, NASA Langley Research Center, Hampton, USA

Program Committee
Maria Paola Bonacina, Univ. degli Studi di Verona, Italy
Jean-Christophe Filliatre, CNRS, France
Bernhard Gramlich, Technische Universitat Wien, Austria
Salvador Lucas, Universidad Politecnica de Valencia, Spain
Pierre-Etienne Moreau, LORIA-INRIA Nancy, France
Natarajan Shankar, SRI International, Menlo Park, CA, USA
Eelco Visser, Delft Univ. of Technology, The Netherlands
Christoph Weidenbach, MPI-INF, Saarbrucken, Germany

Web:   iws2010.inria.fr
Email: iws2010 at inria.fr

10. (from Edward Hirsch) CSR-2010: extended deadline, Last CfP:


Last Call for Papers


June 16-20, 2010, Kazan, Russia



CSR 2010 intends to reflect the broad scope of international cooperation in
computer science. It is the 5th conference in a series of regular events
started with CSR 2006 in St. Petersburg (see LNCS 3967), CSR 2007 in
Ekaterinburg (see LNCS 4649), CSR 2008 in Moscow (see LNCS 5010), and
CSR 2009 in Novosibirsk (see LNCS 5675).


Deadline for submissions:	December 18, 2009 at 23:59 CET
Notification of acceptance:	January 31, 2010
Conference dates:		June 16-20, 2010

As has become tradition, there will be YANDEX 
AWARDs for the best paper and for the best student paper!


* algorithms and data structures
* combinatorial optimization
* constraint solving
* complexity and cryptography
* formal languages and automata
* computational models and concepts
* algorithms for concurrent and distributed systems, networks
* proof theory and applications of logic to computer science
* model checking
* automated reasoning
* deductive methods


Alexander Razborov (University of Chicago and Steklov Mathematical Institute)


Fedor Fomin (University of Bergen)
(many more names are coming soon!)


Ernst W. Mayr (TU München, Germany; Chair)
Sergei N. Artemov (City University of New York, USA)
Lev Beklemishev (M.V. Lomonossov Moscow State University, Russia)
Michael Ben-Or (Hebrew University, Israel)
Harry Buhrman (University of Amsterdam, Netherlands)
Edith Cohen (AT&T Research, USA)
Samir Datta (Chennai Mathematical Institute, India)
Andrew V. Goldberg (Microsoft Research, USA)
Dima Grigoriev (Université de Lille, France)
Martin Hofmann (LMU München, Germany)
Stasys Jukna (Universität Frankfurt, Germany)
Yuri Matiyasevich (Steklov Inst. of Math., St. Petersburg, Russia)
Peter Bro Miltersen (Aarhus University, Denmark)
Georg Moser (University of Innsbruck, Austria)
Madhavan Mukund (Chennai Mathematical Institute, India)
Harald Räcke (University of Warwick, United Kingdom)
Uwe Schöning (Universität Ulm, Germany)
Jeffrey Shallit (University of Waterloo, Canada)
Alexander Shen (LIF, Marseille, France)
Alberto Marchetti Spaccamela (Università di Roma "La Sapienza", Italy)
Michael Tautschnig (TU Darmstadt, Germany)
Pascal Tesson (Université Laval, Canada)
Berthold Vöcking (RWTH Aachen, Germany)
Sergey Yekhanin (Microsoft Research, USA)
Alexander Zelikovsky (Georgia State University, USA)


Institute of Informatics, Tatarstan Academy of 
Sciences, and Kazan State University


Farid Ablayev (Kazan State University)


Authors are invited to submit an extended abstract or a full paper of at most
12 pages in the LNCS format (LaTeX, as pdf; final version with source);
instructions are here:
Proofs and other material omitted due to space constraints are to be put into
a clearly marked appendix to be read at discretion of the referees. Papers
must present original (and not previously published) research. Simultaneous
submission to journals or to other conferences with published proceedings is
not allowed.  The proceedings of the symposium will be published in Springer's
LNCS series.

Selected papers from the conference will be 
reviewed for and published in a special issue of 
Theory of Computing Systems (Springer-Verlag).

Submissions should be uploaded to the EasyChair 
Conference system: https://www.easychair.org/login.cgi?conf=csr2010


Web:	http://csr2010.antat.ru/
Web #2:	http://logic.pdmi.ras.ru/~csr/
Email:	csr2010.kazan at gmail.com

Items for the next CiE Newsletter should be sent to s.b.cooper at leeds.ac.uk
to arrive by December 31, 2009

   ASSOCIATION COMPUTABILITY IN EUROPE       http://www.computability.org.uk
   CiE Conference Series                          http://www.illc.uva.nl/CiE
   CiE 2010                                       http://www.cie2010.uac.pt/
   CiE Membership Application Form             http://www.cs.swan.ac.uk/acie
   ALAN TURING YEAR                           http://www.turingcentenary.eu/

__________ Information from ESET NOD32 Antivirus, 
version of virus signature database 4684 (20091213) __________

The message was checked by ESET NOD32 Antivirus.


More information about the FOM mailing list