Eleventh Annual IEEE Symposium on Logic in Computer Science July 27-30, 1996, New Brunswick, New Jersey, USA CALL FOR PAPERS The LICS Symposium aims to attract original papers of high quality on theoretical and practical topics 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, categorical models, concurrency, constraint programming, constructive mathematics, database theory, domain theory, finite model theory, hybrid systems, logics of knowledge, lambda and combinatory calculi, linear logic, logical aspects of computational complexity, logics in artificial intelligence, logic programming, modal and temporal logics, model checking, program logic and semantics, rewriting, logical aspects of symbolic computing, software specification, type systems, verification. Paper submission: Send 12 copies of an extended abstract (not a full paper) to the program chair to be received by December 13, 1995. This deadline is firm; late submissions will not be considered. Authors without access to copiers may submit a single copy. Authors will be notified of acceptance or rejection by March 7, 1996. Accepted papers in a specified format for the proceedings will be due May 7, 1996. 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, if available. The extended abstract may not exceed 10 typed pages in no less than 11-point font, with a line spacing of no less than 1.5. 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. References and comparisons with related work should be included. Technical development directed to the specialist should follow. Submissions departing significantly from these guidelines risk rejection. Submission deadline: December 13, 1995. Notification: March 7, 1996. Final papers due: May 7, 1996. Conference: July 27-30, 1996. Dual submissions: The results must be unpublished and not submitted for publication elsewhere, including the proceedings of other symposia or workshops (see exception below). All authors of accepted papers will be expected to sign copyright release forms. One author of each accepted paper will be expected to present the paper at the conference. As a one-time experiment, submissions to LICS this year can also be submitted to the Israeli Symposium on the Theory of Computing and Systems (ISTCS), provided this is clearly indicated on the cover page of the submission. If the paper is accepted to both LICS and ISTCS, then the paper will be included in the LICS proceedings, and the ISTCS proceedings will include only a 1-page abstract with a pointer to the LICS proceedings. The symposium is part of the Federated Logic Conference (FLoC), July 27-August 3, 1996, being hosted by the Center for Discrete Mathematics and Computer Science, Rutgers University, as part of its Special Year on Logic and Algorithms. In addition to LICS, FLoC includes the following related conferences: Rewriting Techniques and Applications (RTA), Conference on Automated Deduction (CADE), and Computer-Aided Verification (CAV). LICS and RTA will be held in parallel during the first four days of FLoC. CADE and CAV will be held during the last four days, with CADE workshops running in parallel with the last day of LICS. Plenary events involving all the conferences are scheduled. For further information on FLoC and the participating conferences, see the FLoC home page. For information about the Special Year, see the DIMACS page. The symposium is sponsored by the IEEE Technical Committee on Mathematical Foundations of Computing in cooperation with the Association for Symbolic Logic, the European Association for Theoretical Computer Science, and the Association for Computing Machinery. Kleene Award for Best Student Paper: An award of $500, 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. Program Chair: Edmund M. Clarke, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15228. Email: lics96@cs.cmu.edu. Phone: (412) 268-2628. Fax: (412) 268-5576. Program Committee: S. Buss (UC San Diego), E. Clarke (CMU), A. Emerson (UT Austin), S. German (IBM Watson), G. Gottlob (TU Vienna), O. Grumberg (Technion), D. Howe (AT&T Bell Labs), C. Kirchner (INRIA & CRIN), K. Kunen (Wisconsin), P. Lincoln (SRI), J. Mitchell (Stanford), U. Montanari (Univ. Pisa), P. Panangaden (McGill), F. Pfenning (CMU), J. Rushby (SRI), C. Stirling (Edinburgh), A. Stolboushkin (UCLA), G. Winskel (Aarhus). Conference Chair: Jon G. Riecke, AT&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ 07974, USA. Email: riecke@research.att.com. LICS General Chair: Moshe Y. Vardi, Department of Computer Science, Rice University, 6100 S. Main Street, Houston, Texas 77251-1892, USA. Email: vardi@cs.rice.edu. Organizing Committee: M. Abadi, S. Abramsky, S. Artemov, E. Boerger, A. Borodin, W. Brauer, A. Bundy, S. Buss, E. Clarke, R. Constable, A. Felty, U. Goltz, D. Howe, G. Huet, J.-P. Jouannaud, D. Kapur, C. Kirchner, P. Kolaitis, D. Kozen, T. Leighton, D. Leivant, A.R. Meyer, D. Miller, J. Mitchell, Y. Moschovakis, M. Okada, P. Panangaden, J. Remmel, J. Riecke, S. Ronchi della Rocca, A. Scedrov, D. Scott, J. Tiuryn, M.Y. Vardi. Publicity Co-Chairs: Amy Felty and Douglas Howe, AT&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ 07974, USA. Email: felty@research.att.com, howe@research.att.com. FLoC'96 DIMACS