LICS 2001 Preliminary Call for Papers
Sixteenth Annual IEEE Symposium on
LOGIC IN COMPUTER SCIENCE
June 16 - 19, 2001, Boston, Massachusetts
*PRELIMINARY* CALL FOR PAPERS
The LICS Symposium is an annual international forum on theoretical and
practical topics in computer science that relate to logic in a broad
Suggested, but not exclusive, topics of interest for submissions
include: abstract data types, automata theory, automated deduction,
categorical models and logics, concurrency and distributed
computation, constraint programming, constructive mathematics,
logic in databases, domain theory, finite model theory, formal aspects of
program analysis, formal methods, hybrid systems, lambda and
combinatory calculi, linear logic, logical aspects of computational
complexity, logics in artificial intelligence, logics of programs,
logic programming, modal and temporal logics, model checking,
programming language semantics, reasoning about security, rewriting,
specifications, type systems and type theory, and verification.
Paper submission will be electronic. The deadline for submissions is
January 8, 2001.
This deadline is firm; late submissions will not be considered. The
URL for electronic paper submission has not yet been determined, but
will be given in the final call (and will appear on the LICS web site,
Authors will be notified of acceptance or rejection before March 13,
2001; accepted papers in a specified format for the proceedings will
be due by April 10, 2001.
The first page of the extended abstract should include the title of
the paper, names and affiliations of authors, a brief synopsis, and
the contact author's name, address, phone number, fax number, and
email address. The extended abstract may not exceed 5000 words,
excluding bibliography and figures. It 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, all phrased for the
non-specialist. Technical development directed to the specialist
should follow, with sufficient details for specialists to judge the
plausibility of the results. (If necessary, details can be included
in a clearly-labeled appendix or there can be a pointer to a
manuscript on a web site.) References and comparisons with related
work should be included. Submissions departing significantly from
these guidelines risk rejection.
The results must be unpublished and not submitted for publication
elsewhere, including the proceedings of other symposia or workshops.
All authors of accepted papers will be expected to sign copyright
release forms. One author of each accepted paper will be expected to
present it at the conference.
LICS 2001 will have a session of short (5 - 10 minutes) presentations.
This session is intended for descriptions of work in progress, student
projects, and relevant research being published elsewhere; other brief
communications may be acceptable. Submissions for these presentations,
in the form of short abstracts (1 or 2 pages long), should be entered
at the LICS submission site between March 15 and March 31, 2001. Authors
will be notified of acceptance or rejection by April 20, 2001
The symposium is sponsored by 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.
Kleene Award for Best Student Paper: An award in honor of the late
S.C. Kleene will be given to the best paper, as judged by the program
committee, written solely by one or more students. A submission is
eligible if all authors are full-time students at the time of
submission. This should be indicated in the submission letter. The
program committee may decline to make the award or may split it among
Collocated events: Several workshops are being planned
in conjunction with LICS; see http://logik.mathematik.uni-freiburg.de/lics
for details as they are announced.
Computer Science Dept.
4144 Upson Hall
Ithaca, NY 14853, USA
Phone: +1 607 255 9562
Fax: +1 607 255-4428
Parosh Abdulla, Uppsala U.
Rance Cleaveland, SUNY Stony Brook
Hubert Comon, CNRS -- ENS Cachan
Thomas Eiter, T.U. Vienna
Erich Graedel, RWTH Aachen
Nevin Heintze, Bell Labs
Radha Jagadeesan, Loyola U.
Jean-Pierre Jouannaud, U. Paris-Sud
Patrick Lincoln, SRI International
David McAllester, AT&T Labs
Ron van der Meyden, U. New South Wales
Adolfo Piperno, U. Roma "La Sapienza"
Gordon Plotkin, U. Edinburgh
Michel de Rougemont, U. Paris-II
Thomas Streicher, T.U. Darmstadt
Pawel Urzyczyn, U. Warsaw
Pierre Wolper, U. Liege
111 Cummington Street
Boston, MA 02215
Institut fuer Mathematische Logik
Eckerstr. 1, 79104 Freiburg, Germany
Computer Science Dept.
Stanford, CA 94305-9045, USA
M. Abadi, A. Aggarwal, M. Bezem, E. Clarke, R. Constable,
N. Dershowitz, J. Diaz, H. Ganzinger, F. Giunchiglia, M. Grohe,
D. Leivant, L. Libkin, G. Longo, D. A. Martin, J. Mitchell
(chair), E. Moggi, V. Pratt, S. Ronchi della Rocca, J. Tiuryn,
M.Y. Vardi, J. Vitter, G. Winskel.
M. Abadi, S. Abiteboul, S. Abramsky, M. Dezani, J. Halpern,
R. Impagliazzo, D. Kozen, L. Pacholski, A. Scedrov, D. Scott,