Newsletter 129
November 1, 2010
*******************************************************************
* Past issues of the newsletter are available at
http://www.informatik.hu-berlin.de/lics/newsletters/
* Instructions for submitting an announcement to the newsletter
can be found at
http://www.informatik.hu-berlin.de/lics/newsletters/inst.html
* To unsubscribe, send an email with "unsubscribe" in the
body to lics@informatik.hu-berlin.de
*******************************************************************
TABLE OF CONTENTS
* LICS NEWS
* UPCOMING DEADLINES
Deadlines within the next six weeks
* CONFERENCES AND WORKSHOPS
RTA 2011 - Call for Papers (7.1.2011)
* BOOK ANNOUNCEMENTS
* JOB ANNOUNCEMENTS
DEADLINES
* STOC 2011
4.11.2010
http://www2.research.att.com/~dsj/stoc11/stoc11.html
* LICS 2011
16.11.2010 - Workshop Proposals
http://www.fields.utoronto.ca/programs/scientific/10-11/lics11/proposals.html
* RTA 2011
7.1.2011
http://www.rdp2011.uns.ac.rs/
22ND INTERNATIONAL CONFERENCE REWRITING TECHNIQUES AND APPLICATIONS (RTA 2011)
Monday, May 30 - Wednesday, June 1, 2011,
Novi Sad, Serbia
http://www.rdp2011.uns.ac.rs/
Call for Papers
* The 22nd International Conference on Rewriting Techniques and
Applications (RTA 2011) is organized as part of the Federated
Conference on Rewriting, Deduction, and Programming (RDP 2011),
together with the International Conference on Typed Lambda Calculi and
Applications (TLCA 2011), and several workshops. RDP 2011 will be
held at the University of Novi Sad, Serbia.
* IMPORTANT DATES:
Abstract Submission: January 7, 2011 (Friday)
Paper Submission: January 14, 2011 (Friday)
Notification: March 4, 2011 (Friday)
Final version: April 3, 2011 (Sunday)
Conference: May 30, 2011 (Monday)
* RTA is the major forum for the presentation of research on all aspects
of rewriting. Typical areas of interest include (but are not limited
to):
- Applications: case studies; analysis of cryptographic protocols;
rule-based (functional and logic) programming; symbolic and
algebraic computation; theorem proving; system synthesis and
verification; proof checking; reasoning about programming languages
and logics; program transformation; XML queries and transformations
- Foundations: matching and unification; narrowing; completion
techniques; strategies; rewriting calculi; constraint solving; tree
automata; termination; complexity; combination;
- Frameworks: string, term, and graph rewriting; lambda-calculus and
higher-order rewriting; constrained rewriting/deduction; categorical
and infinitary rewriting; integration of decision procedures; net
rewriting; binding techniques;
- Implementation: implementation techniques; parallel execution;
rewrite tools; termination checking; abstract machines; explicit
substitutions;
- Semantics: equational logic; rewriting logic; rewriting models of
programs.
* INVITED SPEAKERS:
Ashish Tiwari (SRI,USA) and Sophie Tison (Univ. Lille and LIFL, France)
will be invited speakers at RTA.
* PROGRAMME CHAIR:
Manfred Schmidt-Schauss (Goethe-Universität Frankfurt, Germany)
* PROGRAM COMMITTEE:
Franz Baader (TU Dresden, Germany)
Frederic Blanqui (INRIA, China)
Veronique Cortier (CNRS, Loria, France)
Dan Dougherty (Worcester Polytechnic Institute, United States)
Maribel Fernandez (King's College London, United Kingdom)
Juergen Giesl (RWTH Aachen, Germany)
Florent Jacquemard (INRIA Saclay, France)
Fairouz Kamareddine (Heriot-Watt University, United Kingdom)
Salvador Lucas (Universidad Politécnica de Valencia, Spain)
Narciso Marti-Oliet (Universidad Complutense de Madrid, Spain)
Aart Middeldorp (University of Innsbruck, Austria)
Georg Moser (University of Innsbruck, Austria)
Paliath Narendran (University at Albany--SUNY, United States)
Joachim Niehren (INRIA Lille, France)
Hitoshi Ohsaki (AIST Osaka, Japan)
Vincent van Oostrom (Universiteit Utrecht, The Netherlands)
Femke van Raamsdonk (Vrije Universiteit Amsterdam, The Netherlands)
Grigore Rosu (University of Illinois at Urbana-Champaign, USA)
Manfred Schmidt-Schauss (Goethe-Universität Frankfurt, Germany) (Chair)
Aleksy Schubert (The University of Warsaw,Poland)
Jakob Grue Simonsen (University of Copenhagen, Danmark)
Rene Thiemann (University of Innsbruck, Austria)
Christian Urban (TU München, Germany)
Johannes Waldmann (HTWK Leipzig, Germany)
Hans Zantema (Technische Universiteit Eindhoven, The Netherlands)
OPEN POSITION - UNIVERSITY OF LEIPZIG
* The Department of Mathematics and Computer Science at the University of
Leipzig, Germany, announces an open full-time position (research assistant)
in the group "Algebraic and Logical Foundations of Computer Science"
(Prof. Dr. Markus Lohrey).
* The position is funded via the DFG research project "Graphs with decidable
logics", and is available for 3 years starting January 2011. It is paid
according to the pay scale TV-L EG13.
* The project investigates infinite graphs with finite presentations
(e.g. automatic graphs, various transition graphs of infinite state systems,
etc.) with decidable logics (first-order logic, monadic second-order logic,
temporal logics, etc.) and in particular the complexity of the model
checking problem.
* The successful candidate
- must possess a Diploma or Master in computer science or related areas
(e.g. mathematics);
- should have a good background in theoretical computer science and
mathematics;
- should be interested in fundamental research questions in theoretical
computer science and mathematics.
* The position is suitable for candidates with or without a PhD.
For the latter, the possibility exists to do a PhD.
The post comes without teaching obligations, and knowledge of
the German language is not a requirement for the position.
* Informal inquiries are welcome and should be directed to Markus Lohrey via
lohrey@informatik.uni-leipzig.de or +49/0341 97 32201.
* Applications should
- contain a CV, a brief statement explaining the candidate's research
interests, and references,
- be directed electronically to lohrey@informatik.uni-leipzig.de.
* Deadline for applications: November 15th, 2010
Back to the LICS web page.