LICS Newsletter 46

Newsletter 47

October 21, 1997

[Past issues of the newsletter are available at 

  Call for papers
  Lindau, Germany, 5-10 July 1998
* Topics. CADE is the major forum for the presentation of new research
  in all aspects of automated deduction.  Original research papers,
  descriptions of systems, and problem sets that provide innovative,
  challenging tests for automated deduction systems, are solicited.
  Logics of interest include propositional, first-order, higher-order,
  equational, classical, modal, temporal, dynamic, intuitionistic,
  constructive, linear, type theory, and meta-logics.  Methods
  encompass resolution, tableaux, connection, unification,
  paramodulation, term rewriting, constraints, decision procedures,
  induction, and model checking.  Applications cover hardware and
  software development, systems verification, deductive databases,
  logic and functional programming, computer mathematics including
  algebra and geometry, deductive aspects in artificial intelligence.
  Special topics of interest involve logical frameworks, proof
  translation, human-computer interfaces, distributed deduction, and
  search heuristics.
* Program chairs. Claude and Helene Kirchner.
* Conference Chair. Wolfgang Bibel.
* Program Committee.  F.Baader, D.Basin, W.Bibel, H.Comon, G.Dowek,
  H.Ganzinger, F.Giunchiglia, S.Grumbach, J.Hsiang, D.Kapur,
  C.Kirchner, H.Kirchner, C.Kreitz, C.Lynch, D.McAllester, M.Okada,
  L.Paulson, N.Shankar, A.P.Sistla, J.Slaney, M.Wallace, D.Wang,
* Submissions.  Submission deadline: January 5, 1998.  Papers must be
  original and not submitted for publication elsewhere.  Research
  papers can be up to 15 proceedings pages, system descriptions can be
  up to 4 pages and should be entitled ``System Description:...''
  Submission will be electronic, in PostScript format.  Papers should
  be compressed, then uuencoded, and e-mailed to the program chairs
  (  Details on the procedure and alternatives can
  be found at the CADE-15 Web site.  If electronic submission is not
  possible, 5 hard copies should be sent to the program chairs.  The
  letter or e-mail message accompanying the paper must contain a plain
  text abstract of about 200 words and the names, e-mail addresses,
  and postal addresses of all authors.

  Call for Workshops and Tutorials
  Lindau, Germany, 5-10 July 1998
* Topics. CADE is the major forum for the presentation of new research
  in all aspects of automated deduction.  Tutorials and workshops will
  run on July 5 and 6, and a special symposium ``Deduction as a
  Cross-Sectional Technology'' will be held on Friday, July 10.
  Workshops will ordinarily run a whole day, and tutorials for half a
  day.  Workshops may have the same topic as those of previous
  workshops, and this practice is encouraged.  Tutorials may be
  introductory, intermediate, or advanced.
* Submissions.  Anyone wishing to organize a workshop or tutorial in
  conjunction with CADE-15 should send (e-mail preferred) a proposal
  no longer than two pages to the program chairs (Claude and Helene
  Kirchner) by February 15, 1998 at the address:
  The proposal should describe the topic of the proposed workshop or
  tutorial and explain why the topic is relevant to CADE.  Proposals
  will be evaluated by the program committee, and decisions will be
  made by March 16, 1998.  Further information about the arrangements
  for workshops and tutorials can be obtained from the CADE-15 Web

  Call for papers
  June 28 - July 2, 1998
  Vancouver, British Columbia, Canada
* Topics. Modeling and specification formalisms; Algorithms and tools;
  Verification techniques; Applications and case studies; Verification
  in practice.
* Submission.  Submissions are invited in two categories. (A) Regular
  papers.  submission of a regular paper should be an extended
  abstract not exceeding ten (10) pages. The submission should contain
  original research, and sufficient detail to assess the merits and
  relevance of the contribution. (B) Tool presentations. Tool
  submission should be an abstract not exceeding four (4) pages.  The
  same page limit (4) applies to the conference proceedings.  The
  submission should describe the tool and its novel features. Authors
  may submit papers as self-contained Postscript files via anonymous
  ftp to, directory pub/incoming, and then emailing
  notification to Alternatively, authors may
  submit a paper by emailing a self-contained Postscript version to
  the same address. Deadline for submissions is January 9, 1998.
* Program committee.  Martin Abadi, Rajeev Alur, Ahmed Bouajjani,
  Jerry Burch, Olivier Coudert, Werner Damm, David Dill, Limor Fix,
  Patrice Godefroid, Mike Gordon, Orna Grumberg, Alan Hu (co-chair),
  Daniel Jackson, Bengt Jonsson, Kim Larsen, Ken McMillan, Doron
  Peled, Carl Pixley, Amir Pnueli, Carl Seger, Natarajan Shankar,
  Joseph Sifakis, Prasad Sistla, Fabio Somenzi, Moshe Vardi
  (co-chair), Yaron Wolfsthal.

  Thursday, 25 June, 1998 (following LICS'98), Indianapolis, Indiana.
* Submission: An extended abstract (about 5-10 pages) explaining
  recent research results or work in progress should be mailed
  electronically to both organizers, and, to be received by March 13, 1998.  
* Topics of interest include descriptive techniques (specification languages,
  models, logics) and analysis techniques (model checking, theorem proving,
  and their combination), as applied to protocols for authentication, fair
  exchange, electronic commerce, and electronic auctions.  We particularly want
  to hear about new approaches, new problems, new security properties, and new
  protocol bugs. Reports on work in progress are welcome.   
* Program: keynote address (Roger Needham), technical sessions,
  panel discussion.  
* Organizers: Nevin Heintze and Jeannette Wing

  Call for papers
  Indianapolis, Indiana, 25 June 1998 (immed. following LICS '98)
* Topics. Issues in the mathematical logic of diagrammatic/heterogeneous 
  information; logical theories of diagrammatic/heterogeneous
  information; logical properties, such as decidability and
  completeness, of diagrammatic/heterogeneous logics; expressiveness of
  diagrammatic/heterogeneous logics; formal analysis of the efficacy of
  different representation systems; foundational issues in extending
  logic to include diagrammatic information; issues in implementing
  tools based on diagrammatic/heterogeneous logics; case studies
  contrasting the suitability of diagrammatic and textual logics for
  particular problems.
* Program chairs. Gerard Allwein and Kathi Fisler
* Program Committee. Dave Barker-Plummer, Jon Barwise, John
  Etchemendy, Oliver Lemon, Kim Marriott, Atsushi Shimojima
* Submissions.  Submissions (limited to 15 pages) should be emailed to by March 15, 1998.  Submissions must be in
  postscript format in US letter size.  We are unable to process the A4
  European format.  MIME attachments are acceptable.  Please include a
  cover page giving the title of the paper, names and affiliations of
  authors, a brief abstract, and the contact author's name, address,
  phone number, fax number, and email address.  

  July 13 - 17, 1998, BRICS, Aalborg, Denmark
  Call for Papers and Workshops
* Topics. computability, automata, formal languages, new computing
  paradigms, term rewriting, analysis and design of algorithms,
  computational geometry, computational complexity, symbolic and
  algebraic computation, cryptography and security, data types and
  data structures, theory of data bases and knowledge bases, semantics
  of programming languages, program specification and verification,
  foundations of functional and logic programming, parallel and
  distributed computation, theory of concurrency, theory of robotics,
  theory of logical design and layout.
* Submission. Authors are invited to submit seven copies of an
  extended abstract not exceeding 12 pages by January 14, 1998.
  Electronic submission of papers is solicited.  Instructions can be
  found at  In addition,
  suggestions for workshops are invited. Those must be sent by
  December 1, 1997, to Prof. Kim G. Larsen -- ICALP'98, Department of
  Computer Science, Aalborg University, Fredrik Bajers Vej 7E, DK -
  9220 Aalborg, Denmark, e-mail:
* Invited speakers. Gilles Brassard, Mark Overmars, Leslie G. Valiant,
  Avi Wigderson, Martin Abadi, Andrew Pitts, Thomas A. Henzinger, Amir
* Program committee.  Kim G. Larsen (chair), Sven Skyum (vice-chair),
  Susanne Albers, Mark de Berg, Ronald Cramer, Faith Fich, Burkhard
  Monien, Mike Paterson, Arto Salomaa, Mikkel Thorup, Ugo Vaccaro,
  Shmuel Zaks, Glynn Winskel (vice-chair), Gerard Boudol, Julian
  Bradfield, Pierre-Louis Curien, Pierpaolo Degano, Jean-Pierre
  Jouannaud, Edmund Robinson, Bernhard Steffen, Andrzej Tarlecki,
  Frits Vaandrager.

  Call for nominations
* The Godel Prize for outstanding papers in the area of theoretical
  computer science is sponsored jointly by the European Association
  for Theoretical Computer Science (EATCS) and the Special Interest
  Group on Algorithms and Computing Theory of the Association of
  Computing Machinery (ACM-SIGACT).  This award is presented annually,
  with the presentation taking place alternately at the International
  Colloquium on Automata, Languages, and Programming (ICALP) and ACM
  Symposium on the Theory of Computing (STOC).  The fifth presentation
  will take place during the 1998 ICALP, July 13-17, 1998 in Aalborg,
  Denmark.  The Prize is named in honor of Kurt Godel in recognition
  of his major contributions to mathematical logic and of his recently
  discovered interest in what has become the famous ``P versus NP''
  question.  The Prize includes an award of $5000, sponsored by a
  grant from PWS Publishers in cooperation with International Thomson
  Publishing (ITP).
* Award committee. Ron Graham, David Johnson, Amir Pnueli, Grzegorz
  Rozenberg, Leslie Valiant, Emo Welzl (chair)
* Eligibility.  Any research paper (or a series of papers) published
  (not reprinted) in a recognized refereed journal (by a single author
  or a team of authors) in the period 1991 -- 1997 is deemed eligible.
  This extended period is in recognition of the fact that the value of
  fundamental work cannot always be immediately assessed. The research
  work nominated for the award should be in the area of theoretical
  computer science. The term ``theoretical computer science'' is meant
  in a broad sense, and encompasses, but is not restricted to, those
  areas covered by ICALP and STOC. The Award Committee shall have the
  ultimate authority to decide whether a particular paper is eligible
  for the Prize.
* Nominations.  Nominations for the award should be submitted to the
  Award Committee Chairman at the following address: Professor Emo
  Welzl, Departement Informatik, ETH Zentrum, IFW, CH-8092 Zurich,
  Switzerland, email:, telephone: +41-1-6327370/92.
  To be considered, nominations for the 1998 prize must be received by
  January 6, 1998. A nomination should contain a brief summary of the
  technical content of the paper and a brief explanation of its
  significance. A copy of the research paper (or papers) should
  accompany the nomination.

  Call for papers 
  Ostfriesland, Germany, October 5 - 9, 1998
* Topics. Distributed and federated databases, object oriented
  databases, deductive databases, temporal aspects, logics and
  semantics, database and information systems design, integrity and
  security, query languages and optimization, databases in world-wide
  nets, database dynamics.
* Submission. Send uuencoded gzipped PostScript to Alternatively, submit four copies
  to Klaus-Dieter Schewe, Institut fur Informatik, Technische
  Universitat Clausthal, Erzstr. 1, 38678 Clausthal-Zellerfeld,
  Germany. Papers should not exceed 10 pages, or 5 pages for short
  presentations. Deadline for submissions is March 27, 1998. 
* Program Committee. Stefan Brass, Stefan Conrad, Christian Eckert,
  Thomas Eiter, Opher Etzion, Andreas Heuer, Hans-Joachim Klein, Marc
  Levene, Leonid Libkin, Heikki Mannila, Torsten Polle (co-chair),
  Gunter Saake, Yehoshua Sagiv, Klaus--Dieter Schewe (co-chair), Marc
  Scholl, Nicolas Spyratos, Letizia Tanca.

  Aalborg, Denmark, July 17-18, 1998
  Satellite Workshop to ICALP'98
  Call for papers
* Topics. Decidability issues for equivalence and model checking over
  various classes of infinite state systems; complexity results for
  decidability results; connections and applications to questions in
  classical automata and formal language theory; and tools and case
  studies involving nontrivial applications of methods for the
  analysis of infinite state systems.
* Submissions. Authors are invited to submit a 5-page extended
  abstract to the Programme Chair, Javier Esparza, Technical
  University of Munich, E-mail:
  The submission should be emailed in postscript format before March
  15, 1998.
* Program committee. A. Bouajjani, J. Bradfield, O. Burkart,
  D. Caucal, T. Henzinger, Y. Hirshfeld, P. Jancar, F. Moller.

  Conference Centre Boschoord, Oisterwijk (near Tilburg), the Netherlands
  May 5 - 8, 1998
* Topics.  Analytic tableaux for various logics (theory and
  applications); specific related techniques or concepts; related
  methods (model elimination, sequent calculi, connection method,
  etc); new calculi and methods for theorem proving in classical and
  nonclassical logics (modal, intuitionistic, linear, temporal);
  systems, tools, implementations and applications; tableaux based
  theorem proving in temporal logics, in particular, for verification
* Submission.  Authors are requested to submit their papers or their
  proposals for tutorials by e-mail in the form of Postscript files,
  preferably in LaTeX llncs style, to the Program Chair before
  November 15, 1997:  Hardcopy submission is
  allowed for people without e-mail access.
* Invited Speakers. N.G. de Bruijn and E. Clarke.
* Program Committee.  M. d'Agostino, K. Broda, R. Dyckhoff,
  C. Fermueller, M. Fitting, U. Furbach, D. Galmiche, R. Gore,
  J. Goubault-Larrecq, R. Haehnle, R. Hasegawa, R. Letz, U. Moscato,
  N. Murray, N. Olivetti, D. Pearce, J. Posegga, E. Rosenthal,
  P. Schmitt, C. Schwind, H. de Swart, P. Voda.

  Department of Computer Science, University of Rostock, Germany
* Grants are provided on a yearly basis and can be renewed for up to 4
  years. The students shall pursue their studies and obtain a PhD in
  Computer Science. The fields of study for these openings are:
  Communication and network services, Internet technology, Formal
  methods for specifying distributed systems, Linear logic and
  algebraic methods for the specification of distributed systems,
  Parallel computing on clusters and distributed systems.
* Further information. Contact Prof. Clemens Cap, 

  March 29, 1998, Tsukuba, Japan
  In conjunction with RTA-98
  Call for papers
* Topics. New concepts in substitution calculi, Higher order types and
  explicit substitutions, Generalised techniques to show properties of
  substitution calculi, Relating explicit substitutions with other
  formalisms such as sequent calculi, linear logic, game semantics,
  etc, Accommodating different reduction strategies and control
  operators, Use of explicit substitution in proof checking and proof
  search, in the implementation of programming languages and theorem
  provers, Different criteria useful to compare calculi with explicit
  substitutions, Applications of explicit substitutions to solve
  problems in other fields.
* Submission. Extended abstracts (up to 8 pages excluding references
  and appendices) are invited (an appendix containing relevant proofs
  is highly recommended).  Submission of abstracts in PostScript by
  e-mail is mandatory. Email your full article in postscript format to by December 3rd, 1997. 
* Program committee. Roberto Di Cosmo, Fairouz Kamareddine, Delia
  Kesner, Pierre Lescanne, Randy Pollack.

* There are several research positions at BRICS starting next year,
  1998.  Applications by researchers are welcome in theoretical
  computer science and related areas, especially, but not exclusively,
  within the following areas: Semantics of Computation, Logic,
  Algorithms and Data Structures, Complexity Theory, Data Security,
  Programming Languages, Distributed Computing,
  Verification. Openings, while likely to start as postdoctoral
  positions, generally for 1-2 years, have the possibility of
  extension to longer-term positions.
* Application. Applications for positions should preferably be sent by
  e-mail ( and include curriculum vitae and two or
  three names of referees for recommendations with the referees'
  regular mail addresses and, if possible, e-mail addresses, as well
  as a URL to your WWW home directory if available.

  EC Training and Mobility of Researchers, Framework 4
* Applications are invited for research positions at post-doctorate
  and also post-graduate level in the field of Computational Logic at
  the department of Computer Science, with an emphasis on (concurrent)
  constraint (logic) programming, program analysis, synthesis and
  transformation of constraint programs or agent based computing
  utilizing constraint reasoning.
* Application. Email your application (uuencoded compressed postscript
  file(s), including a detailed CV, list of publications, references,
  sample papers and project proposal or statement of research
  interests) to Dr. Thom Fruehwirth,, by November 6, 1997.

  Computer Science Faculty
  Dresden University of Technology
* The field of work covers the whole area of computational logic.
  Particular emphasis is placed on logic programming, constraint
  programming, deduction systems and the development of logic-based
  systems and their applications. Internationally demonstrated
  competence in teaching and research in at least one of the following
  areas is sought: Logic Programming; Constraint Programming; Logical
  Foundations of Intelligent and Cognitive Systems; Deduction Systems;
  Verification Systems; Deductive Databases; Formal Methods in
  Mechanics, Mechatronics or Computer Aided Manufacturing; Logical
  Foundations and Semantics for Natural Language Processing; Logical
  Foundations of Machine Learning.
* Application. Send application along with CV, publications list,
  photograph, certificates and copies of three selected publications
  to Dekan der Fakultaet Informatik, Herrn Prof. Dr.-Ing.habil. Heiko
  Vogler, Fakultaet Informatik, TU Dresden, D-01062 Dresden, Germany,
  by 17 November 1997.
* Further info. Call (0351) 463 8211.