Sixteenth Annual IEEE Symposium on
LOGIC IN COMPUTER SCIENCE
June 16 - 19, 2001, Boston, Massachusetts
CALL FOR PARTICIPATION
The LICS Symposium is an annual international forum on theoretical and
practical topics in computer science that relate to logic in a broad
sense. The conference is intended to emphasize the relevance of logic
to computer science.
Invited Speakers:
A number of distinguished speakers have agreed to give invited talks
at LICS '01. The tentative titles of these talks are:
- Serge Abiteboul (INRIA Rocquencourt): Semistructured Data: From
Practice to Theory
- Andrew Appel, (Princeton): Foundational Proof-Carrying Code
- David Dill, (Stanford): Decision procedures and their use in
formal verification
- Yuri Gurevich (Microsoft): A Logician in the land of OS:
Abstract State Machines in Microsoft
- John Mitchell, (Stanford): Logic in Computer Security
- Wolfgang Thomas (RWTH Aachen): The Engineering Challenge for Logic
Affiliated Workshops:
As in previous years, there will be a number of workshops affiliated
with LICS '01:
- Complexity, Logic, and Computation: A Symposium in Honor of Albert
Meyer (organized by J. Riecke)
- Full Completeness and Full Abstraction (organized by S. Abramsky
and P. Scott)
- Logic and Learning (organized by R. Khardon and G. Turan)
- Satisfiability Testing: Theory and Applications (organized by
H. Kautz and B. Selman)
Registration:
LICS 2000 registration and conference information is now available on
the LICS 2001 website:
http://www.cs.bu.edu/faculty/mairson/LICS01/
The DEADLINE FOR EARLY REGISTRATION is Friday, May 25, 2001.
Program:
The program will soon be available on the LICS webpage.
This archive was generated by hypermail 2b29 : Tue Apr 17 2001 - 09:14:31 MET DST