Newsletter 62

November 1, 1999

[Past issues of the newsletter are available at]

  Call for papers
  Dallas, Texas
  May 14-19, 2000
* Topics: Suggested topics include the following (this list is not
  exhaustive and the order does not reflect priorities): Access
  Methods and Physical Design, Complexity and Performance Evaluation,
  Concurrency Control, Transaction Management, Integrity and Security,
  Data Models, Logic in Databases, Query Languages, Query
  Optimization, Database Programming Languages, Database Updates,
  Active Databases, Deductive Databases and Knowledge Bases,
  Object-oriented Databases, Multimedia Databases, Spatial and
  Temporal Databases, Constraint Databases, Real-time Databases,
  Distributed Databases, Data Integration and Interoperability, Views
  and Warehousing, Data Mining, Databases and Information Retrieval,
  Semistructured Data and XML, Information Processing on the Web,
  Databases in E-commerce, Databases and Workflows
* Program Committee: S. Abiteboul, Y. Breitbart, S. Davidson,
  T. Eiter, G. Gottlob (Chair), R. Hull, G. Lausen, M. Lenzerini,
  L. Libkin, T. Milo, Z.M. Ozsoyoglu, D. Sacca, H.-J. Schek,
  J. Ullman, J. Van den Bussche, M. Y. Vardi
* Submission format: 
  Titles and short abstracts: this year, authors are required to
  submit a paper title and short abstract about 100 words before
  submitting their paper (see the important dates below).
  Papers: The address, telephone number, FAX number, and e-mail
  address of the contact author should appear on the title page of the
  submission.  Submissions should be limited to 10 pages (with font
  size at least 11 pts) and may consist of extended abstracts.  Each
  submission must provide sufficient detail to allow the program
  committee to assess its merits and should include appropriate
  references to and comparisons with the literature.  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 suited
  for the non-specialist.  Technical development of the work, directed
  to the specialist, should follow.  If the authors believe more
  details are necessary to substantiate the main claims of the paper,
  they may include a clearly marked appendix to be read at the
  discretion of the committee.
  Electronic and hard copy submissions are accepted. 
* Important Dates: 
  November 2, 1999 - Paper titles and short abstracts due. 
  November 8, 1999 - Papers due. 
  February 8, 2000 - Notification about acceptance/rejection. 
  March 5, 2000 - Camera-ready due. 

(AiML-ICTL 2000)
  First Call for Papers
  University of Leipzig, Germany
  October 4-7, 2000
* Theme. In the year 2000, the Advances in Modal Logic workshop and
  the International Conference on Temporal Logic will be run as a
  combined event, bringing together the strongly related modal logic
  and computer science oriented temporal logic communities to present
  and share the latest exciting results in all relevant areas.
* Topics of interest include: common-sense temporal reasoning, complexity of 
  modal and temporal logics, deontic logic, description logics, dynamic logic,
  epistemic logic, modal logics of agency and space, modal logic and game 
  theory, modal logic and grammar formalisms, modal realism and anti-realism,
  modal and temporal logic programming and theorem proving, model theory and 
  proof theory of modal and temporal logic, representation of time in natural 
  language semantics, non-monotonic modal logics, provability logic, temporal 
  databases. Papers on related subjects will also be considered.
* Special session.  There will be a special session on description logics and 
  applications of modal logic in knowledge representation. 
* Invited speakers include Nuel Belnap, Stephane Demri, Silvio Ghilardi,
  Giuseppe de Giacomo, Mark Reynolds, Krister Segerberg, Colin Stirling, 
  Moshe Vardi. 
