Newsletter 66

May 2, 2000

[Past issues of the newsletter are available at]

* Calls for Papers
  Workshop on Rewriting Logic and Its Applications
  Workshop on Expressiveness in Concurrency
* Call for Participation
  LICS Workshop on Proof Carrying Code
* Book Announcement
  Architecture Design and Validation Methods by Egon Boerger (Ed.)
* Journals
  ACM Transactions on Computational Logic
  Theory and Practice of Logic Programming
* Associate Professorship in Logic in CS (Aarhus, DK)

  Call for Papers
  Kanazawa, Japan
  September 18-20, 2000
* Theme. Rewriting logic is a natural semantic framework for concurrency,
  parallelism, and communication in computing, and for the specification
  of a wide range of systems and languages.  It also has good properties
  as a logical framework for representing logics. The goal of this workshop
  is to bring together researchers, from all over the world, interested in
  these ideas, so that they can present their recent works, discuss future
  research directions, and exchange ideas.
* Technical topics include, but are not restricted to, foundation/models
  and extensions of rewriting logic, uses of rewriting logic as a logical
  framework, applications of rewriting logic to the specification of
  languages  and systems, applications of rewriting logic to object-oriented
  specification and programming, applications of rewriting logic to
  concurrency and/or parallel specification and/or programming, languages
  based on rewriting logic, and rewriting approaches to behavioral
