LICS 2003 2nd CFP and deadline alteration

To avoid clashes with the holiday period, there are new submission
deadlines for LICS 2003. Here is the updated call for papers.


                LICS 2003 CALL FOR PAPERS  
Eighteenth Annual IEEE Symposium on LOGIC IN COMPUTER SCIENCE 
        June  22nd -- 25th, 2003, Ottawa, Canada

The LICS Symposium is an annual international forum on theoretical and
practical topics in computer science that relate to logic in a broad
sense.  We invite submissions on that theme. 
Suggested, but not exclusive, topics of interest for submissions
include: automata theory, automated deduction, categorical models and
logics, concurrency and distributed computation, constraint
programming, constructive mathematics, database theory, 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.

To expedite the assignment of papers to reviewers, this year authors are 
required to submit electronically a paper title and a short abstract of 
about 100 words before submitting the extended abstract of the paper. 

Titles & Short Abstracts Due:  January 6, 2003  
Extended Abstracts  Due:       January 13, 2003  
Author Notification:           March 20, 2003
Camera-ready Papers Due:       April 11, 2003.

All deadlines are firm; late submissions will not be considered. 
Detailed information about electronic paper submission is
now posted at the LICS website.

This year every extended abstract must be submitted electronically in the 
IEEE Proceedings two-column camera-ready format. 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 and to computer science, all phrased for the 
non-specialist. Technical development directed to the specialist should follow. 
References and comparisons with related work should be included.  

Extended abstracts may be no longer than 10 pages
including references, and must be formatted in the IEEE Proceedings two-column
camera-ready style (IEEE style files are accessible from the LICS website).  
If necessary, detailed proofs of technical results can be included in a 
clearly-labelled appendix in the same two-column format following the 10-page 
extended abstract or there can be a pointer to a manuscript on a web site.  
This material may be read at the discretion of the program committee.
Extended abstracts not conforming to the above requirements
concerning format and length will be rejected without further consideration.

The results must be unpublished and not submitted for publication
elsewhere, including the proceedings of other symposia or workshops.
The PC chair should be informed of closely related work submitted to a
conference or journal between January 6th, 2003 and March 18th, 2003.
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 2003 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 2003 submission site between March 17th and March 21st, 2003.
Authors will be notified of acceptance or rejection by April 4th, 2003.

An award in honor of the late S.C. Kleene will be given for the best 
student paper, as judged by the program committee. For a submission to
be eligible, the research must have been carried out while *all* the
authors were full-time students. The program committee may decline to 
make the award or may split it among several papers.

LICS 2003 will feature invited talks by Erich Graedel (RWTH Aachen), 
John Harrison (Intel Corp.), Marta Kwiatkowska (U. Birmingham), 
John McCarthy (Stanford U.), and invited tutorials
by Martin Abadi (UC Santa Cruz) and Benjamin Pierce (U. Pennsylvania). 

AFFILIATED WORKSHOPS: As in previous years, there will
be a number of workshops affiliated with LICS 2003; 
information  will be posted at the LICS website.

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.

Phokion G. Kolaitis
Computer Science Department
University of California, Santa Cruz
Santa Cruz, CA 95064, USA
Phone: + 1 831 459 4768, Fax:   + 1 831 459 4829

Michael Benedikt, Andreas R. Blass, Maria Luisa Bonet, Witold Charatonik, 
Marcelo Fiore, Giorgio Ghelli, Thomas A. Henzinger, Alan Jeffrey, 
Assaf J. Kfoury, Phokion G. Kolaitis, Orna Kupferman, Ursula Martin, 
Paul-Andre Mellies, Eugenio Moggi, Ugo Montanari, Paliath Narendran, Luke Ong, 
Martin Otto, Frank Pfenning, Mirek Truszczynski. 

Amy Felty  & Philip Scott
SITE  Math. and Stat.
University of Ottawa
Ottawa, Ontario, K1N 6N5, Canada
Email: {afelty,phil@site.uottawa.ca}

Prakash Panangaden, McGill U., prakash@cs.mcgill.ca

Alex Simpson, U. of Edinburgh, Alex.Simpson@ed.ac.uk

Samson Abramsky, U. of Oxford, Samson.Abramsky@comlab.ox.ac.uk

M. Abadi, S. Abramsky (chair), A. Aggarwal, M. Bezem, E. Clarke, 
R. Constable, N. Dershowitz, J. Diaz, H. Ganzinger, F. Giunchiglia, M. Grohe,
J. Halpern, U.  Kohlenbach, D. Leivant, L. Libkin, G. Longo, D.A. Martin, 
H. Mairson, J. Mitchell, E. Moggi, G. Plotkin, V. Pratt, J. Riecke, 
S. Ronchi della Rocca, J. Tiuryn, M.Y. Vardi, J. Vitter, G.Winskel.

ADVISORY BOARD: M.Abadi, S. Abiteboul, M. Dezani, J. Halpern, R. Impagliazzo, 
D. Kozen, L. Pacholski, A. Scedrov, D. Scott, J. Wing.