CALL FOR PAPERS

Thirty-First Annual ACM/IEEE Symposium on
LOGIC IN COMPUTER SCIENCE (LICS)

July 5–8, 2016, New York City, USA

http://lics.rwth-aachen.de/lics16/


SCOPE

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


IMPORTANT DATES

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).

Titles and Short Abstracts Due: January 11, 2016
Full Papers Due: January 18, 2016
Author Feedback/Rebuttal Period: March 14-18, 2016
Author Notification: April 4, 2016
Final Versions Due for Proceedings: May 2, 2016

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


SUBMISSION INSTRUCTIONS

Every full paper must be submitted in the ACM SIGPLAN Proceedings
2-column 10pt format and may not be longer than 10 pages, including
references. The LaTeX style file is available from the conference
website.

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.


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
will be posted on the conference website.


KLEENE AWARD FOR BEST STUDENT PAPER

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.


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.


SPONSORSHIP

The symposium is sponsored by ACM SIGLOG and the IEEE Technical
Committee on Mathematical Foundations of Computing, in cooperation
with the Association for Symbolic Logic and the European Association
for Theoretical Computer Science.


PROGRAM COMMITTEE CHAIR

Natarajan Shankar, SRI International


PROGRAM COMMITTEE

Samson Abramsky, U. Oxford
Jiri Adámek, TU Braunschweig
Amal Ahmed, Northeastern U.
Albert Atserias, U. Politècnica de Catalunya
Christel Baier, TU Dresden
Paul Beame, U. Washington
Lars Birkedal, Aarhus U.
Udi Boker, IDC Herzliya
Maria Paola Bonacina, U. Verona
Ahmed Bouajjani, LIAFA, U. Paris Diderot
Supratik Chakraborty, IIT Mumbai
Yijia Chen, Fudan U.
Robert Constable, Cornell U.
Amy Felty, U. Ottawa
Jane Hillston, U. Edinburgh
Atsushi Igarashi, Kyoto U.
Neil Immerman, U. Massachussetts at Amherst
Radha Jagadeesan, DePaul U.
Jan Krajíček, Charles U.
Kim Guldstrand Larsen, Aalborg U.
Annabelle McIver, Macquarie U.
Georg Moser, U. Innsbruck
Anca Muscholl, LaBRI, U. Bordeaux
Vivek Nigam, Federal U. of Paraíba
Michele Pagani, PPS, U. Paris Diderot
Christine Paulin-Mohring, U. Paris-Sud
Nir Piterman, U. Leicester
Jean-Francois Raskin, U. Libre de Bruxelles
Alexandra Silva, UCL
Viorica Sofronie-Stokkermans, U. Koblenz
Lutz Straßburger, INRIA
Carolyn Talcott, SRI International
Cesare Tinelli, U. Iowa
Helmut Veith, Vienna U. of Technology
Valeria de Paiva, Nuance Labs
Ron van der Meyden, U. New South Wales


CONFERENCE CHAIR

Eric Koskinen, IBM Research


WORKSHOP CHAIR

Patricia Bouyer-Decitre, CNRS & ENS Cachan


PUBLICITY AND PROCEEDINGS CHAIR

Sam Staton, U. Oxford


GENERAL CHAIR

Martin Grohe, RWTH Aachen University


LICS STEERING COMMITTEE

M. Abadi, R. Alur, P. Bouyer-Decitre, K. Chatterjee, M. Grohe,
M. Hasegawa, T. Henzinger, E. Koskinen, S. Kreutzer, O. Kupferman,
D. Miller, M. Mislove, L. Ong, C. Palamidessi, N. Shankar, A. Silva,
S. Staton, M. Vardi.