Forwarded message from [lics-request@sun5.mathematik.uni-freiburg.de] sent originally on Thu, 9 Dec 1999 06:16:37 +0800 (GMT-8): : Fifteenth Annual IEEE Symposium on : LOGIC IN COMPUTER SCIENCE : June 26 - 29, 2000, Santa Barbara, California : : http://logik.mathematik.uni-freiburg.de/lics : : 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 : sense. : : 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 : verification. : : Paper submission will be electronic. The deadline for submissions is : : January 7, 2000. : : This deadline is firm; late submissions will not be considered. : Authors will be notified of acceptance or rejection before March 15, : 2000; accepted papers in a specified format for the proceedings will : be due by April 19, 2000. For further information about submission : procedure, check the LICS website in December. : : 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. 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. : : It may be possible to accept more papers for presentation at LICS 2000 : than at some previous LICS conferences, if the submissions warrant it. : : 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. The deadline for submitting such : short presentations is in late March. For more details, check the LICS : website in December. : : 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 : several papers. : : 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, and Implicit Computational Complexity. : : Program Chair: : Martin Abadi : Bell Labs - Lucent Technologies : 3180 Porter Drive : Palo Alto, California 94304, USA : Email: abadi@research.bell-labs.com : lics2000@research.bell-labs.com : Phone: +1 650 565 7477 : Fax: +1 650 565 7676 : : Program Committee: : 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. : : Publicity Chair: : Martin Grohe : Institut fuer Mathematische Logik : Albert-Ludwigs-Universitaet Freiburg : Eckerstr. 1, 79104 Freiburg, Germany : Email: grohe@logik.mathematik.uni-freiburg.de : : General Chair: : John C. Mitchell : Computer Science Department : Stanford University : Stanford, CA 94305-9045, USA : Email: mitchell@cs.stanford.edu : : Organizing Committee: : 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. : : Advisory Board: : M. Abadi, S. Abiteboul, S. Abramsky, M. Dezani, J. Halpern, : R. Impagliazzo, D. Kozen, L. Pacholski, A. Scedrov, D. Scott, : J. Wing.

-- Wirtschaftsinformatik, FB5, Universitaet GH Essen Gustaf.Neumann@uni-essen.de, neumann@computer.org http://nestroy.wi-inf.uni-essen.de/Neumann.html