* Submission. The papers will be evaluated by the program committee on
  the basis of a 10 pages abstract submitted electronically (in postscript
  format) to the program chairs ( no later than
  May 10, 2000. Notification of acceptance is to be given by June 30,
  and upon acceptance a camera-ready full paper must be prepared by
  August 10, 2000. The proceedings are to be published in the Electronical
  Notes in Theoretical Computer Science series.
* Program committee. David Basin, Razvan Diaconescu, Kokichi Futatsugi
  (Chair), Jean-Pierre Jouannaud, Helene Kirchner, Narciso Marti-Oliet,
  Jose Meseguer, Ugo Montanari, Mitsu Okada, Carolyn Talcott, Yoshihito
  Toyama, Martin Wirsing.

  2nd Call for Papers
  Pennsylvania State University, USA
  August 21, 2000 (satellite to CONCUR 2000)
* Scope: The EXPRESS workshops aim at bringing together researchers
  interested in the relations between various formal systems,
  particularly in the field of Concurrency.  More specifically, they
  focus on the comparison between programming concepts (such as
  concurrent, functional, imperative, logic and object-oriented
  programming) and between mathematical models of computation (such as
  process algebras, Petri nets, event structures, modal logics, rewrite
  systems etc.) on the basis of their relative expressive power.
* Invited speaker: Neil Jones (DIKU, Copenhagen, DK)
* Programme committee: Luca Aceto (BRICS, DK), Karen Bernstein (DePaul
  University, US), Rance Cleaveland (SUNY at Stony Brook, US), Wan
  Fokkink (CWI, NL), Rob van Glabbeek (Stanford University, US), Ursula
  Goltz (TU Braunschweig, DE), Rosario Pugliese (University of Firenze,
  IT), Julian Rathke (University of Sussex, UK), Davide Sangiorgi (INRIA
  Sophia-Antipolis, FR), Igor Walukiewicz (Warsaw University, PL), Bjorn
  Victor (Uppsala University, SE)
* Important dates:
  Paper submission: May 14, 2000 (midnight UTC)
  Notification: June 16, 2000
  Final version: July 31, 2000
* More details:

  (affiliated with LICS 2000)
  Call for Participation
  Santa Barbara, June 28 - 29, 2000
* The Workshop on Proof-Carrying Code aims to foster discussion and
  collaboration between implementors of proof-carrying code systems
  and researchers in the foundational areas of logic, static analysis,
  programming language semantics, compilers, type theory, and theorem
* Tutorials and reports on work in progress will be given by invited
  speakers, including Karl Crary Amy Felty Greg Morrisett George
  Necula Atsushi Ohori
* Additional contributions are solicited.  Appropriate topics include
  (but are not limited to): certifying compilers, type systems, safety
  policies, and security policies in proof-carrying code systems,
  efficient proof checking, compact proof representations, secure
  mobile code frameworks
* Interested parties should contact the organizer.
  Trevor Jim (

  Architecture Design and Validation Methods 
  Egon Boerger (Ed.) 
  Springer Verlag 2000, ISBN 3-540-64976-X
* This state-of-the-art survey gives a systematic presentation of
  recent advances in the design and validation of computer
* Based on advanced research ideas and approaches, and written by
  eminent researchers in the field, seven chapters cover the whole
  range from computer aided high-level design of VLSI circuits and
  systems to layout and testable design, including modeling and
  synthesis of behavior, of control, and of dataflow, cell based logic
  optimization, machine assisted verification, and virtual machine
* The chapters presuppose only basic familiarity with computer
  architecture. They are self-contained and lead the reader gently and
  informatively to the forefront of current research. A special
  feature of the book is the comprehensive range of architecture
  design and validation topics covered, giving the reader a clear view
  of the problems and of advanced techniques for their solution.

  ACM Transactions on Computational Logic (TOCL)
* This addition to the ACM's Transactions Series is devoted to the
  research concerned with all uses of logic in Computer Science.
* Volume 1, Number 1 (July 2000) 
  - Mechanizing UNITY in Isabelle, Larry Paulson 
  - Logics with Counting and Local Properties, Leonid Libkin 
  - On Hoare Logic and Kleene Algebra with Tests, Dexter Kozen 
  - Sequential Abstract State Machines Capture Sequential Algorithms, 
    Yuri Gurevich
  - Locality of Order-Invariant First-Order Formulas, 
    Martin Grohe and Thomas Schwentick 
  - Compilability and Compact Representations of Revision of Horn Knowledge
    Bases, Paolo Liberatore 
  - First-Order Conditional Logic for Default Reasoning Revisited, 
    Nir Friedman, Joseph Y. Halpern and Daphne Koller 
  - Verifying Continuous Time Markov Chains, 
    Adnan Aziz, Kumud Sanwal, Vigyan Singhal and Robert Brayton 
* Authors are allowed (in fact, encouraged) to post their
  submissions first at the Computing Research Repository (CoRR),, freely available.
  The accepted papers are immediately and freely available through the
  home page of the journal.
* For the list of Areas and Area Editors, full list of accepted papers,
  and guidelines for the submission please consult the home page of

  Theory and Practice of Logic Programming
  Cambridge University Press
* This is an appeal to the libraries to subscribe to this new
  journal. The following background information may clarify the
* In November 1999 the complete Editorial Board of the Journal of
  Logic Programming (JLP) of Elsevier Press (50 editors in total)
  collectively resigned after 16 months of unsuccessful negotiations
  with Elsevier Press about the price of library subscriptions.  They
  founded a new journal, Theory and Practice of Logic Programming
  (TPLP) with the Cambridge University Press (CUP). The first issue
  of TPLP will appear in January 2001. For the current list of
  accepted papers please consult the home page of the TPLP.
* The price per page of the TPLP journal will be approximately 55%
  lower than that of the JLP.  It will initially be published
  bi-monthly in both print and electronic form. The actual extent and
  subscription price of TPLP will be announced soon by the CUP in its
  own advertising campaign.  The Founding Editor of the journal is
  Professor Emeritus Jack Minker of the University of Maryland.
* The Association for Logic Programming, acting in full cooperation
  with the former Editorial Board of the JLP, withdrew its support for
  the JLP and adopted TPLP as the sole official journal of the ALP.
  Moreover, several authors withdrew in the meantime their submissions
  to the JLP and resubmitted them to TPLP. At this moment only one
  paper handled by the former Area Editors of the JLP is still active
  for the JLP.
* The former Editors agreed to keep their names on the masthead of the
  JLP until the end of 2000, the moment when all the papers processed
  by them for the JLP will have been published.  Elsevier Press
  decided to continue the JLP as of 2001 "with another editorial
  board".  The Association, the former Editors, and the logic
  programming community, strongly believe that there is support for
  only one logic programming journal.
* Krzysztof R. Apt (
  President of the Association for Logic Programming

  University of Aaarhus
  Department of Computer Science
* A tenured position as associate professor in the area of Logic in
  Computer Science, i.e. computational logic in a broad sense, is
  available at the Department of Computer Science, starting August 1,
  2000. Ideally we seek applicants who as well as exhibiting a broad
  and impressive knowledge of Logic applicable in Computer Science,
  are able to support and encourage Logic on a broad front within the
  department. As a minimum requirement, applicants must have
  documented scientific qualifications within the area (equivalent to
  a PhD plus at least 2-3 years additional research and teaching).
* Applicants must submit a curriculum vitae, a description of
  scientific accomplishments, future research plans and participation
  in research programmes, a description of teaching experience, a list
  of publications (all in 4 copies), and 3 copies of publications to
  be considered in the evaluation.
* Applications should be addressed to The Faculty of Science,
  University of Aarhus, Ny Munkegade, Building 520, DK-8000 Aarhus C,
  Denmark, and marked 212/5-189 
  The deadline for receipt of all applications is May 10, 2000, at
* For more information, please contact the head of the department Kurt
  Jensen (e-mail: Phone: +45 8942 5612) or
  consult the Web pages: