Program Committee Chair

Program Committee

  • Zena M. Ariola, University of Oregon, US
  • Christel Baier, TU Dresden, Germany (chair)
  • Michael Benedikt, University of Oxford, UK
  • Udi Boker, IDC Herzliya, Israel
  • Swarat Chaudhuri, University of Texas at Austin, US
  • Lorenzo Clemente, University of Warsaw, Poland
  • Liron Cohen, Ben-Gurion University, Israel
  • Thomas Colcombet, CNRS IRIF Paris, France
  • Thierry Coquand, University of Gothenburg, Sweden
  • Martin Hötzel Escardo, University of Birmingham, UK
  • Azadeh Farzan, University of Toronto, Canada
  • Marcelo P. Fiore, University of Cambridge, UK
  • Stefan Göller, University of Kassel, Germany
  • Jan Hoffmann, CMU, Pittsburgh, US
  • Benjamin Lucien Kaminski, University College London, UK
  • Shin-ya Katsumata, National Institute of Informatics, Tokyo, Japan
  • Juha Kontinen, University of Helsinki, Finland
  • Jan Kretinsky, TU Munich, Germany
  • Antonín Kučera, Masaryk University, Brno, Czech Republic
  • Ranko Lazic, University of Warwick, UK
  • Karoliina Lehtinen, CNRS, Aix-Marseille University, France
  • Christof Löding, RWTH Aachen, Germany
  • Assia Mahboubi, INRIA, Nantes University, France, and, Vrije Universiteit Amsterdam, NL
  • Annabelle McIver, Macquarie University, Sydney, Australia
  • Nelma Moreira, University of Porto, Portugal
  • Aniello Murano, Universita degli Studi di Napoli Federico II, Italy
  • Kedar Namjoshi, Nokia Bell Labs, US
  • Joanna Ochremiak, CNRS LaBRI Bordeaux, France
  • Prakash Panangaden, McGill University, Canada
  • Elaine Pimentel, Universidade Federal do Rio Grande do Norte, Brazil
  • Revantha Ramanayake, University of Groningen, Netherlands
  • Jean-François Raskin, Université Libre de Bruxelles, Belgium
  • Sylvain Schmitz, IRIF, Université de Paris, France
  • Tachio Terauchi, Waseda University, Tokyo, Japan
  • Henning Urbat, FAU Erlangen-Nürnberg, Germany
  • Mahesh Viswanathan, University of Illinois, US

Call for Papers

The 37th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2022) will be held as part of FLoC 2022, which is planned as a physical meeting from July 31 to August 12, 2022, in Haifa, Israel. For people who cannot travel to Israel, the possibility of remote participation will be ensured.

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, foundations of probabilistic, real-time and hybrid systems, games and logic, higher-order logic, knowledge representation and reasoning, lambda and combinatory calculi, linear logic, logic programming, logical aspects of AI, 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, process calculi, programming language semantics, proof theory, reasoning about security and privacy, rewriting, type systems, 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 full paper. The exact deadline time on these dates is given by anywhere on earth (AoE).

Titles and Short Abstracts Due 17 January 2022
Full Papers Due 21 January 2022
Author Response Period 10–13 March 2022
Author Notification 14 April 2022
Conference 2–5 August 2022 (tentative)

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

Formatting instructions: Every full paper must be submitted in the ACM SIGPLAN Proceedings 2-column 10pt format and may be at most 12 pages, excluding references. The LaTeX style files are available from here.

The paper 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.

LICS 2022 will use a lightweight double-blind reviewing process. Following this process means that reviewers will not see the authors' names or affiliations as they initially review a paper. The authors' names will then be revealed to the reviewers only once their reviews have been submitted.

To facilitate this process, submitted papers must adhere to the following:

  • Author names and institutions must be omitted and
  • References to the authors' own related work should be in the third person (e.g., not "We build on our previous work ..." but rather "We build on the work of ...").

The purpose of this process is to help the reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission, makes the job of reviewing the paper more difficult, or interferes with the process of disseminating new ideas. For example, important background references should not be omitted or anonymized, even if they are written by the same authors and share common ideas, techniques, or infrastructure. Authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For instance, authors may post drafts of their papers on the web or give talks on their research ideas.

Kleene Award, Distinguished Papers and Special Issues

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.

Around 10% of accepted papers will be selected as distinguished papers. These are papers that, in the view of the LICS program committee, make exceptionally strong contribution to the field and should be read by a broad audience due their relevance, originality, significance and clarity.

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.

Publication

The official publication date may differ from the first day of the conference. The official publication date may affect the deadline for any patent filings related to published work. We will clarify the official publication date in due course.

LICS Sponsorship

The symposium is sponsored by ACM SIGLOG and the IEEE Technical Committee on Mathematical Foundations of Computing.

  • ACM
  • IEEE

Website by Sam Staton based on a bootstrap design by Hartmut Eilers and Eric Koskinen.