LICS 2000 - Short Presentations Deadline is March 31
Fifteenth Annual IEEE Symposium on
LOGIC IN COMPUTER SCIENCE
June 26 - 28, 2000, Santa Barbara, California
CALL FOR SHORT PRESENTATIONS
The LICS Symposium is an annual international forum on theoretical and
practical topics in computer science that relate to logic in a broad
LICS 2000 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, in English), should be
entered at the LICS submission site http://lics.cs.bell-labs.com/ between
March 16 and March 31, 2000. Authors will be notified of acceptance
or rejection by May 1, 2000.
Suggested, but not exclusive, topics of interest for submissions
include: abstract data types, automata theory, automated deduction,
bounded arithmetic, categorical models and logics, coinductive
techniques, concurrency and distributed computation, constraint
programming, constructive mathematics, database theory, domain theory,
finite model theory, formal aspects of program analysis, formal
methods, game semantics, hybrid systems, logics of knowledge, 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, reasoning about security, rewriting, semantics,
specifications, type systems and type theory, universal algebra, and
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.
Collocated events: The International Static Analysis Symposium
(SAS2000) will also take place in Santa Barbara, immediately following
LICS, from June 29 to July 1. For more information, see
http://www.cis.ksu.edu/santos/sas/. In addition, several workshops are
planned in conjunction with LICS; they include workshops on
Nonmonotonicity and Belief Revision, Logical Frameworks and
Meta-Languages, Chu Spaces, Implicit Computational Complexity, and
Bell Labs - Lucent Technologies
3180 Porter Drive
Palo Alto, California 94304, USA
Phone: +1 650 565 7477
Fax: +1 650 565 7676
Pierre-Louis Curien, CNRS & U. Paris 7
Rocco De Nicola, U. Florence
Javier Esparza, U. Munich
Marcelo Fiore, U. Sussex
Harald Ganzinger, MPI Informatik
Joe Halpern, Cornell U.
Martin Hofmann, U. Edinburgh
Bart Jacobs, U. Nijmegen
Orna Kupferman, Hebrew U.
Kim Larsen, Aalborg U.
Leonid Libkin, Bell Labs
James F. Lynch, Clarkson U.
Vincent van Oostrom, U. Utrecht & CWI
Frank Pfenning, CMU
Benjamin C. Pierce, U. Penn
Jon G. Riecke, Bell Labs
Igor Walukiewicz, Warsaw U.
Institut fuer Mathematische Logik
Eckerstr. 1, 79104 Freiburg, Germany
John C. Mitchell
Computer Science Department
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,