CiE Newsletter, December 2008 ___________________________________________________________________________ CONTENTS: 1. Announcement of Future and Emerging Technologies conference, FET 2009, in Prague in April 2009 2. POST-GRADUATE PHD STUDENTSHIPS IN THEORETICAL COMPUTER SCIENCE, School of Electronic Engineering and Computer Science, Queen Mary, University of London 3. Positions in Formal Methods, Indiana University Computer Science Department 4. Fall school of Logic & Complexity, in Prague, September 21-25, 2009 5. New Intractability Center in Princeton, NJ 6. Postdoc position at the ILLC, University of Amsterdam 7. Call for papers for ANNALS OF PURE AND APPLIED LOGIC, SECOND SPECIAL ISSUE ON CLASSICAL LOGIC AND COMPUTATION, CL&C 2008 8. 4th INTERNATIONAL COMPUTER SCIENCE SYMPOSIUM IN RUSSIA (CSR 2009) - EXTENSION OF DEADLINE ___________________________________________________________________________ 1. (from Jiri Wiedermann) Announcement of Future and Emerging Technologies conference, FET 2009, in Prague in April 2009: I am sending an item for the CiE Newsletter - namely an announcement on the Future and Emerging Technologies conference FET 2009 to be held in April in Prague: http://ec.europa.eu/information_society/events/fet/2009/documents/fet09_1stc onferenceannouncement.pdf I guess that this information might be of interest to the CiE community. ___________________________________________________________________________ 2. (from Paulo Oliva) This may be of interest to students of list members. POST-GRADUATE PHD STUDENTSHIPS IN THEORETICAL COMPUTER SCIENCE School of Electronic Engineering and Computer Science Queen Mary, University of London Queen Mary is a world-leading centre for research on logical methods for reasoning about computer systems. Our work has spearheaded several developments - separation logic, logic for continuous systems, information theory for security, process types for web services, formal verification and human error - in which novel theoretical developments by us have been brought to bear in new application areas. We have also made fundamental contributions in pure logic (model theory, proof theory, categorical semantics) and in complexity theory; and have strong collaborations with the Maths department (Combinatorics, Network flow and Algebraic proof complexity). At the moment we have about £4m in research funding, supporting a thriving intellectual community. This includes an EPSRC "platform grant" (awarded to leading research groups in the UK to underpin their strategic development). Our group has a particularly strong track record of industrial collaborations, including recent collaborations with Microsoft, QinetiQ and Airbus UK. We are inviting applications for PhD positions in any of the areas above. Successful candidates are expected to start in September 2009. Several PhD studentships are available for UK residents (or EU citizens having studied in the UK for the last three years). The studentship will comprise full fees and an annual stipend commencing at £14,940 for the academic year 2008/9 (stipends are tax exempt). The stipend will increase by a small amount annually. Studentships will be awarded for a period of up to three years subject to satisfactory progress and are tenable in the School of Electronic Engineering and Computer Science, at the Queen Mary, University of London Campus, Mile End Road, London, UK. Competition for these funded positions is intense, so early application (say, by Feb 2009) is advised. We also have studentships (comprising of full fees plus annual stipend) for overseas students, although these require the candidate to carry out a certain amount of teaching during their studies. All applicants should hold a first or good upper second-class honors (or equivalent) degree in Computer Science, Electrical Engineering, Mathematics or a cognate area. It is desirable, but not mandatory, that candidates will have an MSc in theoretical computer science. Successful candidates will enroll on a full-time programme of research studies leading to the award of the degree of Doctor of Philosophy. As part of the PhD degree the successful candidate will be expected to attend international conferences. Completed applications should be submitted as soon as possible, ideally before 27 February 2009. Interviews will be held in March 2009. For further information please contact Dr Oliva (pbo@dcs.qmul.ac.uk) To apply, either: - Apply online at http://www.qmul.ac.uk/postgraduate/apply - Email Melissa Yeo (melissa@dcs.qmul.ac.uk) for application pack. For further information about our research group please visit http://www.dcs.qmul.ac.uk/research/logic --------------------------------------------------------------------------- 3. (from Daniel Leivant) The Indiana University Computer Science Department seeks applicants for junior and senior positions, with Formal Methods as one of the target areas. Please see www.cs.indiana.edu/hiring/facultylist.html for details and on-line application. While the stated closing date is December 31, applications are already actively considered, and interested people are urged to apply as soon as possible. --------------------------------------------------------------------------- 4. (from Alessandra Carbone) - it might be of interest for the CIE community: Dear colleagues, the next Fall school of Logic & Complexity will take place in Prague during September 21.-25., 2009. Starting this year we interpret the "School" as "Advanced School" but the programme should be available to dedicated students, willing to learn a necessary material along the way (and perhaps study a recommended literature in advance). The special themes of this school will be NP Search Problems and Algebraic computations and proofs The guest speakers of this school will be: Samuel R. Buss (University of California, San Diego) and Ran Raz (Weizmann Institute of Science, Rehovot). Speakers from the Prague school will include: Pavel Pudlak and Neil Thapen. More information is available at http://www.math.cas.cz/~krajicek/fall09.html Please distribute this announcement among your colleagues. My apologies for multiple copies arriving from different directions. Thank you! Regards, Jan Krajicek --------------------------------------------------------------------------- 5. (from Sanjeev Arora) New Intractability Center in Princeton, NJ Dear Colleague: I am writing to tell you about a new Center for Computational Intractability that is funded by the National Science Foundation and is a collaborative effort between Princeton University, Institute for Advanced Study, Rutgers University, and New York University. The PIs are Allender, Arora, Barak, Charikar, Chazelle, Impagliazzo, Khot, Naor, Saks, Szegedy,Wigderson, and Tarjan. The Center's mission views "intractability" fairly broadly, and covers both algorithms and complexity theory as well as other topics in theoretical CS. I would like to draw your attention specifically to the following: (a) Visiting possibilities for short-to-medium term (up to 1 year). We can pay travel costs and salary. (b) Several workshops a year, with possibilities to visit the center at the same time. (We can pay expenses.) (c) Postdoctoral positions both at the center and at the affiliated institutions. (d) Streaming videos of all center activities and seminars and other web-based resources. I invite you to visit our website http://intractability.princeton.edu/ and to especially click on "Opportunities" from the sidebar. I was wondering if you could forward this email to others in your department (including students and postdocs) who may be interested in the center's activities. Please note that the deadline for postdoc applications is December 15, and the deadline for postdoc applications to IAS is December 1. With best regards, Sanjeev Arora Director --------------------------------------------------------------------------- 6. (from Yde Venema) ================ POSTDOC POSITION ================ At the Institute for Logic, Language and Computation of the University of Amsterdam, there is a vacancy for a post-doctoral researcher in the field of Logic and Theoretical Computer Science. This position will form part of the NWO-funded VICI project ``Algebra and Coalgebra: the mathematical environment of modal logic", directed by Dr. Yde Venema. Job description -------------- The successful candidate is expected to do research related to the theory of modal logic. The investigations will preferably be in the following area: modal fixpoint logics, coalgebra and automata theory, but other proposals linking modal logic and (co)algebra will be considered as well. The position may include minor teaching duties in logic-related courses. Requirements ------------ We are looking for candidates with a strong background in mathematical logic and/or theoretical computer science, witnessed by publications in international journals and/or accepted papers at conferences. Candidates should have (almost) finished a PhD in an area closely related to modal logic, coalgebra or automata theory. Appointment ----------- The appointment will be for a period of two years, with the envisaged starting date being as soon as possible, but at the latest in September 2009. The gross monthly salary will be in accordance with the University regulations for academic personnel, and will, depending on experience, range from 2,916 euro to a maximum of 3,247 euro. More information ---------------- Further information about the positions, or about the VICI project ``Algebra and Coalgebra'' can be obtained from Dr. Y. Venema, e-mail: Y.Venema@uva.nl, URL: http://staff.science.uva.nl/~yde Job application --------------- Applications should include o a detailed CV including a list of publications o two letters of reference, one of which should be from the PhD thesis supervisor (referents should send their recommendation letters directly to the email address below). Applications should be sent by email to Dr. Y. Venema, Y.Venema@uva.nl, before December 12, 2008. --------------------------------------------------------------------------- 7. (from Uli Berger) ************************************************************ ANNALS OF PURE AND APPLIED LOGIC SECOND SPECIAL ISSUE ON CLASSICAL LOGIC AND COMPUTATION CL&C 2008 ************************************************************ CALL FOR PAPERS =============== Contributions on the topic of Classical Logic and Computation are invited for a special issue of Annals of Pure and Applied Logic. On July 13, 2008, the second meeting on "Classical Logic and Computation" took place in Reykjavik - Iceland, as a satellite meeting of ICALP 2008. The meeting intended to cover all work aiming to explore computational aspects of classical logic and mathematics. The special issue is first of all set up for papers presented at the workshop, but the call is open to all researchers. TOPICS Topics of interest for contributions to the journal issue include, but are not limited to: - logic and type theory, - programming language design, - verification, - witness extraction from classical proofs, - game semantic of classical logic, SUBMISSIONS Submissions must be original work, which has not been previously published in a journal and is not being considered for publication elsewhere. If related material has appeared in a refereed conference proceedings, the manuscript submitted should be substantially more complete or otherwise different. A title page must include: full title, authors' full names and affiliations, and the address to which correspondence and proofs should be sent. Where possible, e-mail address and telephone number should be included. This should be followed by an abstract of approximately 300 words and five key words for indexing. IMPORTANT All source files of the final versions of the accepted papers must respect the format of APAL. In order to make a submission, please follow the instructions from: http://www.elsevier.com/wps/find/journaldescription.cws_home/505603/authorin structions Please upload a .pdf file to the following easy chair link http://www.easychair.org/conferences/?conf=clc08apal Deadline for the submission of a title page indicating the intent to submit: March 1, 2009 Deadline for paper submission: March 30, 2009 Guest editors: Steffen van Bakel, Imperial College, London, UK Stefano Berardi, Universita` di Torino, Italy Ulrich Berger, Swansea University, UK Contact: u.berger@swansea.ac.uk --------------------------------------------------------------------------- 8. (from Andrei Morozov) ATTENTION: THE DEADLINE IS EXTENDED! Final Call for Papers 4th INTERNATIONAL COMPUTER SCIENCE SYMPOSIUM IN RUSSIA (CSR 2009) August 18-23, 2009, Novosibirsk, Russia http://math.nsc.ru/conference/csr2009/index.shtml ************************************************************************* CSR 2009 intends to reflect the broad scope of international cooperation in computer science. It is the 4th conference in a series of regular events started with CSR 2006 in St.Petersburg (see LNCS 3967), CSR 2007 in Ekaterinburg (see LNCS 4649), and CSR 2008 in Moscow (see LNCS 5010). As usual, CSR 2009 consists of two tracks: Theory Track and Applications and Technology Track. IMPORTANT DATES: Deadline for submissions: EXTENDED TO DECEMBER 3 2008. Notification of acceptance: February 3, 2009 Conference dates: August 18-23, 2009 Traditional YANDEX AWARD for the Best paper and the Best student paper is established! TOPICS Theory Track topics include * algorithms and data structures * complexity and cryptography * formal languages and automata * computational models and concepts * proof theory and applications of logic to computer science. Application Track topics include * abstract interpretation * model checking * automated reasoning * deductive methods * constraint solving * functional and declarative languages * type systems * software engineering * development methodologies for design, development, testing, analysis, and verification of correct and reliable systems. OPENING LECTURE: Andrei Voronkov (University of Manchester). INVITED SPEAKERS INCLUDE Wolfgang Thomas (RWTH Aachen) Nikolai K. Vereshchagin (Moscow State University) Hongseok Yang (Queen Mary University, London) Other invited speakers TBA PROGRAM COMMITTEES Program committee of Theory Track is: Farid Ablayev, Kazan State University Sergei N. Artemov, City University of New York Lev Beklemishev, Steklov Inst., Moscow Veronique Bruyere, Universite de Mons-Hainaut Cristian Calude, University of Auckland Christian Glasser, Universitaet Wuerzburg Dima Grigoriev, Institut de Recherche Mathematique de Rennes Dietrich Kuske, Universitaet Leipzig Larisa Maksimova, IM, Novosibirsk Andrei Mantsivoda, Irkutsk State University Yuri Matiyasevich, Steklov Institute, St.Petersburg Elvira Mayordomo, Universidad de Zaragoza Pierre McKenzie, Universite de Montreal Andrey S. Morozov, IM, Novosibirsk (co-chair) Jean-Eric Pin, LIAFA, Paris Kai Salomaa, Queen's University, Kingston, Canada Victor Selivanov, Novosibirsk Pedagogical University Ludwig Staiger, Universitaet Halle-Wittenberg Klaus W. Wagner, Universitaet Wuerzburg (co-chair) Program committee of Applications and Technology Track is: Thomas Ball, Microsoft Research Josh Berdine, Microsoft Research Bart Demoen, K.U. Leuven Franjo Ivancic, NEC Laboratories America Martin Leucker, TU Munich Rupak Majumdar, University of California, Los Angeles Greg Morrisett, Harvard University Arnd Poetzsch-Heffter, University of Kaiserslautern Andreas Rossberg, MPI-SWS Andrey Rybalchenko, MPI-SWS (chair) Alexander Serebrenik, TU Eindhoven Henny Sipma, Stanford University Natasha Sharygina, University of Lugano Helmut Veith, TU Darmstadt Eran Yahav, IBM Research Andreas Zeller, Universitaet des Saarlandes ORGANIZERS: Sobolev Institute of Mathematics SB RAS. Conference chair: Anna Frid SUBMISSIONS: Authors are invited to submit an extended abstract or a full paper of at most 10 pages in the LNCS format (the instructions on it can be found here: http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0). 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 submissions to journals or to other conferences with published proceedings are not allowed. The proceedings of the symposium will be published in Springer's LNCS series. Selected papers from the Theory track will be published in a special issue of Theory of Computing Systems. Submissions should be uploaded at EasyChair Conference system: http://www.easychair.org/conferences/?conf=csr09 . FURTHER INFORMATION AND CONTACTS: Web: http://math.nsc.ru/conference/csr2009/index.shtml Email: csr2009@math.nsc.ru --------------------------------------------------------------------------- Items for the January CiE Newsletter should be sent to pmt6sbc@leeds.ac.uk to arrive by December 31, 2008 ---------------------------------------------------------------------------