[Prev][Next][Index][Thread]
LICS 93 call for papers
To: linear@cs.stanford.edu
Date: Mon, 21 Sep 92 21:00:24 EST
Eight Annual IEEE Symposium on
LOGIC IN COMPUTER SCIENCE
June 20-23, 1993, Montreal, Quebec (Canada)
CALL FOR PAPERS
The LICS Symposium aims for wide coverage of theoretical and practical
issues in computer science that relate to logic in a broad sense,
including algebraic, categorical and topological approaches.
Suggested, but not exclusive, topics of interest include: abstract data
types, automated deduction, concurrency, constructive mathematics, data
base theory, finite-model theory, knowledge representation, lambda and
combinatory calculi, logical aspects of computational complexity, logics
in artificial intelligence, logic programming, modal and temporal
logics, program logic and semantics, rewrite rules, logical aspects of
symbolic computing, problem solving environments, software
specification, type systems, verification.
PROGRAM CHAIR:
Moshe Y. Vardi
IBM Research
Almaden Research Center, K53-802
650 Harry Rd.
San Jose, CA 95120-6099, USA
vardi@almaden.ibm.com, vardi@almaden.bitnet
Phone: (408) 927-1784
Fax: (408) 927-2100
PROGRAM COMMITTEE: M. Abadi (DEC SRC), S. Abramsky (Imperial Coll.),
B. Bloom (Cornell), P. Clote (Boston Coll.), P.J. Freyd (Univ. of
Pennsylvania), D. Harel (Weizmann Inst.), K.G. Larsen (Aalborg Univ.),
P. Lescanne (CRIN and INRIA-Lorraine), D. McAllester (MIT),
J. Meseguer (SRI), D. Miller (Univ. of Pennsylvania), Y. Moschovakis
(UCLA), N. Shankar (SRI), C. Talcott (Stanford), M.Y. Vardi (IBM
Almaden), and P. Wolper (Univ. of Liege).
LICS GENERAL CHAIR:
Robert Constable
Department of Computer Science
Cornell University
Ithaca, NY 14253
rc@cs.cornell.edu
CONFERENCE CO-CHAIRS:
Mitsu Okada Prakash Panangaden
Department of Computer Science School of Computer Science
Concordia University McGill University
Montreal Montreal
H3G 1M8 Quebec, Canada H3A 2A7 Quebec, Canada
okada@concour.cs.concordia.ca prakash@cs.mcgill.ca
PAPER SUBMISSION: 10 hard copies of a detailed abstract (not a
full paper) and 20 additional copies of the cover page should be
RECEIVED by DECEMBER 8, 1992 by the PROGRAM CHAIR (Attn: LICS).
Authors without access to reproduction facilities may submit a single
copy of their submission. Authors will be notified of acceptance
by February 14, 1992. Accepted papers in the specified format for
the symposium proceedings will be due April 6, 1993.
The cover page of the submission should include the title, authors, a
brief synopsis, and the corresponding author's name, address, phone
number, fax number, and e-mail address if available. Abstracts must be
in English, clearly written, and provide sufficient detail to allow
the program committee to assess the merits of the paper. References
and comparisons with related work should be included. It is recommended
that each submission begin with a succinct statement of the problem,
a summary of the main results, and a brief explanation of their
significance and relevance to the conference, all suitable for the
non-specialist. Technical development of the work, directed to the
specialist, should follow. Abstracts of fewer than 1500 words are
rarely adequate, but the total abstract, should not be longer than
10 typed pages with roughly 35 lines per page. If the authors believe
that more details are essential to substantiate the main claims of the
paper, they may include a clearly marked appendix to be read at the
discretion of the committee. Late abstracts, or those departing
significantly from these guidelines, run a high risk of rejection.
The results in the submission must be unpublished and not submitted
for publication elsewhere, including proceedings of other symposia or
workshops. All authors of accepted papers will be expected to sign
copyright release forms, and one author of each accepted paper will be
expected to present the paper at the conference.
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 of
Theoretical Computer Science. Cooperation with the ACM is
anticipated.
ORGANIZING COMMITTEE: M. Abadi, S. Abramsky, S. Artemov, J. Barwise,
M. Blum, A. Bundy, S. Buss, E. Clarke, R. Constable (Chair),
E. Engeler, J. Gallier, U. Goltz, Y. Gurevich, S. Hayashi, G. Huet,
G. Kahn, D. Kapur, C. Kirchner, R. Kosaraju, J. W. Klop, P. Kolaitis,
D. Leivant, A. Meyer, G. Mints, J. Mitchell, Y. Moschovakis, A. Pitts,
G. Plotkin, S. Ronchi Della Rocca, G. Rozenberg, A. Scedrov, D. Scott,
J. Tiuryn, M. Vardi, R. de Vrijer
PUBLICITY CHAIR:
Daniel Leivant
Department of Computer Science
Indiana University
Bloomington, IN 47405, USA
lics@cs.indiana.edu