CiE Newsletter No.8, March 16, 2009 ___________________________________________________________________________ CONTENTS: 1. Nominations for next Editor-in-Chief of ACM Transactions on Computational Logic (ToCL) 2. CSL'09: 2nd Call for Papers and Call for Workshop Proposals 3. International conference Computability and Models in algebra, mathematical logic, and applications 4. 3rd WORKSHOP ON REACHABILITY PROBLEMS, RP'2009 5. CCA 2009: Second Call for Papers and Announcement 6. Call for papers - 10th Intl. Workshop on Termination - WST 2009 7. Positions in the MathWiki project ========================================================================= 1. (from Benedikt Loewe) Nominations for next Editor-in-Chief of ACM Transactions on Computational Logic (ToCL): Nominations (including self nominations) are invited for the next Editor-in-Chief of ACM Transactions on Computational Logic (ToCL): http://www.acm.org/pubs/tocl/. The position is for a term (renewable once) of three years, starting on July 1, 2009. Candidates should be well-established researchers in areas related to computational logic, broadly conceived, and should have sufficient experience serving on conference program committees and journal editorial boards. Nominations, including a current curriculum vita and a brief (one page) statement of vision for ToCL, should be sent to Joseph Halpern , by May 1, 2009. Final selection will be made by a Selection Committee, consisting of Joseph Halpern (chair -- Cornell University), Kryzsztof Apt (CWI), Prakash Panangaden (McGill University), and Gordon Plotkin (University of Edinburgh). Nominations received after May 1, 2009, will be considered up until the position is filled. ========================================================================= 2. (from Reinhard Kahle) CSL'09: 2nd Call for Papers and Call for Workshop Proposals: ******************************************************************** * CSL'09 * * Annual Conference of the European Association for * * Computer Science Logic * * September 7 - 11, 2009, Coimbra, Portugal * * http://www.mat.uc.pt/CSL09 * * CALL FOR PAPERS * ******************************************************************** * CALL FOR WORKSHOP PROPOSALS * * see at the bottom of the message * ******************************************************************** 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. Suggested topics of interest include: automated deduction and interactive theorem proving, constructive mathematics and type theory, equational logic and term rewriting, automata and games, modal and temporal logic, model checking, logical aspects of computational complexity, finite model theory, computational proof theory, logic programming and constraints, lambda calculus and combinatory logic, categorical logic and topological semantics, domain theory, database theory, specification, extraction and transformation of programs, logical foundations of programming paradigms, verification and program analysis, linear logic, higher-order logic, and nonmonotonic reasoning. Programme Committee: Invited Speakers: Samson Abramsky (Oxford) Mikolaj Bojanczyk (Warsaw) Matthias Baaz (Vienna) Thierry Coquand (Göteborg) Patricia Bouyer (Cachan) Martin Grohe (Berlin) Andrej Bulatov (Burnaby) Yiannis Moschovakis Stephen Cook (Toronto) (Athens, Los Angeles) Anuj Dawar (Cambridge) Paulo Oliva (London) Hugo Gimbert (Bordeaux) Erich Graedel (Aachen, co-chair) Steffen Hoelldobler (Dresden) Gerhard Jaeger (Berne) Reinhard Kahle (Lisbon, co-chair) Antonin Kucera (Brno) Benedikt Loewe (Amsterdam) Organizing Committee: Simone Martini (Bologna) Dale Miller (Paris) Ana Almeida (Coimbra, co-chair) Luke Ong (Oxford) Sabine Broda (Porto) Martin Otto (Darmstadt) Jose Carlos Espirito Santo (Braga) Jean-Francois Raskin (Brussels) Mario Florido (Porto) Thomas Schwentick (Dortmund) Gonzalo Gutierres (Coimbra) Luc Segoufin (Cachan) Reinhard Kahle (Lisbon, co-chair) Amilcar Sernadas (Lisbon) Isabel Oitavem (Lisbon) Anton Setzer (Swansea) Pedro Quaresma (Coimbra, co-chair) Helmut Veith (Darmstadt) Joao Rasga (Lisbon) Thomas Wilke (Kiel) Carlota Simoes (Coimbra) Proceedings will be published in the LNCS series. Each paper accepted by the Programme Committee must be presented at the conference by one of the authors, and final copy prepared according to Springer's guidelines. Submitted papers must be in Springer's LNCS style and of no more than 15 pages, presenting work not previously published. They must not be submitted concurrently to another conference with refereed proceedings. The PC chair should be informed of closely related work submitted to a conference or journal by 1 March 2009. Papers authored or coauthored by members of the Programme Committee are not allowed. Submitted papers must be in English and provide sufficient detail to allow the Programme Committee to assess the merits of the paper. Full proofs may appear in a technical appendix which will be read at the reviewer's discretion. The title page must contain: title and author(s), physical and e-mail addresses, identification of the corresponding author, an abstract of no more than 200 words, and a list of keywords. The submission deadline is in two stages. Titles and abstracts must be submitted by 30 March, 2009 and full papers by 6 April, 2009. Notifications of acceptance will be sent by 25 May, 2009, and final versions are due 22 June, 2009. The Ackermann Award for 2009 will be presented to the recipients at CSL'09. ******************************************************************** Important Dates: Submission (title & abstract): 30 March, 2009 Submission (full paper) 6 April, 2009 Notification: 25 May, 2009 Final papers: 22 June, 2009 ******************************************************************** CALL FOR WORKSHOP PROPOSALS Workshops affiliated to CSL '09 will be held before and after the main conference, on September 5 and 6, and on September 12 and 13, 2009. Researchers and practitioners are invited to submit proposals for workshops on topics relating logic to computer science. Proposals should include: * A short scientific summary and justification of the proposed topic. * Proposed format and agenda. * Proposed duration. * Expected number of participants. Proposals and/or enquiries should be submitted by March 31, 2009 by electronic mail in ASCII or PDF format to: Jose Carlos Espirito Santo ******************************************************************** Conference address: CSL'09 c/o Prof. Pedro Quaresma Departamento de Matemetica Universidade de Coimbra Apartado 3008 P-3001-454 Coimbra Portugal http://www.mat.uc.pt/CSL09 csl@mat.uc.pt ******************************************************************** ========================================================================= 3. (from N. Khisamiev) International conference Computability and Models in algebra, mathematical logic, and applications: First Announcement The international conference Computability and Models in algebra, mathematical logic, and applications will be held on August 30, 31; September 1, 2009 in Ust-Kamenogorsk, Republic of Kazakhstan. The conference will take place Ust-Kamenogorsk, East Kazakhstan Region Centre, located on the banks of the Irtysh in picturesque suburbs of the Altay mountains 600 km south of Novosibirsk. The conference is organized by D. Serikbaev East-Kazakhstan State Technical University and the Ministry of Education and Science of the Republic of Kazakhstan. The topics of the conference include Universal Algebra, Mathematical Logic, Computability Theory, Theoretical Computer Science, and related areas of Mathematics. The programme committee: Pr. Yu. Ershov, Chairman; Pr. S. Goncharov, Vice-chairman Pr. B. Khussainov; Pr. J. Knight; Pr. S. Lempp; Pr. R. Soare; Pr. M. Arslanov; Pr. S. Badaev; Pr. L. Maksimova; Pr. A. Morozov; Pr. E. Palyutin; Pr. V. Roman~Rkov; Pr. N. Khisamiev. The programme of the conference includes guest talks o 50 minute long, o 30 minute long, featured talks on o model theory, o computability theory and computable models, o non-classical logics and proof theory and theoretical computer science. Abstracts of the talks will be published. Requirements to be announced later. The conference will be held at the East-Kazakhstan State Technical University. Accommodation will be available at Ust-Kamenogorsk hotels and on university campus. Registration fee of 5,000 Kaz tenge (about 1300 roubles) may be paid on site. Important dates: * registration is open from February 20, 2009 * deadline for abstract submission: May 15, 2009 * confirmations of acceptance/rejection of abstracts will be sent before June 15, 2009 * deadline for booking accommodation:  July 23, 2009 * arrival day: August 29, 2009 * working days of the conference: August 30,31, September 1 2009 * departure day is September 2-3, 2009. Make provisions for Kazakhstan visas at the same time as your application for visas to the Russian Federation. If you have queries concerning participation in the conference, do not hesitate to contact the organizers by phone: +7 (7232) 54 08 63 or by e-mail: ILatkin@ektu.kz. Registration form: FULL NAME: TITLE, OCCUPATION: INSTITUTION TEL NO.: FAX NO.: CONTACT EMAIL: COUNTRY OF RESIDENCE: ========================================================================= 4. (from Olivier Bournez) 3rd WORKSHOP ON REACHABILITY PROBLEMS, RP'2009: ++++++++++ Submissions: April 23, 2009 +++++++++++++ LIX Colloquium: 3rd WORKSHOP ON REACHABILITY PROBLEMS, RP'2009 (September 23-25, 2009, Ecole Polytechnique, France) --------------------------------------------------- ==== Deadline for submissions: April 23, 2009 ==== ==== Proceedings will be published in the ==== ==== Springer LNCS series ==== --------------------------------------------------- http://www.lix.polytechnique.fr/rp09 The annual fall colloquium organized by the Computer Science Laboratory of Ecole Polytechnique (LIX) will host Reachability Problems RP'2009. Reachability Problems RP'2009 will take place at Ecole Polytechnique (on-site at Palaiseau, a suburb district of Paris). Papers presenting original contributions related to reachability problems in different computational models and systems are being sought. The Reachability Problems 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 - Verification Invited Speakers: ================ - Ahmed Bouajjani ( University of Paris 7 ) - Thomas A. Henzinger ( EPFL in Lausanne ) - Oded Maler ( VERIMAG ) - Alexander Shen ( CNRS Marseille ) - Moshe Y. Vardi ( Rice University ) Submissions: ============ Papers presenting original contributions related to reachability problems in different computational models and systems are being sought. Topics of interest include (but are not limited to): 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); predictability in iterative maps and new computational paradigms. Authors are invited to submit a draft of a full paper with at most 12 pages formatted according to LNCS guidelines. Proofs omitted due to space constraints must be put into an appendix to be read by the program committee members at their discretion. Submissions deviating from these guidelines risk rejection. Electronic submissions should be formatted in pdf. Simultaneous submission to other conferences or workshops with published proceedings is not allowed. Proceedings ============= The proceedings will be published in the Springer Verlag LNCS series and distributed during the conference. Selected papers will be invited to the special issue of a high quality journal devoted to RP 2009. Important dates: ================ - Submission: April 23, 2009 - Notification: May 30, 2009 - Final version: June 15, 2009 - Workshop: Sept. 23-25, 2009 Program Committee: ================ - Parosh Aziz Abdulla, Uppsala - Luca de Alfaro, Santa Cruz - Eugene Asarin, Paris - Vincent Blondel, Louvain - Bernard Boigelot, Liege - Ahmed Bouajjani , Paris - Olivier Bournez, Palaiseau - Cristian S. Calude, Auckland - Javier Esparza, Munchen - Laurent Fribourg, Cachan - Vesa Halava, Turku - Franjo Ivancic, Princeton - Oscar Ibarra, Santa Barbara - Alexei Lisitsa, Liverpool - Maurice Margenstern, Metz - Igor Potapov, Liverpool - Colin Stirling, Edinburgh - Wolfgang Thomas, Aachen - Hsu-Chun Yen, Taipei Workshop Organizers: ==================== - Olivier Bournez (Ecole Polytechnique) - Igor Potapov (University of Liverpool) with the help of the local organizers of the 2009 edition of the LIX colloquium. Contact: ================ 3rd Workshop on Reachability Problems 2009 - RP'09 Olivier Bournez: bournez@lix.polytechnique.fr Igor Potapov: potapov@liverpool.ac.uk http://www.lix.polytechnique.fr/rp09 ========================================================================= 5. (from Peter Hertling) CCA 2009: Second Call for Papers and Announcement: ______________________________________________________________ Second Call for Papers and Announcement Sixth International Conference on Computability and Complexity in Analysis 2009 (CCA 2009) August 18-22, 2009, Ljubljana, Slovenia Submission deadline: May 11, 2009 ______________________________________________________________ Invited Speakers * Mark Braverman (Cambridge, USA) * Vladik Kreinovich (El Paso, USA) * Dana Scott (Pittsburgh, USA) * Ning Zhong (Cincinnati, USA) Scientific Program Committee * Andrej Bauer (Ljubljana, Slovenia) * Vasco Brattka (Cape Town, South Africa) * Mark Braverman (Cambridge, USA) * Pieter Collins (Amsterdam, The Netherlands) * Peter Hertling, co-chair (Munich, Germany) * Hajime Ishihara (Ishikawa, Japan) * Ker-I Ko, co-chair (Stony Brook, USA) * Robert Rettinger (Hagen, Germany) * Victor Selivanov (Novosibirsk, Russia) * Alex Simpson (Edinburgh, Great Britain) * Dieter Spreen (Siegen, Germany) * Frank Stephan (Singapore) * Xizhong Zheng (Glenside, USA) Organizing Committee * Andrej Bauer, chair (Ljubljana, Slovenia) * Iztok Kavkler (Ljubljana, Slovenia) * Davorin Le¨nik (Ljubljana, Slovenia) * Matija Pretnar (Ljubljana, Slovenia) Venue Faculty of Mathematics and Physics, University of Ljubljana, and Institute of Mathematics, Physics, and Mechanics, Slovenia Tutorials * Martin Escardo (Birmingham, UK) * Bas Spitters and Russell O'Connor (Eindhoven, The Netherlands) Submissions Authors are invited to submit a PDF version of an extended abstract (typically 10-12 pages) on the following web page: http://www.easychair.org/conferences/?conf=cca2009 These extended abstracts should be prepared using the LNCS stylefile of Springer Verlag; see http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0 Proceedings Accepted papers will be published in an electronic proceedings volume in the DROPS series of Schloss Dagstuhl. In addition, a technical report containing the accepted papers will be available at the conference. It is planned to publish a special issue of some journal dedicated to CCA 2009 after the conference. Dates Submission deadline: May 11, 2009 Notification of authors: June 15, 2009 Final Version: July 13, 2009 Conference Web Page http://cca-net.de/cca2009/ ========================================================================= 6. (from Frederic Blanqui) Call for papers - 10th Intl. Workshop on Termination - WST 2009: 10th International Workshop on Termination (WST 2009) Leipzig, Germany, June 3-5, 2009 http://www.imn.htwk-leipzig.de/wst09/ Termination is a fundamental topic in computer science. Classical undecidability results show that termination is difficult. On the other hand, programs are usually required to terminate. So methods are needed that prove termination and non-termination automatically for a wide range of programs. Termination proofs are essential not only for program verification, but also as components of program transformation systems. The topic is challenging both in theory (mathematical logic, proof theory) and practice (software development, formal methods), and many interesting ramifications are yet to be explored. The 10th International Workshop on Termination will delve into all aspects of termination of processes. It will continue the sequence of successful workshops held in St. Andrews (1993), La Bresse (1995), Ede (1997), Dagstuhl (1999), Utrecht (2001), Valencia (2003), Aachen (2004), Seattle (2006), and Paris (2007). It will attain the same friendly atmosphere as those past workshops. The intent is to bring together, in an informal setting, researchers interested in all aspects of termination, whether this interest be practical or theoretical, primary or derived. The workshop shall help exchange ideas from term rewriting and from the various programming language communities. Contributions from the imperative, constraint, functional, and logic programming communities, and papers investigating new applications of termination are particularly welcome. Program Committee: Frederic Blanqui, INRIA, FR and Tsinghua University, CN Byron Cook, Microsoft Corporation, US Alfons Geser, HTWK Leipzig, DE (chair) Michael Hanus, Universität Kiel, DE Janis Voigtlander, Technische Universität Dresden, DE Local organization: Johannes Waldmann, HTWK Leipzig, DE Important Dates: Paper submission 19 April 2009 Notification 26 April 2009 Final Paper Version 3 May 2009 Conference Venue: The workshop will be held in the city of Leipzig, at the conference center Mediencampus Villa Ida. Hosting institution: Hochschule fur Technik, Wirtschaft und Kultur Leipzig, in cooperation with Leipzig School of Media and Medienstiftung der Sparkasse Leipzig. ========================================================================= 7. (from Bengt Nordstrom) Positions in the MathWiki project ========================================= 1 POSTDOC and 1 PHD POSITION in the MathWiki project at Radboud University Nijmegen (NL) http://www.fnds.cs.ru.nl/fndswiki/Vacancies The Institute for Computing and Information Science of the Radboud University Nijmegen (NL) is looking for 2 researchers to work on the NWO project "MathWiki a Web-based Collaborative Authoring Environment for Formal Proofs". The vacancies are: - a POSTDOC for the period of 3 years vacancy number: 62-16-09 - a PHD POSITION for the period of 4 years vacancy number: 62-17-09 AIMS OF THE PROJECT =================== The aim of the MathWiki project is to open up to a wider community the rich collections of knowledge stored in the repositories of proof assistants. To this end we will build a web-based collaborative authoring environment for formal mathematics, the MathWiki system. This system will provide interactive web access through a standardized interface to a number of proof assistants. The MathWiki system will also be a platform for the development of formal proofs within those proof assistants and it will provide high level access (through Wikipedia-like web pages) to their repositories of formalised mathematics. These repositories will reside on the server. In the project we will study and further develop Wiki technology and semantic web technology, all in the context of proof assistant repositories of formalized mathematics. The project thus brings together the open nature of Wiki authoring with expertise in Proof Assistants and Semantic Web technologies to build a new Wiki for mathematics, supporting content creation, search and retrieval. From the perspective of the ordinary user of mathematics, MathWiki will be important because it will provide high-level mathematical content on the web in a much more coherent and precise way than is available at present. From the proof assistant user perspective, MathWiki will be important because it will provide an advanced environment for the collaborative authoring of verified mathematics, mediated simply by a web interface. The MathWiki system will be based on our existing experience with proof assistant technology on the web, the "ProofWeb" systems, see http:://prover.cs.ru.nl ----------------------------------------------------------------- Requirements for the PhD student position: - A master's (or equivalent) degree in Computer Science, Mathematics or a related field, with a strong interest in proof assistants and/or semantic web technology (preferably both) - Commitment and a cooperative attitude. - Very good written and oral English skills. Requirements for the Postdoc position: - A PhD in Computer Science, Mathematics, or a related field with expertise in proof assistants and/or semantic web technology (preferably both). - A strong publication record. - Commitment and a cooperative attitude. - Very good written and oral English skills. ----------------------------------------------------------------- Conditions of employment: The PhD students will be employed for a period of 4 years (40 hrs/week). The Postdocs will be employed for a period of 3 years (40 hrs/week). Supervision for the projects will be done by Prof. Dr. Herman Geuvers and Dr. F. Wiedijk Postdoc and PhD student will be appointed by the Radboud University Nijmegen. Both positions shall start before October 1 2009, but preferably earlier. The salary for the PhD position starts at 2042 Euro per month, increasing to 2612 Euro per month in the fourth year. The maximum salary for the Postdoc is 3755 Euro per month (salary scale 10). ----------------------------------------------------------------- Information: For more information, see http://www.fnds.cs.ru.nl/fndswiki/Vacancies. For inquiries about the project and its positions, please contact the project leader Prof. Dr. Herman Geuvers (H.Geuvers@cs.ru.nl, +31 243652603). Interested candidates can ask the project leader for the complete project application text. ----------------------------------------------------------------- Application: Deadline for application is May 1, 2009. Send an application letter with CV and 3 references, mentioning the vacancy number by e-mail to RU Nijmegen, FNWI, P&O mrs. D. Reinders Postbus 9010 6500 GL Nijmegen Netherlands e-mail: pz@science.ru.nl telephone: +31 243652764 ========================================================================= Items for the next CiE Newsletter should be sent to pmt6sbc@leeds.ac.uk to arrive by April 2, 2009 -------------------------------------------------------------------------