* Authors are invited to submit a detailed abstract of a full paper of
  at most 10 pages (a4paper, 11pt) by e-mail to the programme chair,
  using `AiML-ICTL Submission' as the subject line. The cover page
  should include title, names of authors, the coordinates of the
  corresponding author, and some keywords describing the topic of the
  paper. Following this it should be indicated whether this is a
  submission to AiML or ICTL. To be considered, submissions must be
  received no later than May 15, 2000. More publication details are
  available at
* Program committee. Franz Baader, Howard Barringer, Marcelo Finger, 
  Nissim Francez, Dov Gabbay, Greg Restall, Maarten de Rijke, Heinrich 
  Wansing (chair), Frank Wolter,  Michael Zakharyaschev.
* Local organizers. Frank Wolter, Holger Sturm.
* Further information.  E-mail enquiries about AiML-ICTL 2000 should be 
  directed to Information about AiML is 
  available at

  Montreal, Canada, September 18-23, 2000
  Call for Workshops
* PLI is a collection of conferences and workshops aimed at the
  advancement of high-level programming languages. The first edition of
  PLI was held in September 1999 in Paris and brought together two
  popular conferences ICFP and PPDP focused on functional and
  declarative programming languages, and a collection of related
  satellite events.
* Submission.  Proposals should be sent to the Workshop Chair, should
  be no longer than two pages and should describe the topic of the
  workshop (that should relate broadly to declarative and/or functional
  programming), the names and contact information of the organizers, the
  expected number of participants and duration, and any other factors
  relevant to its selection.
* Evaluation committee.  Amy Felty (PLI'00 Workshop Chair), Maurizio
  Gabbrielli (PPDP 2000 Program Co-Chair), Martin Odersky (ICFP 2000
  General Chair), Frank Pfenning (PPDP 2000 Program Co-Chair), Philip
  Wadler (ICFP 2000 Program Chair)
* Submission deadline: January 7, 2000
  Notification of acceptance: February 1, 2000

  Preliminary Call for Papers 
  Montreal, Canada
  September 20-22, 2000 (part of PLI 2000)
* Theme.  PPDP represents the union of two former conferences: Programming 
  Languages, Implementations, Logics and Programs (PLILP) and Algebraic
  and Logic Programming (ALP).  Continuing the tradition of PLILP/ALP, 
  PPDP 2000 aims to stimulate research on the use of declarative methods 
  in programming and on the design, implementation and application of 
  programming languages that support such methods.
* Topics of interest include any aspect related to understanding, 
  integrating and extending programming paradigms such as those for 
  functional, logic, constraint and object-oriented programming
  (for more details see
* Submission.  Submissions in PostScript format should be sent to to be received on or before March 1, 2000
  (for more details see
* Program committee.  Samson Abramsky, Zena Ariola, Andrea Asperti,
  Frank de Boer, Radhia Cousot, Danny De Schreye, Saumya Debray,
  Thom Fruhwirth, Maurizio Gabbrielli (co-chair), Andrew Gordon, Doug Howe,
  Claude Kirchner, Naoki Kobayashi, Michael Maher, Greg Morrisett,
  Robert Nieuwenhuis, Christine Paulin, Frank Pfenning (co-chair),
  Paul Tarau, German Vidal.

  Stevens Institute of Technology
  Hoboken, NJ
  April 13 - 16, 2000
* Theme: The semantics of high-level programming langauges and its 
  mathematical underpinnings, including logic and category theory, as 
  well as related areas of computer science.
* Invited Spekers: Samson Abramsky, Rance Cleaveland, Andy 
  Gordon, Robin Milner, Peter O'Hearn and Dana Scott. There also
  will be special sessions on security and on model checking. The 
  balance of the program will be made up of contributed talks. For
  more information, see
* Submissions: A title and short abstract for contributed talks should 
  be sent to 
* Support: Limited support is available. Women and minorities, as well 
  as students are encouraged to apply. 
* Organizing Committee: Stephen Brookes, Michael Main, Austin Melton, 
  Michael Mislove and David Schmidt. The local arrangements are being 
  overseen by Stephen Bloom, Adriana Compagnoni and David Naumann.

  Fischbachau/Munich, Germany
  August 21-26, 2000
* Scope: The conference is intended for computer scientists whose
  research activities involve logic, as well as for logicians working
  on issues significant for computer science. Suggested, but not
  exclusive, topics of interest are: automated deduction and
  interactive theorem proving, categorical logic and topological
  semantics, constructive mathematics and type theory, domain theory,
  equational logic and term rewriting, finite model theory, database
  theory, higher order logic, lambda and combinatory calculi, logical
  aspects of computational complexity, logical foundations of
  programming paradigms, logic programming, constraints, linear logic,
  modal and temporal logics, model checking, program extraction,
  program logics and semantics, program specification, transformation
  and verification
* Invited Speakers: Miklos Ajtai, Paul Beame, Andreas Blass, Egon
  B"orger, Yuri Gurevich, Bruno Poizat, Wolfram Schulte, Saharon
  Shelah, Colin Stirling.
* Program Committee: Edmund Clarke, Peter Clote, Kevin Compton, Erich
  Gr"adel, Gerhard J"ager, Klaus Keimel, Jan Willem Klop, Jan
  Krajicek, Daniel Leivant, Tobias Nipkow, Helmut Schwichtenberg,
  Moshe Vardi.
* Submissions deadline: January 31, 2000
  Notification of acceptance: April 17, 2000
  Camera-ready copy: May 19, 2000
* Contact: Peter Clote and Helmut Schwichtenberg

  Lincoln College, Oxford, UK, 
  10th to 14th April 2000 
* Theme. This school specifically aims to equip mathematicians
  embarking on a PhD degree with the knowledge and expertise to
  contribute to current research in computing science.  It is also of
  interest to other PhD students and lecturers with an active interest
  in the mathematics of program construction. The school will consist
  of intensive courses together with a one-day workshop at which
  participants will be given the opportunity to present their own
* Technical lectures and topics include, but are not limited to,
  Initial Algebras and Final Coalgebras: The Categorical Perspective;
  Fixpoint Calculus and Galois Connections; The Algebra of
  Programming; Calculational Properties of Folds and Unfolds;
  Exercises in Coalgebraic Specification; Temporal Algebra; Lattices
  and Order.
* Registration. To register, complete the form supplied on the School
  web page, and deliver it by one of the following methods:  
  * By email, to 
  * By fax, to +44 1865 273839 (mark "for the attention of Jeremy Gibbons") 
  * By post, to ACMMPC, c/o Jeremy Gibbons, Oxford University Computing
    Laboratory, Wolfson Building, Parks Road, Oxford OX1 3QD, UK.
  If you have any further questions, please email, or contact the organizers by fax or
  post. Please note that places on the School are limited, and early
  registration is advisable. Deadlines are 31st January 2000 
  for financial support, and 11th February 2000 for registration. 
* Program committee. Roland Backhouse (University of Nottingham), Roy
  Crole (University of Leicester), Jeremy Gibbons (Oxford University).
* Preliminary information: This can be found at the School home page

  Journal of Discrete Algorithms
  Hermes Science Publishing Ltd,
  Oxford UK
* Aims and Scope: The Journal of Discrete Algorithms welcomes original
  papers in all areas of finite and discrete algorithm design and
  analysis. The purpose of this journal is to feature new algorithms
  and data structures, new analyses or comparisons of known
  algorithms, complexity studies and well-focussed review articles of
  currently-active subject areas. Articles in other areas of
  theoretical computer science will also be considered when there is a
  clear connection to computational issues. Papers in the following
  subject areas are particularly welcome: Automata, languages and
  computability, Distributed and parallel computation, Algorithmic
  graph theory and combinatorics, Graph algorithms, Algorithmic aspects
  of logic, Graph drawing, Computational algebra, Network optimisation,
  Computational biology, New paradigms of computation, Computational
  complexity, Probabilistic and randomised algorithms, Computational
  geometry, String algorithms, Cryptography, Symbolic computation and
  rewriting systems, Data structures
* Editors-in-Chief and subject areas: D. Gabbay (Computational Logic),
  C.S. Iliopoulos (String Algorithms), G. Italiano (Data Structures),
  M. Smid (Geometric Algorithms), E. Upfal (Randomised Algorithms),
  D. Wagner (Network Optimisation)
* Editors: J. Abello, S. Albers, A. Andersson, A. Broder, M. De Berg,
  P. Dunne, M. Dyer, A. Frieze, R. Giancarlo, G. Gottlob, M. Grohe,
  R. Hariharan, R. Janardan, M. Kaufmann, G. Landau, T. Lecroq, 
  C. Levcopoulos, S. N"aher, H. Nagamochi, G. Narasimhan, K. Park,
  M.-F. Sagot, S. Schirra, I. Stewart, M. Szegedy, M. Thorup, S. Vorobyov,
  G. Woeginger, M. Yvinec 
* Managing Editors: D. Gabbay and C.S. Iliopoulos
* Information for authors:

  Principles of Program Analysis
  F.Nielson & H.R.Nielson & C.Hankin
  Springer, 450 pages, ISBN 3-540-65410-0, 79 DM
* This book covers the four main approaches to static analysis
  of programs: Data Flow Analysis, Constraint Based Analysis,
  Abstract Interpretation, and Type and Effect Systems. The
  coverage include algorithmic as well as semantic aspects.
  The book is intended for M.Sc. and Ph.D. students but is 
  also aimed at researchers and professionals.
* Further info at