Newsletter 133 December 20, 2011 ******************************************************************* * 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 ******************************************************************* TABLE OF CONTENTS * DEADLINES Deadlines in the coming weeks * LICS MATTERS LICS News * CONFERENCES AND WORKSHOPS LICS 2012 - Call for Papers RTA 2012 - Call for Papers MPC 2012 - Call for Papers CAV 2012 - Call for Papers CiE 2012 - Call for Papers IJCAR 2012 - Call for Papers SAT 2012 - Call for Papers ITP 2012 - Call for Papers ICALP 2012 - Call for Papers MFPS 2012 - Call for Papers ICLP 2012 - Call for Papers and Workshop Proposals DATALOG 2.0 - Call for Papers Logical Approaches to Barriers in Complexity - Call for Participation SAT/SMT Summer School - Call for Participation EASLLC 2012 - First Announcement * AWARDS Ackermann Award 2011 - Report Ackermann Award 2012 - Call for Nominations UPCOMING DEADLINES * LICS 2012 Abstract submission: 6.1.2012 http://informatik.hu-berlin.de/lics/lics12 * RTA 2012 Abstract submission: 4.1.2012 http://rta2012.trs.cm.is.nagoya-u.ac.jp/ * MPC 2012 Abstract Submissions: 9.1.2012 http://babel.ls.fi.upm.es/mpc2012 * CAV 2012 Abstract submission: 15.1.2012http://cav12.cs.illinois.edu/ * CiE 2012 Submission deadline: 20.1.2012 http://www.cie2012.eu * IJCAR 2012 Abstract submission: 23.1.2012 http://ijcar.cs.manchester.ac.uk/ * SAT 2012 - Call for Papers Abstract submission: 5.2.2012 http://sat2012.fbk.eu/ * ITP 2012 Abstract submission: 6.2.2012 http://itp2012.cs.princeton.edu/ * ICALP 2012 Submission deadline: 21.2.2012 http://www2.warwick.ac.uk/go/icalp2012 * MFPCS 2012 Abstract submission: 24.2.2012 http://www.math.tulane.edu/~mfps/MFPS28 * ICLP 2012 Workshop Proposals: 29.1.2012 Abstract submission: 11.3.2012 http://www.cs.bme.hu/iclp2012/ * DATALOG 2.0 Submission deadline: 20.3.2012 http://www.dbai.tuwien.ac.at/datalog2.0 HIGHLIGHTS AND CHANGES FOR LICS 2012: * Starting with 2012, there will be some changes in the way LICS is organised, which we highlight here: * Starting 2012, LICS is jointly organized by ACM and IEEE, and is cosponsored by ACM SIGACT and the IEEE Computer Society. * In response to concerns about LICS becoming overly selective with a too-narrow technical focus, the program committee will employ a merit-based selection with no a priori limit on the number of accepted papers. All papers meeting the LICS quality standards will be published, regardless of popularity of topic. The programme will be scheduled to accommodate the accepted papers. * LICS 2012 will continue the tradition of pre-conference tutorials that was initiated in 2011. This year, - Jan Willem Klop will give a tutorial on term rewrite systems and - Andre Platzer will give a tutorial on logics of dynamical systems. * Special Events and Invited Lectures: There will be an invited lecture by - Robert J. Aumann, winner of the 2005 Nobel Prize in Economic Sciences, and - a plenary session in honor of Alan Turing on the occasion of his centenary, with talks by Robert L. Constable, E. Allen Emerson (co-winner of 2008 A. M. Turing Award), Joan Feigenbaum, and Leonid Levin. TWENTY-SEVENTH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2012) CALL FOR PAPERS June 25--28, 2012, Dubrovnik, Croatia http://informatik.hu-berlin.de/lics/lics12 * LICS 2012 will be hosted by the University of Dubrovnik, in Dubrovnik, Croatia, from June 25th to 28th, 2012. * 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 include: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, formal aspects of program analysis, formal methods, foundations of computability, higher-order logic, lambda and combinatory calculi, linear logic, logic in artificial intelligence, logic programming, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantics, proof theory, real-time systems, reasoning about security, rewriting, type systems and type theory, and verification. * Important Dates: January 6, 2012: Titles & Short Abstracts Due January 13, 2012: Extended Abstracts Due March 25, 2012: Author Notification (approximate) April 29, 2012: Final Versions Due for Proceedings: * Authors are required to submit a paper title and a short abstract of about 100 words in advance of submitting the extended abstract of the paper. * At committee discretion, authors will be asked to respond to inquiries in February or March. Deadlines are firm; late submissions will not be considered. All submissions will be electronic via http://easychair.org/conferences/?conf=lics2012. * Short Presentations: A session of short presentations, intended for descriptions of student research, works in progress, and other brief communications, is planned. These abstracts will not be published. Dates and guidelines are posted on the LICS website. * Special Events: - Invited plenary lecture by Robert J. Aumann, winner of the 2005 Nobel Prize in Economic Sciences. - Two plenary sessions in honor of Alan Turing on the occasion of his centenary, featuring talks by Robert L. Constable, E. Allen Emerson, Joan Feigenbaum, and Leonid Levin. * Pre-conference tutorials on Sunday, June 24, by - Jan Willem Klop (rewriting systems) and - André Platzer (logic of dynamical systems). * Associated workshops on Sunday, June 24, and on Friday, June 29. * Special Issues: Full versions of up to three accepted papers, to be selected by the program committee, will be invited for submission to the Journal of the ACM. Additional selected papers will be invited to a special issue of Logical Methods in Computer Science. * Program Chair: Nachum Dershowitz, Tel Aviv University * Program Committee: Christel Baier, Dresden Univ. of Technology Lev Beklemishev, Steklov Inst of Mathematics Andreas Blass, Univ. of Michigan Manuel Bodirsky, École Polytechnique Mikolaj Bojanczyk, Warsaw Univ. Ahmed Bouajjani, Univ. Paris Diderot Patricia Bouyer-Decitre, CNRS Andrei Bulatov, Simon Fraser Univ. Hubert Comon-Lundh, ENS Cachan Anuj Dawar, Univ. of Cambridge Gilles Dowek, INRIA Martín Escardó, Univ. of Birmingham Maribel Fernández, King's College London Rob van Glabbeek, NICTA Rosalie Iemhoff, Utrecht Univ. Neil Immerman, UMass, Amherst Max Kanovich, Queen Mary, Univ. of London Naoki Kobayashi, Tohoku Univ. Orna Kupferman, Hebrew Univ. Marta Kwiatkowska, Univ. of Oxford Olivier Laurent, CNRS -- ENS Lyon Richard Mayr, Univ. of Edinburgh Andrzej Murawski, Univ. of Leicester David Plaisted, Univ. North Carolina, Chapel Hill Davide Sangiorgi, Univ. of Bologna * Conference Chairs: Vlatko Lipovac, Univ. of Dubrovnik Andre Scedrov, Univ. of Pennsylvania * Workshop Chairs: Adriana Compagnoni, Stevens Inst. of Technology Maribel Fernáandez, King's College London * Publicity Chairs: Stephan Kreutzer, Berlin Univ. of Technology Andrzej Murawski, Univ. of Leicester * Treasurer: Martín Escardó, Univ. of Birmingham * General Chair: Rajeev Alur, Univ. of Pennsylvania * Organizing Committee: M. Abadi, R. Alur (chair), F. Baader, P. Beame, S. Buss, E. Clarke, A. Compagnoni, N. Dershowitz, M. Escard'o, M. Fern'andez, L. Fortnow, J. Giesl, M. Grohe, J.-P. Jouannaud, P. Kolaitis, S. Kreutzer, B. Larose, V. Lipovac, J. Makowsky, B. Monien, A. Murawski, A. Scedrov, P. Scott, M. Valeriote * Sponsorship: The symposium is sponsored by the IEEE Technical Committee on Mathematical Foundations of Computing and by ACM SIGACT, in cooperation with the Association for Symbolic Logic and the European Association for Theoretical Computer Science. * Please see the LICS website http://informatik.hu-berlin.de/lics/lics12 for further information. 23RD INTERNATIONAL CONFERENCE REWRITING TECHNIQUES AND APPLICATIONS (RTA) Second Call For Papers May 28 - Jun 2, 2012, Nagoya, Japan http://rta2012.trs.cm.is.nagoya-u.ac.jp/ * The 23rd International Conference on Rewriting Techniques and Applications (RTA 2012) is the major forum for the presentation of research on rewriting. * IMPORTANT DATES: Abstract: Jan 04, 2012 Paper Submission: Jan 09, 2012 Notification: Mar 02, 2012 Final version: Mar 26, 2012 * RTA 2012 seeks original submissions 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; SMT solving; theorem proving; system synthesis and verification; proof checking; reasoning about programming languages and logics; program transformation; XML queries and transformations; systems biology; - Foundations: equational logic; rewriting logic; rewriting models of programs; 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; stochastic rewriting; net rewriting; binding techniques; Petri nets; - Implementation: implementation techniques; parallel execution; rewrite and completion tools; confluence and termination checking; certification of rewriting properties; abstract machines; explicit substitutions; * PROGRAMME COMMITTEE CHAIR: Ashish Tiwari SRI International, Menlo Park, CA http://www.csl.sri.com/users/tiwari * PROGRAMME COMMITTEE: Andreas Abel Ludwig-Maximilians-University Munich Zena Ariola University of Oregon Paolo Baldan Università degli Studi di Padova Ahmed Bouajjani University of Paris 7 Evelyne Contejean LRI Université Paris-Sud-CNRS Irène Anne Durand LaBRI Université of Bordeaux Jörg Endrullis Vrije Universiteit Amsterdam Silvio Ghilardi Università degli Studi di Milano Guillem Godoy Universidad Politécnica de Cataluña Nao Hirokawa Japan Advanced Institute of Science and Technology Deepak Kapur University of New Mexico, Albuquerque, NM Jordi Levy IIIA - CSIC Paul-Andre Mellies University of Paris 7 Pierre-Etienne Moreau Ecole des Mines de Nancy Joachim Niehren INRIA Lille Grigore Rosu University of Illinois at Urbana-Champaign Albert Rubio Universidad Politécnica de Cataluña Masahiko Sakai Nagoya University Carolyn Talcott SRI International René Thiemann University of Innsbruck * CONFERENCE CHAIR: Masahiko Sakai Nagoya University * INVITED SPEAKERS: Hirokazu Anai Fujitsu Labs. & Kyushu University Claude Kirchner INRIA & LORIA Sebastian Maneth NICTA & Univ. of New South Wales * Abstracts and papers must be submitted electronically through the EasyChair system at: http://www.easychair.org/conferences/?conf=RTA2012 * Questions concerning submissions may be addressed to the PC chair, Ashish Tiwari by emailing ashish_dot_tiwari_at_sri_dot_com MPC 2012 - 11TH INTERNATIONAL CONFERENCE ON MATHEMATICS OF PROGRAM CONSTRUCTION Call for Papers Madrid, Spain, 25-27 June 2012 http://babel.ls.fi.upm.es/mpc2012 * The biennial MPC conferences aim to promote the development of mathematical principles and techniques that are demonstrably practical and effective in the process of constructing computer programs, broadly interpreted. * Topics of interest range from algorithmics to support for program construction in programming languages and systems. The notion of "program" is broad; typical areas are type systems, program analysis and transformation, programming-language semantics, security, program logics. Theoretical contributions are welcome, provided that their relevance to program construction is clear. Reports on applications are welcome, provided that their mathematical basis is evident. * Important dates: abstracts 09 Jan 2012, full papers 16 Jan 2012, notification 19 Mar 2012, final version 16 Apr 2012. 24TH INTERNATIONAL CONFERENCE ON COMPUTER AIDED VERIFICATION (CAV) CALL FOR PAPERS July 7-13, 2012 Berkeley, California, USA Website: http://cav12.cs.illinois.edu/ * Program Chairs: Madhusudan Parathasarathy and Sanjit A. Seshia * Aims and Scope The conference on Computer Aided Verification (CAV), 2012, is the 24th 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 spurring advances in hardware and software verification while expanding to new domains such as biological systems and computer security. The conference covers the spectrum from theoretical results to concrete applications, with an emphasis on practical verification tools and the algorithms and techniques that are needed for their implementation. The proceedings of the conference will be published in the Springer-Verlag Lecture Notes in Computer Science series. A selection of papers will be invited to a special issue of Formal Methods in System Design and the Journal of the ACM. * NEW in 2012 CAV will have *special tracks* in the following four areas: 1. Hardware Verification (track chair: Andreas Kuehlmann) 2. Computer Security (track chair: Somesh Jha) 3. Embedded Systems (track chair: Stavros Tripakis) 4. SAT and SMT (track chair: Daniel Kroening) * Submissions in these four topics are especially encouraged. Papers in these areas will be subject to the same rigorous review process as other papers. Accepted special track papers will be organized into special sessions that are highlighted in the program. * Events The conference will include the following events: - Pre-conference workshops on July 7-8. - The main conference will take place July 9th-13th: + Invited tutorials on July 9th. + Technical sessions on July 10-13. - Please see the conference website for further details. * Paper Submission Papers must be submitted in PDF format. Submission is done with EasyChair. Information about the submission procedure will be available at: http://cav12.cs.illinois.edu/ * Important Dates - Abstract submission: January 15, 2012 - Paper submission (firm): January 22, 2012 at 23:59 Samoa time (UTC/GMT-11) - Author feedback/rebuttal period: March 7-9, 2012 - Notification of acceptance/rejection: March 22, 2012 - Final version due: April 20, 2012 * Program Chairs Madhusudan Parthasarathy, University of Illinois at Urbana-Champaign, USA Sanjit A. Seshia, University of California at Berkeley, USA * Program Committee Rajeev Alur (Univ. Pennsylvania) Roderick Bloem (TU Graz) Supratik Chakraborty (IIT Bombay) Swarat Chaudhuri (Rice Univ.) Adam Chlipala (MIT) Vincent Danos (University of Edinburgh) Thomas Dillig (College of William and Mary) Andy Gordon (Microsoft Research) Mike Gordon (Cambridge Univ.) Orna Grumberg (Technion) Aarti Gupta (NEC Labs) William Hung (Synopsys) Somesh Jha (Univ. Wisconsin) Ranjit Jhala (UCSD) Bengt Jonsson (Uppsala Univ.) Rajeev Joshi (NASA JPL) Daniel Kroening (Oxford Univ.) Andreas Kuehlmann (Coverity) Viktor Kuncak (EPFL) Shuvendu Lahiri (Microsoft Research) Rupak Majumdar (MPI-SWS) Ken Mcmillan (Microsoft Research) David Molnar (Microsoft Research) Kedar Namjoshi (Bell Labs) Albert Oliveras (TU Catalonia, Barcelona) Joel Ouaknine (Oxford Univ.) Gennaro Parlato (Univ. of Southampton) Madhusudan Parthasarathy (UIUC) Nir Piterman (Univ. of Leicester) Andreas Podelski (Univ. of Freiburg) Shaz Qadeer (Microsoft Research) Zvonimir Rakamaric (Univ. of Utah) Sriram Sankaranarayanan (Univ. of Colorado) Sanjit A. Seshia (UC Berkeley) Natasha Sharygina (Univ. of Lugano) Stavros Tripakis (UC Berkeley) Helmut Veith (TU Vienna) Mahesh Viswanathan (UIUC) Jin Yang (Intel) Karen Yorav (IBM) * CAV Award The annual CAV Award has been established for a specific fundamental contribution or a series of outstanding contributions to the field of Computer Aided Verification. The award of $10,000 will be granted to an individual or a group of individuals chosen by the Award Committee from a list of nominations. The Award Committee may choose to make no award. The CAV Award shall be presented in an award ceremony at CAV and a citation will be published in a Journal of Record (currently, Formal Methods in System Design). * Call for Nominations for the CAV Award Anyone can submit a nomination. The Award Committee can originate a nomination. Anyone, with the exception of members of the Award Committee, is eligible to receive the Award. A nomination must state clearly the contribution(s), explain why the contribution is fundamental or the series of contributions is outstanding, and be accompanied by supporting letters and other evidence of worthiness. Nominations should include a proposed citation (up to 25 words), a succinct (100-250 words) description of the contribution(s), and a detailed statement to justify the nomination. The cited contribution(s) must have been made not more recently than five years ago and not over twenty years ago. In addition, the contribution(s) should not yet have received recognition via a major award, such as the ACM Turing or Kanellakis Awards. The nominee may have received such an award for other contributions. * The 2012 CAV Award Committee consists of Thomas A. Henzinger (Chair) Rajeev Alur Marta Kwiatkowska Aarti Gupta The nominations should be sent to Thomas Henzinger at email@example.com. Nominations must be received by January 22, 2012. COMPUTABILITY IN EUROPE 2012: HOW THE WORLD COMPUTES TURING CENTENARY CONFERENCE http://www.cie2012.eu University of Cambridge Cambridge, 18-23 June 2012 Call for Papers * CiE 2012 is one of a series of special events, running throughout the Alan Turing Year, celebrating Turing's unique impact on mathematics, computing, computer science, informatics, morphogenesis, artificial intelligence, philosophy and computational aspects of physics, biology, linguistics, connectionist models, economics and the wider scientific world. * CiE 2012 is planned to be an event worthy of the remarkable scientific career it commemorates. * PLENARY SPEAKERS include: Andrew Hodges (Oxford, Special Invited Lecture), Ian Stewart (Warwick, Special Public Lecture), Dorit Aharonov (Jerusalem), Veronica Becher (Buenos Aires), Lenore Blum (Carnegie Mellon), Rodney Downey (Wellington), Yuri Gurevich (Microsoft), Juris Hartmanis (Cornell), Richard Jozsa (Cambridge), Stuart Kauffman (Vermont/ Santa Fe), James Murray (Washington/ Oxford, Microsoft Research Lecture), Stuart Shieber (Harvard), Paul Smolensky (Johns Hopkins) and Leslie Valiant (Harvard, jointly organised lecture with King's College). * SUBMISSION OF PAPERS and informal presentations are now invited for this historic event. * For submission details, see: http://www.mathcomp.leeds.ac.uk/turing2012/WScie12/give-page.php?12 * The CONFERENCE PROCEEDINGS will be published by LNCS, Springer-Verlag. Post-conference publications include special issues of APAL and LMCS. We encourage all researchers presenting papers of the highest research quality at CiE 2012 to submit their full papers to the CiE journal COMPUTABILITY where they will be handled as regular submissions. * IMPORTANT DATES: Submission Deadline for LNCS: Jan. 20, 2012 Notification of authors: Mar. 16, 2012 Deadline for final revisions: Apr. 6, 2012 Submission Deadline for Informal Presentations: May 11, 2012 * SPECIAL SESSIONS include: - The Universal Turing Machine, and History of the Computer Chairs: Jack Copeland and John Tucker - Cryptography, Complexity, and Randomness Chairs: Rod Downey and Jack Lutz Speakers so far: Eric Allender, Lance Fortnow, Omer Reingold, Alexander Shen - The Turing Test and Thinking Machines Chairs: Mark Bishop and Rineke Verbrugge Speakers: Bruce Edmonds, John Preston, Susan Sterrett, Kevin Warwick, Jiri Wiedermann - Computational Models After Turing: The Church-Turing Thesis and Beyond Chairs: Martin Davis and Wilfried Sieg Speakers: Giuseppe Longo, Peter Nemeti, Stewart Shapiro (tbc), Matthew Szudzik, Philip Welch, Michiel van Lambalgen - Morphogenesis/Emergence as a Computability Theoretic Phenomenon Chairs: Philip Maini and Peter Sloot Speakers: Jaap Kaandorp, Shigeru Kondo, Nick Monk, John Reinitz, James Sharpe, Jonathan Sherratt - Open Problems in the Philosophy of Information Chairs: Pieter Adriaans and Benedikt Loewe Speakers: Patrick Allo, Luis Antunes, Mark Finlayson, Amos Golan, Ruth Millikan * PROGRAMME COMMITTEE * Samson Abramsky (Oxford) * Pieter Adriaans (Amsterdam) * Franz Baader (Dresden) * Arnold Beckmann (Swansea) * Mark Bishop (London) * Paola Bonizzoni (Milan) * Luca Cardelli (Cambridge) * Douglas Cenzer (Gainesville) * S Barry Cooper (Leeds, Co-chair) * Ann Copestake (Cambridge) * Anuj Dawar (Cambridge, Co-chair) * Solomon Feferman (Stanford) * Bernold Fiedler (Berlin) * Luciano Floridi (Hertfordshire) * Martin Hyland (Cambridge) * Marcus Hutter (Canberra) * Viv Kendon (Leeds) * Stephan Kreutzer (Oxford) * Ming Li (Waterloo) * Benedikt Loewe (Amsterdam) * Angus MacIntyre (London) * Philip Maini (Oxford) * Larry Moss (Bloomington) * Amitabha Mukerjee (Kanpur) * Damian Niwinski (Warsaw) * Dag Normann (Oslo) * Prakash Panangaden (Montreal) * Jeff Paris (Manchester) * Brigitte Pientka (Montreal) * Helmut Schwichtenberg (Munich) * Wilfried Sieg (Carnegie Mellon) * Mariya Soskova (Sofia) * Bettina Speckmann (Eindhoven) * Christof Teuscher (Portland) * Peter van Emde Boas (Amsterdam) * Jan van Leeuwen (Utrecht) * Rineke Verbrugge (Groningen) 6TH INTERNATIONAL JOINT CONFERENCE ON AUTOMATED REASONING (IJCAR) Second Call For Papers Manchester, UK, June 26-July 1, 2012 http://ijcar.cs.manchester.ac.uk/ * Important Dates (all in 2012) Abstract submission January 23 Final version due April 16 Paper submission January 30 Conference dates June 26-29 Notification March 26 Satellite events June 30-July 1 * IJCAR is the premier international joint conference on all topics in automated reasoning. IJCAR 2012, the 6th International Joint Conference on Automated Reasoning, is a merger of leading events in automated reasoning: CADE (International Conference on Automated Deduction), FroCoS (International Symposium on Frontiers of Combining Systems), FTP (International Workshop on First-order Theorem Proving), and TABLEAUX (International Conference on Automated Reasoning with Analytic Tableaux and Related Methods). Previous editions of IJCAR took place in Siena (2001), Cork (2004), Seattle (2006), Sydney (2008) and Edinburgh (2010), cf. http:/ /www.ijcar.org/. * IJCAR 2012 is held as part of the Alan Turing Year 2012 just after The Alan Turing Centenary Conference in Manchester. * Scope: IJCAR 2012 invites submissions related to all aspects of automated reasoning, including foundations, implementations, and applications. Original research papers and descriptions of working automated deduction systems are solicited. * Logics of interest include: propositional, first-order, classical, equational, higher-order, non-classical, constructive, modal, temporal, many-valued, substructural, description, metalogics, type theory, and set theory. Methods of interest include: tableaux, sequent calculi, resolution, model-elimination, connection method, inverse method, paramodulation, term rewriting, induction, unification, constraint solving, decision procedures, model generation, model checking, semantic guidance, interactive theorem proving, logical frameworks, AI-related methods for deductive systems, proof presentation, efficient datastructures and indexing, integration of computer algebra systems and automated theorem provers, and combination of logics or decision procedures. * Applications of interest include: verification, formal methods, program analysis and synthesis, computer mathematics, declarative programming, deductive databases, knowledge representation, natural language processing, linguistics, robotics, and planning. * Submission: Submission is electronic through https://www.easychair.org/conferences/?conf=ijcar2012 * Conference Chairs Konstantin Korovin, University of Manchester, UK Andrei Voronkov, University of Manchester, UK * Program Chairs Bernhard Gramlich (TU Wien, Austria) Dale Miller (INRIA Saclay, France) Ulrike Sattler (University of Manchester, UK) * Program Committee Takahito Aoto, Tohoku University, Japan Franz Baader, TU Dresden, Germany Peter Baumgartner, NICTA, ANU, Australia Maria Paola Bonacina, Universita degli Studi di Verona, Italy Torben Braüner, Roskilde University, Denmark Michael Fink, TU Wien, Austria Jacques Fleuriot, University of Edinburgh, UK Silvio Ghilardi, Universita degli Studi di Milano, Italy Jürgen Giesl, RWTH Aachen ,Germany Bernhard Gramlich, TU Wien, Austria Reiner Hähnle, Chalmers University of Technology, Sweden Florent Jacquemard, ENS de Cachan, France Deepak Kapur, University of New Mexico, Albuquerque, USA Yevgeni Kazakov, University of Oxford, UK Hélène Kirchner, INRIA Rocquencourt, France Konstantin Korovin, University of Manchester, UK Martin Lange, Universität Kassel, Germany Stéphane Lengrand, LIX, Ecole Polytechnique, France Christoph Lüth, DFKI & Universität Bremen, Germany Carsten Lutz, Universität Bremen, Germany Christopher Lynch, Clarkson University, Potsdam, USA George Metcalfe, Universität Bern, Switzerland Dale Miller, INRIA Saclay, France Aleksandar Nanevski, IMDEA Software, UPM, Madrid, Spain Tobias Nipkow, TU München, Germany Hans de Nivelle, University of Wroclaw, Poland Albert Oliveras, UPC, Barcelona, Spain Nicolas Peltier, LIG/IMAG, Grenoble, France Frank Pfenning, CMU, Pittsburgh, USA Grigore Rosu, University of Illinois at Urbana-Champaign, USA Michaël Rusinowitch, LORIA/INRIA-Lorraine, Nancy France Ulrike Sattler, University of Manchester, UK Viorica Sofronie-Stokkermans, MPI für Inf., Saarbrücken, Germany Georg Struth, University of Sheffield, UK Aaron Stump, University of Iowa, Iowa City, USA Geoff Sutcliffe, University of Miami, USA René Thiemann, University of Innsbruck, Austria Cesare Tinelli, University of Iowa, Iowa City, USA Alwen Tiu, ANU, Canberra, Australia Bow-Yaw Wang, Academia Sinica, Taipei, Taiwan Christopher Weidenbach, MPI für Informatik, Saarbrücken, Germany Michael Zakharyashev, Birkbeck College, London, UK Hans Zantema, Eindhoven University of Technology, The Netherlands * Satellite Event Chair: Birte Glimm, University Ulm, Germany * Competitions Chair: Geoff Sutcliffe, University of Miami, USA * Further Information: For further and up-to-date information about IJCAR 2012 visit http://ijcar.cs.manchester.ac.uk/. 15TH INTERNATIONAL CONFERENCE ON THEORY AND APPLICATIONS OF SATISFIABILITY TESTING (SAT) Trento, Italy, June 17-20th, 2012 http://sat2012.fbk.eu/ * AIM and SCOPE The International Conference on Theory and Applications of Satisfiability Testing (SAT) is the primary annual meeting for researchers studying the propositional satisfiability problem. Importantly, here SAT is interpreted in a rather broad sense: besides plain propositional satisfiability, it includes the domains of MaxSAT and Pseudo-Boolean (PB) constraints, Quantified Boolean Formulae (QBF), Satisfiability Modulo Theories (SMT), Constraints Programming (CSP) techniques for word-level problems and their propositional encoding. * To this extent, many hard combinatorial problems can be encoded as SAT instances, in the broad sense mentioned above, including problems that arise in hardware and software verification, AI planning and scheduling, OR resource allocation, etc. The theoretical and practical advances in SAT research over the past twenty years have contributed to making SAT technology an indispensable tool in these domains. * SAT 2012 will take place in Trento, Italy, a cosmopolitan city set in a spectacular mountain scenery, and home to a world-class university and research centres. * RELEVANT TOPICS The topics of the conference span practical and theoretical research on SAT (in the broader sense above) and its applications, and include, but are not limited to: * Theoretical issues - Combinatorial Theory of SAT - Proof Systems and Proof Complexity in SAT - Analysis of SAT Algorithms * Solving: - Improvements of current solving procedures - Novel solving procedures, techniques and heuristics - Incremental solving * Beyond solving: - Functionalities (e.g., proofs, unsat-cores, interpolants,...) - Optimization * Applications - SAT techniques for other domains - Novel Problem Encodings - Novel Industrial Applications of SAT A more detailed description can be found on the web site. * INVITED SPEAKERS - Aaron Bradley, Boulder, USA. "SAT-based Verification with IC3: Foundations and Demands" - Donald Knuth, Stanford, USA. "Satisfiability and The Art of Computer Programming" * PAPER SUBMISSION Further information about paper submission, including a more detailed description of the scope and specification of the three submission categories, will be made available at SAT'12 web page. The review process will be subject to a rebuttal phase. * IMPORTANT DATES: Abstract Submission: 05/02/2012 Paper Submission: 12/02/2012 Rebuttal phase: 28-30/03/2012 Final Notification: 12/04/2012 Final Version Due: 04/05/2012 Conference: 17-20/06/2012 * PROGRAM CHAIRS Alessandro Cimatti -- FBK-Irst, Trento, Italy Roberto Sebastiani -- DISI, University of Trento, Italy * PROGRAM COMMITTEE Dimitris Achlioptas -- UC Santa Cruz, USA Fahiem Bacchus -- University of Toronto, Canada Paul Beame -- University of Washington, USA Armin Biere -- Johannes Kepler University, Austria Randal Bryant -- Carnegie Mellon University, USA Uwe Bubeck -- University of Paderborn, Germany Nadia Creignou -- LIF Marseille, France} Leonardo DeMoura -- Microsoft Research, USA John Franco -- University of Cincinnati, USA Malay Ganai -- NEC, USA Enrico Giunchiglia -- Università di Genova, Italy Yussef Hamadi -- Microsoft Research, UK Zyiad Hanna -- Jasper, USA Holger Hoos -- University of British Columbia, Canada Marijn Heule -- Johannes Kepler University, Austria Kazuo Iwama -- Kyoto University, Japan Oliver Kullmann -- University of Wales Swansea, UK Daniel Le Berre -- Université d’Artois, France Ines Lynce -- Instituto Superior Técnico, Portugal Panagiotis Manolios -- Northeastern University, USA Joao Marques-Silva -- University College Dublin, Ireland David Mitchell -- Simon Fraser University, Canada Alexander Nadel -- Intel, Israel Jussi Rintanen -- The Austrailan National University, Australia Lakhdar Sais -- Université d’Artois, France Karem Sakallah -- University of Michigan, USA Bart Selman -- Cornell University, USA Laurent Simon -- Université Paris 11, France Carsten Sinz -- Karlsruhe Institute of Technology, Germany Niklas Sorensson -- Chalmers University, Sweden Ofer Strichman -- Technion, Israel Stefan Szeider -- Vienna University of Technology, Austria Allen Van Gelder -- University of California, Santa Cruz, USA Toby Walsh -- University of New South Wales, Australia Xishun Zhao -- Sun Yat-Sen University, China ITP 2012 - 3RD INTERNATIONAL CONFERENCE ON INTERACTIVE THEOREM PROVING Call for Papers 13-16 August 2012, Princeton, New Jersey, USA http://itp2012.cs.princeton.edu/ * Important dates: Abstract submission due: February 6; Paper Submission: February 13; Notification: April 12 * Topics: all aspects of interactive theorem proving and its applications; for example, formal aspects of hardware or software (specification, verification, semantics, synthesis, refinement, compilation, etc.); formalization of significant bodies of mathematics; advances in theorem prover technology (automation, decision procedures, induction, combinations of systems and tools, etc.); industrial applications of theorem proving; other topics including those relating to user interfaces, education, comparisons of systems, and mechanizable logics; and concise and elegant worked examples ("Proof Pearls"). * Submission categories include regular papers and "rough diamonds"; see website for submission details. * Invited Speakers: Lawrence Paulson (Univ. of Cambridge, UK); Others TBA * General Co-Chairs: Andrew Appel (Princeton Univ.); Lennart Beringer (Princeton Univ.) * Program Co-Chairs: Lennart Beringer (Princeton Univ.); Amy Felty (Univ. of Ottawa) * Program committee: Andreas Abel (LMU Munich); Nick Benton (Microsoft Research); Stefan Berghofer (secunet Security Networks AG); Yves Bertot (INRIA); Adam Chlipala (MIT); Ewen Denney (NASA); Peter Dybjer (Chalmers Univ. of Technology); Herman Geuvers (Radboud Univ. Nijmegen); Georges Gonthier (Microsoft Research); Jim Grundy (Intel Corp.); Elsa Gunter (Univ. Illinois at Urbana-Champaign); Hugo Herbelin (INRIA); Joe Hurd (Galois, Inc.); Reiner Hähnle (Chalmers Univ. of Technology); Matt Kaufmann (Univ. of Texas at Austin); Gerwin Klein (NICTA); Assia Mahboubi (INRIA); Conor McBride (Univ. of Strathclyde); Alberto Momigliano (Univ. of Milan); Magnus O. Myreen (Univ. of Cambridge); Tobias Nipkow (TU Munich); Sam Owre (SRI); Christine Paulin-Mohring (Univ. Paris-Sud); David Pichardie (INRIA); Brigitte Pientka (McGill Univ.); Randy Pollack (Harvard Univ.); Julien Schmaltz (Open Univ. of the Netherlands); Bas Spitters (Radboud Univ. Nijmegen); Sofiene Tahar (Concordia Univ.); Makarius Wenzel (Univ. Paris-Sud) 39TH INTERNATIONAL COLLOQUIUM ON AUTOMATA, LANGUAGES AND PROGRAMMING First Call for Papers 9-13 July 2012, University of Warwick, UK http://www2.warwick.ac.uk/go/icalp2012 * The main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS). The conference is also one of the Alan Turing Centenary Celebration events, celebrating the Life and Work, and Legacy of Alan Turing. The main conference will be preceded by a series of workshops. * Papers presenting original research on all aspects of theoretical computer science are sought. Typical but not exclusive topics of interest are: - Track A: Algorithms, Complexity and Games Algorithmic Game Theory, Approximation Algorithms, Combinatorial Optimization, Combinatorics in Computer Science, Computational Biology, Computational Complexity, Computational Geometry, Cryptography, Data Structures, Design and Analysis of Algorithms, Machine Learning, Parallel, Distributed and External Memory Computing, Randomness in Computation, Quantum Computing. - Track B: Logic, Semantics, Automata and Theory of Programming Algebraic and Categorical Models, Automata Theory, Formal Languages, Emerging and Non-standard Models of Computation, Databases, Semi-Structured Data and Finite Model Theory, Principles of Programming Languages, Logics, Formal Methods and Model Checking, Models of Concurrent, Distributed, and Mobile Systems, Models of Reactive, Hybrid and Stochastic Systems, Program Analysis and Transformation, Specification, Refinement and Verification, Type Systems and Theory, Typed Calculi. - Track C: Foundations of Networked Computation Cloud Computing, Overlay Networks, P2P Systems; Cryptography, Privacy,Security, Spam; Distributed and Parallel Computing; E-commerce, Auctions; Game Theory, Incentives, Selfishness; Internet Algorithms; Mobile and Complex Networks; Natural and Physical Algorithms; Network Information Management; Sensor, Mesh, and Ad Hoc Networks; Social Networks, Viral Marketing; Specification, Semantics, Synchronization; Trust and Reputation; Web Mining and Analysis; Web Searching and Ranking; Wireless and Optical Communication. * Important Dates: Submission: February 21, 2012 Notification: April 17 2012 Final manuscript due: May 8, 2012 The conference: July 9 - 13, 2012 * Submission Guidelines http://www2.warwick.ac.uk/go/icalp2012/cfp/ * Best Paper Awards As in previous editions of ICALP, there will be best paper and best student paper awards for each track of the conference. In order to be eligible for a best student paper award, a paper should be authored only by students and should be marked as such upon submission. * Invited Speakers Gilles Dowek (INRIA Paris) Kohei Honda (Queen Mary London) Stefano Leonardi (Sapienza University of Rome) Daniel A. Spielman (Yale) Berthold Vöcking (RWTH Aachen) MFPS 2012 - 28th CONFERENCE ON THE MATHEMATICAL FOUNDATIONS OF PROGRAMMING SEMANTICS Call for Papers June 6-9, 2012, Bath, United Kingdom http://www.math.tulane.edu/~mfps/MFPS28 * MFPS conferences are devoted to those areas of mathematics, logic, and computer science that are related to models of computation, in general, and to the semantics of programming languages, in particular. The series has particularly stressed providing a forum where researchers in mathematics and computer science can meet and exchange ideas about problems of common interest. As the series also strives to maintain breadth in its scope, the conference strongly encourages participation by researchers in neighbouring areas. * Topics include, but are not limited to, the following: biocomputation; concurrent qualitative and quantitative distributed systems; process calculi; probabilistic systems; constructive mathematics; domain theory and categorical models; formal languages; formal methods; game semantics; lambda calculus; programming-language theory; quantum computation; security; topological models; logic; type systems; type theory. We also welcome contributions that address applications of semantics to novel areas such as complex systems, markets, and networks, for example. * Invited Speakers: Steve Awodey (CMU), Michael Clarkson (GWU), Patricia Johann (Strathclyde), Dexter Kozen (Cornell, TBC), Drew Moshier (Chapman), John Power (Bath) * Special Sessions: Logic, computation and algebraic topology; Security; Computational effects; Computability on Continuous Data * There will be four Tutorial Lectures; topics and speakers tba. * Important dates: Abstract submission due: 24 February 2012; Paper submission: 2 March 2012; Notification: 2 April 2012 28TH INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING (ICLP 2012) Call for Papers Budapest, Hungary, September 4-8, 2012 http://www.cs.bme.hu/iclp2012/ * The International Conference on Logic Programming is the premier venue for presenting research in logic programming. ICLP 2012 will take place in Budapest, honouring the important contribution that the Hungarian logic programming community has given to this field. The ICLP technical program will include presentations of accepted papers, invited talks, advanced tutorials and panels, a special session on most influential papers, the doctoral consortium, the programming contest, and several workshops. * Contributions are sought in all areas of logic programming, including but not restricted to: - Theory: Semantic Foundations, Formalisms, Non-Monotonic Reasoning, Knowledge Representation. - Implementation: Compilation, Memory Management, Virtual Machines, Parallelism. - Environments: Program Analysis, Transformation, Validation, Verification, Debugging, Profiling, Testing. - Language Issues: Concurrency, Objects, Coordination, Mobility, Higher Order, Types, Modes, Assertions, Programming Techniques. - Related Paradigms: Abductive/Inductive/Constraint Logic Programming, Answer-Set Programming. - Applications: Databases, Data Integration and Federation, Software Engineering, Natural Language Processing, (Semantic) Web, Agents, Artificial Intelligence, Bioinformatics, Declarative Networking. * There are four broad categories for submissions: (1) technical papers describe technically sound, innovative ideas that can advance the state of the art of logic programming; (2) application papers present real-world applications of logic programming; (3) system and tool papers focus on the novelty, practicality, usability and general availability of the systems and tools described; and (4) technical communications aim at describing recent developments, new projects, and other materials that are not ready for publication as standard papers. * Important Dates Workshop Proposals: January 29, 2012 Paper registration (abstract): March 11, 2012 Submission deadline: March 18, 2012 Notification to Authors (first round): April 28, 201 Notification to Authors (second round): June 10, 2012 Camera-ready LIPIcs copy due: June 10, 2012 Camera-ready TPLP copy due: July 1, 2012 Conference: September 4-8, 2012 * General Chair Peter Szeredi (Budapest Univ. of Technology and Economics) * Program Committee Chairs Agostino Dovier (Univ. of Udine) Vitor Santos Costa (Univ. of Porto) * Workshop Chair Mats Carlsson (SICS, Sweden) * Doctoral Consortium Chairs Marco Gavanelli (Univ. of Ferrara) Stefan Woltran (T.U. Wien) * Programming Contest Tom Schrijvers (Univ. of Gent) * Publicity Chair Gergely Lukacsy (Cisco Systems Inc.) * Web Manager Janos Csorba (Budapest Univ. of Technology and Economics) * Program Committee Elvira Albert (U.C. Madrid) Sergio Antoy (Portland State Univ.) Marcello Balduccini (Kodak Res. Labs) Manuel Carro (U.P. Madrid) Michael Codish (Ben Gurion Univ.) Veronica Dahl (Simon Fraser Univ.) Marina De Vos (Univ. of Bath) Alessandro Dal Palu' (Univ. of Parma) Bart Demoen (K.U. Leuven) Thomas Eiter (T.U. Wien) Esra Erdem (Sabanci Univ.) Thom Fruehwirth (Univ. of Ulm) Andrea Formisano (Univ. of Perugia) Maria Garcia de la Banda (Monash Univ.) Marco Gavanelli (Univ. of Ferrara) Hai-Feng Guo (Univ. of Nebraska, Omaha) Gopal Gupta (Univ. of Texas, Dallas) Katsumi Inoue (National Inst. of Informatics, Japan) Angelica Kimmig (K.U. Leuven) Joohyung Lee (Arizona State Univ.) Evelina Lamma (Univ. of Ferrara) Nicola Leone (Univ. of Calabria) Yuliya Lierler (Univ. of Kentucky) Boon Thau Loo (Univ. of Pennsylvania) Michael Maher (R.R.I., Sidney) Alessandra Mileo (DERI, Galway) Jose Morales (U.P. Madrid) Enrico Pontelli (New Mexico State Univ.) Gianfranco Rossi (Univ. of Parma) Beata Sarna-Starosta (Cambian, Vancouver) Torsten Schaub (Univ. of Potsdam) Tom Schrijvers (Univ. of Gent) Fernando Silva (Univ. of Porto) Tran Cao Son (New Mexico State Univ.) Terrance Swift (Univ. Nova de Lisboa) Peter Szeredi (Budapest Univ. of Tech.) Francesca Toni (I.C. London) Mirek Truszczynski (Univ. of Kentucky) German Vidal (U.P. of Valencia) Stefan Woltran (T.U. Wien) Neng-Fa Zhou (CUNY, New York) * The ICLP 2012 program will include several workshops, held before, after, and in parallel with the main conference. They are perhaps the best places for the presentation of preliminary work, undeveloped novel ideas, and new open problems to a wide and interested audience with opportunities for intensive discussions and project collaboration. DATALOG2.0 2012 - 2nd WORKSHOP ON THE RESUREGENCE OF DATALOG IN ACADEMY AND INDUSTRY Call for Papers September 11-14, 2012, Vienna, Austria http://www.dbai.tuwien.ac.at/datalog2.0 * Datalog 2.0 is a workshop for Datalog researchers, implementors, and users. Its main aim is to bring everyone up-to-date and map out directions for future research. Over the past few years, Datalog has resurrected as a lively topic with applications in many different areas of computer science, as well as industry. Due to this renewed interest and increased level of activity in the area, we have decided to open the workshop for submissions this year. Datalog2.0 2012 will be co-located with the ``International Conference on Web Reasoning and Rule Systems" (RR 2012) and the ``International Conference on Computational Models of Argument" (COMMA 2012). * Important dates: - Paper submission deadline: March 20th, 2012. - Notification: June 5th, 2012 * Invited Speakers: Thomas Eiter (TU Wien) Phokion Kolaitis (UC Santa Cruz) Oege de Moor (Oxford U.) Marie-Laure Mugnier (U. of Montpellier) * General Chair: Georg Gottlob (Oxford U.) * Program Chairs: Pablo Barcelo (U. of Chile) Reinhard Pichler (TU Wien) NEWTON INSTITUTE WORKSHOP "LOGICAL APPROACHES TO BARRIERS IN COMPLEXITY II" 26-30 March 2012, Newton Institute, Cambridge, UK. * Topics. The workshop will be organised by Arnold Beckmann and Anuj Dawar in association with the Newton Institute programme on "Semantics and Syntax: A Legacy of Alan Turing". The workshop will focus on logical descriptions of complexity, i.e. descriptive complexity, propositional proof complexity and bounded arithmetic. Despite considerable progress by research communities in each of these areas, the main open problems remain. In finite model theory the major open problem is whether there is a logic capturing on all structures the complexity class P of polynomial time decidable languages. In bounded arithmetic the major open problem is to prove strong independence results that would separate its levels. In propositional proof complexity the major open problem is to prove strong lower bounds for expressive propositional proof systems. The workshop will bring together leading researchers covering all research areas within the scope of the workshop. We will especially focus on work that draws on methods from the different areas which appeal to the whole community. * Invited Speakers. Samuel R. Buss, Stephan Kreutzer (Tutorials) Albert Atserias, Yijia Chen, Stefan Dantchev, Arnaud Durand, Bjarki Holm, Juha Kontinen, Jan Krajicek, Phuong The Nguyen, Rahul Santhanam, Nicole Schweikardt, Neil Thapen * Participation: The application form for participation can be found at http://www.newton.ac.uk/cgi/wsapply?CODE=SASW01 The Deadline for receiving applications is 26th January 2012 * Contact: For further questions concerning this workshop please contact Arnold Beckmann
swansea.ac.uk> SECOND INTERNATIONAL SAT/SMT SUMMER SCHOOL Trento, Italy, June 12-15th, 2012 http://satsmtschool2012.fbk.eu/ * The SAT/SMT Summer School 2012 (2nd edition) aims at providing graduate students and researchers from universities and industry with a comprehensive overview of the research in SAT, SMT, and their application. The lectures cover the foundational and practical aspects of SAT and SMT solvers, as well as their application to verification, planning, scheduling, and optimization problems. * This second edition follows the Summer School of 2011 organized by Vijay Ganesh at MIT, and is co-located with the SAT 2012 conference. The school will take place in Trento, Italy, from June 12th to June 15th 2012. * The program will feature four lectures per day, with the first two days dedicated to SAT and SMT foundations, and the last two to applications on various domains. * List of speakers: - Armin Biere (Johannes Kepler University, Linz, Austria) - Leonardo de Moura (Microsoft Research Redmond, USA) - Bruno Dutertre (SRI International, USA) - Martin Fränzle (Carl von Ossietzky Universität Oldenburg, Germany) - John Franco (University of Cincinnati, USA) - Silvio Ghilardi (Università di Milano, Italy) - Patrice Godefroid (Microsoft Research Redmond, USA) - Holger Hoos (University of British Columbia, Vancouver, Canada) - Tomi Janhunen (Aalto University, Finland) - Pete Manolios (Northeastern University, USA) - Joao Marques-Silva (University College Dublin, Ireland) - Ken McMillan (Microsoft Research Redmond, USA) - Jussi Rintanen (Austrialian National University, Australia) - Fabio Somenzi (University of Colorado, Boulder, USA) - Gunnar Stålmarck (Prover Technology and Gain Sweden AB, Sweden) - Cesare Tinelli (University of Iowa, USA) * A more detailed program is available at the school website (http://satsmtschool2012.fbk.eu). * It is expected that we will be able to provide a limited number of grants for students that will attend the school. More details about the procedure for applying and the registration deadlines will appear on the school website as soon as possible. Interested students are however encouraged to contact us at any moment. * The school organizers, Alberto Griggio and Stefano Tonetta EAST-ASIAN SCHOOL ON LOGIC, LANGUAGE, AND COMPUTATION (EASLLC 2012) First Announcement Southwest University, Chongqing, China, August 27-31, 2012 http://home.hib.no/prosjekter/easllc2012/ * This is a school for graduate students and postdoctoral scholars, similar in spirit to the annual ESSLLI summer schools in Europe and also to the Sino-European Summer School on Logic, Language, and Computation, which took place in Guangzhou, China in December 2010. * The program of EASLLC 2012 will consist of nine courses in three different tracks: logic, language, and computation. There will be student sessions in the late afternoon/early evening of some days of the School in which students will give short presentations of work in progress. The deadline for submissions to the student session will be announced later. In addition, a mentoring program is being planned. Selected students will be assigned one of the lecturers as mentor for informal interaction and discussions on research and career goals during the School. * Lecturers: - Logic Track: Fenrong Liu (Tsinghua University), Rohit Parikh (Brooklyn College of CUNY and CUNY Graduate Center), Jouko Vaananen (University of Helsinki and University of Amsterdam) - Language Track: Pauline Jacobson (Brown University), Geoffrey K. Pullum (University of Edinburgh and Brown University), Dag Westerstahl (Stockholm University) - Computation Track: Krzysztof R. Apt (CWI and University of Amsterdam), Phokion G. Kolaitis (University of California Santa Cruz and IBM Research – Almaden), Moshe Y. Vardi (Rice University) ACKERMANN AWARD 2011 * The award was presented at the CSL'11, held in Bergen, Norway. * The Jury consisted of A. Atserias (Barcelona, Spain), T. Coquand (Gothenburg, Sweden), A. Dawar (Cambridge, U.K., vice-president of EACSL), J.-P. Jouannaud (Paris, France), D. Niwinski (Warsaw, Poland, president of EACSL), L. Ong (Oxford, U.K., LICS representative), W. Thomas (Aachen, Germany), with J. Makowsky as secretary. * The Ackermann Award 2011 has been granted to Benjamin Rossman for the thesis ``Average Case Complexity of Detecting Cliques'', supervised by Prof. Madhu Sudan, and presented at the Massachusetts Institute of Technology in September 2010. * The Jury report is published in the CSL'11 Proceedings at http://drops.dagstuhl.de/portals/extern/index.php?semnr=11007 * The call for nominations for the Ackermann Award 2011 can be found at http://www.eacsl.org/submissionsAck.html ACKERMANN AWARD 2012 - THE EACSL OUTSTANDING DISSERTATION AWARD FOR LOGIC IN COMPUTER SCIENCE CALL FOR NOMINATIONS * Eligible for the 2012 Ackermann Award are PhD dissertations in topics specified by the EACSL and LICS conferences, which were formally accepted as PhD theses at a university or equivalent institution between 1.1.2010 and 31.12. 2011. * Submission details are available at http://www.eacsl.org/submissionsAck.html * The deadline for submission is April 15, 2012 * Nominations should be sent to the chair of the Jury by e-mail: firstname.lastname@example.org * 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 2012 Ackermann Award will be presented to the recipients at the annual conference of the EACSL (CSL'12) in Fontainebleau (France) to be held 3-6 September 2012. * The jury consists of 8 members: - A. Dawar (Cambridge, U.K., vice-president of EACSL) - T.A. Henzinger (Klosterneuburg, Austria) - J.-P. Jouannaud (Paris, France) - D. Leivant (Bloomington, USA) - D. Niwinski (Warsaw, Poland, president of EACSL) - L. Ong (Oxford, U.K., LICS representative) - W. Thomas (Aachen, Germany) * The jury is entitled to give more (or less) 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; 2008: Krishnendu Chatterjee; 2009: Jakob Nordstrom; 2010: ---- (no award given); 2011: Benjamin Rossman * For the three years 2010-2012, the Ackermann Award is sponsored by the Kurt Goedel Society.
Back to the LICS web page.