Program Committee Chair

• Joel Ouaknine, MPI-SWS & University of Oxford

Program Committee

• Albert Atserias, Universitat Politècnica de Catalunya
• Steve Awodey, Carnegie Mellon University
• Christel Baier, TU Dresden
• Nick Benton, Microsoft Research
• Nathalie Bertrand, INRIA Rennes
• Achim Blumensath, Masaryk University
• Mikołaj Bojańczyk, Warsaw University
• Patricia Bouyer, CNRS, ENS Cachan
• James Brotherston, University College London
• Corina Cîrstea, University of Southampton
• Véronique Cortier, CNRS, LORIA
• Gilles Dowek, INRIA & ENS Cachan
• Thomas Ehrhard, Université Paris Diderot
• Diego Figueira, LaBRI
• Stefan Göller, CNRS, ENS Cachan
• Jean Goubault-Larrecq, ENS Cachan
• Neil Immerman, University of Massachusetts, Amherst
• Bart Jacobs, Radboud University Nijmegen
• Elham Kashefi, CNRS, Laboratoire d'Informatique de Paris 6 & University of Edinburgh
• Antonín Kučera, Masaryk University
• Carsten Lutz, Universität Bremen
• Barnaby Martin, Durham University
• Stefan Milius, Friedrich-Alexander Universität Erlangen-Nürnberg
• David Monniaux, CNRS, VERIMAG
• Joel Ouaknine, MPI-SWS & University of Oxford
• Dominique Perrin, Université Paris-Est
• Brigitte Pientka, McGill University
• Alexander Rabinovich, Tel Aviv University
• Ofer Strichman, Technion
• Christine Tasson, Université Paris Diderot
• Margus Veanes, Microsoft Research

Conference Chairs

• Luca Aceto, Reykjavik University
• Anna Ingólfsdóttir, Reykjavik University

Workshop Chair

• Patricia Bouyer, CNRS, ENS Cachan

Publicity and Proceedings Chair

• Sam Staton, University of Oxford

General Chair

• Martin Grohe, RWTH Aachen University

Steering Committee

M. Abadi, L. Aceto, R. Alur, P. Bouyer, K. Chatterjee, M. Grohe, M. Hasegawa, T. Henzinger, A. Ingólfsdóttir, E. Koskinen, S. Kreutzer, D. Miller, L. Ong, J. Ouaknine, C. Palamidessi, N. Shankar, A. Silva, S. Staton, M. Vardi.

Call for Papers

LICS 2017 will be hosted in Reykjavik during 20-23 June 2017.

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, games and logic, 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 and privacy, rewriting, type systems and type theory, and verification.

Instructions to Authors

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. The exact deadline time on these dates is given by anywhere on earth (AoE).

Deadlines are firm; late submissions will not be considered. All submissions will be electronic via https://www.easychair.org/conferences/?conf=lics2017.

Every extended abstract must be submitted in the IEEE Proceedings 2-column 10pt format and may be at most 12 pages, including references. LaTeX style files are available here; please use IEEEtran.cls version V1.8b, released on 26/08/2015.

The extended abstract must be in English and provide sufficient detail to allow the program committee to assess the merits of the paper. It should begin with a succinct statement of the issues, a summary of the main results, and a brief explanation of their significance and relevance to the conference and to computer science, all phrased for the non-specialist. Technical development directed to the specialist should follow. References and comparisons with related work must be included. (If necessary, detailed proofs of technical results may be included in a clearly-labeled appendix, to be consulted at the discretion of program committee members.) Submissions not conforming to the above requirements will be rejected without further consideration. Paper selection will be merit-based, with no a priori limit on the number of accepted papers. Papers authored or co-authored by members of the program committee are not allowed.

Results must be unpublished and not submitted for publication elsewhere, including the proceedings of other symposia or workshops. The program chair must be informed, in advance of submission, of any closely related work submitted or about to be submitted to a conference or journal. Authors of accepted papers are expected to sign copyright release forms. One author of each accepted paper is expected to present it at the conference.

Kleene Award for Best Student Paper and LICS 1997/2017 Test-of-Time Award

An award in honor of the late Stephen C. Kleene will be given for the best student paper(s), as judged by the program committee. The 2017 edition of the award is sponsored by the European Association for Theoretical Computer Science (EATCS).

The Kleene Award for Best Student Paper will go to Amina Doumane, for the paper "Constructive Completeness for the Linear-Time mu-Calculus."

The LICS 1997/2017 Test-of-Time Award will go to the authors of the following two papers:

• Richard Blute, Josée Desharnais, Abbas Edalat and Prakash Panangaden
• "Bisimulation for Labelled Markov Processes", LICS 1997
• Daniele Turi and Gordon D. Plotkin
• "Towards a Mathematical Operational Semantics", LICS 1997

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.