From fritsv@cwi.nl Tue Jan 4 12:26:39 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA17916; Tue, 04 Jan 94 05:28:16 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA23906 (5.65b/3.12/CWI-Amsterdam); Tue, 4 Jan 1994 11:26:39 +0100 Received: by specht.cwi.nl id AA07010 (5.65b/3.8/CWI-Amsterdam); Tue, 4 Jan 1994 11:26:39 +0100 Date: Tue, 4 Jan 1994 11:26:39 +0100 Message-Id: <9401041026.AA07010=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: CAV 94 call for papers (submissions due Jan 17) From: dill@hohum.stanford.edu (David Dill) CALL FOR PAPERS CONFERENCE ON COMPUTER-AIDED VERIFICATION Stanford University, Stanford CA, USA June 21 - June 24, 1994 This conference is the sixth in a series dedicated to the advancement of the theory and practice of computer-assisted formal verification. Emphasis will be placed on research results that may potentially result in improved techniques, implementation issues for existing verification results, and application of methods to real verification problems. Special sessions for tutorials and demonstration of verification tools are planned. The boundaries of the conference are not rigid. In the past, papers on the following topics have been enthusiastically received: Application areas: synchronous and asynchronous circuits, computer arithmetic, protocols, distributed algorithms, real-time systems, hybrid systems. Methods based on: automata, model-checking, automated deduction. Theoretical issues: decidability of verification problems and logics, computational complexity results, verification algorithms. However, any paper that is of potential interest for computer-aided verification will be considered. SUBMISSION: Electronic submission of Postscript(tm) files by emailing to "cav@cs.stanford.edu" is REQUIRED, except for authors who do not have reasonable access to electronic mail through Internet, BITNET, etc. Draft papers should be no more than 10 pages long (with normal font sizes, line spacing, margins, etc.) Papers should provide sufficient detail so that their technical contributions can be assessed by members of the program committee. Accepted papers will be published in the conference proceedings. Submissions must be received by January 17, 1994. Authors will be notified of acceptance or rejection by March 11, 1994. Program Chairman: David L. Dill CIS 135 Stanford, CA 94305-4070 cav@cs.stanford.edu Steering Committee: E. M. Clarke, Carnegie Mellon University, USA R. P. Kurshan, AT&T Bell Laboratories, USA A. Pnueli, Weizmannn Institute, Israel J. Sifakis, Verimag-IMAG, France Additional members of the program committee: R. Alur, AT&T Bell Labs, USA R. Brayton, U. of California, Berkeley, USA E. Brinksma, U. of Twente, The Netherlands R. Bryant, Carnegie Mellon U., USA R. Cleaveland, N. Carolina St. U. USA C. Courcoubetis, U. of Crete, Greece R. de Simone, INRIA, France A. Emerson, U. of Texas, Austin, USA M. Fujita, Fujitsu, Japan S. German, GTE Labs, USA O. Grumberg, Technion, Israel N. Halbwachs, France G. Holzmann, AT&T Bell Labs, USA K. Larsen, Aalborg U., Denmark K. McMillan, AT&T Bell Labs, USA L. Paulson, Cambridge U., United Kingdom N. Shankar, SRI International, USA F. Somenzi, U. of Colorado, Boulder, USA B. Steffen, Techical U. of Aachen, Germany P. Varaiya, U. of California, Berkeley, USA P. Wolper, U. de Liege, Belgium T. Yoneda, Tokyo Inst. of Tech., Japan From fritsv@cwi.nl Wed Jan 12 19:29:21 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA23988; Wed, 12 Jan 94 12:31:11 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA14458 (5.65b/3.12/CWI-Amsterdam); Wed, 12 Jan 1994 18:29:22 +0100 Received: by specht.cwi.nl id AA15567 (5.65b/3.8/CWI-Amsterdam); Wed, 12 Jan 1994 18:29:21 +0100 Date: Wed, 12 Jan 1994 18:29:21 +0100 Message-Id: <9401121729.AA15567=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Reminder: CONCUR'94 - Call for Papers From: concur94@sics.se (Please distribute to colleagues and others that might be interested in participating) CALL FOR PAPERS CONCUR '94 Fifth International Conference on Concurrency Theory Uppsala, Sweden August 22-25, 1994 TOPICS Submissions are invited in all areas of semantics, logics and verification techniques for concurrent systems. Potential topics include, but are not limited to, process algebras, compositional analysis techniques, verification tools, shared-memory and message-passing formalisms, operational and denotational models, programming language semantics, concurrent logic and constraint programming, fairness, temporal logics, Petri nets and true concurrency. SUBMISSION Six copies of a draft full paper of no more than 15 double-spaced standard pages accompanied by a one-page abstract should reach the programme committee chairman no later than 25 FEBRUARY 1994. The mailing addresses (both postal and electronic), telephone number and fax number (if available) of the author to whom correspondence should be sent should be clearly indicated on each copy of the submission. Papers must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. Submissions will be evaluated by the programme committee for inclusion in the proceedings, which are expected to be published by Springer-Verlag. PROGRAMME COMMITTEE CHAIR (submission address) Joachim Parrow Swedish Inst. of Computer Science Box 1263 164 28 Kista Sweden telephone: +46 8 752 15 25 fax: +46 8 751 72 30 e-mail: concur94@sics.se PROGRAMME COMMITTEE Ralph Back Jos Baeten Eike Best Ed Clarke Mads Dam Rob van Glabbeek Cliff Jones Bengt Jonsson Kim Larsen Ugo Montanari Mogens Nielsen Catuscia Palamidessi Joachim Parrow Scott Smolka Bernhard Steffen Colin Stirling P.S. Thiagarajan Pierre Wolper Frits Vaandrager Zhou Chaochen INVITED SPEAKERS David Dill (Stanford University, USA) Jean-Yves Girard (CNRS, France) Mogens Nielsen (University of ]rhus, Denmark) Prakash Panangaden (McGill University, Canada) Paris Kanellakis (Brown University, USA) TUTORIAL LECTURES by Ralph Back (]bo Akademi, Finland) Costas Courcoubetis (Institute of Computer Science, FORTH, and University of Crete, Greece) Robert de Simone (INRIA, France) Joseph Sifakis (VERIMAG, France) IMPORTANT DATES Submission deadline: 25 February 1994 Notification of Acceptance: 25 April 1994 Final version due: 27 May 1994 VENUE The conference will be held in Uppsala city centre (population ca. 100,000). Uppsala is located 70 km north of Stockholm and 35 km north of the international airport of Stockholm. ORGANIZING COMMITTEE CHAIR Bengt Jonsson Dept. of Computer Systems Uppsala University Box 325 751 05 Uppsala Sweden telephone: +46 18 18 31 57 fax: +46 18 55 02 25 e-mail: concur94@docs.uu.se ASSISTANCE AVAILABLE VIA ANONYMOUS FTP This document is also available via anonymous ftp to sics.se (192.16.123.90) in the pub/CONCUR94 directory as the file cfp.txt. To aid in the preparation of manuscripts using LaTeX (or TeX) LNCS style files can be fetched via anonymous ftp from sics.se in the pub/CONCUR94 directory. The file llncs.tar contains a UNIX tar archive consisting of the LaTex style files, and plncs.tar contains the TeX style files. From fritsv@cwi.nl Sat Jan 15 10:28:19 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA19445; Sat, 15 Jan 94 03:30:06 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA09530 (5.65b/3.12/CWI-Amsterdam); Sat, 15 Jan 1994 09:28:19 +0100 Received: by specht.cwi.nl id AA18603 (5.65b/3.8/CWI-Amsterdam); Sat, 15 Jan 1994 09:28:19 +0100 Date: Sat, 15 Jan 1994 09:28:19 +0100 Message-Id: <9401150828.AA18603=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: CAV 94 submission deadline From: dill@hohum.stanford.edu (David Dill) I have received many questions about this already: Late electronic submissions to CAV 94 will be reviewed iff they arrive before midnight Jan. 24. Please try emailing plain postscript (to cav@cs.stanford.edu) before doing anything complicated. The call for papers in various formats is available via anonymous ftp from snooze.stanford.edu (see cfp.*) David Dill Program Chair Conference on Computer-Aided Verification 1994 From fritsv@cwi.nl Mon Jan 17 16:43:19 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA01222; Mon, 17 Jan 94 09:45:14 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA14633 (5.65b/3.12/CWI-Amsterdam); Mon, 17 Jan 1994 15:43:20 +0100 Received: by specht.cwi.nl id AA21252 (5.65b/3.8/CWI-Amsterdam); Mon, 17 Jan 1994 15:43:19 +0100 Date: Mon, 17 Jan 1994 15:43:19 +0100 Message-Id: <9401171443.AA21252=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: ftp facility Sussex From: Luca Aceto We are pleased to announce the introduction of an ftp facility for the electronic distribution of Sussex Computer Science reports. Recent concurrency related Sussex reports that can be obtained via ftp include: cs0393: A Modal Logic for Message Passing Processes M. Hennessy and X. Liu cs0591: A Process Algebra for Timed Systems M. Hennessy and T. Regan cs0593: Proof Systems for Message Passing Process Algebras M. Hennessy and H. Lin cs0891: A Model for the Pi Calculus M. Hennessy cs1192: Concurrent Testing of Processes M. Hennessy cs0193: On "Axiomatising Finite Concurrent Processes" L. Aceto cs0293: Timed Process Algebras: A Tutorial M. Hennessy cs0192: Symbolic Bisimulations M. Hennessy and H. Lin cs0692: Fully Abstract Denotational Models for Higher Order Processes M. Hennessy cs0693: GSOS and Finite Labelled Transition Systems L. Aceto cs0791: Communicating Processes with Value Passing and Assignments M. Hennessy and A. Ingolfsdottir cs0993: Timing and Causality in Process Algebra L. Aceto and D. Murphy cs1093: Decidability and Small Model Property of Process Equations X. Liu cs1191: Concurrent Testing of Processes M. Hennessy To retrieve one of these reports, connect to the ftp server by saying ftp ftp.cogs.susx.ac.uk Then when prompted you say: Name: anonymous Password: YOUR EMAIL ADDRESS Then: cd pub/reports/compsci Finally you say: binary to select BINARY mode for compressed files, and get csNNYY.ps.Z to retrieve the file you are interested in. To quit the ftp session, just say: quit After transferring the files they have to be uncompressed via the UNIX command uncompress, after which the resulting postcript file can be printed in the standard way. A list of the papers that are available by ftp, together with their abstracts, may be found in the file pub/reports/abstracts/csabs.txt. Best regards, Luca Aceto Carolyn Brown Matthew Hennessy Alan Jeffrey Xinxin Liu David Murphy From fritsv@cwi.nl Mon Jan 17 17:13:16 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA01341; Mon, 17 Jan 94 10:15:09 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA15722 (5.65b/3.12/CWI-Amsterdam); Mon, 17 Jan 1994 16:13:17 +0100 Received: by specht.cwi.nl id AA21320 (5.65b/3.8/CWI-Amsterdam); Mon, 17 Jan 1994 16:13:16 +0100 Date: Mon, 17 Jan 1994 16:13:16 +0100 Message-Id: <9401171513.AA21320=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: CFP(Final): PODC94 From: James H. Anderson CALL FOR PAPERS 1994 ACM Symposium on Principles of Distributed Computing (PODC) The Thirteenth ACM Symposium on Principles of Distributed Computing (PODC), sponsored by ACM SIGACT and SIGOPS, will be held in Los Angeles, California, USA, August 14-17, 1994. Original research contributions are sought that address fundamental issues in the theory and practice of distributed and concurrent systems. Specially sought are papers that illuminate connections between practice and theory. Topics of interest include, but are not limited to: Distributed algorithms and complexity, Network protocols and architectures, Multiprocessor algorithms and architectures, Distributed operating systems -- principles and practice, Concurrency control and synchronization, Issues of asynchrony, synchrony, and real time, Fault tolerance, Cryptography and security, Specification, semantics, and verification. NEW CONFERENCE FORMAT: This year's conference will have two tracks of presentations. Long presentations will follow the standard format of recent years (25 minute talks), and will be accompanied by 10 page extended abstracts in the proceedings. It is understood that the research reported in these abstracts is original, and is submitted exclusively to this conference. In addition, brief presentations (10 minute talks) are invited as well. These presentations will be accompanied by a short (up to 1 page) abstract in the proceedings. Presentations in this track are understood to reflect early research stages, unpolished recent results, or informal expositions, and are not expected to preclude future publication of an expanded or more polished version elsewhere. (The popular ``rump'' session will still take place this year as well, although it is expected to be shorter given the new track.) SUBMISSIONS: Please send 12 copies of a detailed abstract (printed double-sided if possible) or a short abstract (1 page) with the postal address, e-mail address, and telephone number of the contact author, to the program chair: David Peleg IBM T.J. Watson Research Center P.O. Box 704 Yorktown Heights, New York 10598 E-mail: peleg@watson.ibm.com To be considered by the committee, abstracts must be received by February 4, 1994 (or postmarked January 28 and sent via airmail). This is a firm deadline. Acceptance notification will be sent by April 15, 1994. Camera-ready versions of accepted papers and short abstracts will be due May 10, 1994. ABSTRACT FORMAT: An extended abstract (for long presentation) must provide sufficient detail to allow the program committee to assess the merits of the paper. It should include appropriate references and comparisons to related work. 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 a non-specialist. Technical development of the work, directed to the specialist, should follow. Submitted abstracts should be no longer than 4,500 words (roughly 10 pages). If the authors believe that more details are essential to substantiate the main claims of the paper, they may include a clearly marked appendix that will be read at the discretion of the program committee. A short abstract (for brief presentation) should provide a much more concise description (up to 1 page) of the results and their implications. Authors should indicate in the cover letter for which track they wish to have their submission considered. In general, the selection criteria for long presentations are expected to be much more stringent than those for short ones. At the authors' request, a (10-page) submission may be considered for both tracks, with the understanding that it will be selected for at most one. (Such a request will in no way affect the chances of acceptance.) PROGRAM COMMITTEE: James Anderson (University of North Carolina), Brian Bershad (University of Washington), Israel Cidon (Technion and IBM T.J. Watson), Michael J. Fischer (Yale University) Shay Kutten (IBM T.J. Watson), Yishay Mansour (Tel-Aviv University), Keith Marzullo (University of California at San Diego), David Peleg (Weizmann Institute, IBM T.J. Watson and Columbia University), Mark Tuttle (DEC CRL), Orli Waarts (IBM Almaden), Jennifer Welch (Texas A&M University) CONFERENCE CHAIR: James Anderson, University of North Carolina. LOCAL ARRANGEMENTS CHAIR: Elizabeth Borowsky, UCLA. ----------**********----------**********----------**********---------- Jim Anderson anderson@cs.unc.edu PODC94 General Chair Computer Science Dept 919 962-1757 (voice) University of North Carolina 919 962-1799 (fax) Chapel Hill, NC 27599-3175 From fritsv@cwi.nl Tue Jan 18 18:33:10 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA05801; Tue, 18 Jan 94 11:35:08 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA09725 (5.65b/3.13/CWI-Amsterdam); Tue, 18 Jan 1994 17:33:11 +0100 Received: by specht.cwi.nl id AA22771 (5.65b/3.8/CWI-Amsterdam); Tue, 18 Jan 1994 17:33:10 +0100 Date: Tue, 18 Jan 1994 17:33:10 +0100 Message-Id: <9401181633.AA22771=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: RAILWAYS From: Bas van Vlijmen L.S., A summary is given of what we received in response to our request for information on RAILWAYS, SAFETY and FORMAL METHODS, sent to the CONCURRENCY list on December 20, 1993. Our own research in the near future will concentrate on: 1. study of the material we gathered: categorize what is going on, what techniques are used, what is solved and what is not; 2. formulate in cooperation with the Dutch National Railways (NS) what they consider safe and proper behaviour of their interlocking equipment; 3. prove the properties formulated with NS under point 2 for the interlocking at Hoorn-Kersenboogerd, a small Dutch station. Last but not least we wish to thank everybody who responded for the information, remarks, comments, and papers. These were all very helpful. Regards, Jan Friso Groote, S.F.M. van Vlijmen Utrecht University Department of Philosophy Heidelberglaan 8 P.O.Box 80126 3508 TC Utrecht e-mail: JanFriso.Groote@phil.ruu.nl, Bas.vanVlijmen@phil.ruu.nl. ******************************************************************** ****************************** SUMMARY *************************** ******************************************************************** This summary is based on the material we received by email and other means. It does not pretend to be complete nor to be accurate. 1. People and groups working on RAILWAYS, SAFETY and FORMAL METHODS Great Britain Institute Name email --------- ---- ----- Warwick Cullyer ? Warwick W. Wong ww@cl.cam.ac.uk University of Newcastle upon Tyne M. Koutny ? " R. de Lemos ? " A. Saeed ? " T. Anderson ? LFCS Edinburgh G. Bruns ? " S. Anderson ? " G. Cleland glc@dcs.ed.ac.uk Manchester Metropolian University M. Fisher michael@sun.com.mmu.ac.uk UMIST C. Pulley cjp@sna.co.umist.ac.uk UMR Su-mei Tsai sumeit@mcs213k.cs.umr.edu Germany Institute Name email --------- ---- ----- TU Muenchen D. Taubner taubner@informatik.tu-muenchen.de Siemens A. Scholz Andreas.Scholz@zfe.siemens.de ? S. Fischer ? GMD M. Morley morley@gmd.de The Netherlands Institute Name email --------- ---- ----- Eindhoven Technical University K. van Hee ? " W. van der Aalst wsinwa@win.tue.nl " R. Bol bol@info.win.tue.nl CVI P. van Eijk cvitoa!pve@relay.nluug.nl University of Amsterdam W. Koorn koorn@fwi.uva.nl Utrecht University S.F.M. van Vlijmen Bas.vanVlijmen@phil.ruu.nl " J.F. Groote JanFriso.Groote@phil.ruu.nl France Institute Name email --------- ---- ----- GEC Alsthom Sweden Institute Name email --------- ---- ----- Swedisch State Railway J.F. Lindeberg ? U.S.A. Institute Name email --------- ---- ----- Carnegie Mellon E. Clarke Edmund_Clarke@G.GP.CS.CMU.EDU Cornell T. Henzinger tah@cs.cornell.edu Australia Institute Name email --------- ---- ----- CSIRO & ANU H. Schmidt Heinz.Schmidt@csis.dit.csiro.au 2. Techniques used Various techniques are used. The most commenly encountered were Temporal Logics, Process algebras (ACP, CCS, CSP) and Petri nets. 3. Bibliografy (in BibTex format) @article{Kou86, author = {M. Koutny}, title = {The {M}erlin-{R}andell Problem of Train Journeys}, journal = {Acta Informatica}, volume = {23}, year = {1986}, pages = {429-463} } @inproceedings{Br92, author = {G. Bruns}, booktitle = {Computer Aided Verification}, editor = {G. von Bochmann and D.K. Probst}, institution= {Universi\'e de Montreal}, pages = {220-233}, title = {A Case Study in Safety-Critical Design}, series = {LNCS}, volume = {663}, year = {1992} } @article{LSA92a, author = {Lemos, R. de and A. Saeed and T. Anderson}, title = {A Train Set as a Case Study for the requirements Analysis of Safety-Critical Systems}, journal = {The Computer Journal}, volume = {35}, number = {1}, year = {1992}, pages = {30-40} } @inproceedings{FTS92, author = {S. Fischer and D. Taubner and A. Scholz}, booktitle = {Computer Aided Verification}, editor = {G. von Bochmann and D.K. Probst}, institution= {Universit\'e de Montreal}, pages = {192-205}, title = {Verification in process algebra of the distributed control of track vehicles -- A case study}, series = {LNCS}, volume = {663}, year = {1992} } @inproceedings{FFO93, author = {M. Finger and M. Fisher and R. Owens}, booktitle = {Sixth International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems (IEA/AIE-93)}, title = {{\sc MetateM} at Work: Modelling Reactive Systems Using Executable Temporal Logic}, year = {1993}, publisher = {Gordon and Breach Publishers}, address = {Edinburgh, U.K.}, month = jun } @inproceedings{AHH93, author = {Alur and Henzinger and Ho}, booktitle = {IEEE Real-Time Systems Symposium}, title = {Automatic Symbolic Verification of Embedded Systems}, year = {1993} } @article{BS89, author = {J. Burghardt and H. Schmidt}, title = {Das \"{U}bel bei der {W}urzel packen}, journal = {GMD-Spiegel}, volume = {2}, number = {3}, year = {1989} } @book{CGR93a, author = {D. Craigen and S. Gerhart and T. Ralston}, title = {An International Survey of Industrial Applications of Formal Methods--Purpose, Approach, Analysis and Conclusions}, volume = {1}, publisher = {NIST (National Institute of Standards and Technology)}, year = {1993} } @book{CGR93b, author = {D. Craigen and S. Gerhart and T. Ralston}, title = {An International Survey of Industrial Applications of Formal Methods--Case Studies}, volume = {2}, publisher = {NIST (National Institute of Standards and Technology)}, year = {1993} } @article{Bou86, author = {J. Bourachot}, title = {Computer-aided planning of traffic in large stations by means of the {AFAIG} model}, journal = {Rail International}, volume = {2}, month = may, year = {1986} } @techreport{Br87, author = {M. Broy}, title = {Specification of a railway system}, institution= {Universit\"at Passau}, year = {1987}, number = {MIP-8715} } @techreport{IMT93a, author = {M. Insall and B. McMillin and S. Tsai}, title = {Providing Run-Time Assurance for Responsive Computing Systems}, institution= {UMR Department of Computer Science}, number = {CSC 93-29a}, year = {1993}, note = {in preparation} } @techreport{IMT93b, author = {M. Insall and B. McMillin and S. Tsai}, title = {A Run-Time Decision Procedure for Responsive Computing Systems}, institution= {UMR Department of Computer Science}, number = {CSC 93-29b}, year = {1993}, note = {to be submitted to Conference on Computer Aided Verification} } @techreport{IMT93c, author = {M. Insall and B. McMillin and S. Tsai}, title = {Constructing an Interval Temporal Logic for Real-Time Systems}, institution= {UMR Department of Computer Science}, number = {CSC 93-25}, year = {1993}, note = {submitted to Journal of Applied Non-Classical Logic} } @inproceedings{Li93, author = {J.F. Lindeberg}, booktitle = {Directions in Safety-critical Systems, Proceedings of the Safety-critical Systems Symposium, Bristol 1993}, editor = {F. Redmill and T. Anderson}, title = {The Swedish State Railway's Experience with n-Version Programmed Systems}, year = {1993}, publisher = {Springer-Verlag Safety-critical Systems Club}, } @techreport{AC93, author = {S. Anderson and G. Cleland}, title = {Formal Approaches to Safety in Programmable Electronic Systems}, institution= {University of Edinburgh, LFCS}, year = {1993} } @article{Cr87, author = {A.H. Cribbens}, title = {Solid-state interlocking ({SSI}): an integrated electronic signalling system for mainline railways}, journal = {IEE Proceedings}, volume = {134}, number = {3}, month = may, year = {1987} } @techreport{CP93, author = {G.V. Conroy and C. Pulley}, title = {Logical Methods in the Formal Verification of Safety-Critical Software}, institution= {UMIST}, year = {1993} } @techreport{M93a, author = {M.J. Morley}, title = {Safety in Railway Signalling Data: A Behavioural Analysis}, institution= {University of Edinburgh, LFCS}, year = {1993} } @techreport{M93b, author = {M.J. Morley}, title = {Modelling {B}ritish {R}ail's Interlocking Logic: Geographic Data Correctness}, institution= {University of Edinburgh, LFCS}, year = {1993} } @article{CV91, author = {V. Chandra and M.R. Verma}, title = {A fail safe interlocking system for railways}, journal = {IEEE Design \& Test of Computers}, volume = {8}, number = {1}, pages = {58-66}, year = {1991} } From fritsv@cwi.nl Mon Jan 24 18:42:05 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA28865; Mon, 24 Jan 94 11:44:00 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA08328 (5.65b/3.13/CWI-Amsterdam); Mon, 24 Jan 1994 17:42:05 +0100 Received: by specht.cwi.nl id AA05888 (5.65b/3.8/CWI-Amsterdam); Mon, 24 Jan 1994 17:42:05 +0100 Date: Mon, 24 Jan 1994 17:42:05 +0100 Message-Id: <9401241642.AA05888=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: ADT94+COMPASS From: adt94@disi.unige.it 10th ADT Workshop and 6th General Compass Meeting May 30 - June 3, 1994 Call for Participation The two joint events will take place in Santa Margherita Ligure near Genova. At the end of the workshop a meeting of the IFIP WG 14.3 will be held in the same place starting from 3th June noon, to 4th June noon. The workshop will provide an opportunity to meet colleagues, to present recent and ongoing work and to discuss new ideas and future trends. The topics of the workshop include, but are not limited to algebraic specifications, other approaches to formal specification, specification languages and methods, term rewriting and proof systems, specification development systems (concepts, tools, etc.). The proceedings, consisting of a selection of the presented talks through the usual referee process, will be published after the workshop, probably in the Lecture Notes series of the Springer-Verlag (see e.g. the Recent Trends in Data Type Specifications series n. 534, 655....). For further information please contact ADT94@disi.unige.it From fritsv@cwi.nl Tue Feb 1 09:41:45 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA21598; Tue, 01 Feb 94 02:43:54 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA24388 (5.65b/3.13/CWI-Amsterdam); Tue, 1 Feb 1994 08:41:46 +0100 Received: by specht.cwi.nl id AA14544 (5.65b/3.8/CWI-Amsterdam); Tue, 1 Feb 1994 08:41:45 +0100 Date: Tue, 1 Feb 1994 08:41:45 +0100 Message-Id: <9402010741.AA14544=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: CFP: Workshop ICLP94 From: fosca@orione.cnuce.cnr.it (Fosca Giannotti) CALL FOR PAPERS Second ICLP-Workshop on Deductive Databases Deductive Databases and Logic Programming Santa Margherita Ligure, Italy, 17 - 18 June 1994 in conjunction with the International Conference on Logic Programming (ICLP'94) The 1994 International Conference on Logic Programming will be held on June 13 - 16, 1994, in Santa Margherita Ligure, near Genoa, Italy. Post-conference workshops are planned to be held on June 17 - 18. TOPICS Deductive databases use logic programming as a powerful declarative language for accessing and maintaining large amounts of data. Recent research results in logic programming are useful for extending the power and efficiency of deductive database systems. New facilities arise from incorporating disjunctions, sets, types, constraints, negation, non-determinism, actions and different notions of null values. On the other hand, since logical knowledge is often applied for reasoning on large sets of facts, techniques from deductive databases must be used to allow the efficient handling and processing of the underlying logic programs. The objective of the one-day workshop is to bring together researchers working in the area of deductive databases and logic programming. A fundamental goal is to give opportunities for active discussions on new research directions and the exchange of latest results on these related fields. Suggested topics include, but are not limited to: * Disjunctive databases * Sets, Types and Aggregation * Abstract interpretations and program transformations * Non-deterministic extensions of logic database languages * Non-monotonic deduction * Constraint reasoning in databases * Subsumption * Expressiveness of query languages * Query optimization and evaluation * Logical approaches to active databases * Updates and knowledge acquisition ORGANIZING COMMITTEE: Natraj Arni, InferData Corp. Austin, USA Ulrich Geske, GMD Berlin, Germany Fosca Giannotti, CNUCE-CNR Pisa, Italy Els Laenens, Univ. Antwerp, Belgium Dietmar Seipel, Univ. Tuebingen, Germany Mark Wallace, ECRC Munich, Germany PROGRAM COMMITTEE: For evaluating the submissions the organizers will be assisted by: Patrizia Asirelli, IEI-CNR Pisa, Italy Francois Bry, ECRC Muenchen, Germany Jose A. Fernandez, Univ. Maryland, USA Ulrich Fuhrbach, Univ. Koblenz, Germany Hans-Joachim Goltz, GMD Berlin, Germany Jiawei Han, SFU, Burnaby, Canada James Harland, Univ. Melbourne, Australia Werner Kiessling, Univ. Augsburg, Germany Jorge Lobo, Univ. Illinois, Chicago, USA Rainer Manthey, Univ. Bonn, Germany Dino Pedreschi, Univ. Pisa, Italy Gianfranco Rossi, Univ. Bologna, Italy Letizia Tanca, Politecnico Milano, Italy Helmut Thoene, Univ. Tuebingen, Germany Carlo Zaniolo, UCLA Los Angeles, USA SUBMISSIONS The primary focus is on new and original research results. But we also encourage the submission of papers describing products, prototypes in development or benchmarks. Full papers or extended abstracts in English of 6 to 10 pages are welcome on any aspects of deductive databases and new concepts of logic programming supporting it, until March 28, 1994. Submission in LaTeX or plain TeX format by e-mail is encouraged. Notification of acceptance will be no later than April 25, 1994. The final, camera-ready versions of the accepted papers must be received by May 25, 1994 to be included into the informal proceedings. The presentations are intended to be half an hour including some time for discussion. Authors are invited to send their papers to one of the organizers. IMPORTANT DATES: Submission deadline: March 28, 1994 Notification of acceptance: April 25, 1994 Camera ready version: May 25, 1994 ADDRESSES: Information: Dietmar Seipel, University at Tuebingen Sand 13, D - 72076 Tuebingen, Germany Tel.: +49 7071 29 5993, Fax.: +49 7071 29 5958 E-mail: seipel@sunflower.informatik.uni-tuebingen.de Ftp (anonymous): ftp.gmd.de Papers: Ulrich Geske, GMD-FIRST, Rudower Chaussee 5, D - 12489 Berlin, Germany (Computer-)Fax.: +49 30 6392 1839 E-mail: geske@first.gmd.de ________________________________________________________________________ From fritsv@cwi.nl Tue Feb 1 09:43:24 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA21619; Tue, 01 Feb 94 02:45:27 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA24410 (5.65b/3.13/CWI-Amsterdam); Tue, 1 Feb 1994 08:43:24 +0100 Received: by specht.cwi.nl id AA14551 (5.65b/3.8/CWI-Amsterdam); Tue, 1 Feb 1994 08:43:24 +0100 Date: Tue, 1 Feb 1994 08:43:24 +0100 Message-Id: <9402010743.AA14551=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: VLDB 94 Call for Papers From: Matthias Jarke ********************************************************* * V L D B '94 * * SECOND CALL for PAPERS * * 20th INTERNATIONAL CONFERENCE on VERY LARGE DATA BASES * Santiago, Chile * September 12-15, 1994 ********************************************************* !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! HARD DEADLINE FOR ARRIVAL OF SUBMISSIONS : February 23, 1994 !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! SCOPE ===== A distinguished history of 20 years has established VLDB at the center of the international data base community. It is one of the oldest established forums of discussion in the international database community and, without doubt, one of the most eminent. VLDB'94 is to take place in Santiago, Chile, a hospitable modern capital city landmarked by the Mapocho river and the impressive heights of the Andes mountains. We invite you to submit papers reporting recent research results in the general field of databases. In addition, to mark the 20th anniversary of VLDB special efforts are being made to further the goal of leading in reporting and stimulating new research directions. To this purpose, we solicit papers and panel proposals on speculative and futuristic topics. We also encourage papers on novel and challenging applications of database technology in designing and building complex information systems. A new aspect of the conference is the industrial cases program. We encourage submission of papers describing work of significant interest to industry, particularly in areas providing interesting directions for the development of databases. We seek to provide a forum to discuss experiences in applying databases to real life situations. In the evaluation of papers submitted to this program, the committee will consider novelty, technical quality and the value of reported results to developers of information systems. A high-quality tutorial program will be offered in both English and Spanish. TOPICS OF INTEREST ================== The topics of interest include but are not limited to: o Extended Relational Databases o Database Languages o Object Oriented Databases o Data Models and Database Design o Knowledge Base Management Systems o Data Integrity and Security o Temporal and Spatial Databases o Optimization and Performance o Multimedia Databases o Concurrency/ Transaction Management o Heterogeneous Databases o Storage Management o Engineering and Scientific Databases o Persistent Object Systems o Parallel and Distributed Databases o Architectures o Text Databases o Implementation Issues o Graphical Query Languages o User Interfaces PAPER SUBMISSION ================ Six copies of original papers not exceeding 5000 words (double spaced pages, including keywords) MUST BE RECEIVED by the 23th of February 1994, by the appropriate regional program chair: North-American Program Chair: --------------------- Carlo Zaniolo Computer Science Department UCLA 405 Hilgard Avenue, CA 90024 USA e-mail: zaniolo@cs.ucla.edu tel: (+1 310) 825 8137 fax: (+1 310) 825 2273 European Program Chair: ---------------- Matthias Jarke Informatik V, RWTH Aachen Ahornstr. 55 52074 Aachen, Germany email: jarke@informatik.rwth-aachen.de tel.: (+49 241) 80 21 501 fax: (+49 241) 8888 - 321 Latin-America, Pacific Basin and Far-East Program Chair: -------------------------------------- Jorge Bocca Chile (Latin-American region) (Other regions) Depto. de Ciencias de la School of Computer Science Computacio'n Universidad de Chile University of Birmingham Blanco Encalada 2120 Edgbaston Santiago Birmingham B15 2TT Chile United Kingdom e-mail: jbocca@dcc.uchile.cl J.B.Bocca@cs.bham.ac.uk tel: (+56 2) 689 2736 (+44 21) 414 3711 fax: (+56 2) 689 5531 (+44 21) 414 4281 PROGRAM COMMITTEE ==================== Michele Adiba, France Richard R. Muntz, USA Divyakant Agrawal, USA Kotagiri Ramamohanarao, Australia Peter Apers, Netherlands Kenneth Ross, USA Ricardo Baeza-Yates, Chile Ron Sacks-Davis, Australia David Bell, Northern Ireland Felix Saltor, Spain Jose Blakeley, Mexico/USA Betty Salzberg, USA Jorge Bocca, UK/Chile Joachim W. Schmidt, Germany Mokrane Bouzeghoub, France Michael Schrefl, Austria Alex Buchmann, Mexico/Germany Amit P. Sheth, USA Peter Buneman, USA Avi Silberschatz, USA Michael Carey, USA Richard Snodgrass, USA Nick J. Cercone, Canada Stefano Spaccapietra, Switzerland Sharma Chakravarthy, USA Sury Sripada, Germany Jan Chomicki, USA V.S. Subrahmanian, USA Stavros Christodoulakis, Greece Patrick Valduriez, France Sophie Cluet, France Yannis Vassiliou, Greece Armin B. Cremers, Germany P. Venkat Rangan, USA S.Misbah Deen, UK Victor Vianu, USA Sergio Delgado, Mexico Gerhard Weikum, Switzerland Klaus Dittrich, Switzerland Jennifer Widom, USA Kam Fai, Hong Kong Christos Faloutsos, USA Raymundo Foradellas, Spain Antonio Furtado, Brazil Sumit Ganguly, USA Georges Gardarin, France Narain Gehani, USA Goetz Graefe, USA Jim Gray, USA Ehud Gudes, Israel Theo Haerder, Germany Paula Hawthorn, USA Richard Hull, USA Sushil Jajodia, USA Christian Jensen, Denmark Manfred Jeusfeld, Germany Alfons Kemper, Germany Michel Kuntz, Japan Rosana Lanzelotte, Brazil Zhou Longxiang Chou Longhsiang, China Claudia Medeiros, Brazil Alberto Mendelzon, Argentina/Canada Michele Missikoff, Italy C. Mohan, USA Ron Morrison, UK Ami Motro, USA Erich Neuhold, Germany Jack Orenstein, USA Gultekin Ozsoyoglu, USA TUTORIALS ========== Tutorial proposals should be sent by air-mail, fax or e-mail to one of: Alberto O. Mendelzon Ricardo Baeza-Yates CSRI Depto. Ciencias de la Computacio'n University of Toronto Universidad de Chile Toronto Blanco Encalada 2120 Canada M5S 1A1 Santiago, Chile mendel@db.toronto.edu rbaeza@dcc.uchile.cl tel: (+1 416) 978-2952 tel: (+56 2) 689 2736 fax: (+1 416) 978-4765 fax: (+56 2) 689 5531 Some suggested, but not exclusive, tutorial topics are: multimedia data management, scientific databases, geographic information systems, user interfaces and visualization, object-oriented analysis and design, active databases, transaction processing, distributed object management, persistent object systems, database programming languages, standards and technology integration, etc. INDUSTRIAL CASES ================ The VDLB Conference will set up for the first time a section devoted to the discussion of experiences of commercial use of Databases in industry, including the discussion of new leading products. Authors are requested to submit their papers within the dates and format established for the rest of the conference, except that papers should be submitted to one of the following members of the Industrial Cases program committee: Iva'n Tabkha (Chair) Richard M. Soley Depto. Ciencias de la Object Management Group Computacio'n Universidad de Chile Framingham Corporate Center Blanco Encalada 2120 492 Old Connecticut Path Framingham, MA 01701 e-mail: ivan@dcc.uchile.cl soley@omg.org tel: (+56 2) 689 2736 (+1 508) 820 4300 fax: (+56 2) 689 5531 (+1 508) 820 4303 Jose' A. Blakeley Felipe Carin~o Jr. Texas Instruments NCR/Teradata Corporation 13510 N. Central Expressway, MS 238 100 N. Sepulveda Blvd Dallas, Texas 75243 El Segundo, CA 90245 e-mail: blakeley@csc.ti.com Felipe.Carino@ElSegundoCA.ncr.com tel: (+1 214) 995 0362 tel: (+1 310) 524 7026 fax: (+1 214) 995 0304 fax: (+1 310) 524 0015 Guillermo Lois IBM Nordic Lab BOX 962, 181 09 Lidingo, Sweden Lidingo, Sweden e-mail: gmolois@ldgvm1.vnet.ibm.com tel: (+46 8) 636 6342 fax: (+46 8) 767 4929 PANELS ======= Proposals for panel sessions should be sent to: Ron Morrison Computer Science University of St. Andrews St. Andrews - Fife KY16 9SS United Kingdom e-mail: ron@dcs.st-and.ac.uk tel: (+44 33) 463 254 fax: (+44 33) 463 278 IMPORTANT DATES ================= Paper, Panel, Tutorial and Industrial 23 February, 1994 Cases Submissions: Notification of Acceptance: 25 April, 1994 Conference: 12-15 September, 1994 CORPORATE SPONSORS ================= AT&T, IBM, NCR, ORACLE, SISTECO, SYBASE, SYNAPSIS, UNISYS, EL MERCURIO. SUPPORTERS ========== CHILEAN COMPUTER SCIENCE SOCIETY, CONICYT, CORREOS de CHILE, OMG, UNIVERSITY of CHILE, UNIVERSITY of BIRMINGHAM, RAL(UK). OFFICIAL AIRLINES ================= British Airways, LanChile For further information, please contact any member of the local organization committee by e-mail, fax, or mail. There is also a VLDB database server accessible through our local Internet Gopher service at gopher.dcc.uchile.cl. The local organization full address is: VLDB'94 Conference Departamento de Ciencias de la Computacio'n Universidad de Chile Blanco Encalada 2120 Santiago, Chile e-mail: vldb94@dcc.uchile.cl tel: (+56 2) 689 2736 fax: (+56 2) 689 5531 From fritsv@cwi.nl Thu Feb 3 13:15:43 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA28469; Thu, 03 Feb 94 06:17:47 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA18184 (5.65b/3.13/CWI-Amsterdam); Thu, 3 Feb 1994 12:15:44 +0100 Received: by specht.cwi.nl id AA17831 (5.65b/3.8/CWI-Amsterdam); Thu, 3 Feb 1994 12:15:43 +0100 Date: Thu, 3 Feb 1994 12:15:43 +0100 Message-Id: <9402031115.AA17831=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Isabelle course -- places still available From: Lawrence C Paulson Dear Colleague, Please forward the attached course announcement. The course is about the theorem prover Isabelle. It will be held one week after LICS and two weeks after CADE, to facilitate travel arrangements. Please send technical questions to Larry.Paulson@cl.cam.ac.uk and administrative ones to rt10005@phx.cam.ac.uk. I apologize for multiple copies. Larry Paulson ------------------------------------------------------------------------------ UNIVERSITY OF CAMBRIDGE Programme for Industry Introduction to Theorem Proving, using "Isabelle" 11-13 July 1994 Course fee 650 pounds sterling (350 pounds sterling for academic participants) AIM OF THE COURSE Theorem proving systems are growing in popularity and are demonstrating their utility in many fields: hardware/software verification, protocol verification, program synthesis, artificial intelligence, and mathematics research. The aim of this course is to introduce participants to the Isabelle system, developed at Cambridge University, and used since 1986 in research establishments. Isabelle has built-in support for several logics, including first-order logic (FOL), higher-order logic (HOL), Zermelo-Fraenkel set theory (ZF) and extensional Constructive Type Theory (CTT). New logics can also be introduced by specifying their abstract syntax, notation, and inference rules. This feature makes Isabelle uniquely flexible, applicable to many domains. OUTLINE OF THE COURSE The course is highly practical, with a large proportion of teaching taking place as hands-on sessions conducted on X workstations. The lectures and terminal sessions will enable participants to perform their own Isabelle proofs in higher-order logic. The projected course outline includes: Single-step proof checking. How to perform rewriting. Theory. Types and type classes. How to make simple definitions. How to define new logics. Advanced proof tools. The course will be taught by Dr Lawrence Paulson, the originator of Isabelle. WHO SHOULD ATTEND The course is intended for researchers, academic and industrial, in the fields of computer science and logic. Participants must have experience with X workstation environments and should also be familiar with elementary logic. Experience with a functional programming language such as ML would be helpful, but not essential. COURSE FEES AND ACCOMMODATION A 10% DISCOUNT CAN BE APPLIED TO THE COURSE FEE OF ANY REGISTRATION PRIOR TO 1 MARCH 1994. The course fee is 650 pounds sterling (350 pounds sterling for academics) payable in advance and includes a full set of course notes, a certificate of attendance, lunch, and day-time refreshments for the duration of the course. Accommodation can be arranged for delegates in single college rooms with shared facilities at 176 pounds sterling for 3 nights in Peterhouse college from Sunday July 10, to include bed and breakfast, dinner with wine and a Course Dinner. If you would prefer to make your own arrangements, please indicate on the registration form and details of local hotels will be sent to you. LOCATION The course will be held at the Department of Engineering, University of Cambridge. Access to Cambridge by air is possible direct from Amsterdam, and via Stansted Airport from many other European cities. Frequent bus services are available from Heathrow and Gatwick Airports. Rail and road communications to Cambridge are excellent; however, car parking in Cambridge is limited. Full directions will be sent with course joining instructions. REGISTRATIONS The number of places available on the course are limited to 20. You can make a provisional reservation on the course by telephone, fax or e-mail. All provisional places must be confirmed by completing and returning the tear-off slip below together with a company purchase order or full payment. METHODS OF PAYMENT Payments should be made by: A cheque drawn on a UK bank VISA or Mastercard/Eurocard Sterling travellers' cheques The University reserves the right to retrieve any bank charges or exchange costs which arise from payments made in other ways (including Eurocheques). Personal cheques drawn on banks outside the UK will not be accepted. Please do not send cash. Cheques or orders should be made payable to University of Cambridge/EYA. CANCELLATIONS Half the registration fee will be returned for bookings cancelled up to one calendar month in advance of the course. After this time no fees are returnable. However, substitutions may be made at any time. ------------------------------------------------------------------------------ I wish to register for the course: Introduction to Theorem Proving, using "Isabelle" Title (Dr, Mr, Ms etc): Name: First Names: Job Title: Company: Division: Address: Post Code: Tel. No: Fax. No: E-mail address: _____ Please reserve one place and accommodation for 3 nights. I enclose a cheque/purchase order for _______, made payable to the University of Cambridge/EYA. _____ Please reserve one place and send details of local hotels. I enclose a cheque/purchase order for _______, made payable to the University of Cambridge/EYA. _____ Please reserve one place at the Course Dinner (for delegates not resident at Peterhouse College) @ 30 pounds sterling. I have the following special requirements concerning diet or disabilities: Total Amount Enclosed: ____________ Return to : The Course Administrator, Cambridge Programme for Industry, University of Cambridge, 1 Trumpington St, Cambridge CB2 1QA Tel no +44 (0)223 332722 Fax +44 (0)223 301122 e-mail: rt10005@phx.cam.ac.uk From fritsv@cwi.nl Thu Feb 3 18:37:26 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA01224; Thu, 03 Feb 94 11:39:32 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA26860 (5.65b/3.13/CWI-Amsterdam); Thu, 3 Feb 1994 17:37:27 +0100 Received: by specht.cwi.nl id AA18296 (5.65b/3.8/CWI-Amsterdam); Thu, 3 Feb 1994 17:37:26 +0100 Date: Thu, 3 Feb 1994 17:37:26 +0100 Message-Id: <9402031637.AA18296=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Help with CCS bisimulation law From: bremond@gradient.cis.upenn.edu (Patrice Bremond-Gregoire) In CCS and under strong bisimulation equivalence the law fix (X= (P + X\L)) = fix (X = (P + P\L)) is sound, whether or not X is guarded in P. However I have difficulties proving it. Does anyone know of a published (or unpublished) proof of it? Thanks, Patrice Bremond-Gregoire University of Pennsylvania patrice@gradient.cis.upenn.edu From fritsv@cwi.nl Sun Feb 6 17:53:51 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA10888; Sun, 06 Feb 94 10:55:57 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA21283 (5.65b/3.13/CWI-Amsterdam); Sun, 6 Feb 1994 16:53:51 +0100 Received: by specht.cwi.nl id AA21611 (5.65b/3.8/CWI-Amsterdam); Sun, 6 Feb 1994 16:53:51 +0100 Date: Sun, 6 Feb 1994 16:53:51 +0100 Message-Id: <9402061553.AA21611=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Re: Help with CCS bisimulation law From: joachim@sics.se > In CCS and under strong bisimulation equivalence the law > fix (X= (P + X\L)) = fix (X = (P + P\L)) > is sound, whether or not X is guarded in P. However I have > difficulties proving it. > > Does anyone know of a published (or unpublished) proof of it? > > Thanks, > > Patrice Bremond-Gregoire > University of Pennsylvania > patrice@gradient.cis.upenn.edu I have not seen a proof of this, and laws relating recursion and static operators are rare. The brute force strategy which immediately suggests itself to me is to adapt the proof of Prop. 12 on p.99 in Milner's Communication and Concurrency. To make the analogy clear, rephrase your problem into A =def E{A/X} + A\L B =def E{B/X} + E{B/X}\L where E (which is P in your problem) has at most X free. Define the relation S = {(G{A/X}, G{B/X}): G contains at most X free} and prove it a strong bisimulation up to strong equivalence, as in Prop. 12 by proving the property called "(*)": If G{A/X} -a-> P', then for some Q,Q', G{B/X} -a-> Q'' = Q' and (P',Q') in S (and vice versa, "=" is strong equivalence). The proof is by transition induction, by depth on the inference of G{A/X} -a-> P', which goes by cases on the form of G. The interesting case is G == X. Then A -a-> P', so (by shorter inference) E{A/X} + A\L -a-> P'. Thus there are two subcases: 1) E{A/X} -a-> P'; the result follows as in Prop. 12 by induction taking G==E 2) A\L -a-> P'. Then by induction (take G == X\L) B\L -a-> Q'', whence (by def of B) (E{B/X} + E{B/X}\L)\L -a-> Q'', whence (by laws for + and \) E{B/X}\L -a-> Q'', whence (again by def of B) B -a-> Q'', so G{B/X} -a-> Q''. The other cases (where G =/= X) are precisely as in Prop. 12. For the "vice versa", a similar induction arises. The interesting case is when G == X and E{B/X}\L -a-> P' (the counterpart to subcase 2 above). Then by induction, taking G == E\L, we get E{A/X}\L -a-> Q'', whence (by def of A and laws for + and \) A -a-> Q''. Joachim Parrow, SICS From fritsv@cwi.nl Sun Feb 6 17:55:42 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA10904; Sun, 06 Feb 94 10:57:46 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA21288 (5.65b/3.13/CWI-Amsterdam); Sun, 6 Feb 1994 16:55:42 +0100 Received: by specht.cwi.nl id AA21616 (5.65b/3.8/CWI-Amsterdam); Sun, 6 Feb 1994 16:55:42 +0100 Date: Sun, 6 Feb 1994 16:55:42 +0100 Message-Id: <9402061555.AA21616=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: FTRTFT'94 - 2nd Announcement and Call for Papers, CORRECTION From: Aenne Strassner Dear colleagues, I regret having to admit that there are some small typographical errors in our 2nd Announcement and Call for Papers FTRTFT'94. The most important misprint concerns our e-mail-address: PLEASE NOTE THE CORRECT ADDRESS for any e-mail contacts: ftrtft@informatik.uni-kiel.d400.de +++++++ May I additionally ask you to correct the poster which you certainly received in the meantime so that persons not includeded in our mailing list up to now may contact us without problem? Best regards, Willem-Paul de Roever From fritsv@cwi.nl Sun Feb 6 17:57:26 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA10916; Sun, 06 Feb 94 10:59:29 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA21303 (5.65b/3.13/CWI-Amsterdam); Sun, 6 Feb 1994 16:57:26 +0100 Received: by specht.cwi.nl id AA21622 (5.65b/3.8/CWI-Amsterdam); Sun, 6 Feb 1994 16:57:26 +0100 Date: Sun, 6 Feb 1994 16:57:26 +0100 Message-Id: <9402061557.AA21622=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: CSP-based tool From: Vijay Gehlot I'm looking for freely available CSP-based (semi) automatic tools for specification/verification. I'm particularly interested in specification/verification of network protocols. Any information will be greately appreciated. -------------------------------------------------------------------------- Vijay Gehlot email: gehlot@cis.udel.edu Dept of Computer and Info Sci tel : +1 302-831-1951 103 Smith Hall fax : +1 302-831-8458 University of Delaware Newark, DE 19716-2586 From fritsv@cwi.nl Sun Feb 6 17:59:31 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA10930; Sun, 06 Feb 94 11:01:35 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA21336 (5.65b/3.13/CWI-Amsterdam); Sun, 6 Feb 1994 16:59:31 +0100 Received: by specht.cwi.nl id AA21628 (5.65b/3.8/CWI-Amsterdam); Sun, 6 Feb 1994 16:59:31 +0100 Date: Sun, 6 Feb 1994 16:59:31 +0100 Message-Id: <9402061559.AA21628=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Help with CCS bisimulation law/open problem From: Rob van Glabbeek Date: Thu, 3 Feb 1994 17:37:26 +0100 From: bremond@gradient.cis.upenn.edu (Patrice Bremond-Gregoire) In CCS and under strong bisimulation equivalence the law fix (X= (P + X\L)) = fix (X = (P + P\L)) is sound, whether or not X is guarded in P. However I have difficulties proving it. What do you mean by "proving"? If you consider a proof to be any chain of arguments leading to the conclusion that the law holds, then you have proved it already. Namely, you state that that the law is sound, and there would be no way of knowing that, without some kind of proof. Therefore you must mean a proof within the framework of a particular deduction system using a particular axiomatization of bisimulation equivalence of CCS expressions. I think it is not too hard to construct a bisimulation between the two processes you compare, but assume that that's not the solution you are asking for. Does anyone know of a published (or unpublished) proof of it? As CCS is Turing powerful, there is no constructive axiomatization that is complete for all of CCS. There are however several complete axiomatizations for fragments of CCS, but, as far as I know, none of them covers both restriction and unguarded recursion. I don't believe this law is derivable from the (incomplete) standard CCS axioms, mentioned in Milner's book. On this basis I conjecture that there exists no (published) proof of the law mentioned. * * * It is tempting however to introduce another axiom or rule that, when added to the standard CCS axioms would enable a proof of the given identity. An interesting candidate would be the Mutual Recursive Specification Principle (MRSP), to be defined in a minute. First remember that equations X=E where X may occur in E (recursive specifications) may have many solutions. The fixpoint operator fix picks one of those solutions, namely the one generated by the structural operational semantics of CCS. A powerful tool in proving identities for guarded CCS expressions without parallel composition (or actually without abstraction; but in CCS abstraction is implicit in parallel composition) is the rule P = E[P/X], X guarded in E ------------------------- P = fix (X = E) This rule, sometimes called the Recursive Specification Principle (RSP), says that if (X=E) is a recursive specification with X guarded in E, and P is any process that satisfies this equation, then P=fix(X=E). Namely, as (X=E) is guarded is has only one solution, which must be P. Now the Mutual Recursive Specification Principle (MRSP) is hereby defined as fix(Y=F)=E[fix(Y=F)/X], fix(X=E)=F[fix(X=E)/Y] ---------------------------------------------- fix(X=E) = fix(Y=F) It says that if (X=E) and (Y=F) are both recursive specifications, guarded or not, and the selected solution fix(Y=F) of the equation (Y=F) satisfies the equation (X=E), and, vice versa, fix(X=E) satisfies (Y=F), then fix(X=E) and fix(Y=E) must be equal. The rationale behind this principle it the idea that of all the solutions of an equation (X=E), the one selected by the fixpoint operator fix is somehow the least. Thus if fix(Y=F) is one of the solutions of X=E, and fix(X=E) is the `least' solution, fix(X=E) must be `smaller' than fix(Y=F). The same argument also works in the other direction, and one is tempted to conclude that fix(X=E) and fix(Y=F) are equal. The identity fix (X= (P + X\L)) = fix (X = (P + P\L)) must be provable from MRSP and the standard CCS laws. But I don't know whether MRSP is sound. In a c.p.o. based semantics, were fix(X=E) is truly the least solution of (X=E), the argument above proves the soundness of MRSP. But bisimulation semantics is not a c.p.o. based semantics. This brings me to the following question for the readers of this list: "Does there exists a partial order on CCS agents modulo bisimulation such that of all solutions of an arbitrary equation (X=E), the fixpoint operator fix picks the least one?" Or in other words: "Does there exist a preorder on CCS agents such that: (i) The associated equivalence is (strong) bisimulation equivalence, (ii) If P=E[P/X] then fix(X=E) =< P ?" Remark that the bisimulation preorders proposed in the literature are of no use for this purpose, as their associated equivalence is not bisimulation equivalence. If the answer is yes, MRSP must be valid. Probably the easiest way to establish a negative answer is my means of a counterexample to MRSP. My conjecture is that the answer is affirmative, and MRSP is valid. However, as of yet I don't know how to define the preorder. Rob van Glabbeek From fritsv@cwi.nl Thu Feb 10 17:02:23 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA08229; Thu, 10 Feb 94 10:04:46 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA18675 (5.65b/3.13/CWI-Amsterdam); Thu, 10 Feb 1994 16:02:23 +0100 Received: by specht.cwi.nl id AA26573 (5.65b/3.8/CWI-Amsterdam); Thu, 10 Feb 1994 16:02:23 +0100 Date: Thu, 10 Feb 1994 16:02:23 +0100 From: Frits.Vaandrager@cwi.nl Message-Id: <9402101502.AA26573=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Re: Help with CCS bisimulation law/open problem Below I have compiled four messages by Patrice Bremond-Gregoire, Rob van Glabbeek and Joachim Parrow which continue the discussion started by Patrice's request for help with a CCS bisimulation law. Earlier messages in this discussion were sent to the list on Februari 3 and Februari 6. Frits Vaandrager Moderator concurrency@cwi.nl --------------------------------------------------------------------------------- Date: Sun, 6 Feb 94 22:34:22 +0100 From: joachim@sics.se Rob's MRSP can be proven with a similar strategy as Patrice's law. Again, rephrasing into constant definitions, MRSP becomes A =def F{A/X} B =def E{B/X} A = E{A/X} B = F{B/X} Now set up the induction to prove "(*)" just as in my previous note. The interesting case is when G == X, i.e. A -a-> P'. Then (by a shorter inference) F{A/X} -a-> P'. So by induction (take G == F) F{B/X} -a-> Q''. By B = F{B/X} we get B -a->Q''' = Q'' which is enough. The remaining cases are hopefully trivial and the "vice versa" must be symmetric, but I unfortunately have no time to check it as I am leaving for a week in Germany in a few hours. Joachim Parrow PS This of course does not resolve Rob's question about the partial order. --------------------------------------------------------------------------------- Date: Mon, 7 Feb 94 02:29:49 PST From: Rob van Glabbeek Subject: A preorder for (strong) bisimulation From: joachim@sics.se Rob's MRSP can be proven with a similar strategy as Patrice's law. Indeed. Thanks. PS This of course does not resolve Rob's question about the partial order. Well, actually it helps a lot. Joachim's argument also shows that a cyclic version of MRSP is valid: If we have n recursively specified processes A1,...,An and Ai satisfies the defining equation of A(i-1 mod n) then all the Ai's are equal. In fix-notation: fix(Xi=Ei)=E(i-1 mod n)[fix(Xi=Ei)/X] (i=1,...,n) ------------------------------------------------- fix(Xi=Ei) = fix(Xj=Ej) Or using constant definitions: If Ai =def Ei{Ai/X} (i=1,...,n) and Ai = E(i-1 mod n){Ai/X} then Ai=Aj. The bisimulation relation is exactly as in Joachim's examples. Now one can define a preorder on CCS agents by P < Q iff there are Ai =def Ei{Ai/X} (i=1,...,n) with A(i) = E(i-1){Ai/X} (i=2,...,n) such that P bisimilar with A1 and Q with An. The relation is reflexive and transitive, and hence a preorder; moreover, by the cyclic MRSP, P (B) fix (X = (P + P\L + X\L)) = (fix(X=E+X) = fix(X+E)) (C) fix (X = (P + P\L + X\L + X)) > (D) fix (X = (P + P\L + X)) = (fix(X=E+X) = fix(X+E)) (E) fix (X = (P + P\L)) > (A) fix (X = (P + X\L)). Namely A = P[A/X] + A\L (unwind recursion one step) = P[A/X] + (P[A/X] + A\L)\L (repeat this in A\L) = P[A/X] + P[A/X]\L + A\L\L ((x+y)\L = x\L + y\L) = P[A/X] + P[A/X]\L + A\L (x\L\L = x\L) Hence A satisfies the recursive equation of B: X[A/X] = (P + P\L + X\L)[A\X] C\L = (P[C/X] + P[C/X]\L + C\L + C)\L (unwind recursion one step) = P[C/X]\L + P[C/X]\L\L + C\L\L + C\L ((x+y)\L = x\L + y\L) = P[C/X]\L + P[C/X]\L + C\L + C\L (x\L\L = x\L) = P[C/X]\L + C\L (x+x = x) Moreover C = P[C/X] + P[C/X]\L + C\L + C (unwind recursion one step) Hence C\L + C = C (x+x = x) So C = P[C/X] + P[C/X]\L + C (congruence) Thus C satisfies the recursive equation of D: X[C/X] = (P + P\L + X)[C\X] E = P[E/A] + P[E/A]\L = P[E/A] + (P[E/A] + P[E/A]\L)\L = P[E/A] + E\L Hence E satisfies the recursive equation of A: X[E/X] = (P + X\L)[E\X]. QED Rob van Glabbeek --------------------------------------------------------------------------------- From: bremond@gradient.cis.upenn.edu (Patrice Bremond-Gregoire) Date: Tue, 8 Feb 1994 17:28:19 -0500 (EST) Hi, I want to thanks to Rob and Joachim for their answer and I must apologize for the confusion; I suppose I should have said "I believe that the law is true". Joachim did answer my question, although I still have to understand why I thought that this approach did not work when I tried it. In some sense I a glad I initiated the confusion because I found Rob's answer very interesting, even if it did not help my purpose. The origin of the question was practical. In CCS without restriction, the law "fix (X=X) = 0" is enough to eliminate unguarded recursion. The law I am interested in is required to eliminate unguarded recursion in a more general setting. In fact, "fix (X=X) = 0" can be derived from "fix(X=P+X\L) = fix(X=P+P\L)". Patrice --------------------------------------------------------------------------------- Date: Wed, 9 Feb 94 22:33:16 +0100 From: joachim@sics.se This all raises some interesting questions. Define P Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA08271; Thu, 10 Feb 94 10:06:57 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA18756 (5.65b/3.13/CWI-Amsterdam); Thu, 10 Feb 1994 16:04:46 +0100 Received: by specht.cwi.nl id AA26579 (5.65b/3.8/CWI-Amsterdam); Thu, 10 Feb 1994 16:04:45 +0100 Date: Thu, 10 Feb 1994 16:04:45 +0100 Message-Id: <9402101504.AA26579=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Re: CSP-based tool From: Sandeep Kumar Shukla > I'm looking for freely available CSP-based (semi) automatic tools for > specification/verification. I'm particularly interested in > specification/verification of network protocols. Any information will > be greately appreciated. > > -------------------------------------------------------------------------- > Vijay Gehlot email: gehlot@cis.udel.edu > Dept of Computer and Info Sci tel : +1 302-831-1951 > 103 Smith Hall fax : +1 302-831-8458 > University of Delaware > Newark, DE 19716-2586 > You may try the CSP model checker available from Oxford. For Network protocols you have to concentrate on the realtime-probabilistic CSP and for specification and verification of protocols in PCSP there is a tool under development called "Pravda" which is freely available by anonymous ftp from Oxford. -- -------------------------------------------------------------- Sandeep Shukla email: sandeep@cs.albany.edu Graduate Student, phone: (518) 432 8864 Dept. of Computer Science, office:(518) 442 4285 SUNY at Albany, Albany NY 12222. -------------------------------------------------------------- From fritsv@cwi.nl Thu Feb 10 17:09:15 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA08310; Thu, 10 Feb 94 10:11:27 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA18839 (5.65b/3.13/CWI-Amsterdam); Thu, 10 Feb 1994 16:09:16 +0100 Received: by specht.cwi.nl id AA26595 (5.65b/3.8/CWI-Amsterdam); Thu, 10 Feb 1994 16:09:15 +0100 Date: Thu, 10 Feb 1994 16:09:15 +0100 Message-Id: <9402101509.AA26595=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: FSTTCS '14, Call for Papers From: Foundations_of_Software_Technology_Fsttcs_Theoretical_Computer_Science_14 CALL FOR PAPERS Fourteenth Conference on the FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE December 15-17, 1994, Madras, India The 14th Annual FST & TCS Conference will take place in Madras. This year's conference is being jointly organized by the Institute of Mathematical Sciences, SPIC Science Foundation and the Indian Institute of Technology, Madras. SCOPE: Authors are invited to submit papers presenting original and unpublished research on theoretical aspects of Computer Science. Typical areas include (but are not limited to): Computational Complexity Design and Analysis of Algorithms (including Parallel, Distributed, Probabilistic and Randomized Algorithms) Data Structures Learning Theory Computational Geometry Temporal and Modal Logics of Programs Rewrite Systems Type Theory Theory of Concurrency (including Reactive, Real-Time and Hybrid Systems) Theory of Logic Programming, Object-oriented, Functional and Constraints-based Programming Formal Concepts in Programming Languages Specification and Verification Methodologies. SUBMISSIONS: Authors are invited to send SIX copies of a draft of a full paper or an extended abstract. Papers should be limited to 6000 words (about 15 pages). If authors believe that more details are necessary, they may include a clearly marked appendix which will be read at the discretion of the Programme Committee. Each paper should also contain a short abstract of approximately 200 words. If available, e-mail addresses and fax numbers of the authors should also be included. The Conference Proceedings have been traditionally published by Springer-Verlag in the series Lecture Notes in Computer Science (LNCS). A commitment that the paper will be presented at the conference by one of the authors is a pre-condition for an accepted paper to be included in the proceedings. IMPORTANT DATES: Deadline for Submission : 15 May 1994 Notification to Authors : 5 August 1994 Final Version of Accepted Papers due on : 5 September 1994 ADDRESS: Send papers to: P.S. Thiagarajan E-mail : pst@ssf.ernet.in FST & TCS 14 pst@imsc.ernet.in School of Mathematics Fax : +91-44-825 6842 SPIC Science Foundation 92 G.N. Chetty Road, T. Nagar Madras 600 017, INDIA For further details concerning the conference, please write to: R. Ramanujam E-mail : fsttcs@imsc.ernet.in FST & TCS 14 Fax : +91-44-235 0586 Institute of Mathematical Sciences C.I.T. Campus, Taramani Madras 600 113, INDIA PROGRAMME COMMITTEE: S. Arun-Kumar (IIT, Delhi) V. Arvind (IMSc, Madras) V. Chandru (IISc, Bangalore) H. Karnik (IIT, Kanpur) K. Krithivasan (IIT, Madras) S.N. Maheshwari (IIT, Delhi) A. Mukhopadhyay (IIT, Kanpur) J. Radhakrishnan (TIFR, Bombay) R.K. Shyamasundar (TIFR, Bombay) R. Siromoney (MCC, Madras) P.S. Thiagarajan (SPIC Sci. Found., Madras) (CHAIR) ORGANIZING COMMITTEE: V.R. Dare (MCC, Madras) V. Krishnamurthy (Anna Univ., Madras) M. Mukund (SPIC Sci. Found., Madras) R. Ramanujam (IMSc, Madras) (CHAIR) P. Sreenivasakumar (IIT, Madras) ADVISORY COMMITTEE: S. Abramsky (Imperial College) D. Bjorner (UNU/IIST, Macau) A. Chandra (IBM Research) D. Gries (Cornell) M. Joseph (Warwick) A.K. Joshi (Pennsylvania) R. Kannan (Carnegie-Mellon) D. Kapur (SUNY, Albany) J.L. Lassez (IBM Research) U. Montanari (Pisa) R. Narasimhan (CMC, Bangalore) M. Nivat (Paris) R. Parikh (CUNY) A. Pnueli (Weizmann) V.K. Prasanna (USC) S. Sahni (Florida) S. Tripathi (Maryland) W. Wulf (Virginia) From fritsv@cwi.nl Thu Feb 10 17:06:51 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA11597; Thu, 10 Feb 94 15:03:53 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA18822 (5.65b/3.13/CWI-Amsterdam); Thu, 10 Feb 1994 16:06:52 +0100 Received: by specht.cwi.nl id AA26584 (5.65b/3.8/CWI-Amsterdam); Thu, 10 Feb 1994 16:06:51 +0100 Date: Thu, 10 Feb 1994 16:06:51 +0100 Message-Id: <9402101506.AA26584=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: PSSL announcement From: "Edmund Robinson" 54TH PERIPATETIC SEMINAR ON SHEAVES AND LOGIC The 54'th Peripatetic Seminar on Sheaves and Logic will be held at the University of Sussex over the weekend of the 26th-27th March 1994. As usual talks are invited in all aspects of category theory and logic. For further information please contact: pssl@cogs.susx.ac.uk Members of the ESPRIT BRA project CONCUR2 may wish to note that this is the weekend immediately preceding their project meeting also to be held in Sussex. From fritsv@cwi.nl Mon Feb 14 09:50:41 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA23224; Mon, 14 Feb 94 02:55:10 EST Received: from meerman.cwi.nl by charon.cwi.nl with SMTP id AA20525 (5.65b/3.13/CWI-Amsterdam); Mon, 14 Feb 1994 08:52:43 +0100 Received: from specht.cwi.nl by meermin.cwi.nl with SMTP id AA02293 (5.65b/%I%/CWI-Amsterdam); Mon, 14 Feb 1994 08:51:57 +0100 Received: by specht.cwi.nl id AA00457 (5.65b/3.8/CWI-Amsterdam); Mon, 14 Feb 1994 08:50:41 +0100 Date: Mon, 14 Feb 1994 08:50:41 +0100 Message-Id: <9402140750.AA00457=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: RTSS94 CFP From: krithi@nirvan.cs.umass.edu (Krithi Ramamritham) 15th IEEE Real-Time Systems Symposium December 7-9, 1994 San Juan, Puerto Rico FIRST ANNOUNCEMENT AND CALL FOR PAPERS The purpose of this symposium is to bring together researchers and developers from academia, industry and government to advance the science and technology in real-time computing. Papers on all aspects of real-time computing are sought, including operating systems and scheduling, fault-tolerance, databases, programming languages, tools, communication networks, architectures, performance modeling, formal methods, case studies, and applications. Of particular interests are reports describing practical experiences and experimental results based on system building efforts, and real-time issues in applications such as avionics, multimedia, robotics, automated process control and manufacturing. Papers should describe original work, and be 20 double-spaced pages (5,000 words) or less in length. Synopses (5 double-spaced pages or less in length) of real-time applications, experimental results, and practical experiences in the design and development of real-time systems are also invited. The synopses should contain enough information for the program committee to understand the scope of the project and evaluate the novelty of the problem or approach. All accepted submissions will appear in the proceedings. Please send 5 copies of your submission to arrive by April 29, 1993 -- a FIRM deadline -- to the program chair at the following address. (Please include e-mail and fax number with the author's address.) Krithi Ramamritham, RTSS94 Dept. of Computer Science, LGRC Campus Box 34610 University of Massachusetts Amherst MA 01003-4610 e-mail: rtss94@cs.umass.edu Phone: (413) 545-0196 FAX: (413) 545-1249 Sponsor: IEEE Computer Society Technical Committee on Real-Time Systems General Chair: Farnam Jahanian, University of Michigan Program Chair: Krithi Ramamritham, University of Massachusetts, Amherst Program Committee: George Avrunin, Univ. of Mass. Amherst Azer Bestavros, Boston Univ. Alex Buchmann, Tech. Hochschule, Darmstadt Alan Burns, Univ. of York Flaviu Cristian, UC San Diego Wolfgang Halang, Fern Univ. Jayant Haritsa, Indian Institute of Science Michelle Hugue, Trident Systems Kane Kim, UC Irvine Hermann Kopetz, Tech. Univ. Vienna Christian Koza, Alcatel Austria John Lehoczky, CMU Jay Lala, Draper labs Jane Liu, Univ. of Illinois, Urbana Miroslaw Malek, Univ of Texas, Austin Al Mok, Univ of Texas, Austin Frank Olken, Lawrence Berkeley Labs Raj Rajkumar, SEI Parmesh Ramanathan, Univ. of Wisconsin Karsten Schwan, Georgia Tech. Alan Shaw, Univ of Washington Chia Shen, Mitsubishi Electric Research Labs Kang Shin, Univ. of Michigan Lorenzo Strigini, IEI-CNR, Pisa Jay Strosnider, CMU Morikazu Takegaki, Mitsubishi Electric Hide Tokuda, Keiu Univ. Satish Tripathi, Univ. of Maryland Frits Vaandrager, CWI, Amsterdam Tetsuo Wasano, NTT Victor Yodaiken, New Mexico IMT Publicity Chair: Wei Zhao (zhao@cs.tamu.edu), Texas A&M University Industrial Chair: Prabha Gopinath, Honeywell Local Arrangements Chair: Sandra Ramos-Thuel, AT&T Treasurer: Walter Heimerdinger, Honeywell Ex-Officio: Jack Stankovic (RTS-TC Chair) IMPORTANT DATES FIRM deadline for Papers/Synopses -- April 29, 1994 Acceptance Letters -- July 22, 1994 Camera-Ready Papers -- September 15, 1994 Symposium -- December 7-9, 1994 A one-day workshop on the ``Composability of Fault-Resilient Real-Time Systems'' is also being planned, to be held December 6, 1994. For further details, please contact Michelle Hugue (meesh@nemo.cs.umd.edu). From fritsv@cwi.nl Fri Feb 18 14:40:21 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA12375; Fri, 18 Feb 94 07:42:48 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA15657 (5.65b/3.13/CWI-Amsterdam); Fri, 18 Feb 1994 13:40:23 +0100 Received: by specht.cwi.nl id AA06691 (5.65b/3.8/CWI-Amsterdam); Fri, 18 Feb 1994 13:40:21 +0100 Date: Fri, 18 Feb 1994 13:40:21 +0100 Message-Id: <9402181240.AA06691=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: CONCUR'94 From: joachim@sics.se CONCUR'94 Submission Deadline ============================= Many have asked me about the possibility of late submissions for Concur'94, and the following is my standard reply: The submission deadline is 25 February. If your paper reaches me before or on 25 Feb I guarantee it will be processed, if it reaches me later I cannot guarantee anything. If you suspect it will reach me after 25 Feb you can improve your chances by emailing me (no later than noon 25 Feb) at most one page in ASCII containing authors w affiliations, corresponding address and email, title and abstract. The abstract needs not be identical to the abstract in the submitted paper; I will use it just to tentatively assign PC-members to your submission. Be advised that during the week after the deadline (i.e., beginning 28/2) I will send out papers to PC-members; the week after that (i.e., beginning 7/3) I will be away. Unfortunately, for technical reasons we cannot receive email submissions of full papers. If you send a paper with DHL or a similar service, the address is: SICS Isafjordsgatan 22, floor 6, shaft B S-164 28 Kista Sweden The call for submissions is available via anonymous ftp to sics.se (192.16.123.90) in the pub/CONCUR94 directory as the file cfp.txt. Joachim Parrow, PC chair Concur'94 (concur94@sics.se) From fritsv@cwi.nl Fri Feb 18 15:34:03 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA12604; Fri, 18 Feb 94 08:36:21 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA16803 (5.65b/3.13/CWI-Amsterdam); Fri, 18 Feb 1994 14:34:03 +0100 Received: by specht.cwi.nl id AA06804 (5.65b/3.8/CWI-Amsterdam); Fri, 18 Feb 1994 14:34:03 +0100 Date: Fri, 18 Feb 1994 14:34:03 +0100 Message-Id: <9402181334.AA06804=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Call For Papers From: fsttcs@imsc.ernet.in %\documentstyle[12pt]{article} \documentstyle{article} % \oddsidemargin 6pt \evensidemargin 6pt \marginparwidth 90pt \marginparsep 10pt \topmargin -30pt \headheight 12pt \headsep 25pt \footheight 12pt \footskip 30pt %\textheight 680pt \textwidth 455pt \columnsep 10.5pt \columnseprule 0pt % \addtolength{\oddsidemargin}{-2.3cm} \setlength{\textwidth}{18cm} \addtolength{\topmargin}{-1cm} \setlength{\textheight}{27cm} \pagestyle{empty} \begin{document} % % Overall structure of the page % ----------------------------------------- % | | minipage (title) | % ----------------------------------------- % | |p| | % | Parbox |a| minipage | % | (com- |r| (conference | % | mit- |b| information) | % | tees) |o| | % | |x| | % ----------------------------------------- \hspace*{\fill} \begin{minipage}[t]{11cm} \begin{center} {\Large\sc Call for Papers} \end{center} \begin{center} {\large \it Fourteenth Conference on the}\\[1.5ex] {\Large \bf Foundations of Software Technology}\\[1.0ex] {\Large \bf and Theoretical Computer Science} \end{center} \begin{center} {\large\bf December 15--17, 1994, Madras, India} \end{center} \end{minipage} \bigskip %================================================================= % The committees go in a parbox on the left %================================================================= \parbox[t]{5.3cm}{ \noindent {\bf Programme Committee:} \medskip \begin{tabular}{l} S. Arun-Kumar (IIT, Delhi)\\ V. Arvind (IMSc, Madras)\\ V. Chandru (IISc, Bangalore)\\ H. Karnick (IIT, Kanpur)\\ K. Krithivasan (IIT, Madras)\\ S.N. Maheshwari (IIT, Delhi)\\ A. Mukhopadhyay (IIT, Kanpur)\\ J. Radhakrishnan\\ \hspace*{5mm} (TIFR, Bombay)\\ R.K. Shyamasundar \\ \hspace*{5mm}(TIFR, Bombay)\\ R. Siromoney (MCC, Madras)\\ G. Sivakumar (IIT, Bombay)\\ P.S. Thiagarajan {\bf (Chair)}\\ \hspace*{5mm}(SPIC Sci.\ Found., Madras) \end{tabular} \bigskip \noindent {\bf Organizing Committee:} \medskip \begin{tabular}{l} V.R. Dare (MCC, Madras)\\ V. Krishnamurthy \\ \hspace*{5mm}(Anna Univ., Madras)\\ M. Mukund \\ \hspace*{5mm}(SPIC Sci.\ Found., Madras)\\ R. Ramanujam {\bf (Chair)}\\ \hspace*{5mm}(IMSc, Madras) \\ P. Sreenivasakumar \\ \hspace*{5mm}(IIT, Madras) \end{tabular} \bigskip \bigskip \noindent {\bf Advisory Committee:} \medskip \begin{tabular}{l} S. Abramsky (Imperial College)\\ D. Bj\"orner (UNU/IIST, Macau)\\ A. Chandra (IBM Research)\\ D. Gries (Cornell)\\ M. Joseph (Warwick)\\ A.K. Joshi (Pennsylvania)\\ R. Kannan (Carnegie-Mellon)\\ D. Kapur (SUNY, Albany)\\ J.L. Lassez (IBM Research)\\ U. Montanari (Pisa)\\ R. Narasimhan \\ \hspace*{5mm}(CMC, Bangalore)\\ M. Nivat (Paris)\\ R. Parikh (CUNY)\\ A. Pnueli (Weizmann)\\ V.K. Prasanna (USC)\\ S. Sahni (Florida)\\ S. Tripathi (Maryland)\\ W. Wulf (Virginia) \end{tabular} } %\end{parbox} % %================================================================= % Vertical line goes in a parbox after the committees %================================================================= % \parbox[t]{5mm}{ \rule[-21cm]{0.2mm}{22cm} } %\end{parbox} % %================================================================= % Conference information goes in a minipage to the right of the line %================================================================= % \begin{minipage}[t]{12.2cm} The 14th Annual FST \& TCS Conference will take place in Madras. This year's conference is being jointly organized by the Institute of Mathematical Sciences, SPIC Science Foundation and the Indian Institute of Technology, Madras. \medskip {\bf Scope:~} Authors are invited to submit papers presenting original and unpublished research on theoretical aspects of Computer Science. Typical areas include (but are not limited to): \begin{quote} Computational Complexity; Design and Analysis of Algorithms \linebreak (including Parallel, Distributed, Probabilistic and Randomized \linebreak Algorithms); Data Structures; Learning Theory; Computational Geometry; Temporal and Modal Logics of Programs; Rewrite Systems; Type Theory; Theory of Concurrency (including Reactive, Real-Time and Hybrid Systems); Theory of Logic Programming, Object-oriented, Functional and Constraints-based Programming; Formal Concepts in Programming Languages; Specification and Verification Methodologies. \end{quote} {\bf Submissions:~} Authors are invited to send {\bf SIX} copies of a draft of a full paper or an extended abstract. Papers should be limited to 6000 words (about 15 pages). If authors believe that more details are necessary, they may include a clearly marked appendix which will be read at the discretion of the Programme Committee. Each paper should also contain a short abstract of approximately 200 words. If available, e-mail addresses and fax numbers of the authors should also be included. \hspace*{5mm} The Conference Proceedings have been traditionally published by Springer-Verlag in the series {\em Lecture Notes in Computer Science (LNCS)}. A commitment that the paper will be presented at the conference by one of the authors is a pre-condition for an accepted paper to be included in the proceedings. \medskip {\bf Important Dates:~} \begin{tabbing} XX \= Final Version of Accepted Papers due on \= : \= \parbox{4cm}{} \= \+ \kill Deadline for Submission \> : \> \parbox{4cm}{\hspace*{\fill} 15 May 1994} \> \\ Notification to Authors \> : \> \parbox{4cm}{\hspace*{\fill} 5 August 1994} \> \\ Final Version of Accepted Papers due on \> : \> \parbox{4cm}{\hspace*{\fill} 5 September 1994} \> \end{tabbing} \smallskip \noindent {\bf Address:} Send papers to: \begin{tabbing} XX \= Institute of Mathematical Sciences \hspace{5mm} \= E-mail \= : \= \+ \kill P.S. Thiagarajan \> E-mail \> : \> {\sf pst@ssf.ernet.in}\\ FST \& TCS 14 \> \> \> {\sf pst@imsc.ernet.in}\\ School of Mathematics \> Fax \> : \> +91--44--825 6842\\ SPIC Science Foundation \> \> \> \\ 92 G.N. Chetty Road, T. Nagar \> \> \> \\ Madras 600 017, INDIA \> \> \> \end{tabbing} \smallskip For further details concerning the conference, please write to: \begin{tabbing} XX \= Institute of Mathematical Sciences \hspace{5mm} \= E-mail \= : \= \+ \kill R. Ramanujam \> E-mail \> : \> {\sf fsttcs@imsc.ernet.in}\\ FST \& TCS 14 \> Fax \> : \> +91--44--235 0586\\ Institute of Mathematical Sciences \> \> \> \\ C.I.T. Campus, Taramani \> \> \> \\ Madras 600 113, INDIA \> \> \> \end{tabbing} \end{minipage} \end{document} From fritsv@cwi.nl Thu Feb 24 17:28:29 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA01896; Thu, 24 Feb 94 10:30:52 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA19942 (5.65b/CWI-Amsterdam(3.15)); Thu, 24 Feb 1994 16:28:30 +0100 Received: by specht.cwi.nl id AA13705 (5.65b/3.8/CWI-Amsterdam); Thu, 24 Feb 1994 16:28:29 +0100 Date: Thu, 24 Feb 1994 16:28:29 +0100 From: Frits.Vaandrager@cwi.nl Message-Id: <9402241528.AA13705=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: CWI Reports The following concurrency related CWI reports are now available by anonymous ftp. A CWI report with number CS-RXXYY can be retrieved by anonymous ftp at ftp.cwi.nl as pub/CWIreports/AP/CS-RXXYY.ps.Z. F. van Breugel: Three Metric Domains of Processes for Bisimulation. Report CS-R9335, CWI, Amsterdam, June 1993. (To appear in: Proceedings Ninth MFPS, New Orleans, LNCS, 1994.) Abstract. A new metric domain of processes is presented. This domain is located in between two metric process domains introduced by De Bakker and Zucker. The new process domain characterizes the collection of image finite processes. This domain has as advantages over the other process domains that no complica- tions arise in the definitions of operators like sequential composition and parallel composition, and that image finite language constructions like random assignment can be modelled in an elementary way. As in the other domains, bisimilarity and equality coincide in this domain. The three domains are obtained as unique (up to isometry) solutions of equations in a category of 1-bounded complete metric spaces. In the case the action set is finite, the three domains are shown to be equal (up to isometry). For infinite action sets, e.g., equipollent to the set of natural or real numbers, the process domains are proved not to be isometric. J.W. de Bakker, F. van Breugel and A. de Bruin: Comparative Semantics for Linear Arrays of Communicating Processes. Report CS-R9336, CWI, Amsterdam, June 1993 . (Appeared in: A.M. Borzyszkowski and S. Sokolowski, editors, Proceedings of the 18th MFCS, LNCS 711, pages 252-261, Gdansk, August/September 1993.) Abstract. Operational (O) and denotational (D) semantic models are designed for a language incorporating a version of the UNIX fork and pipe commands. Taking a simple while language as starting point, a number of programming constructs are added which achieve that a program can generate a dynamically evolving linear array of processes connected by channels. Over these channels sequences of values (streams) are trans- mitted. Both O and D are defined as (unique) fixed point of a contractive higher order operator. This allows a smooth proof that O and D are equivalent. Additional features are the use of hiatons, and of the closely related syntactic resumptions and semantic continuations. M. M. Bonsangue and J.N. Kok: Isomorphisms between Predicate and State Transformers. Report CS-R9338, CWI Amsterdam, 1993. (Extended abstract in: Proceedings MFCS '93, Gdansk, Poland, LNCS 711, pp. 301-310). Abstract. We study the relation between state transformers based on directed complete partial orders and predicate transformers. Concepts like `predicate', `liveness', `safety' and `predicate transformers' are formulated in a topological setting. We treat state transformers based on the Hoare, Smyth and Plotkin powerdomains and consider continuous, monotonic and unrestricted functions. We relate the transformers by isomorphisms thereby extending and completing earlier results and giving a complete picture of all the relationships. F. van Breugel: Relating State Transformation Semantics and Predicate Transformer Semantics for Parallel Programs. Report CS-R9339, CWI, Amsterdam, June 1993. Abstract. A state transformation semantics and a predicate transformer semantics for programs built from atomic actions, sequential composition, nondeterministic choice, parallel composition, atomisation, and recursion are presented. Both semantic models are derived from some SOS-style labelled transition system. The state transformation semantics and the predicate transformer semantics are shown to be isomorphic extending results of Plotkin and Best. J.W. de Bakker and F. van Breugel: Topological Models for Higher Order Control Flow. Report CS-R9340, CWI, Amsterdam, June 1993. (To appear in: Proceedings Ninth MFPS, New Orleans, LNCS, 1994.) Semantic models are presented for two simple imperative languages with higher order constructs. In the first language the interesting notion is that of second order assignment x := s, for x a procedure variable and s a statement. The second language extends this idea by a form of higher order communication, with statements c ! s and c ? x, for c a channel. We develop operational and denotational models for both languages, and study their relationships. Both in the definitions and the comparisons of the semantic models, con- venient use is made of some tools from (metric) topology. The operational models are based on (SOS-style) transition sys- tems; the denotational definitions use domains specified as solutions of domain equations in a category of 1-bounded com- plete ultrametric spaces. In establishing the connection between the two kinds of models, fruitful use is made of Rutten's `processes as terms' technique. Another new tool consists in the use of `metric' transition systems, with a metric defined on the configurations of the system. In addition to higher order programming notions, we use higher order definitional techniques, e.g., in defining the semantic mappings as fixed points of (contractive) higher order operators. By Banach's theorem, such fixed points are unique, yielding another important proof principle for our paper. J.J.M.M. Rutten: A structural co-induction theorem. Report CS-R9346, CWI Amsterdam, 1993. (To appear in: Proceedings Ninth MFPS, New Orleans, LNCS, 1994.) Abstract. The Structural Induction Theorem (Lehmann and Smyth, 1981; Plotkin, 1981) characterizes initial F-algebras of locally continuous functors F on the category of cpo's with strict and continuous maps. Here a dual of that theorem is presented, giving a number of equivalent characterizations of final coalgebras of such functors. In particular, final coalgebras are order strongly-extensional (sometimes called internal full abstractness): the order is the union of all (ordered) F-bisimulations. (Since the initial fixed point for locally continuous functors is also final, both theorems apply.) Further a similar co-induction theorem is given for a category of complete metric spaces and locally contracting functors. F. van Breugel: Generalizing Finiteness Conditions of Labelled Transition Systems. Report CS-R9365, CWI, Amsterdam, November 1993. (An extended abstract will appear in: Proceedings 21th ICALP, Jerusalem, July 1994. LNCS.) Abstract. A labelled transition system is provided with some additional structure by endowing the configurations and the labels with a complete metric. In this way, a so-called metric labelled transition system is obtained. The additional structure on a metric labelled transition system makes it possible to gener- alize the finiteness conditions finitely branching and image finite to compactly branching and image compact, respectively. Some topological properties of the operational semantic models and the so-called higher order transformations induced by labelled transition systems satisfying one of the finite- ness conditions are discussed. These results are generalized for metric labelled transition systems satisfying one of the generalized finiteness conditions. The generalized results are shown to be useful for studying semantics of programming languages. For example, a proof principle for relating different semantic models for a given language based on the results is presented. A.S.A. Jeffrey, S.A. Schneider and F.W. Vaandrager: A comparison of additivity axioms in timed transition systems. Report CS-R9366, CWI, Amsterdam, November 1993. Abstract. This paper discusses some axioms from the literature which have been used to define properties of timed transition systems. The {\em additivity} axiom proposed by (amongst others) Wang, and Nicollin and Sifakis is compared with the {\em trajectory} axiom of Lynch and Vaandrager. Some conditions for an additive transition system to be trajectoried are discussed. These are proved sufficient by using some simple terminology from category theory to show how this problem about timed transition systems can be turned into an equivalent problem about monotone functions on partially ordered sets. We also discuss {\em trajectory (bi)simulation}, which is a variant of Ho-Stuart's {\em path bisimulation}, and use similar techniques to discuss when (bi)simulation is equivalent to trajectory (bi)simulation. W.J. Fokkink: The tyft/tyxt format reduces to tree rules. Report CS-R9367, CWI, Amsterdam, November 1993. (To appear in: Proceedings TACS'94, LNCS.) Abstract. Groote and Vaandrager introduced the tyft/tyxt format for transition system specifications (TSSs), and established that for each TSS in this format that is well-founded, the strong bisimulation it induces is a congruence. In this paper, we construct for each TSS in tyft/tyxt format an equivalent TSS that consists of tree rules only. As a corollary we can give an affirmative answer to an open question, namely whether the well-foundedness condition in the Congruence Theorem of Groote and Vaandrager can be dropped. These results extend to tyft/tyxt with negative premises and predicates. W.J. Fokkink and H. Zantema: Basic process algebra with iteration: completeness of its equational axioms. Report CS-R9368, CWI, Amsterdam, November 1993. Abstract. Bergstra, Bethke and Ponse proposed an axiomatisation for Basic Process Algebra extended with (binary) iteration. In this paper, we prove that this axiomatisation is complete with respect to strong bisimulation equivalence. To obtain this result, we will set up a term rewriting system, based on the axioms, and prove that this term rewriting system is terminating, and that bisimilar normal forms are syntactically equal modulo commutativity and associativity of the +. J.J.M.M. Rutten and D. Turi: Initial algebra and final coalgebra semantics for concurrency. Report CS-R9409, CWI Amsterdam, 1994. (To appear in: J.W. de Bakker et al. (eds.), Proc. of the REX School/Symposium `A Decade of Concurrency---Reflections and Perspectives', LNCS, 1994.) Abstract. The aim of this paper is to relate initial algebra semantics and final coalgebra semantics. It is shown how these two approaches to the semantics of programming languages are each others dual, and some conditions are given under which they coincide. More precisely, it is shown how to derive initial semantics from final semantics, using the initiality and finality to ensure their equality. Moreover, many facts about congruences (on algebras) and bisimulations (on coalgebras) are shown to be dual as well. In particular, initial algebras satisfy an induction property: any congruence (which, in our terminology, need not be an equivalence) contains the equality relation. Dually, any bisimulation on a final coalgebra is contained in the equality relation. From fritsv@cwi.nl Thu Feb 24 17:31:17 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA01924; Thu, 24 Feb 94 10:33:47 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA20011 (5.65b/CWI-Amsterdam(3.15)); Thu, 24 Feb 1994 16:31:18 +0100 Received: by specht.cwi.nl id AA13713 (5.65b/3.8/CWI-Amsterdam); Thu, 24 Feb 1994 16:31:17 +0100 Date: Thu, 24 Feb 1994 16:31:17 +0100 Message-Id: <9402241531.AA13713=fritsv@specht.cwi.nl> To: concurrency@cwi.nl From: mdr@cwi.nl WORKSHOP "THREE DAYS OF BISIMULATION" Date: April 20 - 22, 1994 Place: CWI (Center for Mathematics and Computer Science) Kruislaan 413, Amsterdam Research in theoretical computer science has seen the emergence of both modal logics and process algebras as formalisms to describe processes. These approaches share a focus on Labeled Transition Systems as important structures for modeling computation. The workshop aims to bring together a group of leading researchers in these areas in order to compare both approaches and stimulate cross-fertilization. The focus of the workshop will be on the notion of bisimulation, this being a central tool in comparing labeled transition systems. The workshop is organized under the auspices of the Dutch National Organization for Scientific Research (NWO) Project NF 102/62-356 "Structural and Semantic Parallels between Natural Languages and Programming Languages". CONTRIBUTIONS: There will be four kinds of contributions: * tutorials on modal logic, process algebra and their connections * research talks on modal logic * research talks on process algebra * research talks on connecting and connected fields SPEAKERS: The following people will contribute to the workshop by giving a research talk or tutorial: H. Andreka & I. Nemeti M. Hennessy J.A. Bergstra I. Hodkinson D. Caucal J.W. Klop J. van Eijck M. de Rijke T. Fernando J. Rutten R. Goldblatt S. Smolka J.F. Groote C. Stirling A. Visser REGISTRATION: To stimulate fruitful interaction the number of participants will be limited. If you are interested in attending the workshop, please register by sending an e-mail message to bisim3@cwi.nl before April 1. The registration fee will be Dfl 100,-, to be paid in cash upon arrival at the workshop; this fee covers coffee, lunches and copies of the material that will be presented at the workshop. --------------------------------- | | | Deadline for registration: | | | | April 1, 1994 | | | --------------------------------- ORGANIZERS: Alban Ponse alban@fwi.uva.nl Maarten de Rijke mdr@cwi.nl Yde Venema yde@phil.ruu.nl From fritsv@cwi.nl Mon Feb 28 18:56:04 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA27217; Mon, 28 Feb 94 11:58:43 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA06595 (5.65b/CWI-Amsterdam(3.15)); Mon, 28 Feb 1994 17:56:06 +0100 Received: by specht.cwi.nl id AA18368 (5.65b/3.8/CWI-Amsterdam); Mon, 28 Feb 1994 17:56:04 +0100 Date: Mon, 28 Feb 1994 17:56:04 +0100 Message-Id: <9402281656.AA18368=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Postdoc positions at GMD From: poigne@gmd.de (Axel Poigne) Below is an offer for a postdoc position I like to circulate. Axel Poigne Head Research group "Specification of Complex Systems" "System Design Techniques Institute" PS. Following the official advertisement, I sketch some particular areas for which I would like to see applicants, for the benefit of my research group. Of course, evaluation is on the central level but if somebody turns up my group is interested in we will try to ventilate our interest. ====================================== The German National Research Center for Computer Science (GMD) offers 10 Postgraduate Positions. By these positions GMD offers young scientists from all over Europe the opportunity to work on innovative topics on a broad range of subjects. The emphasis is on * Cooperation and Communication * Intelligent Multimedia Systems * Hardware/Software Co-Design * Parallel and Scientific Computing which represent the four major research areas of GMD. Each of the fully paid positions will have a duration of up to two years. A single extension by one additional year is possible. Funding can commence on September 1994. Applications Before May 15, 1994 Applicants must have a Ph.D. (or equivalent) and demonstrate research experience from projects in research institutions, universities or industry. Good knowledge of English or German is required. A statement of research qualification and interest should accompany the application. The applications should include a Curriculum Vitae, copies of university degrees, letters of reference, and publication lists. They should be addressed to GMD Gilbert Kalb Schlo_ Birlinghoven D-53754 Sankt Augustin / Germany For further information please contact Gilbert Kalb by e-mail: kalb@gmd.de, Telefax: ++49-2241-2288 ------------------------------ The GMD SmartCards, telepresence, virtual reality, embedded systems, neural networks, molecular bioinformatics and parallel computing, these relatively new terms point to the state of the art in research and applications in computer science and information technology. They also show the way to their further development. The interplay between computer science and parts of mathematics continually opens new dimensions which will play a key role in private and social life in the future. These are the fields in which the scientists of the German National Research Center for Computer Science (GMD) work. GMD's scientists conduct basic research in mathematics and computer science. The results are used to build prototypical applications designed to test the viability of new ideas, processes and methods. The German National Research Center for Computer Science - Gesellschaft f|r Mathematik und Datenverarbeitung mbH - is an independent, nonprofit, research corporation. GMD was founded in Bonn in 1968. Its shareholders are the Federal Republic of Germany, and the states of North Rhine-Westphalia and Hesse. GMD's funding for 1993 was approximately DM 175 million. Of this total, approximately DM 130 million was provided by the shareholders. The remaining DM 45 million resulted from income generated by domestic and international research and cooperation contracts. GMD has about 1,300 employees. Of these about 800 are engaged in scientific or technical work. The majority work at GMD's headquarters at Sankt Augustin. Additional sites are located at Berlin and Darmstadt. GMD also maintains an office in Tokyo. GMD's primary research concerns are * System design technology, * Communication and cooperation, * Intelligent multimedia systems, * Parallel computing. Research work is planned annually, taking into account long-term research and development programs, and published in a budgetary plan available to the public. GMD publishes a quarterly journal, the GMD-Spiegel, which regularly covers ongoing research. Research conducted by GMD benefits its cooperation partners and end users alike, whether in the public or private sector, or involved in scientific or industrial pursuits. Through GMD they have the opportunity to implement new scientific methods and procedures and thus improve the quality of their products. GMD offers the scientific community services for research and development work and a specially adapted infrastructure tailored to scientific needs, in particular, state-of-the-art communications technology. These services are especially used by scientists working in universities. Many of GMD's scientists are also professors and lecturers at universities and colleges. Their research and development work at GMD enables them to make an important contribution to the teaching of computer science. In this way, GMD functions as a catalyst between the academic world and the producers and users of information technology. GMD is also a member of the European Research Consortium for Informatics and Mathematics, ERCIM, which combines the strength of a number of important European research institutes to further scientific integration in Europe. GMD is a founding member of the European Software Institute, ESI. Through this membership, GMD works with software houses, manufacturers and users of information technology tools. In the United States of America, GMD is closely connected with, and is co-founder of, the International Computer Science Institute in Berkeley. In Japan, GMD is a member of the Real World Computing Partnership, RWC. The RWC Partnership is dedicated to the research of future-oriented computer technology such as massively parallel systems, neural networks, and optical computers. ===================================== About the research group "Specification of Complex System" A rough characterization is given by our standard brochure: 'Research Area The research group focusses on specification and analysis techniques for embedded systems, used, for example, in process control. Such systems, which are typically reactive and real-time constrained consist of software and hardware as well as mechatronic subsystems. Synchronous languages such as Esterel, Lustre and Signal are investigated as tools for the design of embedded systems. We envisage these languages forming the kernel a a future "co-design workbench " which will comprise an integrated set of specification-, construction- and analysis-tools. Research Topics - Co-Design of Reactive Systems The applicability of the synchronous paradigm, and particularly of Esterel, is now being evaluated in experimental designs of reactive real-time systems. Specifically, prediction of timing properties is under investigation for a combination of synchronous and object-oriented language paradigms. The results are the basis for the development of a co-design language intended to support the analysis of timing and data flow. - Analysis of Reactive Systems The aim is to combine testing and verification methods for reactive, real-time systems. Test methods are being developed and evaluated. At the same time, available verification engines are being applied to the same set of examples to learn about the trade-off between testing and verification, focussing on synchronous languages for the time being. The methodological insights will guide the design of an "analysis workbench".' Furthermore, I would like to mention that we currently start to built a uniform framework for the variety of synchronous languages, and that we are particularly interested in persons with a strong background in formal methods related to hardware/software codesign and/or verification of such designs. I am happy to answer any enquieries about the particulars of the research group. --------------------------------- GMD I5 - SKS D - 53754 Sankt Augustin Tel. + 2241 142440 fax. + 2241 142035 Germany email poigne@gmd.de From fritsv@cwi.nl Mon Feb 28 18:57:35 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA27249; Mon, 28 Feb 94 12:00:20 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA06613 (5.65b/CWI-Amsterdam(3.15)); Mon, 28 Feb 1994 17:57:36 +0100 Received: by specht.cwi.nl id AA18373 (5.65b/3.8/CWI-Amsterdam); Mon, 28 Feb 1994 17:57:35 +0100 Date: Mon, 28 Feb 1994 17:57:35 +0100 Message-Id: <9402281657.AA18373=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: BANFF Higher Order Workshop From: fm@sics.se The VIIIth BANFF Higher Order Workshop Logics for Concurrency: Structure vs Automata The Banff Centre, Banff, Alberta, CANADA 27 August --- 3 September 1994 Local Organisation Programme Chair Graham Birtwistle Faron Moller Department of Computer Science Swedish Institute of Computer Science University of Calgary Box 1263 Calgary T2N 1N4 S-164 28 Kista CANADA SWEDEN tel: +1 (403) 220 6055 (work) tel: +46 (8) 752 1500 (work) tel: +1 (403) 241 0627 (home) tel: +46 (18) 50 60 89 (home) fax: +1 (403) 284 4707 fax: +46 (8) 751 7230 net: graham@cpsc.ucalgary.ca net: fm@sics.se This year's BANFF Higher Order Workshop is based on the theme of Logics for Concurrency. It is mainly intended for graduate students and researchers already interested in concurrency theory and/or temporal logics who want a kick start into selected central themes. The workshop will consist of five series of three lectures, presented by the following noted researchers. Samson Abramsky Imperial Interaction Categories E Allen Emerson Austin Automated Temporal Reasoning about Reactive Systems Yoram Hirshfeld Tel Aviv \ Algorithms for Normed Processes Faron Moller Stockholm / Colin Stirling Edinburgh Modal and Temporal Logics for Processes Moshe Y Vardi Houston An Automata-Theoretic Approach to Program Specification and Verification The cost of attendance (for nonspeakers) is $1200 (CAN) which includes full (possibly shared) accommodation and food for the week at the Banff Centre, GST and Alberta taxes, photocopying charges, and a nominal contribution towards getting the speakers there. Any attendee bringing family will only be charged for accommodation and food but the rates are excellent: children under 12 are free and others are charged about $50 per day. The schedule for the workshop allows two talks on each of six mornings, and one talk on each of three evenings. The idea, adopted from previous successful workshops at Banff, is that with everyone in seclusion you can talk to your favourite lecturer at breakfast, go hiking with him in the afternoon, have supper with him in the evening, and then repair to wherever with him for drinks. You thus have ample opportunity to make or reinforce varied personal contacts in the field as well as learn current research thrusts. Notes: * The workshop attendance will be limited to about 35. To avoid disappointment, register your interest with the local organiser (Graham Birtwistle) as soon as possible. * Due to space restrictions at the Banff Centre, some people will have to share rooms. When registering, indicate if there is anyone you would like to share with. * When registering, make your cheque out to "Banff VIII HOW Workshop" and send it to the local organiser (Graham Birtwistle). Payments for any family members should be made directly to the Banff Centre upon leaving. * When registering, let the local organiser know if you have any special diet (eg, vegetarian or kosher), and if you will not be staying for the whole workshop. General Information: * Location: The Banff Centre is a residential continuing education school which sits a few minutes walk from the centre of Banff (125 kilometers west of Calgary). Head for Banff (population 7,000) and ask. The Centre is equipped with excellent conference services and sports facilities such as a swimming pool, tennis courts, running track, gymnasium, and squash courts. * Registration: There will be a reception in the Bourgeau Room at the Banff Centre between 20:00 and 22:00 on Saturday 27 August. This is where you will register and pick up copies of the workshop handouts. * Meals: Three meals are provided each day, which are included in your registration fee: breakfast is at 7:00 in the canteen; a packed lunch will be ready for you to take out at 11:00; and supper is at 18:30 in the canteen. You also get supper on Saturday 27 August and breakfast on Saturday 3 September. * Weather: The weather in Alberta varies enormously, from day to day even. We expect the temperature to be around 20 Celcius, but it will be cool at night (0--10 Celcius) -- it might even be 15 below. It always snows in September, so bring some warm gear. * Getting there: First fly (or otherwise get) to Calgary. You then have 3 options: 1) Rent a car (book in advance) and drive along the Trans Canada Highway west to Banff. Finding the route is easy: drive out from the airport south along Barlow Trail (the only road) for about 10 kilometers and then turn right onto the Trans Canada Highway (Highway 1) going west. Banff is now about 120 km away, 20 km after entering the National Park. You will need a Park permit if you bring a car (around $25). 2) Take a bus to Banff and a short taxi ride from there. There are two bus lines: Brewsters (403 762 2286) which leaves Calgary at 12:20 and 17:15 daily; and Pacific Western Transport (403 762 4458) which leaves at 12:00, 15:00, and 19:00. The fare is around $20 each way and no reservations are necessary. You will need to take a cab or a bus from the airport to the bus depot; enquire at the airport. 3) You are hopelessly poor. Let the local organiser (Graham Birtwistle) know and we will do our best to get you a lift out. In this case remember that the workshop starts with a reception on Saturday evening and the person giving you a lift will want to be in Banff in the afternoon. BANFF VIII 1994 REGISTRATION FORM Email to graham@cpsc.ucalgary.ca or Fax to Graham Birtwistle at (403) 284 4707 I would like to attend this workshop: Name: Affiliation: Address: Telephone: Fax: Net address: Dietary restrictions: None Vegetarian Milk free Kosher Other Flight arrival time: Lift requested to Banff 27 August: Lift requested from Banff 3 September: Interaction Categories Samson Abramsky Imperial College Samson Abramsky is We propose Interaction Categories as a new currently Professor of paradigm for the semantics of computation. In Computing Science and place of the standard paradigm for categories qua Head of the Theory and universes for denotational semantics: Formal Methods Section in the Department of Computing, Imperial Objects: Structured sets College of Science, Technology and Medicine, Morphisms: Structure-preserving functions London. He was previously a Lecturer in Composition: Function composition the Department of Computer Science and Statistics, Queen Mary we propose the Interaction Category paradigm: College, London (1980-83) and a Lecturer and then a Reader in the Objects: Specifications Department of Computing, Imperial College Morphisms: Processes (1983-90). He has a Diploma in Computer Composition: Interaction Science from Cambridge University, and a PhD in Computer Science from Interaction Categories provide a framework for London University. His the unification of a number of hitherto disparate research includes: aspects of programming theory, most notably of Domain theory in logical functional computation with concurrency. form, the lazy lambda Potential applications include: calculus, computational interpretations of * A useful type discipline for concurrent Linear logic, strictness programming, integrated with a analysis for compositional verification methodology. higher-order and polymorphic functions, * Foundations for programming languages proofs as processes, incorporating both concurrency and game semantics and full higher-order polymorphic constructs. abstraction for PCF, and Interaction Categories. We will present a number of concrete examples of His research interests Interaction Categories, covering both synchronous include: programming and asynchronous forms of interaction. We will language semantics and also present the notion of specification logics; concurrency; structure as a framework for combining semantics-based program propositions-as-types with verification, with analysis; Linear Logic; examples of how this framework can be applied to and the integration of a range of behavioural properties of processes, functional and including fairness, liveness properties, and process-based deadlock-freedom. programming paradigms. Automated Temporal Reasoning about Reactive Systems E Allen Emerson University of Texas at Austin E Allen Emerson's There is a pressing need for reliable methods of general research designing correct reactive systems. These systems interests include formal are characterized by ongoing, typically methods, distributed nonterminating and highly nondeterministic computing, real-time behavior. Examples include operating systems, systems, logics of network protocols, and air traffic control programs, and other systems. There is widespread agreement that some applications of logic to type of Temporal Logic, or related formalism, computer science. Areas provides an extremely useful framework for of special interest reasoning about reactive programs. We shall include the complexity focus on (i) Computation Tree Logic (CTL) and its and expressiveness of variants, (ii) the Mu-Calculus, and (iii) tree logical formalisms and automata. automata on infinite objects. He has The "classical" approach to the use of Temporal published a variety of Logic for reasoning about reactive programs is a papers in these areas. manual one, where one is obliged to construct by He received the B.S. hand a proof of program correctness using axioms degree in Mathematics and inference rules in a deductive system. A from the University of desirable aspect of some such proof systems is Texas at Austin, and the that they may be formulated so as to be Ph.D. degree in Applied "compositional", which facilitates development of Mathematics from Harvard a program hand in hand with its proof of University. He serves on correctness by systematically composing together the editorial boards of proofs of constituent subprograms. Even so, several journals manual proof construction can be extremely relating to formal tedious and error prone, due to the large number methods and applied of details that must be attended to. Hence, logic. correct proofs for large programs are often very difficult to construct and to organize in an intellectually manageable fashion. It is not entirely clear that it is realistic to expect manual proof construction to be feasible for large-scale reactive systems. We advocate an alternative, automated approach to reasoning about reactive systems. The basic idea is that certain important questions associated with (propositional) Temporal Logic are decidable: 1. The Model Checking Problem: Given a finite state transition graph M and a Temporal Logic specification formula f, is M a model of f? This is useful in automatic verification of (finite state) reactive programs. 2. The Satisfiability Problem: Given a Temporal Logic specification formula f, does there exist a model M of f? This is useful in automatic synthesis of (finite state) reactive programs. Thus automated program reasoning, in various forms, is possible in principle. The limiting factors are: a. the complexity of the decision procedures; and b. the expressiveness of the logics. We will discuss these factors, their interaction with each other, and their impact on the promise and pitfalls of automated program reasoning. We will sketch known complexity and expressiveness results for a number of representative logics, and discuss key technical tools for obtaining essentially optimal decision procedures. Algorithms for Normed Processes Yoram Hirshfeld Faron Moller Tel Aviv University Swedish Institute of Computer Science (both currently at the University of Edinburgh) Yoram Hirshfeld received The study of process algebras has received a an MSc in Mathematics great deal of attention over the past 15 years, (non-standard analysis) and has merited this attention by providing a from the Hebrew natural framework for describing and analyzing University, Jerusalem in concurrent systems. The goal of such a framework 1969, and a PhD in is to provide techniques for verifying the Mathematical Logic correctness of systems. Typically this (models of arithmetic) verification takes the form of demonstrating the from Yale in 1972. equivalence between two processes expressed in Since then he has been the framework, respectively representing the at Tel Aviv University specification of the system and its where his mathematical implementation. However, any reasonable process areas of research have algebra is expressive enough to permit the been centered on description of any computable function, and the mathematical logic, equivalence problem --- regardless of the notion model theory and of equivalence you consider --- is readily seen non-standard analysis. to be undecidable in general. Hence much Since 1987 his main interest lies in the problem of identifying interests have been with classes of systems --- simple process algebras applications of logic to --- for which the equivalence problem is computer science, decidable. Beyond that, the complexity of such particularly in decision procedures is of concern to the concurrency theory. implementor of proof systems. In these lectures we survey decidability results Faron Moller finished for various notions of equivalence, particularly his PhD thesis in over three classes of processes: regular Edinburgh under Robin (finite-state) processes, context-free processes, Milner's guidance in and basic parallel processes. In particular, we 1988. In his thesis he demonstrate the decidability of bisimulation studied the equivalence over these three classes, using three decomposability of different techniques: for regular processes the concurrent systems and result follows by a brute force search for a its theoretical bisimulation relation over the finite-state applicability. His agents; for context-free processes we use a present interests finite characterisation of infinite bisimulation include the study of relations; and for basic parallel processes we infinite state systems, use a tableau-based decision procedure. We also particularly with a view point out the undecidability of various other of exploiting equivalences including language equivalence for decomposability, as well context-free processes and basic parallel as formalisms for processes. real-time systems and automated proof The latter two classes differ only in the notion systems. of composition which they employ: the first uses a noncommutative sequential composition, whilst the second uses a commutative parallel composition. Regardless of the composition we can define a notion of primality: a process will be prime if it cannot be decomposed into a nontrivial composition of (simpler) processes. In certain subclasses of systems we can derive results concerning the existence and uniqueness of prime decompositions of systems. In particular, in the case of so called normed processes --- those which may at any time follow a terminating path --- we have just such a result. In these cases, we can exploit this property to derive efficient algorithms for deciding bisimilarity between process terms. Modal and Temporal Logics for Processes Colin Stirling University of Edinburgh Colin Stirling has First we introduce concurrent processes as terms researched for some 10 of an algebraic language comprising a few basic years in the theory of operators (as developed by Milner, Hoare and computation, others). Their behaviours are described using particularly in transitions. Families of transitions can be concurrency theory and arranged as labelled graphs, concrete summaries the application of of the behaviour of processes. Various modal and temporal combinations of processes and their resulting logics to this area. behaviour as determined by the transition rules With David Walker he are reviewed. Next a simple modal logic, a introduced the notion slight extension of Hennessy-Milner is introduced of local model for describing the capabilities of processes. checking, using semantic tableaux. He An important discussion is when two processes may has also applied this be deemed, for all practical purposes, to have technique to the same behaviour. Such an abstraction can be decidability results presented by defining an appropriate behavioural for bisimulation equivalence between processes. A more abstract equivalence. approach is to consider equivalence in terms of having the same pertinent properties. Some time will be spent on describing bisimulation equivalence as the discriminating power of the modal logic is tied to it: two equivalent processes have precisely the same modal properties and two non-equivalent image-finite processes do not. We will present this equivalence initially in terms of games. More generally practitioners have found it useful to be able to express temporal properties of concurrent systems. A logic expressing temporal notions provides a framework for the precise formalization of such specifications. Formulas of the modal logic are not rich enough to express such temporal properties. So an extra operator, a fixed point operator, is added. The result is a very expressive temporal logic, (a slight extension of) the modal mu-calculus. The modal and temporal logics provide a repository of useful properties. However it is also very important to be able to verify that an agent has or lacks a particular property. We present sound and complete tableaux proof systems for proving temporal properties of processes with finite or infinite state spaces. This proof system extends local model checking techniques: we use games to underpin these techniques. The tableau proof system is data independent and therefore generalizes standard methods commonly used in program logics such as Hoare or dynamic logics. The proof method is illustrated on examples. An Automata-Theoretic Approach to Program Specification and Verification Moshe Y Vardi Rice University Moshe Y Vardi is a Noah The automata-theoretic approach uses automata as Harding Professor and a unifying paradigm for program specification and Chair of Computer verification. Both programs and specification Science at Rice languages are in essence descriptions of University. His computations. These computation can be viewed as research interests words or trees over some alphabet. Thus, include data-base programs and specifications can be viewed as theory, finite-model descriptions of word or tree languages. The theory, automata-theoretic perspective considers the knowledge-theory, and relationships between programs and their program specification specifications as relationships between and verification. languages. By translating programs and Before joining Rice specification to automata, questions about University in 1993, he programs and their specifications can be reduced was a department manager to questions about automata. More specifically, at the IBM Almaden questions such as satisfiability of Research Center. Vardi specifications and correctness of programs with is the recipient of 3 respect to their specifications, can be reduced IBM Outstanding to questions such as nonemptiness and containment Innovation Awards. He of automata. was the program chair of the 6th ACM Symposium on Unlike classical automata theory, which focused the Principles of on automata on finite words, the application to Database Systems (1987), program specification and verification uses the 2nd Conference on automata on infinite words or trees, since the Theoretical Aspects of computations in which we are interested are Reasoning about typically infinite and we often want to consider Knowledge (1988), and their branching structures. These lectures will the 8th IEEE Symposium provide an introduction to the theory of automata on Logic in Computer on infinite structures and demonstrate its Science (1993). He is application to program specification and currently an editor of verification. Information and Computation and the Journal of Computer and System Sciences. From fritsv@cwi.nl Wed Mar 2 11:12:05 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA23351; Wed, 02 Mar 94 04:14:35 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA16479 (5.65b/CWI-Amsterdam(3.15)); Wed, 2 Mar 1994 10:12:05 +0100 Received: by specht.cwi.nl id AA20624 (5.65b/3.8/CWI-Amsterdam); Wed, 2 Mar 1994 10:12:05 +0100 Date: Wed, 2 Mar 1994 10:12:05 +0100 Message-Id: <9403020912.AA20624=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: ICLP'94 Call for Attendance From: fosca@orione.cnuce.cnr.it (Fosca Giannotti) Call For Attendance INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING (ICLP'94) S. Margherita Ligure, Italy, 13-18 June 1994 Sponsored by the Association of Logic Programming and the Prolog Vendors Group ICLP'94 is the eleventh international conference on logic programming. The technical program for the conference will include tutorials, invited lectures and presentations of refereed papers and posters on: Applications Language design Architecture Natural language Artificial Intelligence Parallelism Concurrency Programming methodology Constraints Proof theory Databases Semantics and foundations Environments Static analysis Higher-order programming Theorem proving Implementation Types A series of workshops will be organized during the conference on the following topics: W1) Process-based Parallel Logic Programming W2) Verification and analysis of (concurrent) logic languages W3) Logic and Reasoning with Neural Networks W4) Sixth Workshop on Logic Programming Environments W5) Non-monotonic Extensions of Logic Programming W6) Parallel and Data-Parallel Execution of Declarative Languages W7) Applications of Logic Programming to Software Engineering W8) Integration fo Declarative Paradigms W9) Second ICLP Workshop on Deductive Databases W10) Proof-Theoretical Extensions of Logic Programming W11) Logic Programming and Education W12) Legal Applications of Logic Programming ___________________________Organization_________________________________________ The 11th International Conference on Logic Programming - ICLP'94 is organized by DISI (University of Genova), DIST (University of Genova) and IMA-CNR and sponsoredby the Association of Logic Programming and the Prolog Vendors Group. __________________________Time and place___________________________________ The conference will be held from Monday 13 June to Thursday 16 June, 1994, in Santa Margherita Ligure, Italy, at the Hotel Miramare. The post-conference Workshops will be held on Friday 17 and Saturday 18 at the same place. Conference Secretariat Piera Ponta Consorzio Genova Ricerche Via dell'Acciaio, 139 16152 Genova (Italy) Telephone 39-10-6514000 Telefax 39-10-6512981 e-mail: ponta@infmge.ge.infn.it ___________________________Registration fees_________________________________ Registration forms must be completed and returned to the Conference Secretariat before May 15, 1994. The registration fees are (in US $): before after May 15, 1994 May 15, 1994 ALP Members (*) 400 470 Non-Members (**) 430 500 Students (***) 145 170 Workshops ICLP'94 participants non participants 1/2 day 25 65 full day 40 80 The registration fee for participants includes attendance to the conference, coffee and tea during breaks, the social dinner, as well as a copy of the proceedings. The student fee does not include the social dinner. (*) All members of ALP are eligible for the discount of the registration fee. Members must include the membership/organization number in order to receive the discount. (**) People who want to join or renew their membership to ALP or GULP for 1994/1995 must tick the appropriate space in the registration form and pay the Non-Members fee. Recall that GULP is affiliated to ALP, and so GULP members are also ALP members. (***) All students must submit proof of student status by enclosing a photocopy of the student identification or a letter from the advisor. The amount due for participation in the conference and in the social programme can be paid (in US dollars) as follows: - by cheque made payable to Consorzio Genova Ricerche, Via dell'Acciaio 139, 16152 Genova,Italy) - by money transfer to Consorzio Genova Ricerche, current account n. 21503/20 Banca CARIGE Ag. 21 Genova, Italy - by cash Credit cards cannot be accepted Please make sure that your payment includes any banking or other fees, so that we receive the correct amount. A confirmation of registration, hotel accommodation and payment will be sent to you immediately. ________________________________Cancellations______________________________ For cancellations communicated (in writing) to the conference secretariat before June 4, 1994, all fees will be refunded minus a 15% deduction. _______________________________Hotel accommodation__________________________ All hotels reserved for the conference are located within walking distance from the Hotel Miramare. Hotels at the following rates (in Italian Lire) have been reserved for ICLP participants: single room double room **** 120.000/180.000 200.000/280.000 *** 70.000/90.000 110.000/140.000 ** 55.000/75.000 90.000/120.000 Please indicate your preference in the attached hotel accomodation form. Because of limited availability, please send your accomodation form by fax to the Conference Secretariat no later than April 15, 1994. Every effort will be made to meet participants' preferences on a first-come/first-served basis. Confirmation of the reservation with all details on the hotel and its location will be given immediately after receival of the hotel accommodation form. For an accommodation different from those proposed, please contact the Conference Secretariat. N.B. The deadline for accommodation is anticipated with respect to the deadline for registration because of the limited availability of rooms in S. Margherita. Hotel accommodation will be considered as definitely confirmed only after receival (by May 15, 1994) of the registration form. Should the hotel accommodation form not be followed by any confirmation of participation, the hotel reservation will be cancelled. @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ @ @ @ REGISTRATION FORM @ @ @ @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ Please complete (block letters) and return to the Conference Secretariat by May 15, 1994, to pay a reduced fee. Surname ________________________________________________________________________ First name ______________________________________________________________________ Affiliation _______________________________________________________________________ Full address ________________________________________________________________________ _________________________________________________________________________ Telephone ________________________ Fax________________________________ e-mail ______________________________________ Name/s of the accompanying person/s participating in the conference: _______________________________________________________________________ _______________________________________________________________________ _______________________________________________________________________ __ I am not sure of my plans but I wish to receive next circular __ I will participate in the conference and/or in ___ Workshop n. _____ __ I wish to join ALP __ __ I wish to join GULP__ Please find enclosed: ___Copy of the money tranfer ___Cheque ___I will pay at the conference @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ @ @ @ HOTEL ACCOMMODATION FORM @ @ @ @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ Please complete (block letters) and return to the Conference Secretariat by April 15, 1994. After this date hotel accommodation cannot be guaranteed. Name __________________________________________________________________ Telephone ______________________ Fax ____________________________ Please reserve for me: n. ....... single room/s n. ....... double room/s to be shared with ............................................................... in the following hotel **** (single n. ____ double n. ____) *** (single n. ____ double n. ____) ** (single n. ____ double n. ____) arrival on ____________________________ departure on ___________________________ date __________________________________ signature _____________________________ From fritsv@cwi.nl Fri Mar 4 09:12:14 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA15778; Fri, 04 Mar 94 02:14:45 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id AA09073 (5.65b/CWI-Amsterdam(3.15)); Fri, 4 Mar 1994 08:12:15 +0100 Received: by specht.cwi.nl id AA23730 (5.65b/3.8/CWI-Amsterdam); Fri, 4 Mar 1994 08:12:14 +0100 Date: Fri, 4 Mar 1994 08:12:14 +0100 Message-Id: <9403040712.AA23730=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Jobs in Xerox Corporate Research in Rochester, New York From: Vijay Saraswat Please forward this announcement on to people who may be interested. Respondents should send me their resume; I will forward it on to Greg. The team being assembled will collaborate with our group here at PARC on machine control software, including the development of model-based computing techniques. Vijay --------------- The Research & Technology Integration group within Xerox has 3 openings for exceptional individuals with interest and experience in the domain of embedded, real-time machine control software. These people will work within a growing Research and Technology Integration team, in direct participation with product development teams in Rochester NY, and in close collaboration with the Scientific and Engineering Reasoning research group in the Xerox Palo Alto Research Center [PARC]. These groups will work collaboratively to evolve a cross-product architecture for machine control that will, within the context of current and future product development activities, enable dramatic productivity and product improvements through commonality, reuse, and rapid development and integration of new technologies and methodologies. We are looking to hire people who, as a combined team: - bring a leadership perspective to individual contributor work, - possess very good inter-personal skills, - are very strong in software architecture and in object-oriented, real-time software development and methodologies, - have demonstrated mastery of the C++ language, - have experience in achieving software reuse in product development contexts, - possess a strong software engineering background, with applied experience in implementing software development processes and utilizing software metrics, - have experience through the full software development life cycle in a product development context, and - bring experience to the task of developing a conceptual analysis of the domain of embedded, reactive, real-time machine control software (in the area of reprographics systems, such as digital color copiers and printers). The PARC collaborators bring to the project, among other things, rigorous techniques for representing and reasoning about real-time systems that arise from their work in combining constraint languages with synchronous programming languages. The overall team is expected to contain a skill-base that can synergistically integrate and build on these techniques and methodologies for model-based software development. These jobs are located in Rochester, New York. The positions are currently open and we are looking to fill them immediately. Candidates should have an MS, PhD, or equivalent experience in Computer Science (preferred) or related discipline. To apply, send resume and any additional information to: Gregg Bonikowski Manager, Software Engineering & Technology Applications 1350 Jefferson Road, MS 801-27C Henrietta, NY 14623 email: gregg@eso.mc.xerox.com Xerox is an affirmative action, equal opportunity employer. From fritsv@cwi.nl Mon Mar 7 11:08:50 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA20493; Mon, 07 Mar 94 04:11:26 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Mon, 7 Mar 1994 10:08:51 +0100 Received: by specht.cwi.nl id AA27490 (5.65b/3.8/CWI-Amsterdam); Mon, 7 Mar 1994 10:08:50 +0100 Date: Mon, 7 Mar 1994 10:08:50 +0100 Message-Id: <9403070908.AA27490=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: summer interships at IBM From: "J.R.Rao" Summer Internships for CS Graduate Students Distributed Systems Software Technology IBM Thomas J Watson Research Yorktown Heights, New York The Distributed Systems Software Technology group at IBM Research is actively involved in the design and implementation of a family of programming languages (called the Concert family of languages) that are appropriate for distributed programming in a heterogeneous network. Specifically, the group has designed and developed Concert/C: language extensions to ANSI C to enable the programming of distributed applications. The Concert/C compiler and runtime are currently being tested and used by several research groups in industry and academia. Additionally, we are building a graphical network-wide desktop, which allows object-oriented applications to be connected together, packaged, and sent around a network using a small number of graphical primitives. We are committed to disseminating our results both by publishing papers and by releasing meaningful prototypes. Each summer the group hosts a few outstanding graduate students; our summer students are considered to be colleagues and work in close cooperation with the members of the group. This summer we are looking for students who have a demonstrated interest in: programming languages and/or distributed systems and/or graphical programming. To be considered for a position, please send your resume, a succinct cover letter explaining your areas of interest, and the names and email addresses of three references to: Josyula R. Rao jrrao@watson.ibm.com IBM Thomas J. Watson Research Center P.O. Box 704, H1-A07 Yorktown Heights, NY 10598 (914) 784-6692 From fritsv@cwi.nl Mon Mar 7 11:15:24 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA20545; Mon, 07 Mar 94 04:18:00 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Mon, 7 Mar 1994 10:15:25 +0100 Received: by specht.cwi.nl id AA27501 (5.65b/3.8/CWI-Amsterdam); Mon, 7 Mar 1994 10:15:24 +0100 Date: Mon, 7 Mar 1994 10:15:24 +0100 Message-Id: <9403070915.AA27501=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: FORMAL METHODS TEACHING WORKSHOP From: Douglas R. Troeger TEACHING FORMAL METHODS CURRICULUM DEVELOPMENT WORKSHOP SECOND ANNOUNCEMENT Hamilton College Clinton, N.Y. July 30 - Aug 5, 1994 sponsored by The National Science Foundation THE PURPOSE OF THE WORKSHOP is to develop modules and materials for teaching formal methods in an undergraduate setting. Participants will be asked to submit a module or position paper which they have developed. While the particular form and length of the module is left unspecified, modules should contain both expository material and exercises or labs. TOPICS for the modules may include(but are not limited to) -- Propositional/ Predicate Calculus , with applications to assertions/pre- and post-conditions -- Loops and Invariants -- Category Theory -- Algorithm Design -- Hardware Specification/Design/Verification -- Parallel Constructs (eg. CSP, Hoare semantics) -- Operational Semantics -- Formal Methods with OOP -- Applications of Mathematica THE WORKSHOP itself will be devoted to the presentation, discussion and revision of participant modules. We also anticipate inviting several keynote speakers. After the workshop, participants will be asked to submit full revised versions of their modules for incorporation into a collection for dissemination to computer science educators. Three of the principal investigators for the project, Philip Mulry (Colgate University), Doug Troeger(CUNY) and Henry Walker(Grinnell College), will be responsible for editing the collection of materials with a view towards publication in the near future. We plan to have a followup workshop in the summer of 1995, in conjunction with the working group in Object Oriented Computing, to evaluate the results to date and further disseminate the materials developed. Participants will be encouraged to use draft versions of the modules in their teaching for evaluation. AN NSF GRANT will partially cover travel, room and board costs for the workshop. Participants will receive a stipend of $150 for their participation in the workshop and an additional $150 after submission of their revised module. THERE MAY BE LIMITED FUNDS to support attendance by individuals who want to become involved with the project but do not have a module to submit at this time. Please write to inquire. TO APPLY: Send an abstract of your module or position paper and a brief resume including your experience with formal methods to: Philip Mulry Formal Methods Workshop Computer Science Department Colgate University 13 Oak Drive Hamilton, New York 13346 email:fmworkshop@cs.colgate.edu ABSTRACTS should be no more than 5 pages in length, be clearly written, and provide sufficient detail to allow the program committee to assess the merits of the module. The preferred mode of submission is via email. The preferred abstract format is latex. Submission of abstracts should be received by March 20, 1994 by the program chair. This is a firm deadline, late submissions will not be considered. Participants will be notified of acceptance by April 1, 1994. Accepted modules (in a specified format) will be due July 1, 1994. A final revised module will be due November 1, 1994. DATES: Abstract Submission Deadline: March 20, 1994 Participation Notification: April 1, 1994 Draft Module Due: July 1, 1994 Conference: July 30 - August 5, 1994 Revised Module Due: November 1, 1994 FOR FURTHER INFORMATION, contact the Workshop Co-chairs: Philip Mulry: phil@cs.colgate.edu Doug Troeger: dtroeger@csfaculty.engr.ccny.cuny.edu Henry Walker: walker@ac.grin.edu From fritsv@cwi.nl Wed Mar 9 19:00:08 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA24649; Wed, 09 Mar 94 12:03:00 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Wed, 9 Mar 1994 18:00:11 +0100 Received: by specht.cwi.nl id AA02674 (5.65b/3.8/CWI-Amsterdam); Wed, 9 Mar 1994 18:00:08 +0100 Date: Wed, 9 Mar 1994 18:00:08 +0100 Message-Id: <9403091700.AA02674=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Visiting Position in Uppsala From: Bengt Jonsson VISITING RESEARCH POSITION at the UNIVERSITY of UPPSALA, Sweden The department of Computer Systems at Uppsala University offers a position as visiting researcher starting in Autumn 1994. Uppsala is located 70 km north of Stockholm. The departments of computer systems, computing science, mathematics, numerical analysis, and automatic control, have been located together on a newly renovated campus. Research at the department of Computer Systems is focussed on - formal methods and tools for design and analysis of distributed systems, real-time systems, and hardware circuits. We have been active in the areas of automatic verification, process algebra, timing analysis, semantics, and transformational program development. - implementation support for the development of real-time systems. (work is conducted in an Ada-based programming environment) - Neural networks (applications of networks for decision support in telecommunication networks, and hardware implementation of neural networks) - techniques for efficient implementation of communication protocol software Researchers at the department inlude Parosh Abdulla, Lars Asplund, Ivan Christoff, Linda Christoff, Hans Hansson, Bengt Jonsson, Joachim Parrow(20%), Wang Yi, and a number of Ph.D. students. We participate in ESPRIT collaboration projects and working groups. The neighbouring department of Computing Science is conducting research in the area of logic programming. The position is intended for one (possibly two) years. We seek an applicant with a PhD and a research record in area(s) that are relevant to the research at the department. Areas that would be welcome are: - Formal program development and semantics for distributed and real-time systems - Real-time systems - Neural networks Interested? Please send CV and state your interests and requirements by e-mail, fax or physical mail. Bengt Jonsson Uppsala University Dept of Computer Systems Box 325 S - 751 05 Uppsala, Sweden, fax: +46 - 18 - 55 02 25 e-mail: bengt@docs.uu.se From fritsv@cwi.nl Sun Mar 13 10:13:02 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA06327; Sun, 13 Mar 94 03:15:48 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Sun, 13 Mar 1994 09:13:04 +0100 Received: by specht.cwi.nl id AA07903 (5.65b/3.8/CWI-Amsterdam); Sun, 13 Mar 1994 09:13:02 +0100 Date: Sun, 13 Mar 1994 09:13:02 +0100 Message-Id: <9403130813.AA07903=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: CCL94: Last Call From: Helene Kirchner Do not miss the deadline of CCL'94 Conference! ************************** Friday March 25, 1994 ************************** It may happen that you receive several times this e-mail: I sincerely apologize for this inconvenience. Helene Kirchner ----------------------------------------------------------------------- CALL FOR PAPERS 1st International Conference on CONSTRAINTS IN COMPUTATIONAL LOGICS September 7--9, 1994, Munich, Germany Constraints in Computational Logics (CCL) is a new conference sponsored by the ESPRIT WORKING GROUP ``Construction of Computational Logics''. The past two decades have seen a proliferation of different programming styles: functional, logical, constraint based, object-oriented, among others. More recently, it has been recognized that these styles complement rather than exclude each others by being suitable for particular problem domains. As a consequence, combining programming paradigms has emerged as a significant research direction of its own, and constraints have often been used as a glue for these combinations. CCL aims to attract high quality original papers covering theoretical and practical issues in this direction of combining and extending programming paradigms preferably (but not exclusively) by using constraints. Suggested, but not exclusive, topics of interest include: symbolic constraints, set constraints, numerical constraints, constraints for knowledge representation and processing, use of constraints for type checking and program analysis, multi-paradigm programming, abstract properties of combined calculi, combinations of computational logics, constraints in rewriting, deduction, and symbolic computations, working systems. CCL'94 will invite 5 lecturers, Max Dauchet (Symbolic constraints and tree automata), Dexter Kozen (Set constraints and logic programming), Helmut Simonis (Applications of constraint logic programming), Gert Smolka (Concurrent constraint programming), and Wayne Snyder (Constraints in automated deduction). PAPER SUBMISSION: 5 hard copies of a full paper and 16 additional copies of the cover page and second page should be received by March 25, 1994 by the program chair. This is a FIRM deadline: late submissions will not be considered. Authors without access to duplication facilities may submit a single copy of each. Authors will be notified of acceptance by May 10, 1994. Accepted papers (16 pages in the LNCS format) will be due June 17, 1994. The cover page of the submission should include the title, the abstract, and for all authors, the name, address, phone number, fax number, and e-mail when available. Each submission must include as the second page a clear statement of the issues, a summary of the main results, and an explanation of their significance and relevance to the conference, all phrased for the non-specialist. Technical developments, directed to the specialist, should follow starting on the third page. The whole paper should not exceed 16 pages in LNCS LaTeX Format. Papers must be in English, clearly written, and provide sufficient explanations to allow the program committee to assess the merits of the paper. References and comparisons with related work should be included. Proofs, if omitted in the paper, must appear in an additional appendix for which there is no space limit. Submissions departing significantly from these guidelines run a high risk of rejection. The results in the abstract must be unpublished, and not submitted for publication elsewhere, including other refereed conferences. 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. People planning to attend CCL are kindly requested to send a note as early as possible to the conference chair in order to help estimate the facilities needed for the conference. For further announcements, contact the publicity chair. LOCATION: Technical University Munich CONFERENCE CHAIR: Tobias Nipkow Institut fuer Informatik Technische Universitaet Muenchen D-80290 Muenchen GERMANY E-mail: ccl@informatik.tu-muenchen.de Phone:(49) 89 2105 2690 Fax: (49) 89 2105 8183 PUBLICITY CHAIR: Helene Kirchner CRIN-CNRS et INRIA-Lorraine BP 239 54506 Vandoeuvre-les-Nancy Cedex FRANCE E-mail: Helene.Kirchner@loria.fr Phone:(33) 83593012 Fax: (33) 83278319 PROGRAM CHAIR: Jean-Pierre Jouannaud LRI, Bat. 490 CNRS et Universite de Paris-Sud 91405 Orsay Cedex FRANCE E-mail: ccl@lri.fr Phone: (33) 1-69416905 Fax: (33) 1-69416586 PROGRAM COMMITTEE: A. Aiba, A. Colmerauer, M. Dincbas, H. Ganzinger, S. Haridi, V. Hentenryck, J. Jaffar, J.-P. Jouannaud, C. Kirchner, D. Miller, U. Montanari, F. Orejas, L. Pacholski, F. Pfenning, M. Rodriguez, K. Schulz, M.Wallace. DEADLINES: Submissions: March 25, 1994 Notification: May 10, 1994 Paper due: June 17, 1994 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % CALL FOR PAPERS CCL'94 (LaTeX File) % % % %%%%%%%%%%%%%%%% Cut here %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \documentstyle{article} \topmargin-0.75in \marginparwidth 0pt \oddsidemargin 0pt \evensidemargin 0pt \marginparsep 0pt \textwidth 6.5in \textheight 10.0in\parskip 6pt \parindent 0pt \renewcommand{\i}[1]{{\it #1 \/}} \begin{document} \thispagestyle{empty} \begin{center} {\bf CALL FOR PAPERS}\\[2ex] {\large 1st International Conference on }\\[2ex] {\Large\bf CONSTRAINTS IN COMPUTATIONAL LOGICS}\\[2ex] {\large\it September 7--9, 1994, Munich, Germany} \end{center} \vspace{.2in} \small \begin{minipage}[t]{2.10in}% first column \parskip 4pt {\bf Location:} \\[1mm] Technical University Munich\\ {\bf Conference Chair:} \\[1mm] Tobias Nipkow\\ Institut f\"ur Informatik\\ Technische Universit\"at M\"unchen\\ D-80290 M\"unchen\\ GERMANY\\ {\tt ccl@informatik.tu-muenchen.de}\\ Phone:(49) 89 2105 2690 \\ Fax: (49) 89 2105 8183 \\ {\bf Publicity Chair:} \\[1mm] H\'el\`ene Kirchner\\ CRIN-CNRS et INRIA-Lorraine\\ BP 239\\ 54506 Vand{\oe}uvre-les-Nancy Cedex\\ FRANCE\\ {\tt Helene.Kirchner@loria.fr} \\ Phone:(33) 83593012\\ Fax: (33) 83278319\\ {\bf Program Chair:} \\[1mm] Jean-Pierre Jouannaud\\ LRI, B\^at. 490\\ CNRS et Universit\'e de Paris-Sud\\ 91405 Orsay Cedex\\ FRANCE\\ {\tt ccl@lri.fr} \\ Phone: (33) 1-69416905\\ Fax: (33) 1-69416586 \\ {\bf Program Committee:}\\[1mm] A.~Aiba, A.~Colmerauer, M.~Dinc\-bas, H.~Ganzinger, S.~Haridi, P.~Van Hentenryck, J.~Jaffar, J.-P.~Jouan\-naud, C.~Kirchner, D.~Miller, U.~Montanari, F.~Orejas, L.~Pacholski, F.~Pfenning, M.~Rodri\-guez, K.~Schulz, M.~Wallace.\\ {\bf Deadlines:}\\[1mm] Submissions: March 25, 1994\\ Notification: May 10, 1994\\ Paper due: June 17, 1994 \end{minipage} \hskip .25 in \begin{minipage}[t]{4.5in}% second column \parskip 4pt Constraints in Computational Logics (CCL) is a new conference sponsored by the ESPRIT WORKING GROUP ``Construction of Computational Logics''. The past two decades have seen a proliferation of different programming styles: functional, logical, constraints based, object-oriented, among others. More recently, it has been recognized that these styles complement rather than exclude each others by being suitable for particular problem domains. As a consequence, combining programming paradigms has emerged as a significant research direction of its own, and constraints have often been used as a glue for these combinations. CCL aims to attract high quality original papers covering theoretical and practical issues in this direction of combining and extending programming paradigms preferably (but not exclusively) by using constraints. Suggested, but not exclusive, topics of interest include: symbolic constraints, set constraints, numerical constraints, constraints for knowledge representation and processing, use of constraints for type checking and program analysis, multi-paradigm programming, abstract properties of combined calculi, combinations of computational logics, constraints in rewriting, deduction, and symbolic computations, working systems. CCL'94 will invite 5 lecturers, Max Dauchet (Symbolic constraints and tree automata), Dexter Kozen (Set constraints and logic programming), Helmut Simonis (Applications of constraint logic programming), Gert Smolka (Concurrent constraint programming), and Wayne Snyder (Constraints in automated deduction). {\bf Paper submission}: 5 hard copies of a full paper and 16 additional copies of the cover page and second page should be {\bf received} by {\bf March 25, 1994} by the {\bf program chair}. {\sl This is a FIRM deadline: late submissions will not be considered.} Authors without access to duplication facilities may submit a single copy of each. Authors will be notified of acceptance by May 10, 1994. Accepted papers (16 pages in the LNCS format) will be due June 17, 1994. The cover page of the submission should include the title, the abstract, and for all authors, the name, address, phone number, fax number, and e-mail when available. Each submission must include as the second page a clear statement of the issues, a summary of the main results, and an explanation of their significance and relevance to the conference, all phrased for the non-specialist. Technical developments, directed to the specialist, should follow starting on the third page. The whole paper should not exceed 16 pages in LNCS LaTeX Format. Papers must be in English, clearly written, and provide sufficient explanations to allow the program committee to assess the merits of the paper. References and comparisons with related work should be included. Proofs, if omitted in the paper, must appear in an additional appendix for which there is no space limit. Submissions departing significantly from these guidelines run a high risk of rejection. The results in the abstract must be unpublished, and not submitted for publication elsewhere, including other refereed conferences. 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. People planning to attend CCL are kindly requested to send a note as early as possible to the {\bf conference chair} in order to help estimate the facilities needed for the conference. For further announcements, contact the {\bf publicity chair}. \end{minipage} \end{document} From fritsv@cwi.nl Wed Mar 16 14:03:57 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA19555; Wed, 16 Mar 94 10:55:09 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Wed, 16 Mar 1994 13:03:59 +0100 Received: by specht.cwi.nl id AA12578 (5.65b/3.8/CWI-Amsterdam); Wed, 16 Mar 1994 13:03:57 +0100 Date: Wed, 16 Mar 1994 13:03:57 +0100 Message-Id: <9403161203.AA12578=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Bisimulation Workshop From: alban@fwi.uva.nl (Alban Ponse) WORKSHOP "THREE DAYS OF BISIMULATION" Date: April 20 - 22, 1994 Place: CWI (Center for Mathematics and Computer Science) Kruislaan 413, Amsterdam Research in theoretical computer science has seen the emergence of both modal logics and process algebras as formalisms to describe processes. These approaches share a focus on Labeled Transition Systems as important structures for modeling computation. The workshop aims to bring together a group of leading researchers in these areas in order to compare both approaches and stimulate cross-fertilization. The focus of the workshop will be on the notion of bisimulation, this being a central tool in comparing labeled transition systems. The workshop is organized under the auspices of the Dutch National Organization for Scientific Research (NWO) Project NF 102/62-356 "Structural and Semantic Parallels between Natural Languages and Programming Languages". CONTRIBUTIONS: There will be four kinds of contributions: * tutorials on modal logic, process algebra and their connections * research talks on modal logic * research talks on process algebra * research talks on connecting and connected fields SPEAKERS: The following people will contribute to the workshop by giving a research talk or tutorial: H. Andreka & I. Nemeti M. Hennessy J.A. Bergstra I. Hodkinson D. Caucal J.W. Klop J. van Eijck M. de Rijke T. Fernando J. Rutten R. Goldblatt S. Smolka J.F. Groote C. Stirling A. Visser REGISTRATION: To stimulate fruitful interaction the number of participants will be limited. If you are interested in attending the workshop, please register by sending an e-mail message to bisim3@cwi.nl before April 1. The registration fee will be Dfl 100,-, to be paid in cash upon arrival at the workshop; this fee covers coffee, lunches and copies of the material that will be presented at the workshop. --------------------------------- | | | Deadline for registration: | | | | April 1, 1994 | | | --------------------------------- ORGANIZERS: Alban Ponse alban@fwi.uva.nl Maarten de Rijke mdr@cwi.nl Yde Venema yde@phil.ruu.nl From fritsv@cwi.nl Thu Mar 17 09:24:21 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA26636; Thu, 17 Mar 94 02:27:11 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Thu, 17 Mar 1994 08:24:22 +0100 Received: by specht.cwi.nl id AA13654 (5.65b/3.8/CWI-Amsterdam); Thu, 17 Mar 1994 08:24:21 +0100 Date: Thu, 17 Mar 1994 08:24:21 +0100 Message-Id: <9403170724.AA13654=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Postdoctoral position From: Tom Henzinger Please forward this message to anybody who may be interested: A postdoctoral position for the academic year 1994-95 is available at Cornell University in the Department of Computer Science. The position is for research on the computer-aided verification of concurrent, real-time, and hybrid systems. Requirements are a strong background in concurrency theory and significant systems building experience. Applicants should send a vita and have three letters of reference to be sent to Tom Henzinger Assistant Professor Computer Science Department Cornell University Ithaca, NY 14853 tah@cs.cornell.edu From fritsv@cwi.nl Thu Mar 17 09:28:09 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA26647; Thu, 17 Mar 94 02:30:55 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Thu, 17 Mar 1994 08:28:11 +0100 Received: by specht.cwi.nl id AA13665 (5.65b/3.8/CWI-Amsterdam); Thu, 17 Mar 1994 08:28:09 +0100 Date: Thu, 17 Mar 1994 08:28:09 +0100 Message-Id: <9403170728.AA13665=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Automatic verification tools From: Tom Henzinger I am teaching a graduate course on computer-aided verification (automata-based, temporal-logic-based, and process-algebra-based methods) and I would like to compile a list of verification tools that are publically available for course use (say, for course projects). If your system(s) fall(s) into this category, please let me know how one could obtain (ftp?) the software and the necessary documentation. Any pointers to systems that I may not be aware of would be helpful, too. Thanks, Tom Henzinger From fritsv@cwi.nl Thu Mar 17 18:38:55 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA04146; Thu, 17 Mar 94 11:41:45 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Thu, 17 Mar 1994 17:38:55 +0100 Received: by specht.cwi.nl id AA14489 (5.65b/3.8/CWI-Amsterdam); Thu, 17 Mar 1994 17:38:55 +0100 Date: Thu, 17 Mar 1994 17:38:55 +0100 Message-Id: <9403171638.AA14489=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Technical report available by ftp or WWW From: alanje@cogs.susx.ac.uk (Alan Jeffrey) A technical report: A complete axiomatization of timed bisimulation for a class of regular timed behaviours Luca Aceto and Alan Jeffrey is available by anonymous ftp from ftp.cogs.susx.ac.uk in pub/reports/compsci/cs0494.ps.Z. If you have access to the World Wide Web (for example using Mosaic) and would like to browse an index of COGS reports, the COGS home page is http://www.cogs.susx.ac.uk/ from which you can select the `list of technical reports'. Alan. Alan Jeffrey Tel: +44 273 606755 x 3238 alanje@cogs.susx.ac.uk School of Cognitive and Computing Sciences, Sussex Univ., Brighton BN1 9QH, UK From fritsv@cwi.nl Fri Mar 18 15:59:20 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA15157; Fri, 18 Mar 94 09:02:10 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Fri, 18 Mar 1994 14:59:20 +0100 Received: by specht.cwi.nl id AA15887 (5.65b/3.8/CWI-Amsterdam); Fri, 18 Mar 1994 14:59:20 +0100 Date: Fri, 18 Mar 1994 14:59:20 +0100 Message-Id: <9403181359.AA15887=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Bekic's indexed sets: any full presentations or follow-ups? From: Andrew Moran I've just recently come across work that Hans Bekic did in the early 80s. Indexed sets were his attempt to solve the problem of modelling non-determinism and/or concurrency without the use of powerdomain constructions. I have one paper that presents an example of the use of indexed sets, and two papers that are transcriptions of slides from talks that he gave on the subject (they are all in LNCS 177, opi 60, 61, 62). These are by no means detailed, and sadly Bekic died before he could finish a full paper on indexed sets. I'm interested in finding out if there are any full presentations or if anyone has followed up on his ideas. Cheers, Andy From fritsv@cwi.nl Fri Mar 18 15:59:20 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA15542; Fri, 18 Mar 94 10:03:19 EST Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Fri, 18 Mar 1994 14:59:20 +0100 Received: by specht.cwi.nl id AA15887 (5.65b/3.8/CWI-Amsterdam); Fri, 18 Mar 1994 14:59:20 +0100 Date: Fri, 18 Mar 1994 14:59:20 +0100 Message-Id: <9403181359.AA15887=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Bekic's indexed sets: any full presentations or follow-ups? From: Andrew Moran I've just recently come across work that Hans Bekic did in the early 80s. Indexed sets were his attempt to solve the problem of modelling non-determinism and/or concurrency without the use of powerdomain constructions. I have one paper that presents an example of the use of indexed sets, and two papers that are transcriptions of slides from talks that he gave on the subject (they are all in LNCS 177, opi 60, 61, 62). These are by no means detailed, and sadly Bekic died before he could finish a full paper on indexed sets. I'm interested in finding out if there are any full presentations or if anyone has followed up on his ideas. Cheers, Andy From fritsv@cwi.nl Thu Apr 7 13:31:29 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA18260; Thu, 07 Apr 94 05:34:29 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Thu, 7 Apr 1994 11:31:30 +0200 Received: by specht.cwi.nl id AA02433 (5.65b/3.8/CWI-Amsterdam); Thu, 7 Apr 1994 11:31:29 +0200 Date: Thu, 7 Apr 1994 11:31:29 +0200 Message-Id: <9404070931.AA02433=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: LICS'94 Program and Registration From: felty@research.att.com (Amy Felty) [This announcement is being sent to email lists. Our apologies for multiple copies.] LOGIC IN COMPUTER SCIENCE (LICS) ******************************** Ninth Annual IEEE Symposium July 3-7, 1994, Paris, France ADVANCE REGISTRATION AND PROGRAM INFORMATION ============================================ [This information is available on the world-wide web at http://www.research.att.com/lics/ Postscript, dvi, latex and plain text versions of the conference brochure are available via anonymous ftp from research.att.com in directory /dist/lics.] CONFERENCE OFFICE. ================= Please address registration form and inquiries to LICS'94 Secretariat Claudie Thenault INRIA-Rocquencourt Relations Exterieures Domaine de Voluceau BP 105 78153 Le Chesnay Cedex FRANCE Phone: 33 (1) 39 63 56 75 Fax: 33 (1) 39 63 56 38 E-mail: symposia@inria.fr REGISTRATION ============ The registration form should be sent to the conference office. Registration without payment (or purchase order) enclosed will not be considered. For early registration, payment must be received by June 5. Fees will be returned in full for any written cancellation received before June 24. No refund will be made after this date. A table of registration fees can be found on the registration form. The member rate applies to members of ACM, IEEE, EATCS and INRIA, members of the organizing and program committees and authors of accepted papers. The student rate applies to full time students; a copy of the registrant's 1993-94 student card should be included with the registration form. The registration fee includes conference participation, a copy of the proceedings, coffee breaks and an invitation to the welcome reception. There is a separate charge for the banquet. Payment must be in French currency, and can be made by bank cheque, postal cheque, or foreign draft made payable to "Agent Comptable de l'INRIA", by bank transfer to Tresorerie Generale des Yvelines, Versailles, account number 10071-78000-00044009 15389, by postal transfer to CCP Paris---30041-00001-09099 45 B 020-31, or by institutional purchase order. We have applied for permission to allow registration by credit card, and hope to have confirmation of this possibility by May 1. Participants wishing to use this facility should contact our office at that time, preferably by email addressed to symposia@inria.fr. Bank transfers should specify registrant's name and "Conference reference LICS94". ACCOMMODATION ============= Reservations can be made through the Wagonlit Travel Agency. The accommodation form should be sent with deposit before June 1 to: Wagonlit Travel Departement Congres & Evenements 50 Rue de Londres 75008 Paris FRANCE Tel: 33 (1) 44 90 33 10 Fax: 33 (1) 44 90 33 15 There are two categories of hotels available, as well as inexpensive student lodging (no age limit) in an international center in Clichy (north Paris). Paris is very popular in the summer, so reservations should be made as soon as possible. A deposit is compulsory for hotel reservations, and student lodging must be entirely prepaid. Payment must be in French currency, and can be made by bank cheque, Eurocheque, or foreign draft made payable to "Wagonlit Travel", by bank transfer to the account 00021935201/61 B.N.P. Paris Saint Lazare, bank code 30004, branch code 0819, "Wagonlit Travel---code comptable 04/670", or by credit card. Hotel deposits will be forwarded to the hotel less 60FF for reservation fees. The participant's bank charges must be added to the amount transferred. For cancellations made before June 1, payments will be refunded less 60FF for fees; no refunds will be made after June 1. LOCATION ======== The Conference is being hosted by the Conservatoire National des Arts et Metiers (CNAM) and will be part of its Bicentennial celebration. CNAM is a well-known engineering school where professionals are taught by professionals. It houses the famous Musee National Des Arts et Techniques, and is located at 292 Rue Saint Martin in the old center of Paris, on the right bank of the river Seine. It is walking distance from Les Halles, the Centre National d'Art et de Culture Georges-Pompidou (Beaubourg), the Hotel de Ville (City Hall) and the cathedral Notre-Dame de Paris. The nearest Metro station is Arts et Metiers. Paris normally enjoys pleasant summer weather in early July. Days are warm, but nights may be cool. For general information on Paris, contact the Paris Tourist Information Office, 127 Champs Elysees, 75008 Paris, phone number 33 (1) 49 52 53 54. RECEPTIONS ========== A Welcome Reception will be held on Sunday evening (17:00-19:00) in a gallery of CNAM. The Conference Banquet will be held in the palace housing the Senate, the upper chamber of the French Parliament. The palace was built in the beginning of the 17th century for Marie de Medicis, widow of King Henry IV. It is located in the well-known Jardins du Luxembourg. To reserve a place at the banquet, the appropriate column on the registration form must be marked; a banquet reservation on site will not be possible. LOCAL ARRANGEMENTS ================== Lunches are at the participants' own expense. Participants may eat in cafes and restaurants in CNAM's vicinity. Telephone messages will be delivered to participants during breaks. Access to email will be possible from CNAM. The organizers cannot be held liable to conference participants for injury, damage or loss of their personal property. It is suggested that participants make their own insurance arrangements. REGISTRATION DESK ================= A registration and information desk located at the conference site will operate on Sunday, July 3, from 15:00 to 18:00, and on the remaining conference days from 8:00 to 18:00. TRAVEL ====== Paris has two airports, Roissy-Charles de Gaulle, 30km north of Paris, and Orly, 20km south of Paris. A frequent Air France bus service goes from Roissy to Place Charles de Gaulle-Etoile or Porte Maillot in central Paris (the cost is about 48FF); from Orly the bus goes to Invalides and stops on demand at Montparnasse (32FF). There is also train service. From Roissy, the RER B line goes to Gare du Nord or Chatelet; from Orly, the Orlyval goes to Antony where there is a connection to the RER B (32FF). A taxi from Orly to central Paris costs about 150FF; from Roissy, 200FF. The Metro offers a convenient way to get around the city. Each trip (with unlimited transfers) costs one ticket. Tickets can be bought individually, but a carnet of 10 is more practical. RER lines to the suburbs connect with the Metro and cost more. Both Metro and RER tickets can be purchased from ticket booths or machines. A 40-45% discount may be obtained from AIR INTER for French domestic blue and white flights, depending on the days of departure. A voucher can be requested on the registration form. Participants requiring a visa for entry into France are strongly advised to make their application in their home countries at least two months prior to departure date. LICS'94 REGISTRATION FORM ************************* Last Name __________________________________________________ First Name _________________________________________________ Affiliation ________________________________________________ Street Address _____________________________________________ _______________________________________________________ City _______________________________________________________ State/Zip __________________________________________________ Country ____________________________________________________ Phone(s) ___________________________________________________ Fax ________________________________________________________ E-mail _____________________________________________________ REGISTRATION RATES. The fees below are in French currency and include 18.6% VAT. Please circle the applicable fees. through June 5 from June 6 Regular 2200 2600 Member 1700 2100 Student 1000 1200 Banquet 300 300 Total Fee ___________________________________________________ Rate justification __________________________________________ Full-time student at ________________________________________ I need an AIR INTER discount form: Yes / No Payment (circle one): Cheque (Bank/Foreign Draft) / Purchase Order / Bank Transfer (include copy) LICS'94 ACCOMMODATION FORM ************************** to be returned before Jun 1 Last Name __________________________________________________ First Name _________________________________________________ Company ____________________________________________________ Street Address _____________________________________________ _______________________________________________________ City _______________________________________________________ State/Zip __________________________________________________ Country ____________________________________________________ Phone(s) ___________________________________________________ Fax ________________________________________________________ 1A. HOTEL. Please reserve: *...twin bed room shared by 2 persons *...single room in a hotel of ________ stars, for ________ nights, from _________________ to _________________(a.m.). Average rates in French currency, per room and per night, room only, taxes and service included: Category Single/Twin Deposit 2** 385/500 460 3*** 550/700 760 1B. YOUTH HOSTEL. Please reserve: *...bed in a twin bed room, bathroom and toilets outside the room, compulsory stay of 4 nights (July 3 to 7, 1994), continental breakfast included, full prepayment compulsory, fixed rate per person 4 nights: 600FF. 2. PAYMENT. Deposit/prepayment of ____________ FF Circle one: Visa / Eurocard / Mastercard / Cheque (Bank/Euro/Foreign Draft) / Bank Transfer (include copy) Credit card # __________________________ Exp. __________ Signature _____________________________ Date ___________ CONFERENCE PROGRAM ****************** SUNDAY, July 3 ============== REGISTRATION (15:00-18:00) WELCOME RECEPTION (17:00-19:00) MONDAY, July 4 ============== REGISTRATION (8:00-9:00) OPENING ADDRESSES (9:00-9:25) INVITED LECTURE I (9:25-10:25) Chair: Robert Constable (Cornell) Rod Burstall (Edinburgh), Lambda-terms, proofs and refinement SESSION 1: FINITE MODEL THEORY (10:50-12:30) Chair: Daniel Leivant (Indiana) 10:50 McColm's Conjecture, Yuri Gurevich (Michigan), Neil Immerman (U Mass) & Saharon Shelah (Hebrew U & Rutgers) 11:15 The expressive power of finitely many generalized quantifiers, Anuj Dawar (Swansea) & Lauri Hella (Helsinki) 11:40 Generalized quantifiers for simple properties, Martin Otto (RWTH Aachen) 12:05 How to define a linear order on finite models, Lauri Hella (Helsinki), Phokion Kolaitis (UC Santa Cruz), & Kerkk Luosto (Helsinki) LUNCH (12:30-14:00) SESSION 2: CONCURRENCY (14:00-15:15) Chair: Vaughan Pratt (Stanford) 14:00 Finitary fairness, Rajeev Alur (Bell Labs) & Thomas Henzinger (Cornell) 14:25 Bisimulation is not (first-order) equationally axiomatisable, Peter Sewell (Edinburgh) 14:50 Foundations of timed concurrent constraint programming, Vijay Saraswat (Xerox PARC), Radha Jagadeesan (Loyola) & Vineet Gupta (Stanford) SESSION 3: SEMANTICS I (15:40-16:55) Chair: Achim Jung (Darmstadt) 15:40 A fully abstract semantics for concurrent graph reduction, Alan Jeffrey (Sussex) 16:05 An axiomatization of computationally adequate domain-theoretic models of FPC, Marcelo Fiore & Gordon Plotkin (Edinburgh) 16:30 On strong stability and higher-order sequentiality, Loic Colson & Thomas Ehrhard (Marne-la-Vallee) SESSION 4: DOMAIN THEORY (17:10-18:00) Chair: Carl Gunter (U Penn) 17:10 Linear types, approximation and topology, Michael Huth, Achim Jung & Klaus Keimel (Darmstadt) 17:35 Domain theory and integration, Abbas Edalat (Imperial Coll.) BUSINESS MEETING (20:00) TUESDAY, July 5 =============== TUTORIAL I (8:30-9:45) Chair: Moshe Vardi (Rice) Ed Clarke (CMU), Model Checking SESSION 5: CONSTRAINTS (10:00-10:50) Chair: Harald Ganzinger (MPI Saarbrucken) 10:00 Negative set constraints with equality: an easy proof of decidability, Witold Charatonik (Wroclaw) & Leszek Pacholski (Polish Academy of Sciences) 10:25 Systems of set constraints with negative constraints are NEXPTIME-complete, Kjartan Stefansson (Cornell) SESSION 6: MODAL AND TEMPORAL LOGICS I (11:15-12:30) Chair: Dexter Kozen (Cornell) 11:15 A compositional proof system for the modal mu-calculus, Hendrik Reif Andersen (TU Denmark), Colin Stirling (Edinburgh) & Glynn Winskel (Aarhus) 11:40 On the parallel complexity of model-checking in the modal mu-calculus, Shipei Zhang, Oleg Sokolsky & Scott Smolka (SUNY Stony Brook) 12:05 Complexity transfer for modal logic, Edith Hemaspaandra (Le Moyne) LUNCH (12:30-14:00) SESSION 7: TYPES I (14:00-15:15) Chair: Paris Kanellakis (Brown) 14:00 Typability and type-checking in the second-order lambda-calculus are equivalent and undecidable, J.B. Wells (Boston U) 14:25 Efficient inference of object types, Jens Palsberg (Northeastern) 14:50 Type inference and extensionality, Adolfo Piperno (Roma) & Simona Ronchi della Rocca (Torino) SESSION 8: CONSTRUCTIVE MATHEMATICS (15:40-16:55) Chair: Daniel Leivant (Indiana) 15:40 A groupoid model refutes uniqueness of identity types, Martin Hofmann (Edinburgh) & Thomas Streicher (LMU Muenchen) 16:05 A non-elementary speed-up in proof length by structural clause form transformation, Matthias Baaz, Christian Fermueller & Alexander Leitsch (TU Wien) 16:30 Upper and lower bounds for tree-like cutting planes proofs, Russell Impagliazzo (UC San Diego), Toniann Pitassi (UC San Diego) & Alasdair Urquhart (Toronto) SESSION 9: COMPLEXITY AND DATABASES (17:10-18:00) Chair: David McAllester (MIT) 17:10 The power of reflective relational machines, Serge Abiteboul (INRIA), Christos Papadimitriou (UC San Diego) & Victor Vianu (UC San Diego) 17:35 A syntactic characterization of NP-completeness, J. Antonio Medina & Neil Immerman (U Mass) EVENING LECTURE (19:30-20:30) Chair: Jean-Pierre Jouannaud (Paris Sud & CNRS) Corrado Boehm (Roma), An algebraic view of the lambda-calculus WEDNESDAY, July 6 ================= TUTORIAL II (8:30-9:45) Chair: Samson Abramsky (Imperial Coll.) Gerard Berry (CMA), The semantics of synchronous concurrent languages SESSION 10: LOGIC PROGRAMMING (10:00-10:50) Chair: Krzysztof Apt (CWI) 10:00 The declarative semantics of the Prolog selection rule, Robert Staerk (U Muenchen) 10:25 Semantics of meta-logic in an algebra of programs, Antonio Brogi & Franco Turini (Pisa) SESSION 11: LINEAR LOGIC (11:15-12:30) Chair: Samson Abramsky (Imperial Coll.) 11:15 A multiple-conclusion meta-logic, Dale Miller (U Penn) 11:40 Proof search in first-order linear logic and other cut-free sequent calculi, Patrick Lincoln & N. Shankar (SRI) 12:05 Linear logic, totality and full completeness, Ralph Loader (Oxford) LUNCH (12:30-14:00) SESSION 12: TYPES II (14:00-15:15) Chair: Frank Pfenning (CMU) 14:00 The emptiness problem for intersection types, Pawel Urzyczyn (Warsaw) 14:25 Subtyping and parametricity, Gordon Plotkin (Edinburgh), Martin Abadi (DEC SRC) & Luca Cardelli (DEC SRC) 14:50 On the Church-Rosser property for expressive type systems and its consequences for their metatheoretic study, Herman Geuvers (Nijmegen) & Benjamin Werner (Cornell & INRIA) SESSION 13: SEMANTICS II (15:40-16:55) Chair: Prakash Panangaden (McGill) 15:40 A semantics of object types, Martin Abadi & Luca Cardelli (DEC SRC) 16:05 Passivity and independence, Uday Reddy (Illinois) 16:30 A general semantics for evaluation logic, Eugenio Moggi (Genova) SESSION 14: CATEGORY THEORY (17:10-18:00) Chair: Glynn Winskel (Aarhus) 17:10 Reflexive graphs and parametric polymorphism, Edmund Robinson (Sussex) & Giuseppe Rosolini (Genova) 17:35 Categories, allegories and circuit design, Carolyn Brown (Sussex) & Graham Hutton (Chalmers) BANQUET THURSDAY, July 7 ================ INVITED LECTURE II (9:00-10:00) Chair: Gerard Huet (INRIA) Henk Barendregt (Nijmegen), Results and problems related to proof-checking SESSION 15: REWRITING (10:00-10:50) Chair: Jean-Pierre Jouannaud (Paris Sud & CNRS) 10:00 Rewrite techniques for transitive relations, Leo Bachmair & Harald Ganzinger, (Max-Planck-Institut) 10:25 Normalised rewriting and normalised completion, Claude Marche (CNRS & INRIA) SESSION 16: LAMBDA-CALCULUS (11:15-12:30) Chair: Jean-Jacques Levy (INRIA) 11:15 Modularity of strong normalization and confluence in the algebraic lambda-cube, Franco Barbanera (Torino), Maribel Fernandez (Paris Sud & CNRS), & Herman Geuvers (Nijmegen) 11:40 Cyclic lambda graph rewriting Zena Ariola (U Oregon) & Jan Willem Klop (CWI) 12:05 Paths in the lambda-calculus, Andrea Asperti (Bologna), Vincent Danos (CNRS & Paris 7), Cosimo Laneve (INRIA & CMA), & Laurent Regnier (CNRS) LUNCH (12:30-14:00) SESSION 17: MODAL AND TEMPORAL LOGIC II (14:00-15:15) Chair: Colin Stirling (Edinburgh) 14:00 A trace based extension of linear time temporal logic, P.S. Thiagarajan (SPIC Madras) 14:25 Axioms for knowledge and time in distributed systems with perfect recall, Ron van der Meyden (NTT Tokyo) 14:50 Compositional verification of real-time systems, Edward Chang (Stanford), Zohar Manna (Stanford), & Amir Pnueli (Weizmann Institute) SESSION 18: LOGIC IN ARTIFICIAL INTELLIGENCE (15:40-16:55) Chair: Peter Schroeder-Heister (Tuebingen) 15:40 Logical bilattices and inconsistent data, Ofer Arieli & Arnon Avron (Tel Aviv) 16:05 A modal logic for subjective default reasoning, Shai Ben-David & Rachel Ben-Eliyahu (Technion) 16:30 Language completeness of the Lambek calculus, Mati Pentus (Moscow State) SESSION 19: AUTOMATED DEDUCTION} (17:10-18:00) Chair: Gerard Huet (INRIA) 17:10 Rigid E-unifiability is NEXPTIME-complete, Jean Goubault (Bull) 17:35 Higher-order narrowing, Christian Prehofer (TU Muenchen) END OF CONFERENCE CONFERENCE ORGANIZATION *********************** LICS General Chair: Robert L. Constable 1994 Conference Co-chairs: Gerard Huet & Jean-Pierre Jouannaud 1994 Program Chair: Samson Abramsky Publicity Co-chairs: Amy Felty & Douglas Howe 1994 Local Arrangements: A. Theis-Viemont & C. Thenault PROGRAM COMMITTEE: ================== S. Abramsky, K. Apt, H. Ganzinger, C. Gunter, A. Jung, P. Kannelakis, D. Kozen, D. Leivant, J.-J. Levy, D. McAllester, P. Panangaden, F. Pfenning, V. Pratt, P. Schroeder-Heister, C. Stirling, G. Winskel. ORGANIZING COMMITTEE: ===================== M. Abadi, S. Abramsky, S. Artemov, A. Borodin, A. Bundy, S. Buss, E. Clarke, R. Constable (Chair), A. Felty, U. Goltz, Y. Gurevich, S. Hayashi, D. Howe, G. Huet, J.-P. Jouannaud, D. Kapur, C. Kirchner, P. Kolaitis, R. Kosaraju, D. Kozen, D. Leivant, A.R. Meyer, D. Miller, J. Mitchell, Y. Moschovakis, M. Okada, P. Panangaden, A. Pitts, G. Plotkin, J. Remmel, S. Ronchi della Rocca, G. Rozenberg, A. Scedrov, D. Scott, J. Tiuryn, M.Y. Vardi. From fritsv@cwi.nl Wed Apr 13 13:51:22 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA29994; Wed, 13 Apr 94 05:54:30 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Wed, 13 Apr 1994 11:51:23 +0200 Received: by specht.cwi.nl id AA05833 (5.65b/3.8/CWI-Amsterdam); Wed, 13 Apr 1994 11:51:22 +0200 Date: Wed, 13 Apr 1994 11:51:22 +0200 Message-Id: <9404130951.AA05833=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: CAV preliminary announcement From: dill@hohum.stanford.edu (David Dill) PRELIMINARY CONFERENCE ANNOUNCEMENT Conference on Computer-Aided Verification CAV 1994 Stanford University June 21-23, 1994 ------------------------------------------------------------------------------ This preliminary notice is being sent out now so that people can make travel arrangements soon. More details will appear in a few days. The Sixth Conference on Computer-Aided Verification will be held June 21-23 at Stanford University. The conference will be followed on June 24th by a one-day workshop on practical aspects of computer-aided formal verification. CAV 94 is sponsored by a group of companies with a strong interest in the topic area: AT&T, IBM, Intel, Motorola, Redwood Design Automation and Sun Microsystems. IMPORTANT NOTE: World Cup matches will be held at Stanford on June 20th and 24th, which will contribute to congestion both locally and in air travel. Please make your flight reservations as soon as possible! WORKSHOP: On Friday, June 24th, there will be a one-day workshop consisting of presentations by both developers and users of formal verification tools, with special emphasis on experiences on applications. This is still being arranged -- more details will follow shortly. LOCATION: The conference will be held on the Stanford campus. Stanford will provide housing and food for participants in student residences. Participants may opt to stay in local hotels, but rooms will be scarce due to the World Cup Finals being held in the area at that time. The Stanford Campus is about 30-40 minutes drive from two major international airports, San Francisco and San Jose. Commercial shuttle service is available. REGISTRATION: Please complete the attached reservation form and either email or physically mail it with payment to the appropriate address. HOUSING: We strongly encourage participants to stay on campus to promote interaction with other conference participants. The cost of rooms and all meals (except for dinner on Wednesday night) will be $217 for three days and nights. A room may be reserved for the night of Thursday, June 23, for an additional $39. There is also a $50 key deposit that will be refunded upon checkout. A few rooms may be reserved for subsequent nights (for participants who wish to tour the Bay area), depending on availability. Dinner on Wednesday will be a banquet at another site (transportation will be provided). Student registration does NOT include the banquet Wednesday. PARKING: Parking permits will be available on request at registration. Parking is available near the dorms. CLIMATE: The weather will almost certainly be 72-80 degrees (F) with cloudless skies. It generally cools down significantly in the evenings (in the 50s), so a sweater is helpful if you are out in the evening. At other places in the Bay area (e.g. parts San Francisco), it can by foggy and very cool. FURTHER INFORMATION: You can send electronic mail to "cav@hohum.stanford.edu" if you have further questions about the conference. ---------------------------------------------------------------- REGISTRATION If you are paying by credit card, you may return this registration form by electronic mail to "cav-registration@hohum.stanford.edu" Otherwise, physically mail the form along with payment in the form of a VISA or MasterCard number, a check drawn on a U.S. bank, or an international money order (in U.S. dollars) to Events Plus and mail it to Events Plus attn: Cecilia Sanchez 540 Valley Way Milpitas, CA 95035 USA Events Plus can be contacted at the above address. Their telephone is (408) 262 8109 and fax is (408) 262 8344. The registration form is due May 20. Timely registration is important to make sure we have reserved adequate rooms. There is also a limit on the number who can attend the banquet. Name: _____________________________________________________ Affiliation: ______________________________________________ Address: __________________________________________________ ___________________________________________________________ Country: __________________________________________________ Phone: _______________________ Fax: _______________________ (please include country and city code) Email: ____________________________________________________ For room assignment: Are you: Male Female Confirmation will be sent to you by email. Regular advanced registration: $200 $___ Late registration: $250 $___ Student registration: $150 $___ Housing&Meals June 20-22 $267 $___ (excl. banquet, incl. $50 refundable key deposit) Housing June 23 $39 $___ TOTAL $___ Would you like to pay by VISA [ ] or MasterCard [ ]? If so, what is the number? _______________________________ expiration date ______, daytime telephone _________________ Do you have any special dietary requirements? Vegetarian [ ] Kosher [ ] Other: ___________________ TECHNICAL PROGRAM Here are the talks that will be presented. The times are still being set, and there may be small changes in some of the titles. Invited talks: Prof. Zohar Manna, Stanford University Prof. Alberto Sangiovanni-Vincentelli, U. C. Berkeley "A Determinizable Class of Timed Automata" R. Alur and L. Fix and T. A. Henzinger "Real-Time System Verification using P/T Nets" R. Gorrieri and G. Siliprandi "Criteria for the Simple Path Property in Timed Automata" W. K.C. Lam and R. K. Brayton "Hierarchical representations of discrete functions, with application to model checking" K. L. McMillan "Symbolic Verification with Periodic Sets" B. Boigelot and P. Wolper "Automatic Verification of Pipelined Microprocessor Control" J. R. Burch and D. L. Dill "Using Abstractions for the Verification of Linear Hybrid Systems" A. Olivero and J. Sifakis and S. Yovine "Decidability of Hybrid Systems with Rectangular Differential Inclusions" A. Puri and P. Varaiya "Suspension Automata: A Decidable Class of Hybrid Automata" J. McManis and P. Varaiya "Verification of Context-Free Timed Systems Using Linear Hybrid Observers" A. Bouajjani, R. Echahed, and R. Robbana "On the Random Walk Method for Protocol Testing" M. Mihail and C. H. Papadimitriou "An Automata-Theoretic Approach to Branching-Time Model Checking" O. Bernholtz, M. Vardi, and P. Wolper "Realizability and Synthesis of Reactive Modules" A. Anuchitanukul and Z. Manna "Model Checking of Higher-Order Processes" H. Hungar "Methodology and System for Practical Formal Verification of Reactive Hardware" I. Beer, S. Ben-David, D. Geist, and M. Yoeli "Modeling and Verification of a Real Life Protocol Using Symbolic Model Checking", V. G. Naik and A. P. Sistla "Verification of a Distributed Cache Memory by using Abstractions", S. Graf "Models Whose Checks Don't Explode" R. P. Kurshan "On the Automatic Computation of Network Invariants" F. Balarin and A. L. Sangiovanni-Vincentelli "Ground Temporal Logic -- A Logic for Hardware Verification" David Cyrluk and Palaith Narendran "A Hybrid Model for Reasoning about Composed Hardware Systems" E. Thomas Schubert "Composing Symbolic Trajectory Evaluation Results" S. Hazelhurst and C-J. H. Seger "The Completeness of a Hardware Inference System" Z. Zhu "Efficient Model Checking by Automated Ordering of Transition Relation Partitions" D. Geist and I. Beer "The Verification Problem for Replaceability" V. Singhal and C. Pixley "Formula-Dependent Equivalence for Compositional CTL Model Checking", A. Aziz, T. R. Shiple, V. Singhal, R. K. Brayton, and A. Sangiovanni-Vincentelli "An Improved Algorithm for the Evaluation of Fixpoint Expressions", D. E. Long, A. Browne, E. M. Clarke, S. Jha, and W. R. Marrero "Incremental Model Checking in Modal Mu-Calculus", O. V. Sokolsky and S. A. Smolka "Performance Improvement of State Space Exploration by Regular and Differential Hashing Functions" B. Cousin "Combining Partial Order Reductions with On-the-fly Model-Checking" D. Peled "Improving Language Containment Using Fairness Graphs" R. Hojati, R. Mueller-Thuns, and R. K. Brayton "A Parallel Algorithm for Relational Coarsest Partition Problems and Its Implementation" I. Lee and S. Rajasekaran "Another Look at LTL Model Checking" E. Clarke, O. Grumberg, and K. Hamaguchi "The Mobility Workbench: A Tool for the Mu-Calculus" B. Victor and F. Moller "Compositional Semantics of Esterel and verification by compositional reduction" R. de Simone and A. Resouche "Design of a VHDL/S model checker based on adaptive state and data abstraction" D. Dams, R. Gerth, G. D\"{o}hmen, R. Herrmann, and P. Kel "Automatic Verification of Timed Circuits" T. G. Rokicki and C. J. Myers From fritsv@cwi.nl Wed Apr 13 13:53:39 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA00102; Wed, 13 Apr 94 05:56:42 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Wed, 13 Apr 1994 11:53:40 +0200 Received: by specht.cwi.nl id AA05841 (5.65b/3.8/CWI-Amsterdam); Wed, 13 Apr 1994 11:53:39 +0200 Date: Wed, 13 Apr 1994 11:53:39 +0200 Message-Id: <9404130953.AA05841=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Final Call for Papers From: fsttcs@imsc.ernet.in (FST_TCS_14) %\documentstyle[12pt]{article} \documentstyle{article} % \oddsidemargin 6pt \evensidemargin 6pt \marginparwidth 90pt \marginparsep 10pt \topmargin -30pt \headheight 12pt \headsep 25pt \footheight 12pt \footskip 30pt %\textheight 680pt \textwidth 455pt \columnsep 10.5pt \columnseprule 0pt % \addtolength{\oddsidemargin}{-2.3cm} \setlength{\textwidth}{18cm} \addtolength{\topmargin}{-1cm} \setlength{\textheight}{27cm} \pagestyle{empty} \begin{document} % % Overall structure of the page % ----------------------------------------- % | | minipage (title) | % ----------------------------------------- % | |p| | % | Parbox |a| minipage | % | (com- |r| (conference | % | mit- |b| information) | % | tees) |o| | % | |x| | % ----------------------------------------- \hspace*{\fill} \begin{minipage}[t]{11cm} \begin{center} {\Large\sc Final Call for Papers} \end{center} \begin{center} {\large \it Fourteenth Conference on the}\\[1.5ex] {\Large \bf Foundations of Software Technology}\\[1.0ex] {\Large \bf and Theoretical Computer Science} \end{center} \begin{center} {\large\bf December 15--17, 1994, Madras, India} \end{center} \end{minipage} \bigskip %================================================================= % The committees go in a parbox on the left %================================================================= \parbox[t]{5.3cm}{ \noindent {\bf Programme Committee:} \medskip \begin{tabular}{l} S. Arun-Kumar (IIT, Delhi)\\ V. Arvind (IMSc, Madras)\\ V. Chandru (IISc, Bangalore)\\ H. Karnick (IIT, Kanpur)\\ K. Krithivasan (IIT, Madras)\\ S.N. Maheshwari (IIT, Delhi)\\ A. Mukhopadhyay (IIT, Kanpur)\\ J. Radhakrishnan\\ \hspace*{5mm} (TIFR, Bombay)\\ R.K. Shyamasundar \\ \hspace*{5mm}(TIFR, Bombay)\\ R. Siromoney (MCC, Madras)\\ G. Sivakumar (IIT, Bombay)\\ P.S. Thiagarajan {\bf (Chair)}\\ \hspace*{5mm}(SPIC Sci.\ Found., Madras) \end{tabular} \bigskip \noindent {\bf Organizing Committee:} \medskip \begin{tabular}{l} V.R. Dare (MCC, Madras)\\ V. Krishnamurthy \\ \hspace*{5mm}(Anna Univ., Madras)\\ M. Mukund \\ \hspace*{5mm}(SPIC Sci.\ Found., Madras)\\ R. Ramanujam {\bf (Chair)}\\ \hspace*{5mm}(IMSc, Madras) \\ P. Sreenivasakumar \\ \hspace*{5mm}(IIT, Madras) \end{tabular} \bigskip \bigskip \noindent {\bf Advisory Committee:} \medskip \begin{tabular}{l} S. Abramsky (Imperial College)\\ D. Bj\"orner (UNU/IIST, Macau)\\ A. Chandra (IBM Research)\\ D. Gries (Cornell)\\ M. Joseph (Warwick)\\ A.K. Joshi (Pennsylvania)\\ R. Kannan (Carnegie-Mellon)\\ D. Kapur (SUNY, Albany)\\ J.L. Lassez (IBM Research)\\ U. Montanari (Pisa)\\ R. Narasimhan \\ \hspace*{5mm}(CMC, Bangalore)\\ M. Nivat (Paris)\\ R. Parikh (CUNY)\\ A. Pnueli (Weizmann)\\ V.K. Prasanna (USC)\\ S. Sahni (Florida)\\ S. Tripathi (Maryland)\\ W. Wulf (Virginia) \end{tabular} } %\end{parbox} % %================================================================= % Vertical line goes in a parbox after the committees %================================================================= % \parbox[t]{5mm}{ \rule[-21cm]{0.2mm}{22cm} } %\end{parbox} % %================================================================= % Conference information goes in a minipage to the right of the line %================================================================= % \begin{minipage}[t]{12.2cm} The 14th Annual FST \& TCS Conference will take place in Madras. This year's conference is being jointly organized by the Institute of Mathematical Sciences, SPIC Science Foundation and the Indian Institute of Technology, Madras. \medskip {\bf Scope:~} Authors are invited to submit papers presenting original and unpublished research on theoretical aspects of Computer Science. Typical areas include (but are not limited to): \begin{quote} Computational Complexity; Design and Analysis of Algorithms \linebreak (including Parallel, Distributed, Probabilistic and Randomized \linebreak Algorithms); Data Structures; Learning Theory; Computational Geometry; Temporal and Modal Logics of Programs; Rewrite Systems; Type Theory; Theory of Concurrency (including Reactive, Real-Time and Hybrid Systems); Theory of Logic Programming, Object-oriented, Functional and Constraints-based Programming; Formal Concepts in Programming Languages; Specification and Verification Methodologies. \end{quote} {\bf Submissions:~} Authors are invited to send {\bf SIX} copies of a draft of a full paper or an extended abstract. Papers should be limited to 6000 words (about 15 pages). If authors believe that more details are necessary, they may include a clearly marked appendix which will be read at the discretion of the Programme Committee. Each paper should also contain a short abstract of approximately 200 words. If available, e-mail addresses and fax numbers of the authors should also be included. \hspace*{5mm} The Conference Proceedings have been traditionally published by Springer-Verlag in the series {\em Lecture Notes in Computer Science (LNCS)}. A commitment that the paper will be presented at the conference by one of the authors is a pre-condition for an accepted paper to be included in the proceedings. \medskip {\bf Important Dates:~} \begin{tabbing} XX \= Final Version of Accepted Papers due on \= : \= \parbox{4cm}{} \= \+ \kill Deadline for Submission \> : \> \parbox{4cm}{\hspace*{\fill} 15 May 1994} \> \\ Notification to Authors \> : \> \parbox{4cm}{\hspace*{\fill} 5 August 1994} \> \\ Final Version of Accepted Papers due on \> : \> \parbox{4cm}{\hspace*{\fill} 5 September 1994} \> \end{tabbing} \smallskip \noindent {\bf Address:} Send papers to: \begin{tabbing} XX \= Institute of Mathematical Sciences \hspace{5mm} \= E-mail \= : \= \+ \kill P.S. Thiagarajan \> E-mail \> : \> {\sf pst@ssf.ernet.in}\\ FST \& TCS 14 \> \> \> {\sf pst@imsc.ernet.in}\\ School of Mathematics \> Fax \> : \> +91--44--825 6842\\ SPIC Science Foundation \> \> \> \\ 92 G.N. Chetty Road, T. Nagar \> \> \> \\ Madras 600 017, INDIA \> \> \> \end{tabbing} \smallskip For further details concerning the conference, please write to: \begin{tabbing} XX \= Institute of Mathematical Sciences \hspace{5mm} \= E-mail \= : \= \+ \kill R. Ramanujam \> E-mail \> : \> {\sf fsttcs@imsc.ernet.in}\\ FST \& TCS 14 \> Fax \> : \> +91--44--235 0586\\ Institute of Mathematical Sciences \> \> \> \\ C.I.T. Campus, Taramani \> \> \> \\ Madras 600 113, INDIA \> \> \> \end{tabbing} \end{minipage} \end{document} From fritsv@cwi.nl Wed Apr 13 13:55:31 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA00111; Wed, 13 Apr 94 05:58:33 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Wed, 13 Apr 1994 11:55:32 +0200 Received: by specht.cwi.nl id AA05847 (5.65b/3.8/CWI-Amsterdam); Wed, 13 Apr 1994 11:55:31 +0200 Date: Wed, 13 Apr 1994 11:55:31 +0200 Message-Id: <9404130955.AA05847=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: ICALP '94 - second announcement (LaTeX file) From: Edna Wigderson \documentstyle[fullpage]{article} \setlength{\parindent}{0pt} \setlength{\parskip}{10pt} \begin{document} \begin{center} {\Large ICALP '94 --- Second Announcement} \end{center} Please contact the Conference Secreteriat for obtaining a brochure detailing the full conference program, tours, social events and registration forms: \begin{tabular}{ll} Dan Knassim Ltd.\\ P.O. Box 57005\\ Tel Aviv 61570\\ Israel\\ \\ Phone: & +972-3-5626470\\ Fax: & +972-3-5612303 \end{tabular} \newpage {\bf Welcome to Jerusalem,} The twenty-first ICALP conference convenes in the Hebrew University's Givat Ram campus located in west Jerusalem, near the Knesset (parliament), Supreme Court, the Israel Nation Museum and other museums. The scientific program follows the tradition of ICALP, with some innovations: A selection of contributed papers and invited talks in broad areas of theoretical Computer Science during the 4 days of ICALP. Additional scientific events include workshops and Sunday's tutorial lectures. Jerusalem is deeply rooted in human spirit. Its history spans 3,000 years. Before, during and after the meeting there will be ample opportunities for organized and private excursions. Enjoy the beautiful city, old and new; the Holy Land: visit archeological excavations, historical cities, holy places, cultural treasures and other tourist attractions. We look forward to a successful conference and enjoyable visits. We extend to all the most basic Hebrew peace wish: Shalom! \begin{tabular}{p{3in}l} S. Abiteboul, Co-Chairman & E. Wigderson, Chairperson\\ E. Shamir, Co-Chairman & Organizing Commitee\\ Program Committee \end{tabular} \newpage \begin{tabular}{p{3in}l} {\bf Organizing Committee} & {\bf Program Committee}\\ E. Cohen & S. Abiteboul, Paris (co-chairman) \\ N. Lindenstrauss & A. Apostolico, Purdue and Padova\\ N. Nisan & E. Clarke, Pittsburgh\\ E. Shamir & B. Courcelle, Bordeaux \\ E. Wigderson (Chairperson) & J. de Bakker, Amsterdam \\ & O. Grumberg, Haifa\\ & J. Hromkovic, Paderborn \\ & Z. Kedem, New York \\ & A. Lingas, Lund \\ & G. Mauri, Milan \\ & U. Montanari, Pisa \\ & M. Nielsen, Aarhus \\ & F. Orejas, Barcelona \\ & P. Orponen, Helsinki \\ & H. Prodinger, Vienna \\ & E. Shamir, Jerusalem (co-chairman) \\ & W. Thomas, Kiel \\ & J. Tiuryn, Warsaw \\ & J. Tucker, Swansea \\ & O. Watanabe, Tokyo \\ & E. Welzl, Berlin \\ \\ \\ Sponsors:\\ {\bf EC-ESPRIT}\\ {\bf INRIA France}\\ {\bf Leibniz Center, Hebrew University}\\ \\ The Israel Academy of Sciences and Humanities\\ The National Research Council of Israel\\ The Hebrew University\\ The Technion, Israel Institute of Technology\\ IBM Israel\\ Intel Israel \end{tabular} \newpage {\bf \large Sunday's Tutorial Lectures} These lectures are intended for general university audience and ICALP participants. All lectures will be given at the Feldman Hall on the Givat Ram campus (the ICALP location) on Sunday, July 10, 1994. \begin{tabular}{p{1cm}p{5.5in}} 13:30 & {\sf A Formal Approach to Query Languages,}\\ & C. Beeri, Hebrew U., Israel.\\ \\ 14:30 & To be announced.\\ \\ 15:30 & {\sf A Tool for Software Specification and Complexity Analysis,}\\ & Y. Gurevich, U. of Michigan, USA.\\ \\ 16:30 & Break\\ \\ 17:00 & {\sf One Way Functions, Cryptography and Fault-Tolerant Distributed Complexity,}\\ & A. Wigderson, Hebrew U., Israel.\\ \\ 18:00 & {\sf Approximability of Combinatorial Problems,}\\ & M. Yanakakis, AT\&T Bell Labs, USA. \end{tabular} \newpage \begin{center} {\LARGE ICALP '94 PROGRAM} \end{center} {\Large Monday, July 11} \begin{tabular}{p{1cm}p{5.5in}} 8:50 & Opening of ICALP '93 \end{tabular} {\bf Session 1: Theory of Computation}\\ \hspace*{0.5cm} (Chair: E. Shamir, Hebrew U., Israel) \begin{tabular}{p{1cm}p{5.5in}} 09:00 & {\sf Invited Talk:}\\ & {\sf Unexpected Upper Bounds on the Complexity of Some Communication Games,}\\ & P. Pudlak, Academy of Sciences, Czech Republic.\\ \\ \end{tabular} \begin{tabular}{p{1cm}p{5.5in}} 9:55 & {\sf Valuations and Unambiguity of Languages, with Applications to Fractal Geometry,}\\ & H. Fernau, Karlsruhe U., Germany and L. Staiger, Aachen U., Germany.\\ \\ 10:20 & {\sf On The Computational Power of Faulty and Asynchronous Neural Networks, }\\ & H.T. Siegelmann, Bar-Ilan U., Israel.\\ \\ 10:45 & Break \end{tabular} {\bf Session 2: Automata, Computation Models}\\ \hspace*{0.5cm} (Chair: S. Bensasson, Esprit B.R.A, EEC) \begin{tabular}{p{1cm}p{5.5in}} 11:05 & {\sf Deciding Properties of Integral Relational Automata,}\\ & K. $\breve{\rm C}\mbox{er}\bar{\rm a}\mbox{ns}$, Latvia U., Latvia.\\ \\ 11:30 & {\sf On the Cost of Recomputing: Tight Bounds on Pebbling with Faults,}\\ & Y. Aumann, Weizmann Inst., Israel, J. Bar-Ilan, Hebrew U., Israel and U. Feige, Weizmann Inst., Israel.\\ \\ 11:55 & {\sf On some Relations between Dynamical Systems and Transition Systems,}\\ & E. Asarin, Inst. for Info. Transmission Problems, Russia and O. Maler, Spectre-Verimag, France. \\ \\ 12:20 & {\sf Complexity Results for Multi-Pebble Automata and their Logics,}\\ & N. Globerman, Bar-Ilan U., Israel and D. Harel, Weizmann Inst., Israel. \\ \\ 12:45 & Lunch \end{tabular} \newpage {\bf Session 3: Expressive Power}\\ \hspace*{0.5cm} (Chair: S. Abiteboul, INRIA-Roquencourt, France) \begin{tabular}{p{1cm}p{5.5in}} 14:15 & {\sf Invited Talk:}\\ & {\sf An Analysis of core-ML: Expressive Power and Type Inference,}\\ & P. Kanellakis, Brown U., USA (joint work with G. Hillebrand, Brown U., USA and INRIA-Roquencourt, France and with H. Mairson, Brandeis U., USA)\\ \\ 15:10 & {\sf Expressiveness of Efficient Semi-Deterministic Choice Constructs,}\\ & M. Gyssens, Limburg U., Belgium, J. Van den Bussche, Antwerp U., Belgium and D. Van Gucht, Indiana U., USA. \\ \\ 15:35 & {\sf Tailoring Recursion for Complexity,}\\ & E. Gr\"adel, RWTH Aachen, Germany and Y. Gurevich, U. Michigan, USA.\\ \\ 16:00 & Break \end{tabular} {\bf Session 4: Automata, Concurrency}\\ \hspace*{0.5cm} (Chair: U. Montanari, Pisa U., Italy) \begin{tabular}{p{1cm}p{5.5in}} 16:25 & {\sf Determinizing Asynchronous Automata,}\\ & N. Klarlund, Aarhus U., Denmark, M. Mukund and M. Sohoni, SPIC Science Foundation, India.\\ \\ 16:50 & {\sf On the Complementation of B\"uchi Asynchronous Cellular Automata,}\\ & A. Muscholl, Stuttgart U., Germany.\\ \\ 17:15 & {\sf Distribution and Locality of Concurrent Systems,}\\ & F. Corradini and R. De Nicola, U. di Roma la Sapienza, Italy.\\ \\ 17:40 & {\sf Liveness in Timed and Untimed Systems,}\\ & R. Gawlick, R. Segala, J. S\o gaard-Andersen and N. Lynch, M.I.T, USA (J. S\o gaard-Andersen also Technical U., Denmark).\\ \\ 19:30 & EATCS General Assembly and the 1994 G\"{o}del Prize Presentation. \end{tabular} \newpage {\Large Tuesday, July 12} \begin{tabular}{p{1cm}p{5.5in}} 08:00 & Morning Excursion, Jerusalem\\ \\ 13:30 & Lunch \end{tabular} {\bf Session 5: Pattern Matching}\\ \hspace*{0.5cm} (Chair: A. Apostolico, Padova U., Italy and Purdue U., USA) \begin{tabular}{p{1cm}p{5.5in}} 14:30 & {\sf Average-case Analysis of Pattern-Matching in Trees Under the BST Probability Model,}\\ & J.R. S\'anchez-Couso, U. Polit\'ecnica, Spain and M.I. Fern\'andez-Camacho, U. Complutense, Spain.\\ \\ 14:55 & {\sf On the Approximation of Shortest Common Supersequences and Longest Common Subsequences,}\\ & T. Jiang, McMaster U., Canada and M. Li, Waterloo U., Canada.\\ \\ 15:20 & {\sf Optimal Parallel Algorithms for Prefix Matching,}\\ & R. Hariharan and S. Muthukrishnan, NYU, USA.\\ \\ 15:45 & {\sf Optimal Two-Dimensional Compressed Matching,}\\ & A. Amir, Georgia Tech. U., USA, G. Benson, USC, USA and M. Farach, Rutgers U., USA.\\ \\ 16:10 & Break \end{tabular} {\bf Session 6: Data Structures}\\ \hspace*{0.5cm} (Chair: J. Hromkovic, Paderborn U., Germany) \begin{tabular}{p{1cm}p{5.5in}} 16:30 & {\sf Maintaining Spanning Trees of Small Diameter,}\\ & G.F. Italiano and R. Ramaswami, IBM Research, USA.\\ \\ 16:55 & {\sf Simple Fast Parallel Hashing,}\\ & J. Gil, Technion, Israel and Y. Matias, AT\&T Bell Labs., USA.\\ \\ 17:20 & {\sf The Optimal Alphabetic Tree Problem Revisited,}\\ & T.M. Przytycka, Odense U., Denmark and L.L. Larmore, UC Riverside, USA.\\ \\ 17:45 & Break \end{tabular} {\bf Session 7: Computation Complexity}\\ \hspace*{0.5cm} (Chair: N. Nisan, Hebrew U., Israel) \begin{tabular}{p{1cm}p{5.5in}} 18:05 & {\sf On the Cutting Edge of Relativization: The Resource Bounded Injury Method, }\\ & H. Buhrman, Catalunya Poly. U., Spain and L. Torenvliet, Amsterdam U., Netherlands.\\ \\ 18:30 & {\sf PSPACE-completeness of Certain Algorithmic Problems on the Subgroups of Free Groups,}\\ & J.-C. Birget, S. Margolis, J. Meakin, Nebraska-Lincoln U., USA and P. Weil, LITP.IBP, France.\\ \\ \multicolumn{2}{p{6in}}{Evening at leisure. Participants can visit the Israel Museum (open until 22:00), or dine at recommended restaurants.} \end{tabular} \newpage {\Large Wednesday, July 13} {\bf Session 8: Semantics, Logic and Verification I}\\ \hspace*{0.5cm} (Chair: M. Nielsen, Aarhus U., Denmark) \begin{tabular}{p{1cm}p{5.5in}} 08:45 & {\sf Invited Talk:}\\ & {\sf Higher Order Processes and Their Models,}\\ & M. Hennessy, Sussex U., UK.\\ \\ 09:40 & {\sf Efficient Local Correctness Checking for Single and Alternating Boolean Equation Systems, }\\ & B. Vergauwen and J. Lewi, Leuven U., Belgium.\\ \\ 10:05 & {\sf Undecidable Verification Problems for Programs with Unreliable Channels, }\\ & P. Abdulla and B. Jonsson, Uppsala U., Sweden.\\ \\ 10:30 & {\sf Reasoning about Programs by Exploiting the Environment,}\\ & L. Fix and F.B. Schneider, Cornell U., USA.\\ \\ 10:55 & Break \end{tabular} {\bf Session 9: Semantics, Logic and Verification II}\\ \hspace*{0.5cm} (Chair: J. Tiuryn, Warsaw U., Poland) \begin{tabular}{p{1cm}p{5.5in}} 11:15 & {\sf A Model of Intuitionistic Affine Logic from Stable Domain Theory,}\\ & T. Br\"auner, Aarhus U., Denmark.\\ \\ 11:40 & {\sf Bistructures, Bidomains and Linear Logic,}\\ & G. Plotkin, Edinburgh U., Scotland and G. Winskel, Aarhus U., Denmark.\\ \\ 12:05 & {\sf Equivalences for Fair Kripke Structures,}\\ & A. Aziz, V. Singhal, F. Balarin, R.K. Brayton, and A. Sangiovanni-Vincentelli, UC Berkeley, USA.\\ \\ 12:30 & {\sf Generalizing Finiteness Conditions of Labelled Transition Systems,}\\ & F. van Breugel, CWI \& Amsterdam U., Netherlands.\\ \\ 12:55 & Lunch \end{tabular} \newpage {\bf Session 10: Formal Languages}\\ \hspace*{0.5cm} (Chair: G. Mauri, Milan U., Italy) \begin{tabular}{p{1cm}p{5.5in}} 14:30 & {\sf A Kleene Theorem for Recognizable Languages over Concurrency Monoids,}\\ & M. Droste, U. GH Essen, Germany.\\ \\ 14:55 & {\sf Least Solutions of Equations over ${\cal N}$,}\\ & H. Seidl, U. des Saarlandes, Germany.\\ \\ 15:20 & {\sf Fast Uniform Analysis of Coupled-Context-Free Languages,}\\ & G. Hotz and G. Pitsch, U. des Saarlandes, Germany.\\ \\ 15:45 & {\sf Polynomial Closure of Group Languages and Open Sets of the Hall Topology, }\\ & J.-E. Pin, U. Paris VI, France.\\ \\ 16:10 & Break \end{tabular} {\bf Session 11: Term Rewriting Systems}\\ \hspace*{0.5cm} (Chair: N. Dershowitz, Illinois U., USA) \begin{tabular}{p{1cm}p{5.5in}} 16:30 & {\sf Pumping, Cleaning and Symbolic Constraints Solving,}\\ & A.C. Caron, Lille U., France, H. Comon, Paris-Sud U., France. J.L. Coquid\'e, M. Dauchet, Lille U., France and F. Jacquemard, Paris-Sud U., France.\\ \\ 16:55 & {\sf Dynamically-Typed Computations for Order-Sorted Equational Presentations, }\\ & C. Hintermeier, C. Kirchner and H. Kirchner, INRIA-Lorraine \& CRIN-CNRS, France.\\ \\ 17:20 & {\sf Modular Properties in Combinations of First Order Algebraic Rewriting Systems, Recursion and Extensional Typed Lambda Calculi,}\\ & R. Di Cosmo, LIENS-ENS, France and D. Kesner, Paris-Sud U., France.\\ \\ 19:30 & Conference Dinner \end{tabular} \newpage {\Large Thursday, July 14} {\bf Session 12: Algorithms and Communications}\\ \hspace*{0.5cm} (Chair: Z. Kedem, NYU, USA) \begin{tabular}{p{1cm}p{5.5in}} 08:45 & {\sf Invited Talk:}\\ & {\sf Theory of Communication Networks for Large Scale Parallel Computers, }\\ & E. Upfal, IBM Research, USA and Weizmann Inst., Israel. \end{tabular} \begin{tabular}{p{1cm}p{5.5in}} 09:40 & {\sf Multiway Cuts in Directed and Node Weighted Graphs,}\\ & N. Garg, V.V. Vazirani, Indian Inst. of Tech., India and M. Yannakakis , AT\&T Bell Labs, USA.\\ \\ 10:05 & {\sf A Fast Randomized LOGSPACE Algorithm for Graph Connectivity,}\\ & U. Feige, Weizmann Inst., Israel.\\ \\ 10:30 & {\sf Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing,}\\ & S. Nikoletseas, Patras U., Greece, K. Palem, IBM Research, USA, P. Spirakis, Patras U., Greece, and M. Yung, IBM Research, USA.\\ \\ 10:55 & Break \end{tabular} {\bf Session 13: Graph Algorithms}\\ \hspace*{0.5cm} (Chair: A. Lingas, Lund U., Sweden) \begin{tabular}{p{1cm}p{5.5in}} 11:15 & {\sf The Size of an Intertwine,}\\ & J. Lagergren, Royal Inst. of Tech., Sweden.\\ \\ 11:40 & {\sf Finding Even Cycles Even Faster,}\\ & R. Yuster and U. Zwick, Tel-Aviv U., Israel.\\ \\ 12:05 & {\sf Polynomial Time Analysis of Toroidal Periodic Graphs,}\\ & F. H\"ofting, Paderborn U., Germany and E. Wanke, GMD, Germany.\\ \\ 12:30 & {\sf A Tight Lower Bound for Primitivity in $k$-structures,}\\ & P. Bonizzoni, Milan U., Italy.\\ \\ 12:55 & Lunch \end{tabular} \newpage {\bf Session 14: Randomized Complexity}\\ \hspace*{0.5cm} (Chair: P. Orponen, Helsinki U., Finland) \begin{tabular}{p{1cm}p{5.5in}} 14:30 & {\sf Randomness in Distribution Protocols,}\\ & C. Blundo, A. De Santis and U. Vaccaro, Salerno U., Italy.\\ \\ 14:55 & {\sf Lower Space Bounds for Randomized Computation,}\\ & R. Freivalds, Latvia U., Latvia and M. Karpinski, Bonn U., Germany.\\ \\ 15:20 & {\sf The Average Case Complexity of the Parallel Prefix Problem,}\\ & A. Jakoby, R. Reischuk, C. Schindelhauer and S. Weis, Darmstadt Tech. Hoch., Germany.\\ \\ 15:45 & Break \end{tabular} {\bf Session 15: Various Algorithms}\\ \hspace*{0.5cm} (Chair: O. Watanabe, Tokyo U., Japan) \begin{tabular}{p{1cm}p{5.5in}} 16:05 & {\sf Prefix Codes: Equiprobable Words, Unequal Letter Costs,}\\ & M.J. Golin, UST Hong-Kong and N. Young, Maryland U., USA.\\ \\ 16:30 & {\sf A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks,}\\ & C.G. Plaxton and T. Suel, Texas U., USA.\\ \\ 16:55 & {\sf A Robot Navigation Strategy in Unknown Environment and its Efficiency,} \\ & A. Mei and Y. Igarashi, Gunma U., Japan. \end{tabular} {\bf End of ICALP '94} \newpage {\bf \large The CTRS Workshop} The 4th International Workshop on Conditional (and Typed) Term Rewriting Systems will be held on Thursday and Friday, July 14 and 15, in conjunction with ICALP. A preliminary program for the workshop is enclosed. For more information contact \begin{tabular}{p{3in}l} Nachum Dershowitz & Naomi Lindenstrauss\\ Department of Computer Science & Computer Science Department\\ University of Illinois & Hebrew University\\ 1304 West Springfield Ave. & Givat Ram\\ Urbana, IL 61801 & Jerusalem 91904\\ USA & Israel\\ nachum@cs.uiuc.edu & naomil@cs.huji.ac.il \end{tabular} Extended abstracts will be made available prior to the conference by anonymous ftp from\\ a.cs.uiuc.edu\\ in directory pub/ctrs Workshop attendees must register for ICALP. Please indicate your intention to attend the workshop by marking the appropriate box on the application form. \newpage \begin{center} {\large Preliminary Program for the CTRS Workshop\\ on Conditional (and Typed) Term Rewriting Systems}\\ Held in Conjunction with ICALP '94, Jerusalem, July 14-15 \end{center} {\bf Thursday, July 14} \begin{tabular}{p{1cm}p{5.5in}} 8:45 & Opening Remarks.\\ \\ 9:00 & {\sf Complexity of Testing Ground Reducibility for Linear Word Rewriting Systems with Variables,}\\ & G. Kucherov and M. Rusinowitch, INRIA-Lorraine and CRIN, France,\\ \\ 9:50 & {\sf A Calculus for Rippling,}\\ & D. A. Basin, Max Planck Inst., Germany and T. Walsh, INRIA-Lorraine, France.\\ \\ 10:25 & {\sf Abstract Notions and Inference Systems for Proofs by Mathematical Induction,}\\ & C.-P. Wirth and K. Becker, U. Kaiserlautern, Germany.\\ \\ 11:00 & Break \\ \\ 11:15 & {\sf A Conflict between Call-By-Need Computation and Parallelism,}\\ & R. Kennaway, East Anglia U., UK.\\ \\ 11:50 & {\sf Strong Sequentiality of Left-Linear Overlapping Rewrite Systems,}\\ & J.-P. Jouannaud and W. Sadfi, CNRS Paris-Sud U., France.\\ \\ 12:25 & {\sf On Relative Normalization in Orthogonal Expression Reduction Systems,}\\ & J. Glauert and Z. Khasidashvili, East Anglia U., UK. \\ \\ 13:00 & Lunch\\ \\ 14:30 & {\sf Hierarchical Termination,}\\ & N. Dershowitz, Illinois U., USA.\\ \\ 15:05 & {\sf Well-Foundedness of Term Orderings,}\\ & M. C. F. Ferreira and H. Zantema, Utrecht U., Netherlands.\\ \\ 15:40 & {\sf Preserving Confluence for Rewrite Systems with Built-In Operations,}\\ & R. Buendgen, Tuebingen U., Germany. \\ \\ 16:15 & Break\\ \\ 16:45 & {\sf Associative-Commutative Superposition,}\\ & L. Bachmair and H. Ganzinger, Max Planck Inst., Germany.\\ \\ 17:20 & {\sf Church-Rosser Property and Unique Normal Form Property of Non-Duplicating Term Rewriting Systems,}\\ & Y. Toyama, JAIST, Japan and M. Oyamaguchi, Mie U., Japan. \\ \\ 17:55 & {\sf Coherence for Cartesian Closed Categories: a Sequential` Approach,}\\ & A. Mori and Y. Matsumoto, Kyoto University, Japan. \end{tabular} {\bf Friday, July 15} \begin{tabular}{p{1cm}p{5.5in}} 8:45 & {\sf On Termination and Confluence of Conditional Rewrite Systems,}\\ & B. Gramlich, Kaiserlautern U., Germany. \\ \\ 9:20 & {\sf LSE Narrowing for Decreasing Conditional Term Rewrite Systems,}\\ & A. Bockmayr, Max Planck Inst. Germany and A. Werner, Karlsruhe U., Germany.\\ \\ 9:55 & {\sf Modular Properties of Constructor-Sharing Conditional Term Rewriting Systems,}\\ & E. Ohlebusch, Bielefeld U., Germany.\\ \\ 10:30 & Break\\ \\ 11:00 & {\sf A New Characterization of AC-Termination and Application,}\\ & J.-M. Gelis, U. Paris 11, France. \\ \\ 11:35 & {\sf Termination for Restricted Derivations and Conditional Rewrite Systems,}\\ & C. Hoot, Illinois U., USA. \\ \\ 12:10 & {\sf Equation Solving in Geometrical Theories,}\\ & P. Balbiani, U. Paul Sebatier, France.\\ \\ 12:45 & Lunch \\ \\ 14:15 & {\sf Rewriting for Preorder Relations,}\\ & P. Inverardi, Instituto di Elaborazione dell'Informazione, Italy.\\ \\ 14:50 & {\sf The Transformation of Term Rewriting Systems Based on Well-Formedness Preserving Mappings,}\\ & J.C. Verheul and P. G. Kluit, T U Delft, Holland. \end{tabular} \newpage {\Large General Information} {\bf Registration Fees:} \begin{tabular}{llcc} & & Before June 10 & After June 11 \\ \\ Participants: & Members & US\$218 & US\$240\\ & Non-Members: & US\$240 & US\$260\\ Students: & & US\$80 & US\$90 \\ Accompanying Persons: & & US\$100 & US\$150 \end{tabular} (Payment in Israeli currency is subject to Value Added Tax.) {\bf Accommodations:} Hotel rooms have been reserved at the Sonesta Hotel (3 stars), the Paradise Hotel (3 stars, swimming pool) and the Ramada Hotel (5 stars, swimming pool) in Jerusalem. The hotels are located in the same area, within walking distance of the University. Conference participants are offered a special package at Conference rates including accommodations, full Israel breakfast and service charges according to the following rates: {\bf Prices per person, per night, in US\$:} \begin{tabular}{llcc} & {\bf Sonesta} & {\bf Paradise} & {\bf Ramada}\\ Triple occupancy & 42 & --- & ---\\ Double occupancy & 45 & 40 & 67\\ Single occupancy & 79 & 63 & 113 \end{tabular} (Payment in Israeli currency is subject to Value Added Tax.) {\bf Arrival Assistance:} Upon you arrival (check the appropriate box on you registration form), special staff will be in attendance in the Ben-Gurion Airport in Tel-Aviv, to meet and assist you, including transfer to hotels in Jerusalem. {\bf Price:} US\$80 per taxi (based on 2 persons per taxi). For general information, if you decide to take a local taxi from the airport to your hotel, the recommended fare is approximately \$40 per taxi. We recommend that you use the Airport ``Nesher Shuttle'' which offers door-to-door service, for approximately \$10 per person. \newpage \begin{center} {\large 21st International Colloquium On Automata, Languages and\\ Programming Jerusalem, Israel, July 11--15, 1994} {\Large Accomodation \& Reservation Form} \end{center} Please type or write in BLOCK letters and send to:\\ Danit Tours and Travel Ltd., P.O. Box 57005, Tel-Aviv 61570, Israel\\ Tel: +972-3-5626470, Fax: +972-3-5612303 Last Name:\dotfill\ First Name:\dotfill \\ Mailing Address:\dotfill \\ Country:\dotfill \\ Tel:\dotfill\ Fax:\dotfill\ Tlx:\dotfill \\ Arrival date:\dotfill\ Flight:\dotfill \ Time:\dotfill \\ {\bf Hotel Accomodation}\\ (must be accompanied by deposit of US\$100 per person)\\ Please reserve at the hotel:\dotfill\ Jerusalem\\ $\Box$ Double room (sharing with\dotfill ) $\Box$ Single room\\ $\Box$ Double room, please assign a room mate M/F Smoking/Non-Smoking\\ Check-in:\dotfill\ Check out:\dotfill\ No. of nights:\dotfill\ Total:\dotfill $\Box$ Arrival Assistance Reservation: Filght\dotfill \ Date \& Time\dotfill \\ Airline\dotfill\ Total:\dotfill \\ {\bf Optional Tours}\\ (must be accompanied by deposit of US\$25 per person for the pre- and post-conference tours)\\ Please reserve: \begin{tabular}{p{3in}l} \begin{tabular}{@{$\Box$}@{Tour }l@{/\# seats\ldots\ldots Total}p{0.5cm}} A &\ldots\ldots \\B &\ldots\ldots\\C &\ldots\ldots\\D &\ldots\ldots \end{tabular} & \begin{tabular}{@{$\Box$}@{Tour }l@{/\# seats\ldots\ldots Total}p{0.5cm}} E &\ldots\ldots\\ F &\ldots\ldots\\ G &\ldots\ldots\\ H &\ldots\ldots \end{tabular} \end{tabular} {\bf Payment}\\ $\Box$ I enclose a cheque of US\$\dotfill\ or equivalent, payable to Danit Tours \& Travel Ltd.\\ $\Box$ Enclosed is a copy of my bank transfer of US\$\dotfill\ or equivalent, payable to:\\ Danit Tours \& Travel Ltd., Union Bank of Israel, Bank no. 13, Branch 062, Acc. 486800/79 $\Box$ Please charge the amount of US\$\dotfill to my Credit Card\\ $\Box$ Visa \hfill $\Box$ Mastercard \hfill $\Box$ Diners Club\\ Credit Card number:\dotfill\ Expiration Date:\dotfill \\ Signature:\dotfill\ Date:\dotfill \newpage \begin{center} {\large 21st International Colloquium On Automata, Languages and\\ Programming Jerusalem, Israel, July 11--15, 1994} {\Large Registration Form} \end{center} Please type or write in BLOCK letters and send to:\\ Danit Tours and Travel Ltd., P.O. Box 57005, Tel-Aviv 61570, Israel\\ Tel: +972-3-5626470, Fax: +972-3-5612303 Last Name:\dotfill\ First Name:\dotfill \\ Title: $\Box$ Mr. $\Box$ Ms. $\Box$ Dr. $\Box$ Prof.\\ Institution:\dotfill \\ Mailing Address:\dotfill \\ City\dotfill\ State/Prov \dotfill\ Country\dotfill \\ Zip Code\dotfill\ Tel:\dotfill\ Fax:\dotfill \\ \\ {\bf Accompanyiong Persons}\\ Last Name:\dotfill\ First Name:\dotfill \\ Last Name:\dotfill\ First Name:\dotfill \\ {\bf Registration Fees:} (in US dollars) \begin{tabular}{lcc} & Payment before June 10 & Payment after June 11\\ Participants, Members & \$218 & \$240\\ Participants, Non-Members & \$240 & \$260\\ Students & \$80 & \$90 \\ Accompanying Persons & \$100 & \$150 \end{tabular} $\Box$ I plan to attend the CTRS Workshop, Thursday--Friday, July 14--15, 1994. {\bf Payment} $\Box$ I enclose a cheque of US\$\dotfill\ or equivalent, payable to DanKnassim Ltd.\\ $\Box$ Enclosed is a copy of my bank transfer of US\$\dotfill\ or equivalent, payable to:\\ Dan Knassim Ltd., Account No. 299100/16 (ICALP), Bank Leumi Le'Israel, Bank No. 10, Kikar Herut Branch (773), Jerusalem, Israel. $\Box$ Credit Card Payment --- {\bf Overseas Participants Only}\\ Please charge the amount of US\$\dotfill to my credit card: $\Box$ Visa \hfill $\Box$ Mastercard \\ Registered Name of Card Holder:\dotfill\\ Credit Card number:\dotfill\ Expiration Date:\dotfill \\ Signature:\dotfill\ Date:\dotfill \end{document} ------------------------------------------------------------------- Edna Wigderson Computation Center Hebrew University Jerusalem, Israel e-mail: edna@shum.cc.huji.ac.il PHONE: +972-2-584294 From fritsv@cwi.nl Wed Apr 13 14:17:09 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA00214; Wed, 13 Apr 94 06:20:23 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Wed, 13 Apr 1994 12:17:11 +0200 Received: by specht.cwi.nl id AA05896 (5.65b/3.8/CWI-Amsterdam); Wed, 13 Apr 1994 12:17:09 +0200 Date: Wed, 13 Apr 1994 12:17:09 +0200 Message-Id: <9404131017.AA05896=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Summer course From: joanne@theory.lcs.mit.edu (Joanne Talbot) -- SUMMER COURSE in DESIGN AND ANALYSIS OF DISTRIBUTED PROTOCOLS -- Prof. Nancy Lynch and Prof. Nir Shavit Massachusetts Institute of Technology Tel Aviv University --July 25-29, 1994-- This course is intended to familiarize programmers and system engineers with the theory underlying the design and analysis of distributed algorithms. The focus will be on message-passing protocols, the key communication paradigm in computing environments ranging from tightly coupled multiprocessors to local and wide area networks. The theory identifies typical problems for solution in message passing systems, and shows how to design and analyze protocols that solve them. Often, this involves using message passing systems to emulate simpler communication paradigms. The theory also identifies the inherent costs of solutions, and even shows that certain problems cannot be solved at all. The instructors for this course are Professor Nancy Lynch of the M.I.T. Department of Electrical Engineering and Computer Science and Professor Nir Shavit of the Tel Aviv University Computer Science Department. For further information, please contact: Joanne Talbot, joanne@theory.lcs.mit.edu or Director of the Summer Session Room E19-356 Massachusetts Institute of Technology Cambridge, MA 02139 (617)-253-2101 From fritsv@cwi.nl Wed Apr 13 14:19:31 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA00222; Wed, 13 Apr 94 06:22:41 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Wed, 13 Apr 1994 12:19:31 +0200 Received: by specht.cwi.nl id AA05903 (5.65b/3.8/CWI-Amsterdam); Wed, 13 Apr 1994 12:19:31 +0200 Date: Wed, 13 Apr 1994 12:19:31 +0200 Message-Id: <9404131019.AA05903=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Lecture Doron Peled From: robg@info.win.tue.nl (Rob Gerth) Technical University Eindhoven Department of Mathematics and Computing Science Computer Science-colloquium under the auspicies of the NFI project TRANSFER (NF-78) Speaker: Doron Peled (AT&T Bell Labs) Date: monday April 18, 1994 Time: 13.30 pm Location: Auditorium, room 15 Title: A hierarchy of partial order temporal properties Contact: robg@win.tue.nl Abstract: We propose a classification of partial order temporal properties into a hierarchy, which is a generalization of the safety-progress hierarchy of Chang, Manna and Pnueli. The classes of hierarchy are characterized through three views: language-theoretic, topological and temporal. Instead of the domain of strings, we take the domain of Mazurkiewicz traces, i.e., equivalence classes of strings with respect to the permutation equivalence) as a basis for our considerations. For the language-theoretic view, we propose operations on trace languages which define the four main classes of properties: safety, guarantee, persistence and response. These four classes are shown to correspond precisely to the two lower levels of the Borel hierarchy of the Scott topology of the domain of traces relativized to the infinite traces. In addition, a syntactic characterization of the classes is provided in terms of a sublogic of the Generalized Interleaving Set Temporal Logic GISTL (an extension of ISTL). We also prove that a class of properties containing the four classes mentioned above can be automatically verified by means of a model checking algorithm. From fritsv@cwi.nl Wed Apr 13 14:21:14 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA00230; Wed, 13 Apr 94 06:24:26 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Wed, 13 Apr 1994 12:21:16 +0200 Received: by specht.cwi.nl id AA05912 (5.65b/3.8/CWI-Amsterdam); Wed, 13 Apr 1994 12:21:14 +0200 Date: Wed, 13 Apr 1994 12:21:14 +0200 Message-Id: <9404131021.AA05912=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: FORTE'94 - Second Call for Papers From: Stefan Leue ------------------------------------------------------------------------------- * Submission deadline: 6 May 94 * FORTE'94 * Submission deadline: 6 May 94 * ------------------------------------------------------------------------------- Second Call for Papers IFIP WG6.1 Seventh International Conference on FORMAL DESCRIPTION TECHNIQUES for Distributed Systems and Communications Protocols Berne, Switzerland, 4-7 October 1994 FORTE'94 will address formal techniques applicable to Distributed Systems such as Estelle, Lotos, SDL, ASN.1, Z, Automata, Logics, Process, Algebras, etc., and will include industrial applicability to Protocols and Distributed Systems. The conference will be a forum for presentation of the state of the art in theory, application, tools and industrialization of Formal Techniques and will provide an excellent orientation for newcomers. Research papers and industrial usage reports as well as proposals for tutorials (advanced technology semi- nars), poster displays and tool demonstrations on Formal Techniques are soli- cited, particularly in the following areas: * Design and implementation * Extensions of FDTs * FDT-based software engineering * Verification, validation and testing * Comparative analyses of FDTs * Tools & tool support * Practical usage experience and case * Examples and analyses of formal des- studies criptions * Corporate strategic and financial * Real-time and probability aspects consequences of FDT use * Feature and service interaction prob- lems FORTE'94 will be sponsored by IFIP WG6.1 in cooperation with ACM SIGCOMM and IEEE Computer Society(*). Additional support will be provided by the corporate sponsors Alcatel STR, Siemens-Albis, ASCOM, Sun Microsystems and the Swiss PTT, as well as by the non-corporate sponsors Beer-Brawand Fund and the Swiss Natio- nal Science Foundation. The conference Proceedings will be published by the of- ficial publisher of IFIP WG6.1 Proceedings, presumably by Chapman & Hall, tit- led Formal Description Techniques, VII. FORTE'94 will start with one day of tu- torials and advanced technology seminars on 4 October 1994 and will continue with three days of technical presentations (no parallel sessions). Tool pre- sentations and poster displays will be offered throughout all four days of FORTE'94. The conference will be held in the main building of the University of Berne. (* = approval pending) Conference Chairperson: Dieter Hogrefe (University of Berne, CH) Conference Organization Chairperson: Stefan Leue (University of Berne, CH) Important dates: * 6 May 1994 Submission deadline (for more details see `Submission policy') * 11 July 1994 Notification of acceptance * 12 August 1994 Camera ready copy for participants proceedings due Program Committee: Paul Amer (University of Delaware, USA), Gregor v. Bochmann (University of Mon- treal, CDN), Tommaso Bolognesi (CNUCE, I), Ed Brinksma (University of Twente, NL), Ana Cavalli (INT, F), Jean-Pierre Courtiat (LAAS-CNRS, F), Piotr Dembinski (Polish Academy of Science, PL), Ove Faergemand (EURESCOM, D), Reinhard Gotz- hein (University of Kaiserslautern, D), Gerard Holzmann (AT&T Bell Labs, USA), Jean-Pierre Hubaux (EPF Lausanne, CH), Toshihiko Kato (KDD, J), Jan Kroon (PTT Research, NL), Luigi Logrippo (University of Ottawa, CDN), Nancy Lynch (MIT, USA), Lynn Marshall (BNR, CDN), Jan de Meer (GMD Fokus, D), Elie Najm (ENST, F), Linda Ness (Bellcore, USA), Ken Parker (Telecom Research Laboratory, AUS), Bjorn Pehrson (SICS, S), Claude Petitpierre (EPF Lausanne, CH), Juan Quemada (DIT ETSIT UPM, E), Harry Rudin (IBM Research, CH), Deepinder Sidhu (University of Maryland, USA), Richard Tenney (University of Massachusetts, USA), Ken Tur- ner (University of Stirling, UK), Umit Uyar (CUNY, USA), Son Vuong (University of British Columbia, CDN). Submission policy Solicited are: * Full original research papers and industrial usage reports, 5 copies, up to 16 pages (including bibliography), 12 point, single spaced, including an informative abstract as well as names and affiliations of all authors, and a list of keywords facilitating the assignment of papers to referees. The keyword list from which authors may choose the keywords for their papers can be obtained by sending a request to the FORTE'94 Organization Commit- tee or by copying the file `keyword.asc' by anonymous ftp as described be- low. A cover letter naming a contact author (including postal and email address) and indicating the preferred category (research paper or industri- al usage report) in which the paper should be considered, is required. The cover letter should also state that the paper has not been presented in any language at another conference nor is it currently being considered by an- other conference or by a journal. Authors may propose a list of Program Committee members whom they consider to be particularly qualified to review their submission. Only those papers presented by an author during FORTE'94 will be included in the final proceedings. * Proposals for tool demonstrations (including hard- and software require- ments), poster displays, tutorials and advanced technology seminars. * Submission deadline: 6 May 1994 * All submissions should be sent to: Stefan Leue, FORTE'94 Organization Committee (address see below). For further information: FORTE'94 Organization Committee, University of Berne, P.O. Box 900, CH-3000 Berne 9, Switzerland Tel.: +41 31 631 ~4994 (Dieter Hogrefe), ~4430 (Stefan Leue), ~3965 (Fax), Email: forte94@iam.unibe.ch. To obtain additional information (Postscript copy of the Call for Papers, key- word list, etc.) please login via ftp on host `siam.unibe.ch' as user `anony- mous' and give your email address as password, then get the appropriate file from directory `forte94' (for particular filenames see file `README'). --------------------- Expression of Interest in FORTE'94 ---------------------- If you are interested in FORTE'94, please return the following information to the Conference Organization Chairperson (preferably by email to forte94@iam. unibe.ch): Name (including title): ....................................................... Affiliation: .................................................................. Address: ...................................................................... Tel: .................. Fax: ................. Email: ......................... o I would like to receive further information about FORTE'94 by MAIL or ELEC- TRONIC MAIL (please indicate), please put me on your mailing lists. o I intend to submit to FORTE'94 a research paper / an industrial usage report / a proposition for a tool demonstration / a proposition for a poster display (please indicate category), entitled: ................................................................... ............................................................................. provisional author list / presented by: ..................................... o I would be interested in offering a tutorial / an advanced technology seminar entitled: ................................................................... ------------------------------------------------------------------------------- FORTE'94 ------------------------------------------------------------------------------- KEYWORD LIST ============ I. General Keywords: 1. Extensions of FDTs 2. Design and implementation 3. Verification, validation and testing 4. FDT-based software engineering 5. Comparative analyses of FDTs 6. Tools & Tool support 7. Practical usage experience and case studies 8. Examples and analyses of formal descriptions 9. Corporate strategic and financial consequences of FDT use 10. Real-time and probability aspects in FDTs 11. Feature and service interaction problems II. Languages: 1. Estelle 2. Lotos 3. SDL 4. Z 5. VDM 6. ASN.1 7. TTCN 8. L.0 9. UNITY 10. Statecharts 11. Message Sequence Charts 12. Other (please specify) III. Semantic models: 1. Automata and Languages 2. (Temporal) Logics 3. Process Algebras 4. Event structures 5. True concurrency semantics 6. Petri Nets 7. Other (please specify) IV. Miscellaneous: 1. FDTs and Performance Analysis 2. Protocol Synthesis 3. Test Case Generation 4. Conformance/Interoperability Testing 5. Communicating Processes 6. Algebraic Specification 7. Object Oriented Specification 8. Action Refinement 9. Architectural Concepts 10. Open Distributed Processing 11. Formalization of Standards 12. Network Management 13. Network Information Models 14. Visualization with FDTs REMARKS ======= 1. Authors of submissions to FORTE'94 are required to provide a list of keywords describing the contents of their paper. The keyword list should appear on the cover page of the paper. 2. Authors may select an arbitrary number of keywords from the above list. Please use the number code to indicate your keyword, for example `II.2' in case you wish to refer to `Lotos'. 3. Please also indicate cross-dependences, so if for example your paper is referring to `Tool & Tool support' for `SDL' only, but not for other languages, please list `..., I.6/II.3, ...'. 4. Should you wish to specify other languages / semantic models please indicate `..., II.11: my language, ...' or `..., III.7: my model, ...', respectively. Your effort to provide a meaningful keyword list is greatly appreciated. It helps in the assignment of your paper to reviewers who indicated their competence and interest in reviewing papers on the respective subject. If you have any further questions please do not hesitate to contact the FORTE'94 Organization Committee: FORTE'94 Organization Committee, University of Berne, P.O. Box 900, CH-3000 Berne 9, Switzerland Tel.: +41 31 631 ~4994 (Dieter Hogrefe), ~4430 (Stefan Leue), ~3965 (Fax), Email: forte94@iam.unibe.ch. ------------------------------------------------------------------------------- FORTE'94 ------------------------------------------------------------------------------- TUTORIAL / ADVANCED TECHNOLOGY SEMINAR ====================================== SUBMISSION POLICY ================= Those interested in holding a tutorial or advanced technology seminar at FORTE'94 are kindly requested to submit an abstract of up to 2 pages per hour of proposed presentation, giving a brief overview of their presentation. A literature list or a collection of papers covering the scope of the intended presentation may be appended, authors of proposals may also like to describe their own involvement in the topic discussed. The proposal should also specify the target audience of the tutorial. Submissions should be made by the paper submission deadline, namely May 6, 1994. The decision about acceptance of proposed tutorials will be made by the Program Committee, the notification will be as for research papers (around July 11, 1994). The Program and the Organization Committees of FORTE'94 reserve the right to additionally invite Tutorials. It is intended to compensate participants presenting tutorials for a major part of their expenses. The presentations should be planned to have a length of 120 minutes including refreshment breaks in the general case, or of 240 minutes if more substantial topics are being addressed. The proposals may include options so that the PC may decide to accept the presentation in its 120 mins or 240 mins variants. The presentations should primarily address an industrial audience and should be suited to introduce newcomers to the use of formal methods in the scope of FORTE. The presentations should therefore have a more practical than theoretical character. Presentations should also attempt to cover subjects or experiences not addressed at previous FORTE conferences. Proposals should be submitted by May 6, 1994 to: Stefan Leue FORTE'94 Organization Committee University of Berne P.O. Box 900 CH-3000 Berne 9 Switzerland Tel.: +41 31 631 44 30 Fax : ~39 65 Email: forte94@iam.unibe.ch From fritsv@cwi.nl Wed Apr 13 18:12:47 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA01487; Wed, 13 Apr 94 10:15:59 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Wed, 13 Apr 1994 16:12:48 +0200 Received: by specht.cwi.nl id AA06314 (5.65b/3.8/CWI-Amsterdam); Wed, 13 Apr 1994 16:12:47 +0200 Date: Wed, 13 Apr 1994 16:12:47 +0200 Message-Id: <9404131412.AA06314=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Report available by ftp or www From: alanje@cogs.susx.ac.uk (Alan Jeffrey) The following technical report is now available by anonymous ftp: A fully abstract semantics for concurrent graph reduction Alan Jeffrey This paper presents a fully abstract semantics for a variant of the untyped lambda-calculus with recursive declarations. We first present a summary of existing work on full abstrction for the untyped lambda-calculus, concentrating on Abramsky and Ong's work on the lazy lambda-calculus. Abramsky and Ong's work is based on leftmost outermost reduction without sharing. Thisis notably inefficient, and many implmenetations model sharing by reducing syntax graphs rather than syntax trees. Here we present a concurrent graph reduction algorithm for the lambda-calculus with recursive declarations, in a style similar to Berry and Boudol's Chemical Abstract Machine. We adapt Abramsky and Ong's techniques, and present a program logic an denotational semantics for the lambda-calculus with recursive declarations, and show that the three semantics are equivalent. An extended abstract of this paper will appear in this year's LICS. The paper is available by anonymous ftp from ftp.cogs.susx.ac.uk in pub/papers/compsci/cs1293.ps.Z. The list of all Sussex CS tech reports is available on the World-Wide Web in "http://www.cogs.susx.ac.uk/reports.html". NOTE: This tech report is very long (130pp printed 2up). The compressed PostScript file is 260K. Alan. Alan Jeffrey Tel: +44 273 606755 x 3238 alanje@cogs.susx.ac.uk School of Cognitive and Computing Sciences, Sussex Univ., Brighton BN1 9QH, UK From fritsv@cwi.nl Mon May 9 19:21:33 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA22825; Mon, 09 May 94 11:21:45 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Mon, 9 May 1994 17:21:34 +0200 Received: by specht.cwi.nl id AA01108 (5.65b/3.8/CWI-Amsterdam); Mon, 9 May 1994 17:21:33 +0200 Date: Mon, 9 May 1994 17:21:33 +0200 Message-Id: <9405091521.AA01108=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Position in Uppsala From: Bengt Jonsson Subject: Position as lecturer in Computer Science/ Computer Engineering at Uppsala University. Two POSITIONS AS LECTURER IN COMPUTER SCIENCE/COMPUTER ENGINEERING are available at the Department of Computer Systems at Uppsala University. THE POSITIONS entail - Teaching and Course/Curriculum Development at the Dept of Computer Systems. The department offers courses on assembly programming, computer architecture, operating systems, distributed systems, computer communications and protocols, real-time systems, computer security, compiler construction, introductory programming, theory of programming, formal methods for design of computer systems, and neural networks. Courses are offered to undergraduate students attending the M.Sc. programs of computer science, computer engineering, and of mathematics and natural sciences. - The applicant is expected to develop and pursue a research program. Funding for research must be obtained from external sources, e.g. research councils. In some cases, the department could contribute research funding from existing external grants. Present research at the department concerns archictectures and implementation strategies for distributed real-time systems and commuication protocols, formal methods and tools for design and analysis of distributed and real-time systems, and application and implementation of neural networks. THE DEPARTMENT of Computer Systems is nicely situated on a new campus, jointly with departments of computing science, numerical analysis, control theory, mathematics, and theoretical physics. SALARY will be determined according to qualifications. It is desirable that the applications includes salary expectations. FURTHER INFORMATION about positions, application, and the department is provided by prof. Bengt Jonsson (e-mail:bengt@docs.uu.se), by head of department Lars Asplund (e-mail asplund@docs.uu.se), or by director of undergraduate studies Mats Daniels (e-mail:matsd@docs.uu.se). Please enclose a resume, preferrably before May 10. From fritsv@cwi.nl Mon May 9 19:23:28 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA22873; Mon, 09 May 94 11:23:37 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Mon, 9 May 1994 17:23:28 +0200 Received: by specht.cwi.nl id AA01126 (5.65b/3.8/CWI-Amsterdam); Mon, 9 May 1994 17:23:28 +0200 Date: Mon, 9 May 1994 17:23:28 +0200 Message-Id: <9405091523.AA01126=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: final call for ACP94 From: acp94@fwi.uva.nl Dear Reader, For those that did not (yet) register for ACP94... Call for Participation A C P 9 4 Workshop on Algebra of Communicating Processes May 16 - 17, 1994 Utrecht University, Utrecht, The Netherlands ACP, the Algebra of Communicating Processes, is an algebraic approach to the study of concurrent processes initiated by Bergstra and Klop. The development of ACP in the past ten years has reached a stage that asks for a common platform on ACP matters. ACP94 is meant to provide an overview of the (current) research, design and application activities. Invited speakers at ACP94 are J.C.M. Baeten (Eindhoven University of Technology) R.J. van Glabbeek (Stanford University) J.F. Groote (Utrecht University) F.W. Vaandrager (CWI, University of Amsterdam) The programme committee of ACP94 selected ten papers for presentation. A copy of the material presented will be handed out at the workshop. The ACP94 organization is aiming at a published proceedings. Programme, Monday May 16 ------------------------ 09.00 - 09.45 Registration 09-45 - 10.00 Opening of ACP94 10.00 - 11.00 "Systematic verification of distributed systems in process algebra" J.F. Groote (Invited speaker, Utrecht University) 11.00 - 11.30 Break 11.30 - 12.00 "A correctness proof of the Bakery Protocol in mCRL" J.F. Groote (Utrecht University) H.P. Korver (CWI) 12.00 - 12.30 "Inductive proofs with sets, and some applications in process algebra" J.J. van Wamel (University of Amsterdam) 12.30 - 14.00 Lunch 14.00 - 15.00 "Timed process algebra = untimed process algebra + timer operators" F.W. Vaandrager (Inv. speaker, CWI & University of Amsterdam) 15.00 - 15.30 "Formal semantics of discrete absolute timed interworkings" J. van den Brink (University of Amsterdam) W.O.D. Griffioen (University of Amsterdam) 15.30 - 16.00 Break 16.00 - 16.30 "The ABP and the CABP -- a comparison of performances in real time process algebra" J.A. Hillebrand (University of Amsterdam) 16.30 - 17.00 "Real time process algebra with infinitesimals" J.C.M. Baeten (Eindhoven University of Technology) J.A. Bergstra (University of Amsterdam, Utrecht University) 17.00 ....... Drinks and workshop dinner. Information will be provided at the workshop. Programme, Tuesday May 17 ------------------------- 09.30 - 10.30 "On the expressiveness of ACP" R.J. van Glabbeek (Invited speaker, Stanford University, USA) 10.30 - 11.00 "Definability and Decidability in Process Algebra" J. Blanco (Eindhoven University of Technology) 11.00 - 11.30 Break 11.30 - 12.00 "A real time mCRL specification of a system for traffic regulation at signalized intersections" M.J. Koens (University of Amsterdam) L.H. Oei (University of Amsterdam) 12.00 - 12.30 "The implementation of process algebra specifications in C" C. Groza (Technical University of Timisoara, Romania) 12.30 - 14.00 Lunch 14.00 - 15.00 "Graph isomorphism models for non-interleaving process algebra" J.C.M. Baeten (Inv. speaker, Eindhoven Univ. of Technology) J.A. Bergstra (University of Amsterdam, Utrecht University) 15.00 - 15.30 "Process specification in a UNITY format" J.J. Brunekreef (University of Amsterdam) 15.30 - 16.00 Break 16.00 - 16.30 "Specification of dynamic leader election protocols in broadcast networks" J.J. Brunekreef (University of Amsterdam) J.P. Katoen (University of Twente) R.L.C. Koymans (Philips Research Laboratories) S. Mauw (Eindhoven University of Technology) 16.30 - 16.45 Closing of ACP94 Registration & Fee ------------------ To register for ACP94 contact the ACP94 secretariat: Mrs. Annemarie Besselink, Utrecht University, Department of Philosophy, Heidelberglaan 8, 3584 CS, Utrecht, The Netherlands. Phone : +31-30-535574 Fax : +31-30-532816 E-mail: annemarie.besselink@phil.ruu.nl. A registration form is appended at the end this call for participation. Please register *BEFORE* May 4, 1994. The registration fee is NLG 250. The registration fee covers attendance at all sessions, a copy of the proceedings (if to appear), all lunches, social events and workshop dinner. The registration fee for students is NLG 25 for just attending the sessions and lunches, and NLG 75 for attending the full programme. All payments, net of all charges, are to be made in Dutch Guilders (NLG) by - cash payment at the workshop, or - money transfer to postal giro 128693 of Universiteit Utrecht, Faculteit Wijsbegeerte, Heidelberglaan 8, 3584 CS, Utrecht, The Netherlands. Make sure ACP94 and your name are mentioned. Location & Travel ----------------- >From Utrecht Central Station there is a frequent bus service to the Utrecht University Campus, ``De Uithof''. The recommended bus services are 11, 12 or 12s; stop at busstop ``Bestuursgebouw''. You are now at the junction of two streets, the Heidelberglaan and the Bolognalaan. The Workshop will be held in meeting centre ``Zalencentrum Bologna'', Bolognalaan 2. Social Events ------------- All lunches will be served in the meeting centre. On Monday May 16, drinks will be served at the meeting centre after the last presentation that day. A dinner will be served on Monday May 16 in the centre of Utrecht. Precise location and travel information will be given at the workshop. Accommodation ------------- For booking accommodation you can contact the Tourist Information Office: VVV Utrecht, P.O. Box 19107, 3501 DC, Utrecht. Phone: +31-30-331544, Fax: +31-30-318843. In case you prefer to book a hotel yourself, some names and telephone numbers of hotels in Utrecht are listed below: Hotel Mitland +31-30-715824 Arienslaan 1, Utrecht Malie Hotel +31-30-316424 Maliestraat 2-4, Utrecht Hotel Smits +31-30-331232 Vredenburg 14, Utrecht Hotel Ouwi +31-30-716303 F.C. Dondersstraat 12, Utrecht Organisation ------------ The programme committee of ACP94 consists of I. Bethke (CWI, Utrecht University) J.W. Klop (CWI, Free University - Amsterdam) S. Mauw (Eindhoven University of Technology) J.C. Mulder (Eindhoven University of Technology) A. Ponse (University of Amsterdam) C. Verhoef (Eindhoven University of Technology) S.F.M. van Vlijmen (Utrecht University) ACP94 is organized with financial support of Nationale Faciliteit Informatica (NFI) University of Amsterdam Utrecht University ACP94 is organized by A. Ponse, C. Verhoef and S.F.M. van Vlijmen. Registration form for ACP94 --------------------------- Name ...........................(last).......................(first) Affiliation ........................................................ Address ............................................................ Postal code ......... City ......................................... Country ............................................................ E-mail ............................................................. Telephone ......................Fax ................................ Special Request .................................................... .................................................................... .................................................................... 0 I transfer the registration fee to your postal giro account 0 I pay cash at the workshop For students only: 0 I will attend the sessions and lunches: NLG 25 0 I will attend the full program: NLG 75 Date ............................................................... Signature .......................................................... From fritsv@cwi.nl Mon May 9 19:25:20 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA22945; Mon, 09 May 94 11:26:21 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Mon, 9 May 1994 17:25:20 +0200 Received: by specht.cwi.nl id AA01134 (5.65b/3.8/CWI-Amsterdam); Mon, 9 May 1994 17:25:20 +0200 Date: Mon, 9 May 1994 17:25:20 +0200 Message-Id: <9405091525.AA01134=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Conference Announcment -- CAV 94 From: dill@hohum.stanford.edu (David Dill) CONFERENCE ANNOUNCEMENT Conference on Computer-Aided Verification CAV 1994 Stanford University June 21-23, 1994 ------------------------------------------------------------------------------ The Sixth Conference on Computer-Aided Verification will be held June 21-23 at Stanford University. The conference will be followed on June 24th by a one-day workshop on practical aspects of computer-aided formal verification. CAV 94 is sponsored by a group of companies with a strong interest in the topic area: AT&T, IBM, Intel, Motorola, Redwood Design Automation and Sun Microsystems. IMPORTANT NOTE: World Cup matches will be held at Stanford on June 20th and 24th, which will contribute to congestion both locally and in air travel. Please make your flight reservations as soon as possible! WORKSHOP: On Friday, June 24th, there will be a one-day workshop consisting of presentations by both developers and users of formal verification tools, with special emphasis on experiences on applications. This is still being arranged -- more details will follow shortly. LOCATION: The conference will be held on the Stanford campus. Stanford will provide housing and food for participants in student residences. Participants may opt to stay in local hotels, but rooms will be scarce due to the World Cup Finals being held in the area at that time. The Stanford Campus is about 30-40 minutes drive from two major international airports, San Francisco and San Jose. Commercial shuttle service is available. REGISTRATION: Please complete the attached reservation form and either email or physically mail it with payment to the appropriate address. HOUSING: We strongly encourage participants to stay on campus to promote interaction with other conference participants. The cost of rooms and all meals (except for dinner on Wednesday night) will be $217 for three days and nights. A room may be reserved for the night of Thursday, June 23, for an additional $39. There is also a $50 key deposit that will be refunded upon checkout. A few rooms may be reserved for subsequent nights (for participants who wish to tour the Bay area), depending on availability. Dinner on Wednesday will be a banquet at another site (transportation will be provided). Student registration does NOT include the banquet Wednesday. PARKING: Parking permits will be available on request at registration. Parking is available near the dorms. CLIMATE: The weather will almost certainly be 72-80 degrees (F) with cloudless skies. It generally cools down significantly in the evenings (in the 50s), so a sweater is helpful if you are out in the evening. At other places in the Bay area (e.g. parts San Francisco), it can by foggy and very cool. FURTHER INFORMATION: You can send electronic mail to "cav@hohum.stanford.edu" if you have further questions about the conference. ---------------------------------------------------------------- REGISTRATION If you are paying by credit card, you may return this registration form by electronic mail to "cav-registration@hohum.stanford.edu" Otherwise, physically mail the form along with payment in the form of a VISA or MasterCard number, a check drawn on a U.S. bank, or an international money order (in U.S. dollars) to Events Plus and mail it to Events Plus attn: Cecilia Sanchez 540 Valley Way Milpitas, CA 95035 USA Events Plus can be contacted at the above address. Their telephone is (408) 262 8109 and fax is (408) 262 8344. Please contact Events Plus for special arrangements (e.g. hotel rooms after the conference). The registration form is due May 20. Timely registration is important to make sure we have reserved adequate rooms. There is also a limit on the number who can attend the banquet. Name: _____________________________________________________ Affiliation: ______________________________________________ Address: __________________________________________________ ___________________________________________________________ Country: __________________________________________________ Phone: _______________________ Fax: _______________________ (please include country and city code) Email: ____________________________________________________ For room assignment: Are you: Male Female Confirmation will be sent to you by email. Regular advanced registration: $200 $___ Late registration: $250 $___ Student registration: $150 $___ Housing&Meals June 20-22 $267 $___ (excl. banquet, incl. $50 refundable key deposit) Housing June 23 $39 $___ TOTAL $___ Would you like to pay by VISA [ ] or MasterCard [ ]? If so, what is the number? _______________________________ expiration date ______, daytime telephone _________________ Do you have any special dietary requirements? Vegetarian [ ] Kosher [ ] Other: ___________________ TECHNICAL PROGRAM This is the final program. However, there may be last-minute changes in the schedule. Monday June 20, 1994 8 - 10 PM Reception and registration --------------------------------------------------------------- Tuesday June 21, 1994 8:30 Late registration 9 AM Welcome Session 1: 9:15 -- 10:45 9:15 - 9:45: "A Determinizable Class of Timed Automata" R. Alur and L. Fix and T. A. Henzinger 9:45 - 10:15: "Real-Time System Verification Using P/T Nets" R. Gorrieri and G. Siliprandi 10:15 - 10:45: "Criteria for the Simple Path Property in Timed Automata" W. K.C. Lam and R. K. Brayton BREAK: 10:45 - 11:15 Session 2: 11:00 - 12:30 11:00 - 11:30: "Hierarchical Representations of Discrete Functions, with Application to Model Checking" K. L. McMillan 11:30 - 12:00: "Symbolic Verification with Periodic Sets" B. Boigelot and P. Wolper 12:00 - 12:30: "Automatic Verification of Pipelined Microprocessor Control" J. R. Burch and D. L. Dill LUNCH: 12:30 -- 2:00 Session 3: 2:00 - 4:00 2:00 - 2:30: "Using Abstractions for the Verification of Linear Hybrid Systems" A. Olivero, J. Sifakis and S. Yovine 2:30 - 3:00: "Decidability of Hybrid Systems with Rectangular Differential Inclusions" A. Puri and P. Varaiya 3:00 - 3:30 "Suspension Automata: A Decidable Class of Hybrid Automata" J. McManis and P. Varaiya 3:30 - 4:00 "Verification of Context-Free Timed Systems Using Linear Hybrid Observers" A. Bouajjani, R. Echahed, and R. Robbana BREAK: 4:00 - 6:00 Session 4: 4:30 - 6:00 Chair: A. Emerson 4:30 - 5:00 "On the Random Walk Method for Protocol Testing" M. Mihail and C. H. Papadimitriou 5:00 - 5:30 "An Automata-Theoretic Approach to Branching-Time Model Checking" O. Bernholtz, M. Y. Vardi, and P. Wolper 5:30 - 6:00 "Realizability and Synthesis of Reactive Modules" A. Anuchitanukul and Z. Manna 7:00 PM Dinner After dinner: Software demos ---------------------------------------------------------------- Wednesday, June 22, 1994 Session 5: 8:30 - 10:00 8:30 - 9:00 "Methodology and System for Practical Formal Verification of Reactive Hardware" I. Beer, S. Ben-David, D. Geist, R. Gewirtzman, and M. Yoeli 9:00 - 9:30 "Modeling and Verification of a Real Life Protocol Using Symbolic Model Checking", V. G. Naik and A. P. Sistla 9:30 - 10:00 "Verification of a Distributed Cache Memory by using Abstractions", S. Graf BREAK 10:00 - 10:30 Invited talk: 10:30 - 11:30 "Beyond Model Checking" Z. Manna, Stanford University Session 6: 11:30 -- 12:30 11:30 - 12:00 "Models Whose Checks Don't Explode" R. P. Kurshan 12:00 - 12:30 "On the Automatic Computation of Network Invariants" F. Balarin and A. L. Sangiovanni-Vincentelli LUNCH 12:30 -- 1:30 Session 7: 1:30 -- 3:00 1:30 - 2:00 "Ground Temporal Logic: A Logic for Hardware Verification" D. Cyrluk and P. Narendran 2:00 - 2:30 "A Hybrid Model for Reasoning about Composed Hardware Systems" E. T. Schubert 2:30 - 3:00 "Composing Symbolic Trajectory Evaluation Results" S. Hazelhurst and C-J. H. Seger Session 8: 3:00 - 5:30 Chair: R. Bryant 3:00 - 3:30 "The Completeness of a Hardware Inference System" Z. Zhu and C-J. H. Seger 3:30 - 4:00 "Efficient Model Checking by Automated Ordering of Transition Relation Partitions" D. Geist and I. Beer 4:00 - 4:30 "The Verification Problem for Replaceability" V. Singhal and C. Pixley EXCURSION AND BANQUET 6:00 -- ? ---------------------------------------------------------------- Thursday, June 23. 1994 Session 9: 9:00 - 10:00 8:30 - 9:00 "Formula-Dependent Equivalence for Compositional CTL Model Checking", A. Aziz, T. R. Shiple, V. Singhal, and A. L. Sangiovanni-Vincentelli 9:00 - 9:30 "An Improved Algorithm for the Evaluation of Fixpoint Expressions", D. E. Long, A. Browne, E. M. Clarke, S. Jha, and W. R. Marrero 9:30 - 10:00 "Incremental Model Checking in Modal Mu-Calculus", O. V. Sokolsky and S. A. Smolka BREAK: 10:00 - 10:30 Session 10: 10:30 - 12:30 10:30 - 11:00 "Performance Improvement of State Space Exploration by Regular and Differential Hashing Functions" B. Cousin and J. H\'{e}lary 11:00 - 11:30 "Combining Partial Order Reductions with On-the-fly Model-Checking" D. Peled 11:30 - 12:00 "Improving Language Containment Using Fairness Graphs" R. Hojati, R. Mueller-Thuns, and R. K. Brayton 12:00 - 12:30 "A Parallel Algorithm for Relational Coarsest Partition Problems and Its Implementation" I. Lee and S. Rajasekaran LUNCH 12:30 - 2:00 Session 11: 2:00 - 3:30 2:00 - 2:30 "Another Look at LTL Model Checking" E. Clarke, O. Grumberg, and K. Hamaguchi 2:30 - 3:00 "The Mobility Workbench: A Tool for the Pi-Calculus" B. Victor and F. Moller 3:00 - 3:30 "Model Checking of Macro Processes" H. Hungar Session: 12: 3:30 - 4:30 3:00 - 3:30 "Compositional Semantics of Esterel and Verification by Compositional Reductions" R. de Simone and A. Resouche 3:30 - 4:00 "Design of a VHDL/S Model Checker Based on Adaptive State and Data Abstraction" D. Dams, R. Gerth, G. D\"{o}hmen, R. Herrmann, P. Kelb and H. Pargmann 4:00 - 4:30 "Automatic Verification of Timed Circuits" T. G. Rokicki and C. J. Myers * END OF CONFERENCE * -------------------------------------------- Friday, June 24, 1994 Workshop on Practical Aspects of Formal Verification Stanford University 9:00 -- 5:00 PM The workshop will be a series of series of presentations and discussions on formal verification tools and practical applications of them in industry. We hope to emerge with a clearer view of the state of the art of practical formal verification, and where things are headed. The following people have already agreed to speak. There will be more on the schedule later. Ken McMillan (Cadence Laboratories) Carl Pixley (Motorola) Andreas Nowatzyk (Sun Microsystems) Robert Kurshan (AT&T) Ze'ev Shtadtler (Intel) David Dill (Stanford) From fritsv@cwi.nl Mon May 9 19:28:00 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA22992; Mon, 09 May 94 11:28:19 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Mon, 9 May 1994 17:28:01 +0200 Received: by specht.cwi.nl id AA01141 (5.65b/3.8/CWI-Amsterdam); Mon, 9 May 1994 17:28:00 +0200 Date: Mon, 9 May 1994 17:28:00 +0200 Message-Id: <9405091528.AA01141=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: AMAST 95 Call For Papers (ASCII Format) From: subbu@cs.concordia.ca Call for Papers Fourth International Conference on Algebraic Methodology and Software Technology, AMAST'95 July 3-7,1995 Montreal, Canada Goals A major goal of the AMAST Conference consists in putting software development technology on firm, mathematical foundations. Particular emphasis is given to algebraic and logical foundations of software technology. An eventual goal is to establish algebraic and logical methodology as a practically viable and attractive alternative to the prevailing ad-hoc approaches to software engineering. The benefits accruing from such formal foundations will be clearly wide reaching and both academia and industry are expected to benefit from this. The previous three editions of AMAST were held at the University of Iowa (1989 and 1991) and at the University of Twente, The Netherlands in 1993. During the previous three meetings, AMAST has attracted researchers and practitioners interested in algebra, logic, formal methods, specification and verification of concurrent and reactive systems, constraint programming, semantics, category theory, logic programming, process algebra, etc. Since 1993, an organizational novelty of AMAST has been to promote simultaneous co-operative effort between Europe and America in this venture, bringing the conference to a truly international level. In addition, the first day of the conference is dedicated to Mathematics Education for Software Engineers. Following this successful trend, the fourth AMAST International Conference is to be held at Concordia University, Montreal, Canada, during July 3-7, 1995. Montreal is renowned for its cultural richness, numerous museums, and its unique multicultural setting, to name a few. Montreal offers a variety of attractions for tourists throughout the year. The highlights in July include the world-famous International Jazz Festival. Submissions We invite papers reporting original research in algebra and logic, suitable as a foundation for software technology, as well as software technologies developed by means of logic and algebraic methodologies. The paper should not have been published elsewhere previously and should not be under review for publication elsewhere. We also solicit submissions of system demonstration showing the improved effectiveness of software developed on a mathematical basis. The topics of interest include, but not limited to, the following. 1. ALGEBRAIC AND LOGICAL FOUNDATIONS .algebraic logic .algebraic methodologies for languages and systems .logical frameworks for reasoning .category theory .relation algebra .logics of programs 2. CONCURRENT AND REACTIVE SYSTEMS .linear and modal logics .algebraic approaches .object oriented models .modular verification 3. SOFTWARE TECHNOLOGY .logic, functional, and object paradigms .specification languages and tools .formal specification case studies .abstraction for software documentation and reuse .theorem proving systems .integration of pragmatic and formal methods 4. LOGIC PROGRAMMING .semantics .logic programming extensions .constraints and concurrency .program verification and transformation .temporal and deductive databases We invite prospective authors to submit 6 copies of previously unpublished papers of high quality (15 double spaced pages maximum) in an area relevant to the conference theme. The paper should provide adequate information for the reviewers to assess the significance and anticipated impact on the foundations of software technology. All papers will be refereed by the program committee, and will be judged based on their significance, technical merit, and relevance to the conference. All submissions (both papers and system demo proposals) must be sent to the program chair at the address below; papers must be received by November 15, 1994 and system demo proposals must be received by December 15, 1994. V.S. Alagar AMAST'95 Program Chair Department of Computer Science Concordia University 1455 De Maisonneuve Blvd. West Montreal, Quebec H3G 1M8 CANADA Phone: (514) 848-3022 Fax: (514) 848-2830 e-mail: amast95-info@cs.concordia.ca General Chair: Maurice Nivat (France). Program Chair: V.S. Alagar (Canada) Program Committee : Martin Abadi (USA) Gregor Bochmann (Canada) Chris Brink (South Africa) Pierre Deransart (France) Michael Ferguson (Canada) Kokichi Futatsugi (Japan) Nicolas Halbwachs (France) Armando Haeberer (Brazil) Jiawei Han (Canada) Deepak Kapur (USA) Helene Kirchner (France) Laks V.S. Lakshmanan (Canada) Giorgio Levi (Italy) Luigi Logrippo (Canada) Silvio Lemos Meira (Brazil) Jose Meseguer (USA) Hafedh Mili (Canada) Rokia Missaoui (Canada) Peter Mosses (Denmark) Istvan Nemeti (Hungary) Rocco De Nicola (Italy) Prakash Panangadan (Canada) Don Pigozzi (USA) R. Ramanujam (India) R.K. Shyamasundar (India) Andrzej Tarlecki (Poland) Frits Vaandrager (Netherlands) Martin Wirsing (Germany) Organizing Committee: (Preliminary) Chair: Teodor Rus (USA) e-mail: rus@herky.cs.uiowa.edu Tools and Demos Chair: Peter Grogono (Canada) Finance Chair: T. Radhakrishnan (Canada) Publicity Chair: Charles Rattray (UK) Michel Bidoit (France) Pankaj Goyal (USA) Pippo Scollo (Australia) Ralph Wachter (USA) Local Arrangements: (Preliminary) Chair: Rokia Missaoui (Canada) A. Das (Canada) Invited Speakers (Partial List) To achieve the goal of the conference we aim to provide a forum in which leading researchers in mathematics, computer science, and software development, will come together to identify algebraic and logical methodologies that are applicable as viable alternatives to the present software development approaches and to discuss the appropriateness of such alternatives with a view to implementation. Invited speakers, with a tentative indication of the topic areas, include Krzysztof Apt (Logic Programming) Ewa Orlowska (Algebraic Logic) Rohit Parikh (Logic and Concurrency) Important Dates: Submission of Papers: November 15, 1994 Submission of System Demo Proposals: December 15, 1994 Notification of Acceptance/Rejection: February 1, 1995 Camera-ready Version of Accepted Papers: March 15, 1995 Education Day: July 3, 1995 Conference Days: July 4-7, 1995 Proceedings to be published by Springer-Verlag. Further Information: For bulletins on current status of the conference: amast95-info@cs.concordia.ca Tools and Demos: grogono@cs.concordia.ca Registration: krishnan@cs.concordia.ca Local Arrangements: missaoui.rokia@uqam.ca For subscribing to amast mailing list: amast95-request@cs.concordia.ca From fritsv@cwi.nl Mon May 9 19:29:48 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA23023; Mon, 09 May 94 11:30:12 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Mon, 9 May 1994 17:29:50 +0200 Received: by specht.cwi.nl id AA01147 (5.65b/3.8/CWI-Amsterdam); Mon, 9 May 1994 17:29:48 +0200 Date: Mon, 9 May 1994 17:29:48 +0200 Message-Id: <9405091529.AA01147=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Isabelle course -- final call From: Lawrence C Paulson Dear Colleague, Please forward the attached course announcement. The course is about the theorem prover Isabelle. It will be held one week after LICS and two weeks after CADE, to facilitate travel arrangements. Please send technical questions to Larry.Paulson@cl.cam.ac.uk and administrative ones to rt10005@phx.cam.ac.uk. I apologize for multiple copies. Larry Paulson ------------------------------------------------------------------------------ UNIVERSITY OF CAMBRIDGE Programme for Industry Introduction to Theorem Proving, using "Isabelle" 11-13 July 1994 Course fee 650 pounds sterling (350 pounds sterling for academic participants) AIM OF THE COURSE Theorem proving systems are growing in popularity and are demonstrating their utility in many fields: hardware/software verification, protocol verification, program synthesis, artificial intelligence, and mathematics research. The aim of this course is to introduce participants to the Isabelle system, developed at Cambridge University, and used since 1986 in research establishments. Isabelle has built-in support for several logics, including first-order logic (FOL), higher-order logic (HOL), Zermelo-Fraenkel set theory (ZF) and extensional Constructive Type Theory (CTT). New logics can also be introduced by specifying their abstract syntax, notation, and inference rules. This feature makes Isabelle uniquely flexible, applicable to many domains. OUTLINE OF THE COURSE The course is highly practical, with a large proportion of teaching taking place as hands-on sessions conducted on X workstations. The lectures and terminal sessions will enable participants to perform their own Isabelle proofs in higher-order logic. The projected course outline includes: Single-step proof checking. How to perform rewriting. Theory. Types and type classes. How to make simple definitions. How to define new logics. Advanced proof tools. The course will be taught by Dr Lawrence Paulson, the originator of Isabelle. WHO SHOULD ATTEND The course is intended for researchers, academic and industrial, in the fields of computer science and logic. Participants must have experience with X workstation environments and should also be familiar with elementary logic. Experience with a functional programming language such as ML would be helpful, but not essential. COURSE FEES AND ACCOMMODATION The course fee is 650 pounds sterling (350 pounds sterling for academics) payable in advance and includes a full set of course notes, a certificate of attendance, lunch, and day-time refreshments for the duration of the course. Accommodation can be arranged for delegates in single college rooms with shared facilities at 176 pounds sterling for 3 nights in Peterhouse college from Sunday July 10, to include bed and breakfast, dinner with wine and a Course Dinner. If you would prefer to make your own arrangements, please indicate on the registration form and details of local hotels will be sent to you. LOCATION The course will be held at the Department of Engineering, University of Cambridge. Access to Cambridge by air is possible direct from Amsterdam, and via Stansted Airport from many other European cities. Frequent bus services are available from Heathrow and Gatwick Airports. Rail and road communications to Cambridge are excellent; however, car parking in Cambridge is limited. Full directions will be sent with course joining instructions. REGISTRATIONS The number of places available on the course are limited to 20. You can make a provisional reservation on the course by telephone, fax or e-mail. All provisional places must be confirmed by completing and returning the tear-off slip below together with a company purchase order or full payment. METHODS OF PAYMENT Payments should be made by: A cheque drawn on a UK bank VISA or Mastercard/Eurocard Sterling travellers' cheques The University reserves the right to retrieve any bank charges or exchange costs which arise from payments made in other ways (including Eurocheques). Personal cheques drawn on banks outside the UK will not be accepted. Please do not send cash. Cheques or orders should be made payable to University of Cambridge/EYA. CANCELLATIONS Half the registration fee will be returned for bookings cancelled up to one calendar month in advance of the course. After this time no fees are returnable. However, substitutions may be made at any time. ------------------------------------------------------------------------------ I wish to register for the course: Introduction to Theorem Proving, using "Isabelle" Title (Dr, Mr, Ms etc): Name: First Names: Job Title: Company: Division: Address: Post Code: Tel. No: Fax. No: E-mail address: _____ Please reserve one place and accommodation for 3 nights. I enclose a cheque/purchase order for _______, made payable to the University of Cambridge/EYA. _____ Please reserve one place and send details of local hotels. I enclose a cheque/purchase order for _______, made payable to the University of Cambridge/EYA. _____ Please reserve one place at the Course Dinner (for delegates not resident at Peterhouse College) @ 30 pounds sterling. I have the following special requirements concerning diet or disabilities: Total Amount Enclosed: ____________ Return to : The Course Administrator, Cambridge Programme for Industry, University of Cambridge, 1 Trumpington St, Cambridge CB2 1QA Tel no +44 (0)223 332722 Fax +44 (0)223 301122 e-mail: rt10005@phx.cam.ac.uk From fritsv@cwi.nl Mon May 9 19:35:34 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA23098; Mon, 09 May 94 11:35:53 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Mon, 9 May 1994 17:35:34 +0200 Received: by specht.cwi.nl id AA01164 (5.65b/3.8/CWI-Amsterdam); Mon, 9 May 1994 17:35:34 +0200 Date: Mon, 9 May 1994 17:35:34 +0200 Message-Id: <9405091535.AA01164=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: ICLP 94 registration From: fosca@orione.cnuce.cnr.it (Fosca Giannotti) Please find enclosed the program of the ICLP'94, the registration and accommodation forms. We apologize if you receive this more than once. ------------------------------------------------------------------------------- International Conference on Logic Programming ICLP '94 Santa Margherita Ligure, Italy 13-18 June 1994 -------------------------------------------------------------------------------- Sponsored by the Association of Logic Programming and the Prolog Vendors Group Organized by: DISI - University of Genova DIST - Univesity of Genova IMA-CNR, Genova Supported by: CNR -------------------------------------------------------------------------------- Final Program -------------------------------------------------------------------------------- General Chair Maurizio Martelli, DISI, University of Genova martelli@disi.unige.it Program Chair Pascal Van Hentenryck, Brown University pvh@cs.brown.edu Workshop Chair Catuscia Palamidessi, DISI, University of Genova catuscia@di.unipi.it Poster Chair Lee Naish, University of Melbourne lee@cs.mu.oz.au Publicity Chair Fosca Giannotti, CNUCE-CNR, Pisa fosca@cnuce.cnr.it Organizing Committee Rosa Maria Bottino, IMA-CNR, Genova Giorgio Delzanno, DISI, University of Genova Giuseppe Marino, DIST, University of Genova Alessandro Messora, DISI, University of Genova Giancarlo Colla, DIST, University of Genova Program Committee Khayri Ali, Sweden Maurice Bruynooghe, Belgium Philippe Codognet, France Yves Deville, Belgium Herve Gallaire, France Chris Hogger, UK Joxan Jaffar, USA Giorgio Levi, Italy Jan Maluszynski, Sweden Kim Marriott, Australia Maurizio Martelli, Italy Lee Naish, Australia Frank Pfenning, USA David Poole, Canada Antonio Porto, Portugal Raghu Ramakrishnan, USA Mario Rodriguez-Artalejo, Spain Gert Smolka, Germany V.S. Subrahmanian, USA Peter Szeredi, Hungary Evan Tick, USA Kazunori Ueda, Japan Pascal Van Hentenryck , USA Peter Van Roy, France Andrei Voronkov, Sweden Mark Wallace, Germany Rong Yang, UK Conference Secretariat Piera Ponta Consorzio Genova Ricerche via dell'Acciaio 139 16152 Genova, Italy Email: ponta@infmge.ge.infn.it Phone: +39 10 6514000 Fax: +39 10 6512981, 6503801 -------------------------------------------------------------------------------- Welcome to the International Conference on Logic Programming - 1994 Logic programming originates from the discovery that a subset of predicate logic could be given a procedural interpretation which was first embodied in the programming language Prolog. The unique features of logic programming make it appealing for numerous applications in artificial intelligence, computer-aided design and verification, databases and operations research as well as to explore parallel and concurrent computing. The last two decades have witnessed substantial developments in this field from its foundation to implementation, applications, and the exploration of new language designs. ICLP'94 is the eleventh international conference on logic programming and is one of the two major annual international conferences reporting recent research results in logic programming. Sponsored by the Association of Logic Programming (ALP) and the Prolog Vendors Group, it has been organized by DISI, DIST (departments of the University of Genova) and IMA (Institute for Applied Mathematics of CNR); the CNR (National Research Council of Italy), with its institutes and national committees, has given a strong support to the conference. The technical program for the conference includes 43 refereed papers (arranged in two parallel sessions), various poster presentations and 4 invited lectures by Z. Manna (Stanford), A. Mackworth (UBC), J. Wing (CMU) and S. Peyton Jones (Glasgow). The conference presents also 4 advanced tutorials and an industrial session with important contributions from people really involved in applications. The opportunities to discuss various scientific themes during this week will be enhanced by the organization of 12 post conference workshops on some of the most up-to-date subjects in the field. The opportunity to enjoy Italy and, hopefully, to have also a good time during the conference is given by the choice of the place and by some events scheduled as part of the social program. ICLP'94 takes place in Santa Margherita Ligure, a small town in the Italian Riviera not far from Genova, the largest city of Liguria. Close to the conference site is the worldwide famous village of Portofino, pearl of the Mediterranean Sea and marine natural park; not far from Santa Margherita is also the pleasant resort area of "Cinque Terre", consisting of five picturesque villages on the rocky coast which can be reached by train or boat only. The social program includes an excursion to one of the oldest villages in the nearby coast (S. Fruttuoso) which also can be reached by boat only. The banquet will be held in one of the most important old building in Genova with the possibility to visit it. Italy is well known to be attractive from many points of view, particularly in June, but this is not the main motivation for having for the first time ICLP in Italy. Our Logic Programming community is one of the largest in the world as witnessed by the GULP association (the Italian society affiliated to ALP) and this event is the result of all the efforts that many people have put into the development of Logic Programming and GULP. On behalf of all the colleagues who contribute to the organization of ICLP'94, I welcome all participants and wish them a nice and successful conference. Maurizio Martelli -------------------------------------------------------------------------------- Scientific Programme SUNDAY, JUNE 12 18.00-21.00 Registration 19.30 Welcome Cocktail MONDAY, JUNE 13 8.30-9.00 Welcome Session 9.00-10.00 Invited Talk The Role of Logic Programming in Software Engineering J. Wing (CMU) chair: H. Gallaire 10.00-10.30 Coffee Break 10.30-12.30 Session Semantics I Chair: G. Levi * Splitting a Logic Program V. Lifschitz, H. Turner * Language Independence and Language Tolerance in Logic Programs N. McCain, H. Turner * Computing Stable Models by Program Transformation J. Stuber * Declarative Interpretations reconsidered K. Apt, M. Gabbrielli 10.30-12.30 Session Parallelism Chair: K. Ali * ACE: And/Or-parallel Copying-based Execution of Logic Programs G. Gupta, E. Pontelli, M. Hermenegildo, V. Santos Costa * Hybrid Tree Search in the Andorra Model R. Moolenaar, B. Demoen * Parallel CLP on Heterogeneous Networks S. Mudambi, J. Schimpf * PDP: Prolog Distributed Processor for Independent AND/OR parallel Execution of Prolog L. Araujo, J. Ruz 12.30-14.00 Lunch Break 14.00-15.30 Tutorial Chair: R. Yang * Implementation of Andorra-based Languages S. Janson 14.00-15.30 Tutorial Chair: C. Hogger * Synthesis of Logic Programs K.K. Lau, G. Wiggins 15.30-16.00 Coffee Break 16.00-17.30 Session Implementation Chair: P. Van Roy * On the Scheme of Passing Arguments in Stack Frames for Prolog N. Zhou * Output Value Placement in Moded Logic Programs P. Bigot, D. Gudeman, S. Debray * Native Code Compilation in SICStus Prolog R.C. Haygood 16.00-17.30 Section Parallel Actions Chair: M. Rodriguez Artalejo * Representing Actions in Equational Logic Programming M. Thielscher * Representing continuous change in the abductive event calculus K. Van Belleghem, M. Denecker, D. De Schreye * Concurrency and plan generation in a linear logic programming language with a sequential operator A. Guglielmi 18:00-19:30 ALP General Meeting followed by GULP Meeting TUESDAY, JUNE 14 8.45-9.45 Invited Talk S. Peyton-Jones (Glasgow) Manipulating Mutable State in a Purely Functional Language Chair: E. Tick 9.45-10.00 Coffee Break 10.00-12.00 Session Semantics II Chair: A. Voronkov * Computing Annotated Logic Programs: Theory and Implementation S. Leach, J. Lu * Conditonal Logic Programming D. Gabbay, L. Giordano, A. Martelli, N. Olivetti * Causal Models of Disjunctive Logic Programs J. Dix, G. Gottlob, V. Marek * An Axiomatic Approach to Se-mantics of Disjunctive Programs J. Dix, M. Mueller 10.00 - 12.00 Session Constraints I Chair: J. Jaffar * Finding Conflict Sets and Backtrack Points in CLP(R) J. Burg, S. Lang * Entailment of Finite Domain Constraints B. Carlson, M. Carlsson, D. Diaz * Notes on the Design of an Open Boolean Solver A. Rauzy * Improved CLP Scheduling with Task Intervals Y. Caseau, F. Laburthe 12.00-13.15 Lunch Break 13.15-16.15 Industrial Section Char: P. Van Hentenryck * Application of Logic Programming at British Telecom B. Crabtree * Overview of the Prolog Application Conference L. Sterling * Industrial Applications of CLP M. Dincbas * Industrial Applications of Declarative Programming in Sweden H. Nilson 17.00 Excursion WEDNESDAY, JUNE 15 9.00 -10.00 Invited Talk Z. Manna (Stanford) Specification and Verification of Real-Time Systems Chair: V.S. Subrahmanian 10.00 -10.30 Coffee Break 10.30-12.30 Session Abduction & Negation Chair: M. Wallace * Equivalence between Disjunctive and Abductive Logic Programs C. Sakama, K. Inoue * The Acceptability Semantics for Logic Programs: Negation as Failure as a general non-monotonic reasoning framework A.L. Kakas, P. Mancarella, P.M. Dung * A Bottom-up Semantics for Constructive Negation A. Bossi, M. Fabris, M.C. Meo * Default Rules: An Extension of Constructive Negation for Narrowing-based languages J. Moreno-Navarro 10.30-12.30 Session Analysis Chair: M. Bruynooghe * Depth-k Sharing and Freeness A. King, P. Soper * Towards a Practical Full Mode Inference System for CLP(H,N) V. Dumortier, G. Janssens * A proof method for runtime properties of Prolog Programs D. Pedreschi * Fast and Precise Regular Approximations of Logic Programs J. Gallagher, D.A. de Waal 12.30-14.00 Lunch Break 14.00-15.30 Tutorial Chair: P. Codognet * Abduction and Abductive Logic Programming A.C. Kakas, P. Mancarella 14.00-15.30 Tutorial Chair: A. Porto * Modularity in Logic Programming E. Lamma, P. Mello 15.30-16.00 Coffee Break 16.00-17.30 Session Higher-Order and Meta Programming Chair: J. Lloyd * Ambivalent logic as the semantic basis of metalogic programming Y. Jiang * Higher-order Aspects of Logic Programming U. Reddy * Higher-Order Polymorphic Unification for Logic Programming L. Caires, L. Monteiro 16.00-17.30 Session Databases Chair: U. Nilsson * A Database Interface for Complex Objects M. Holsheimer, R. de By, H. Ait-Kaci * A slick procedure for integrity checking in deductive databases H. Decker, M. Celma * LPDA: Another look at Tabulation in Logic Programming B. Lang, E.V. de la Clergerie 18.30 Banquet THURSDAY, JUNE 16 9.00-10.00 Invited Talk A. Mackworth (UBC) Constraint-based Robotic Systems Chair: Y. Deville 10.00-10.30 Coffee Break 10.30-11.30 Poster Session 11.30-13.30 Session Constraint II Chair: G. Smolka * Constraint Solving by Narrowing in Combined Algebraic Domains H. Kirchner, C. Ringeissen * A Grammatical Approach to DCG Parsing F. Barthelemy * Compiling Intensional Sets in CLP P. Bruscoli, A. Dovier, E. Pontelli, G.F. Rossi 11.30-13.30 Session Transformation & Synthesis Chair: J. Maluszynski * The Halting Problem for Deductive Synthesis of Logic Programs K-K. Lau, M. Ornaghi, S-A. Tarnlund * A New Transformation for Concurrent Logic Languages K. Kumon, K. Hirata * Compiling Control Revisited: A New Approach based upon Abstract Interpretation D. Boulanger, D. De Schreye * Completeness of Some Transformation Strategies for Avoiding Unnecessary Logical Variables M. Proietti, A. Pettorossi ------------------------------------------------------------------------- Post-Conference Workshops Schedule ------------------------------------------------------------------------- FRIDAY 17 JUNE 9.00 - 18.00 W2: Verification and analysis of (concurrent) logic languages W5: Non-monotonic Extensions of Logic Programming: Theory, Implementation, and Applications W9: Second ICLP-Workshop on Deductive Databases - Deductive Databases and Logic Programming 8.00 - 13.00 W1: Process-based Parallel Logic Programming W4: Sixth Workshop on Logic Programming Environments 14.00 - 19.00 W3: Logic and Reasoning with Neural Networks W6: Parallel and Data-Parallel Execution of Declarative Languages ------------------------------------------------------------------------- SATURDAY 18 JUNE 9.00 - 18.00 W7: Applications of Logic Programming to Software Engineering W8: Integration of declarative Paradigms W10: Proof-Theoretical Extensions of Logic Programming W11: Logic programming and education W12: Legal Application of Logic Programming -------------------------------------------------------------------------------- Workshops Descriptions -------------------------------------------------------------------------------- Workshop W1 Process-Based Parallel Logic Programming Organizer: K. De Bosschere, Universiteit Gent, Belgium J.-M. Jacquet, University of Namur, Belgium A. Brogi, Universit` di Pisa, Italy Contacts: Koen De Bosschere ELIS, Universiteit Gent St.-Pietersnieuwstraat 41, B-9000 Gent, Belgium Email: kdb@elis.rug.ac.be Several process-based parallel logic programming languages (e.g., Delta-Prolog, CS-Prolog, Multi-Prolog and Shared-Prolog) have been proposed as an alternative to goal-based (and/or) parallel execution models for logic programs. The main features of these languages are explicit process creation and explicit communication based on channels or blackboards. The workshop is aimed at being a forum for discussing the various topics of process-based parallel LP, ranging from theory to practice. Workshop W2 Verification and Analysis of (Concurrent) Logic Languages Organizer: F.S. de Boer, Free University Amsterdam, The Netherlands M. Gabbrielli, Universit` di Pisa Contacts: Frank S. de Boer Free University de Boelelaan 1081 1081 HV Amsterdam, The Netherlands E-mail: frankb@cs.vu.nl This workshop aims at a discussion of the analysis and correctness of logic programs and their concurrent (constraint) extensions. More specifically, we are interested in proof methods based on abstract interpretation and the applicability of methods developed in different programming paradigms, like process algebras, Hoare logics, etc. The workshop also includes discussion of techniques for the development of (concurrent) logic programs. Workshop W3 Logic and Reasoning with Neural Networks Organizers: Franz Kurfess, University of Ulm, Germany Alessandro Sperduti, University of Pisa, Italy Contacts: Franz Kurfess Dept. of Neural Inf. Proc., D-89069 Ulm, Germany. kurfess@neuro.informatik.uni-ulm.de The goal of the workshop is to initiate discussions and foster interaction between researchers interested in the use of neural networks and connectionist models for various aspects of logic and reasoning. There are a number of domains where thecombination of neural networks and logic opens up interesting perspectives: methods for reasoning, know-ledge representation, integration of symbolic and neural components, implementation techniques. Workshop W4 Sixth Workshop on Logic Programming Environments Organizers: Markus Fromherz, Xerox PARC Palo Alto, USA Anthony J. Kusalik, University of Saskatoon, Canada Oysten Nytro, University of Trondheim, Norway Steven Prestwich, ECRC Munich, Germany Contacts: Anthony J. Kusalik Dept. of Comp. Sci., Saskatoon, Saskatchewan S7N 0W0 Canada. kusalik@cs.usask.ca This workshop will provide a forum for researchers and logic programming system developers to exchange ideas and results on all aspects of environments for logic programming. This includes work related to design issues, new techniques and tools, and the solution of noteworthy problems arising, for example, from new logic programming languages or interesting application areas. Both state-of-the-practice and state-of-the-art presentations are welcome. Workshop W5 Non-monotonic Extension of Logic Programming: Theory, Implementation and Applications Organizers: Jurgen Dix, University of Koblenz, Germany Luis Moniz Pereira, Univ. Nova de Lisboa, Portugal Teodor Przymusinski, University of California Riverside, USA Contacts: Jurgen Dix Dept. of Comp. Sci., Rheinau 1, 56075 Koblenz, Germany. dix@informatik.uni-koblenz.de Logic programs rely on a non-monotonic operator, often referred to as negation by failure. The non-monotonicity of this operator allows us to view logic programs as special non-monotonic theories and thus makes it possible to draw from the extensive research in the area of non-monotonic reasoning. This workshop focusses on non-monotonic extensions of logic programming and will be concerned with all of the three aspects of Theory, Implementation, and Applications. Workshop W6 Parallel and Data-Parallel Execution of Declarative Languages Organizers: Jonas Barklund, University of Uppsala, Sweden Bhat Jayaraman, SUNY Buffalo, USA Jiro Tanaka, University of Tsukuba, Japan Contacts: Jonas Barklund Computing Science Dept., Box 311, S-751 05 Uppsala, Sweden. jonas@csd.uu.se The workshop will focus on language constructs, implementation technology, program analysis and practical experiences of declarative programming languages on parallel computers. There will be an emphasis on data parallel computation (not restricted to SIMD computation) and other massively parallel computation models. It is expected that logic programming languages will be more represented than, e.g., functional programming languages, but we would consider participation from these neighbouring fields valuable. Workshop W7 Applications of Logic Programming to Software Engineering Organizers: P. Ciancarini, Universit` di Bologna, Italy L. Sterling, Case Western Reserve University, Cleveland, USA Contacts: Paolo Ciancarini Dip. di Matematica, P. di Porta S. Donato, 5, 40127 Bologna, Italy. cianca@cs.unibo.it We will discuss which features of logic programming are most useful for a software engineer, and which software engineering applications have been already developed based on a logic programming approach. Suggested topics are: Requirement analysis, specification and design based on logic programming, software engineering environments including rule-based components, Prolog-based tools, software process modeling based on logic languages, and Logic and Object-oriented programming methods. Workshop W8 Integration of Declarative Paradigms Organizers: Hassan Ait-Kaci, Simon Fraser University, Canada Michael Hanus, MPI Saarbr|cken, Germany Juan Jose' Moreno Navarro, Univ. of Madrid, Spain Contacts: Juan Jose' Moreno Navarro Facultad de Informatica, Campus de Montegancedo s/n, Boadilla del Monte 28660 Madrid, Spain. jjmoreno@fi.upm.es The interest on the integration of declarative paradigms and, in particular, the integration of functional and logic programming, has been spurred anew, especially for what concerns efficient implementation. The aim of this workshop is to bring together researchers from different communities as well as to give the logic programming community an idea of recent advances in the area. A non-exhaustive list of topics is: language features, semantics, execution principles, implementation issues, abstract interpretation of integrated languages, environments for integrated languages. Workshop W9 Second ICLP-Workshop on Deductive Databases - Deductive Databases and Logic Programming Organizers: Natraj Arni, InferData Corp. Vaustin, USA Ulrich Geske, GMD-FIRST Berlin, Germany Fosca Giannotti, CNUCE-CNR Pisa, Italy Els Laenens, Univ. Antwerp, Belgium Dietmar Seipel, Univ. Tuebingen, Germany Mark Wallace, ECRC Munich, Germany Contacts: Dietmar Seipel, Tuebingen Univ., Sand 13, D - 72076 Tuebingen, Germany. seipel@informatik.uni-tuebingen.de Deductive databases use logic programming as a powerful declarative language for accessing and maintaining large amounts of data. Recent research results in logic programming are useful for extending the power and efficiency of deductive database systems. Topics of the workshop are: disjunctive DBs; sets, types and aggregation; abstract interpretations and program transformations; non-deterministic extensions of logic DB languages; non-monotonic deduction; constraint reasoning in DBs; subsumption; expressiveness of query languages; query optimization and evaluation; logics of active DBs; updates and knowledge acquisition. Workshop W10 Proof-Theoretical Extensions of Logic Programming Organizers: Roy Dyckhoff, University of St. Andrew, Scotland Lars-Henrik Eriksson, SICS Stockholm, Sweden Alberto Momigliano, Carnegie Mellon University, USA Mario Ornaghi, Universit` di Milano, Italy Contacts: Alberto Momigliano CMU, Pittsburgh, PA 15213-3890, U.S.A. mobile@lcl.cmu.edu The workshop will provide a forum to discuss the use of proof-theoretical techniques in logic programming as well as the influence of proof theory on the future development of this field. Topics include proof-theoretical foundations of logic programming, languages based on proof theory and applications. Critical and comparative papers are also welcome. Workshop W11 Logic programming and education Organizers: Rosa Maria Bottino, IMA-CNR Genova, Italy Paola Forcheri, IMA-CNR Genova, Italy Maria Teresa Molfino, IMA-CNR Genova, Italy Contacts: Rosa Maria Bottino IMA, Via De Marini 6, 16149 Genova, Italy. Bottino@IMAGE.GE.CNR.IT The workshop will focus onto two different aspects of the research concerned with the use of logic programming, in particular of Prolog, in education. >From one hand we consider issues and problems related to the teaching (and learning) of Prolog: problems in understanding Prolog, misconceptions of novices, ways of representing the behaviour of Prolog, problems of supporting program construction and debugging, etc. On the other hand we consider the opportunities offered by Prolog as a tool for the implementation of classroom products, such as modelling tools, tutoring systems, problem solvers etc. Workshop W12 Legal Application of Logic Programming Organizers: Carlo Biagioli, IDG Firenze, Italy Giovanni Sartor, IDG Firenze, Italy Daniela Tiscornia, IDG Firenze, Italy Contacts: Daniela Tiscornia IDG, Via Panciatichi 56/16, 50127 Firenze, Italy. daniela@idg.cnr.fi.it The workshop is dedicated to the use of logic programming methodologies in modelling legal knowledge and legal reasoning. Main topics are: legal knowledge represention, abductive model of legal reasoning, metalevel legal reasoning, default reasoning, deontic logic, arguments construction; beliefs revision; analogical reasoning; case-based reasoning. SOCIAL PROGRAM Tuesday, June 14 17.00-20.00 Excursion by boat to San Fruttuoso di Camogli, visit to the Doria Family Abbey and cocktail. Minimum participants 30. Wednesday, June 15 18.30 Banquet at Palazzo Ducale of Genova Participation fees are the following (in US $): Social dinner Excursion ICLP'94 participants included in the 30 registration fee Accompanying persons 85 30 Delegates and accompanying persons interested in participating in the social program are requested to specify it in the attached registration form. GENERAL INFORMATION Venue of the Conference ICLP'94 will be held in Santa Margherita Ligure at the Grand Hotel Miramare, which is located at about 1 km from the Railway Station. Full address of the Hotel is the following: Via Milite Ignoto 30, 16038 Santa Margherita Ligure (GE), Italy tel. +39 185 287013, fax +39 185 284651 Travelling to Santa Margherita Ligure * by plane The International Airport "C. Colombo of Genova" is well connected to the main European cities. Genova is located about 25 Kilometers from Santa Margherita Ligure. Shuttle busses connect the airport to the terminals of Porta Principe and Brignole railway stations. Contact the conference Secretariat for train time-table from Genova to Santa Margherita (the trip takes about 20 minutes). * by train Piazza Principe and Brignole are the main railway stations in Genova: the former is located in the western area of the city, the latter in the eastern area. Many trains from Milano stop only at Piazza Principe: Brignole station (from which all trains to Santa Margherita depart) can be reached by bus or by train. * by car Santa Margherita can be reached via highway A12 (Livorno-Genova). The exit is Rapallo. Then follow indications for Santa Margherita-Portofino. Registration fees The attached registration form must be complete and returned to the Conference Secretariat before May 28, 1994. The registration fees are the following (in US $): Conference before May 28, 1994 after May 28, 1994 ALP Members (*) 400 470 Non-Members (**) 430 500 Students (***) 145 170 Workshops ICLP'94 Participants non Participants half day workshop 25 65 full day workshop 40 80 The registration fee for participants include attendance to the confe-rence, coffee and tea during breaks, the social dinner, as well as a copy of the proceedings. The student fee does not include the social dinner. (*) All ALP members are eligible for the discount of the registration fee. Members must include the membership/organization number in order to receive the discount. (**) People who want to join or renew their membership to ALP or GULP for 1994/1995 must tick the appropriate space in the registration form and pay the Non-Members fee. Recall that GULP is affiliated to ALP, therefore GULP members are also ALP members. (***) All students must submit proof of student status by enclosing a photocopy of the student identification or a letter from the advisor The amount due for participation in the conference, in the workshops and in the social program can be paid (in US $) as follows: * by cheque made payable to Consorzio Genova Ricerche, Via dell'Acciaio 139, 16152 Genova, Italy * by money transfer to Consorzio Genova Ricerche, current account n. 21503/20 banca CARIGE Ag. 21, Genova, Italy * by cash at the registration desk (in this case no discount will be applied) Credit cards cannot be accepted Please make sure that your payment includes any banking or other fees, so that we receive the correct amount. Grants A limited number of grants is available for young researchers and/or for researchers from the Eastern and the Developing Countries. If you are interested in receiving a grant please attach a formal request to your registration form. Cancellations For cancellations communicated (in writing) to the conference secretariat before June 4, 1994, all fee will be refunded minus a 15% deduction. Hotel Accommodation All hotels reserved for the conference are located within walking distance from the Grand Hotel Miramare. Hotels at the following rates (in Italian Lire) have been reserved for ICLP participants: single room double room *** 120.000/180.000 200.000/280.000 *** 70.000/90.000 110.000/140.000 ** 55.000/75.000 90.000/120.000 Please indicate your preference in the attached Hotel Accommodation Form. Every effort will be made to meet participants' preferences on a first-come/first-served basis. Confirmation of the reservation with all details on the hotel and its location will be given after receival of the hotel accommodation form. For an accommodation different from those proposed, please contact the Conference Secretariat. The hotel accommodation will be considered as definitely confirmed only after receival of the registration form and after payment of the participation fee. Should the hotel accommodation form not be followed by any confirmation of participation, the hotel reservation will be cancelled. ================================================================================ REGISTRATION FORM -------------------------------------------------------------------------------- Please complete (block letters) and return to the Conference Secretariat by May 28, 1994, to pay a reduced fee. Surname ______________________________________________________________________ First name ____________________________________________________________________ Affiliation ___________________________________________________________________ Full address __________________________________________________________________ _______________________________________________________________________________ Telephone ________________________ Fax ________________________________ e-mail ______________________________________ Name/s of the accompanying person/s participating in the conference: _______________________________________________________________________________ _______________________________________________________________________________ _______________________________________________________________________________ Please fill in: __ I will participate in the conference US $ ____________________ __ I will participate in workshop n.___ US $ ____________________ __ Social dinner for n. ____ person/s US $ ____________________ __ Excursion for n. ____ person/s US $ ____________________ Total US $ ____________________ Please find enclosed: ___Copy of the money tranfer ___Cheque ___I will pay at the conference (full fee) ================================================================================ HOTEL ACCOMMODATION FORM -------------------------------------------------------------------------------- Please complete (block letters) and return URGENTLY by fax or e-mail to the Conference Secretariat. Name __________________________________________________________________ Telephone ______________________ Fax ____________________________ Please reserve for me: n. _______ __ single room/s n. _______ __ double room/s to be shared with ________________________________________________________________ in the following hotel **** ___ *** ___ ** ___ Arrival on ____________________________ Departure on ___________________________ Date __________________________________ Signature _____________________________ From fritsv@cwi.nl Mon May 9 19:38:06 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA23152; Mon, 09 May 94 11:38:17 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Mon, 9 May 1994 17:38:07 +0200 Received: by specht.cwi.nl id AA01174 (5.65b/3.8/CWI-Amsterdam); Mon, 9 May 1994 17:38:06 +0200 Date: Mon, 9 May 1994 17:38:06 +0200 Message-Id: <9405091538.AA01174=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: 1st CFP: PASCO'94, Parallel Symbolic Computation Symposium From: Parallel Symbolic Computation Symposium '94 We sincerely apologize if you get this message more than once. Please, discard further copies. See you at PASCO'94, -PASCO'94 Organizers --------------------------------------------------------------------- This mail consists of the CFP in two formats: (1) plain text (2) uuencoded compressed Postscript In order to print the Postscript version, 1. Save this mail/article into a file: cfp.uue 2. uudecode cfp.uue 3. uncompress cfp.ps.Z 4. print the Postscript file: cfp.ps Please post/distribute it in your department. ======================================================================= CALL FOR PAPERS PASCO'94 First International Symposium Parallel Symbolic Computation September 26 -- 28, 1994 Linz - Austria ======================================================================= The First International Symposium on Parallel Symbolic Computation (PASCO'94) will be devoted communicating significant developments in all the areas pertinent to ``Parallel Symbolic Computation''. Motivation ---------- The interplay between parallelism and symbolic computation poses inspiring scientific challenges, which deserve much focused attention. However, there has not yet been a dedicated forum, and this symposium addresses the need. It is also expected that further progress can be made through the interaction between parallel symbolic algorithm designers and parallel high-level language designers. This symposium is intended to provide a framework for establishing this fruitful dialogue. Sponsors -------- ACCLAIM European Union ESPRIT Basic Research Action CEI-PACT Central European Initiative on Parallel Computation BMWF Austrian Ministry of Science FWF Austrian National Science Foundation ACPC Austrian Center for Parallel Computation RISC Research Institute for Symbolic Computation, Austria Scope ----- The scope includes but is not limited to algorithms, languages, software systems and application in any area of parallel symbolic computation such as: * Parallel Computer Algebra * Parallel Automated Deduction * Parallel Constraint/Logic Languages * Parallel Functional Languages where parallelism is interpreted broadly to include concurrent, distributive, cooperative schemes, etc. Scientific Program ------------------ The program will consist of invited lectures and contributed papers selected from the submissions. Software demonstrations will be scheduled on request. A panel discussion session will be also part of the program. Publication ----------- * Proceedings: Will be made available at the meeting by an international publisher. * Journal: Several high quality papers will appear as a special issue of the Journal of Symbolic Computation (JSC), that is planned to appear in early 1995. Invited speakers ---------------- Kevin Hammond (UK) on Parallel Functional Languages Claude Kirchner (France) on Parallel Automated Deduction Gert Smolka (Germany) on Parallel Constraint/Logic Languages Paul Wang (USA) on Parallel Computer Algebra Program Committee ----------------- A. Aiba, (Japan) L. Augustsson, (Sweden) M. P. Bonacina, (USA) B. Char, (USA) J. Della Dora, (France) J. Fitch, (UK) B. Fronhoefer, (Germany) K. Hammond, (UK) S. Haridi, (Sweden) J. Hsiang, (Taiwan) J. Johnson, (USA) H. Kredel, (Germany) H. Kuchen, (Germany) W. Kuechlin, (Germany) E. Lusk, (USA) R. Maeder, (Switzerland) C. Palamidessi, (Italy) J. L. Roch, (France) V. Saraswat, (USA) D. Saunders, (USA) G. Smolka, (Germany) P. Van Hentenryck, (USA) P. Viry, (Japan) M. Wallace, (Germany) P. Wang, (USA) S. Watt, (USA) K. Yelick, (USA) R. Zippel, (USA) Program Committee Chair ----------------------- Hoon Hong RISC-Linz, Research Institute for Symbolic Computation Johannes Kepler University A-4040 Linz, Austria/Europe Phone: +43 (7236) 3231-48 Fax: +43 (7236) 3231-30 email: hhong@risc.uni-linz.ac.at Symposium Chair --------------- Bruno Buchberger RISC-Linz, Research Institute for Symbolic Computation Johannes Kepler University A-4040 Linz, Austria/Europe Phone: +43 (7236) 3231-41 Fax: +43 (7236) 3231-30 email: buchberg@risc.uni-linz.ac.at Local Organization ------------------ RISC-Linz, Austria Olga Caprotti Andreas Neubacher Wolfgang Schreiner email: pasco94@risc.uni-linz.ac.at Important Deadlines ------------------- Submission: July 1, 1994 Notification: August 1, 1994 Camera-ready: August 31, 1994 Submission Guideline -------------------- The first page must include: * the title, * the authors' addresses, * the abstract * a list of keywords. The introduction must consist of a brief and intuitive description of: * the problem that is tackled in the paper * the motivation and importance * the method used in the paper * the performance or the result * the related works and the originality claim Submission must be: * in English * at most 10 pages long, using LaTeX format in "pasco.sty" style available from the anonymous-ftp site: ftp.risc.uni-linz.ac.at /pub/pasco94/ * sent in uuencoded-compressed Postscript or dvi file, created in Unix by: cat paper.dvi | compress | uuencode paper.dvi.Z > paper.uue * via e-mail to the Program Committee Chair at: pasco94@risc.uni-linz.ac.at Further Information ------------------- For further information, or technical assistance in preparing submissions, contact email: pasco94@risc.uni-linz.ac.at begin 664 cfp.ps.Z M'YV0)4) F=(B")DW8LJTD.$"AH(2)8;(*1.&SALY.D"0L9,&SAP0-5S0N %B MR!LX>>2D.8.&#H@8.7#8:)$C!@@I85/'C4XW9\;BR0@#1-L:.6R P$%C MQM(B9DVV:5/ TY8LN<2>,&BIPW8Z:4H9.13AD\+N <5O""2ADL1':ZE &C MK9-3X^C60O:((4S&MID^KU],:?UX M#!H%LVO';HUESW G?82TIB*E-1TY8=S,85-1:/+>P=-L_VBFYQRAP>W,2:-' M:(RVP8&H7+U'@7@V<_9L:6NSA2 M0]!)]X*=V9%A8AAPE+'G?1]=5P=ZK?4IE'\@!%IGL*>F?+MB0@PPUS3 # M#C7@4&ETE\Y0'Y_K^1E#2#74,(--E@X*%1E6!R X(1QI=[3F" MN>A^A 6J+QC11$5;_.<6")0&Z 1E1@@AQ'[WZMN:&ZS!UUH21=P;'&AR* R; M&2U0FP8;>Q(\5X6@50J"Q:H1QB^!=%"11Z(@&!N<$2#/*V>09O@E1Y G@^SO M&T'V*]UKTZJ$5FMBA'$>"%B D!1V>5 FA%/S>@0T;G5,3,80:"2U!]1)"=$T M&Z+)0><+> UX%HX(:]Q7;V+N:<8;;Y2XV-E^]2&# D.'D8>0)\T]AATP@_#= MO1:/VQK#"F\!+QEF[#D':;2VUO)U-:NL,>$1AS%Q'PH(2GA^(;9V^-(O+/[R M%IL#6")I-P;[?:+1P1QIDT('& M'L:U0$9%88"I=U]G"*_F''6(4>;N+Q2/1ADKM41\[\=3"R9RS#LO)?324PEO M\7@457@,,IA:?/?)SPX56LX;2_[T)49_?N]YJ%_?^\A3WOR:QR4&W8]*+Y$! M2]0 YC\.$9G&2PZA%18R\X@@]# MAT2JR<%J3BN#GN80!CL(Q5@V.0P;?#(%!2UQR/SZ:@33%^UWPN#1# M/[:@?X=4&QUX8AQHE8$C8RB# A()/.<%,GLN"5>] H:O_KC )H8D32'_&,E3 M"HT,9.@"!#FXE3)0CI9<0=(]V9'1 M+&9\HYD.YT4+M>E ";KGWUX(.!G"\E@'(UX0_=D;(L!+#"?9@[6DB"V>G:0% M:$#;&A2P!C>\X0YNT,U#(_J&-413.$DH414A)9^5$(:4;7B#%2VRM3(D= Q0 M2A0B]K1&FX-"--* M"AT4>AZ@HD:94F7J1)&*T3U$50YTT.I'8;0B#[F( M\]10OC\;VQ[V< 8J6K$TU6F!*P4*UA#V>&UQWP?"8ILU10%'.2F4%P!WBUP77X M,E:E!95123-HTZUY Z8I=0<%P"L.F+8)J'^(Z4_#*S].TC2\INHD*:WZ@6T9 M3I15.F5XY8'0@3W3@WP"![@=] WY$0XY1PI0H2*;>#%MV!1T[$C-F ?$M6C@!M\"HD1]:$=TE;$@P]TX29Z<7"R M@Z,B#H$)28 "C,T#J30*X41!C/&^DELRW\ +J@DNBU/^5$0@6+S%>X!YBV4> M&GN^P.) >[EZ$EP?G4.%YW"-5,;?A:R#U\C@[FK-QT,.KMBB1^C$&A;GIB[R M<.GPY1$]Y)L,GC:FUVGB8E^,ILK^.CG]R3]A[\+>N7JM,4' MOJ#O\9SS%\JK_JAC4::#AX(*Y86RG+'5 M:5[DID,5X$!5AEZU#;WA:D9_&E34XP^9FGP!MF"_)E2[?M]WRM,>MF91Q^P^ M.% Y@["VMMP]T $/K_N9O=IP?"\*G.!Q I)&KI.=PUVD#4,1&K7W *=MA_?;W5KOY[ M(!=OID4^<7_])X!O0X!55WWM!P((*&Q;M(#\%V7Y9X#R)Q<,HH#ZQX '&&P$ M^'[[%W_8AX$0Z!-#(@=$QF/[!5/(5@;FAP8\]H*4U1,^ 7XO2#=E@2=O@'Z\ M%#=%XS,=UAIG$$1X0#A= CL9,P,Y<"]^8W=FH ?W8@8?P2!&\ )\\ 58F(4F M023HTC"+ P*$845@90;<<6<*H!7>)03<,08>E2!;0*#1FP5[9 M9X@G%@,XT!:',5PN1BEXV"5Z:!<(! =Z:!,(5#KW4SJFV# ,4HIZV!:I2"*K M2"+4X8B3*(ELT!$*T'N4&"U]6(@D:R(FGU1VBV##& HL-@XIFHHK1 MHT(=!V UI "ZV!$@\(B[Z"2^6"BN V(WYT2-]V(<* MY!"=J(R+R&)0@8O=" +9Z"3@Z([2!3LY@(R>^&*@F&#+V')4HDWB.(LX4HLX MTHK!YHSWPI#L1(W6F$_5Z(].THMX1%&D1_#80.Q,@-RD3G0$1Q?%3*/800KL2>4 M20)3,%)D, 4#&6(ZY%-5U5!(@@?7Q27&%6[(I9@M-G(^MAQZB23X89 G:"1T M\#K>I0 ]DER'0P*01YE_,9G)N7C,^1'(:08DL$5S$YW.29V AYW320+7>3A_ M01FEZ5C@^1'!V1?#^0;>E9TD, :YQ9YC$"1!TYUS0)[4:9_*^3)=DIQ]ASO3 MR)GL.0??29T#FI\%:IT5":"E69_[29T":H_BDISQJ4W)R:"94YJ =S^EZ9X- M2@(/>J'/*0=SB>6?85IJG:46I M.9!S:4OQ<5SG]F\4DV_P9IORYF_JQ@9U*A0AIC']-5*]>'U\F9OGZ1=)ZA(] M @3]AFZ%&G#E07!S\%1OTJ>%.C4@!P7J6 9/RB4 H@!6"@('!V5A^J5MH1YG M\JIITZHN.:MD*B2S<:;BIZL=$4T1-W$ I@! -W002HDX,H^.\6,GUQ-D1G<^ MI9\9^I_V-#NA"'BE@Z W8ISHF$\EI%,QVE+8P:LHNC!U$ZZO88/B]U1C ZK" MLF'5IA0P11'21J@]<:B]9%,3L29F\52QX:Y_2F^I89M/Y2R&8J\48Y="0!F[ MN >T"B]R0#$12Z80^ZPGF(*<1GK",5)!$ZGIN9X;:T59L#2O$19O$J8\X8VF M^H);,RU>=1T=)12'&C2'.K)L&AQF,#%[D+,1.+-#,5)9H*KT5V3!(5_LJ"A" M919N)Q3S^9E+RSDI41OSB0?8T1M-.U+1IR0^LC*;=*3HF;5YTR-46QM1VQNA M*#J')55/.S9/FQ1!%&)@BSN+ ;9T@FT0@1=D,&[=9IR7(;#QYE:+]58S\%90 M12U@U1I&D#PR !8R8"R$PP-&$+E&L(F2.[DP4+F;& /O,0,W4 0X0 0Q8 ,^ MH T0"9$P ,W<+DX,+F3F[HP4 .O>P,X0!>AZP-)P .= 0/'F+NCDKLPT+NY MZ[K!Z[LP4 3$:[RY&P-#X+L*H+R^"[R= ;TP(+R=0;W%>[R^Z[S)N[R\NXG= MZ[O6:[U%H #8N[W9R[W1Z[WI"[[$*[[EF[OHVQF:RQF=FP-#4+NW2[[3&[]& M$+]$@+XQ\+^\:[\#C+XWH+V7B\!%H+TQL,#<.P/W^\ XH+VRJ[T*8 2ZR[V5 M:[P;?+F2B[P9?+XB;+XDK+N1R[TQ<,+RJ\(Q,"LY< -&H Q4;LUP""G^[L@ M[,'>F\+]&[WWB[RN"\35VQE"?+W3NXG(V[M)C,35NXFI2[ZR>\2J^[N2F[F1 M*P3>:P1%(+WA&[U#+,5 /,'\!# ,'3R\?+N\43K ")/"K.J\B/[,B- M+,;%*\F53,F$W+N9',B1F[Z=*[^%C+X8;,C3&[F,7,=GW!EVS#YM7 0S++HV M("6GF\(@W,>I#,.6>\2D/+A&G+LYW,M]C+S-&[E);+Q%C+S(3,3*;,1A/ - M_,%47 2?K+K.K+NSHD"NK+FB^\*,B;IIG,/3[,OON\SB[+M;#,)%T,FJ'+E9 MC .D?,;)[!#Q',1??,SU?,_3N\S(B\$-K,KNK,'L3,3J# ,V0,HQ0 ,PH0"; M^,JVB[M]3+G]R\-;_,-1/ 3"B\[EW,L@?,O5&\4W4,T+K,+L3+Y]K+NZJT!$ M4!/XB[LF#+ZYK,/R*\T[7,@E',)WK,Z5N\[J3+X(;-.@/,(_7=,]/=3Q2]1 M;"3=@EC+D>'-"*S<8YT'"N_,8^\!ZF:[S M"]J?[=G*'-JD?;UV,=JFO=JJ[<3]"\,>+,VM^]K\7 /LL]#:/-GOT_W=M-S3[UF]NW M>]G[G,[%7<7^_,[ZK+_SO,S'G=[HO=[,K,JZN\__K-.?/= 3[ MJP 0G%K%B\SP/+D-#.)5;-'[K-TIS=T.W;Y(GN'YO-6FK--GG-,=ON0<+N51 MWL7L"[BI"[Q9[KU9KM!-++P+OL+\N\.:>P,DGG &[LTI3+E;/,@AW=JE#>?% M2])R+MIQ?N>H7>>GS<%9++EW+ 1^W.:Z:]OM0^!AL=(PG,++&[DY@,>)WL/. M>]%2;LSB_-^]3,C!B\!*B+Z;WADD'1/).^#R*^KN[=O$F\KZ_.H3LKR.RM"0.*YSK][+R&'.F9N^B_7KG4SL*+JT!0S=T*D##Q(CTV$1,:808LS1E*;N6Y2^HP MH.ZDKKD C,#NGKN<,;[RWLL1+KSWSN2YNXG R^_>Z^^Z.^VD;IY/-BGKM6H'N'$GKL^W_.EGO(= MSN7)^[TP@/&[Z_.#O;R[.\07^H^/P3W^^_5++\) M)\TI?;\WX /NO.L.C?L$;\0M>4X\&Y)4)1L"(P&1+>L2O\ITVP*75NJ 7U'G:B_MUAKT'X5P7#D!> M9["7!Y"8$KB .ZF7"+ M?IN(^Q4T3;2\O)\["P+7:^\9,N.5!I=;*V1B>:Z]+;=(%\(B75@+8:G+>='" MWK7<1@7SRW._ M,X/3#P:D04G'#7\:\GIDWA"4L<'F-00:GQ@SAZ,"'V([+8#(N( 8\T0;:KE=J22W+:U:HO#Q&_E3: M^:.'L@O?I;1_9[RX5QH\9?$.QH'#$/8-$UGZ8H,@48+MKBTWQ'A9/AN$',]S MW4%?1KW*'F)+>_&+UL&T6N?6<-VK@(:AC/L-@;=1#:]A&K0!:;#]D361)\$ M(?#2&1N#;[$,+CD<4/WT%UWD@'1/'(JULL87 M)9@O]&Q_41,%1G?6#I477(""]$YWS:]X:.3ZV0R(1X6/C/G$ZG<7*9UE5%Z8 M,8)EQLQX 2^@8*R BE!Y&3>.IN$H72)S7A50+KH\DU83F2(-F&R+:]=U.\1E ME;"()AIW+ WHI;[L-?7:'O$RB;3/=VV^F(>^>)IO3(+"D7@-Q]V8O'HCWX\HA7Z (5)&Z!G;^1 MD 7K758#CE,NRNDOG#?TDA=]Y%PT3X'0/*Y'\T8"S;-H-(\N%K7X!@978^V3 MB2(P?C4^!8G==-K*JXU#_,9^1*#XW&X0:\BIL^B8PY++3UM0?HN<[@CI=C, M8X(UCT/NO)O'\XHDD2R/SJ[#N16X=_1FH+G3>WN-Z5TU\)CT;"#J5+,V/4N-;D0]=>:K&4+\=BQ20/)"PT8 MS(."!C**T3K71>N*FY=#;^HKC 6U,J;EN)RA)&=G;$QJN"\9TT2C*UM8G $" M5B[K=B=+G:(D>D-/?:4R3=GR(.0.,UX1;A/Q-%"9O4AE\JJ(I5+M7;>0]_1< M7MNC@'Q/&\9*48DG9UY6HW"U$NS9RB%YZFB>>$M>04!Y03;!1_5\0.K*@K_. MG]D\(5D?T61]-'80,EH:NU%9*F,E[XJ)V-):KL![Y[VXY1CTD=Y25I:Q3I@F M*=?Z>G*+K9.%+D=)+(. L5R+*"Y9*DM4M]0XI8%,E*?,4HHRLI;$4%B_C&DK M4$9^2@TWW&I90N1TIBR'R<0Z>"W?8\SSD;HR8N;*B0G=:)ZSS&.^4O3IKF I MY(CE$!!^;>&&P39Q.##'VC>$A9[N!]K'C6;$,J,7*WG:2\9%.)F)VLKA]:H! M0^"YY0 BP.\PV#ML7BC-(:(_XJ?^F*7*%()($[^=/=-GT]X?@)1?/#/SM45# MQ@L?'VD[1FLR(0J\K+GD--GZXI/#;O8M.>.VS,X8]\)])I% GK0 %@^!'P3\ M@YCNARD_\2<8-YSP8I):L9=Q/&IH!@=76\,!YLZ.&0$BI])D@ JD8KPRU87' MHZDT5QW3'),C;P^>39<'[0 >+UQ?3-)KDC:P:<346^<,CJY+QY'-G^F= MM.W6%.DATH-@3W#C$;"ZZ>^0HO,T>L]SB($Y\L7Q1@7ZH@%"CSQJQSR&QVY: MGX-T F_UN3X!V/J6E_Z2G9/O24Z^_Y;*UF7.)'"+Z_QMKO9(%+OC%WQ[]].$ M'KVTJ"[4FAF/X$$U=8G0M%U-:%[S MD*7IM<$EZ8[1%SUM";'U=4-E)ND:J!T%:[#/]6E.SMD1GUXX:V':+9O=1'KX MVMI@U 28"1",]BY%>#4!7N4,85R3=YYRBZFVXY4(AMLM>5S%M=%Z.C3%#>6B['EZ\ M<#&A"S>N1G7)SFR912-FN R\3UP-AF+$-:L$L=_)<'MG3@IU4<2;-=%E3O6A/_:E9%*C>5)\:5(MJ M%P6J1]6HZ4LM5U:I==8*9-+%:5F&71G_N)X8.XZ"E;UA;[0%\=3>N7Q M6\* (" #SF(.6&#RE >H+Z;'&=Y?<]R>EI6;FL35NL-::W<\A X4K=W"!TI; M)VMW/(K7\;!>R2LI6/]J7PV/G/6MN3+0VM#<*K'+A215JE5)L@KASFK.'($^ M@ :RZO&XV6?K*W]O4=Y$VE )[QA M)I%/FLT**N48K(.%I0_6@LY7"$MAYV5 UUWE5@^Q-Q('6N:3(1@3!!G^BX! MEKL(6%/C= AL<5U/!!;!]AT#LVE^DWMQ!NVE3%C-*P#<'':?IXF--3 ML22NZIV_&N8)D6$.M&54C/75OB5;)9FL-JUF271PM8^ZJ;S,W09,95C6 *ZS M+>O!E.4C?&\U5@160.,F/-DF@=VPJY&\5D#^ZKHV'A$+@NP5\]G7.8M?.YHJ MXV6#L#XAA5M:KC,W]F M->.*P:CA4HRG'U,!&,](RTVEX[+\M$93=^%*44OS2FE^M LQKW&EVH6)T'Y9 MJR5>KQ9)$B]S>5I?VAM<8Q?LN@%8]/4D>6T=E'T@S.<9.V%;]U88P%1V(A6# MD4.V22)3V(ELCW\P4!(TVPH3C)[,@Y,^C6M./N@5%L)DR\.5PZ[ET<>+V2S+ M+;D]MZF,"8Y;Z^5MB1ZXG8&R$M[M-< %PC >ODM>?Q*KM47[",!J@C1S93]L MZW6]2;GHCETJ*[C?KKMTUYTW+)AFNY3NXI+/%6;NYN6B5U]9[;*=K4M):Z3;Y-B6:I+6H M3^'JQHO77'FN>^.X[FVO<$^6>7$IKL^MN!VW6>*\I9LX+^;'Q9C<,Y>YSY:[ M"0^<@OMP=7"DEKH^F76SKIORZX;=L >OX$63A1?Q'M[$ M^^34600+LI?K&2Y1/T?'RICEW9^75^9E7A^Y>3OO_FPXF/G"1*F[#BBCM;HO[:4YW92I=)LNTP6UM]=HYM[:&QYS+\[]O3_O&"5* M6NM6EEJIOL^QGYC?]EM_LY0'#KU?#@>^W84*O.HDG61T&W6.W_D-^,IX+3KW RP M?..]NM?VGCH@N7MG[Z>EO*(V[[I4:;",MB&'GH;4C7Y82&K(^_:' M-2N:+,16^! +XD4Q51CYG%A-JY?MKA<+2AN?;*WW;Y!3E<'*R0($[K*#A1+7Y&F+A\O5-.[ MPJ^RX2ZN^E7#:G/%PF0UKFY5Z^I$L2KHE5V'UJQ:-*R75AG>5%-T27&%%LK( M^4GY+4/D7J%QC-DT'/E34^\R/:H1KO[93,7GN?3G'H.')A7]V34>NV,;\DO4 ML=NK]$%-F0"!*9\N%'AO],8BU:6Z13LR4=7(M=#I)=2V"!-RMB0?"?6E&G'$,IWQ[#N85,$ HY:R:*7:=#,U[D2\W6 MS;-*Q-8K\CJ=Q&PF/V,,U[@\WC&*<+D/NPW.6UI-56"B=:6'S'CU/O*IE@-H M=>W+BS4Q,M; +$OOV)"#JE7PB.MNB5*\98 8U\0+I^H.2KFT008#N_8#@.R4"U^2E[(Q9 ? M-F60=$ M)_!8FVDK[#D'.![-4,4KJG-@DT_V,>7U MQ8);\T8L@'<40(>P/,HY6?/K\V6:KGW"PVNZ85\;"HN:%?DW.SV,W*);-$?^ MR'<:J*YH$CV2+7(TS7PMS@?CYO3UD0@\$]K M0SMFJZ]I:$W$3"]:H]:I^$UIZXR6U8>PK=TO$\RM,2,R="M%H-=^:T2= ^)I M>2Z1";5)*VEUS:2=]+IVU^TZM>%"[Q5_>;*HKMZB#&]OYB^<"!4A9K92Q?K5*5)GT?J-H(@#X\1O"< M="X4>,@UA#E1>KON *KNT/8O71AH\*"'+UF-OPE:&OL ME9JO\"OYRJ/2JWK:3H9I+CR,NHBH>P->HVQX8;QTN+W6V,-NEN&KV6$U^P6+ M>]F\ X_W]DWNKRYK\ @=*7@@[$2=LS\9]';;3CMAF M+Z.I%7G%6C5./?F7HV=&W1_[M!MR#PJ=6U> M=#&E'3#110.6D,ALGW?-_@&Q0C:[07'IL]TE,GT!Y=W',&474<9Y?GO5.;M! M-L$&-#V]7,<[I/HSVXW=[NZ6?7\JNWZM[D9K$^88IUUU"A.]X:;\B/!PPY'(R^D-4>H*S8ZM^Y:6V-L^XC&>=A4!*5V$:M.;!,MO MZDS!)IB@?'*T=D#/2\I%P*<8,![0@>P/.K)$NQ.!=: &DS;/*DHXW"U0"20; MW6&=C.Z^.TTDO6E8U_..03*$0\P\]C#-L^X2 F Y>Z%P\[C"G]J;Y'W=M3-41&''R,#9OFX[QN*6W?/*WE<\BUOQ+1Z]LC<3Y-T-,HR#\3&.Q;2TN49GEQ?V+T?"OR[.\(JZ-037=A:"-16 M?#/04#[*EW I%^6D/)5WR%/.RH\M->9>P9*.[\%G2-G\8+^HDKMZ!/+JCH=E M!QG'#FC(-.2=S;.9OM'@Y!J!W7-\E;E-KKET&XK\L]PT):K!)&:*^5DK7^6D MO"*_M_+-S?UW-[]<"1!Y@:[[_<*:^8'C8.C\Y8USG:_QU]; ^UNCN5\(II3$L(,&$?HTX.UF^AG$+T8V.LLYF$O48%(2L M,N%:IFE);3YL^L;FFG%\_$8)NP5$1? MGLLBZY_'HW3;'!_S9,L*O?BCO*->\4C>=>"YWG3A^MUTB^JK<8U6!(;0[IX+ MIGQR>K>JOU):$UU93?B87?*3 S?227P[PX!S*X_=$@KL9_H!(^1=="N7/>_) M56WHK3G['<3L/)GH@59Q"=J5$-$S[?'6"&<$=>-(!G M:B*Z" (+NVT_?T^8!TC?/?O_<'D'?*$A,B:_Q>K7W0]8]$._A+U?-##A9M(Z MU^I*@0V/-A/JVZR>ZWL&D[H^$V JZI_&-=THC7;1_WU/HVCFK-]''6\E=N]O MCI,XI\Z2+5<$DV2\3$@/Y@D?685I5XW+BAJ9O0= -CBCN/$,9Q,[Q.OT$5_+ M&%G=VWW+S1WBLQYZ0UF\#EUF.FZ*0F;RO1/_F^)>FW1\D.(NB0P\_>9EC^@: M+WV#., \/@FKA9>5&%[#C[X.W]"JVN=NE=>Y"ZXR? RK)W2$AG^_K2:,4@(7 MD-PE75O(MSM1\LPB4- 68@53WT?LC>9"(+KF<2&*;O.T4,W?PCC/YM^\G5?S M(8Q R[8)!KJ6?*1\#S"7-DO=:.HO6R9:_]*1'-&WS$3/Z!>]HT^,BGZ(]O.U MN>1U?'Q=?FS6MQ,T.AM?.SU]U;($;;^*L>5WZ=L[ZTJ!\U15#]2!.F.OO':^ MUK3UKFUK#G^Y3)PMYPP!,,+UTBK)^F[94H-TW1/!K]-=KLLA;JC,9;.>==5Z M>BBM#7%EI=:UE"M6^4/8ZJM]!K/V7_:T53TS!]79ANQ*X;I2.^E&_VX M-_?EWMC5^)19^B#=XJKT;7IP^C'T&<*$;2D$F.BK!"LS'<@%X6#P"DB?#Q7R M+H%OWWM:6;W;$;))$C$N&*[-&2TN8]"[E'+X@Z;2=UU*30.!90FQ#S+QN*J8 MQ[^PO\N] ^WH6M?:*J3UKB,A)EPSNVQL0W[T"IW]$!FN^>>W_][B]/M@IJQ[ M1MBN^-@+P[[@K*/3?-' MF>#,8C\?J@7]KL?T6.9.=F9TE\L5>B];QA+M[%:6NT\WDTE#O =;6/U:^=]O MESZX!O89@>=KHV4?[;-NL1U7_?)S$?#[@'\$YGV+MN8&UT('F-%/BY&T 9WU MO M+9T)N9TO?Z5GNX)J?CU6&V,N5?%%8YDHR'S(_6969%U?ODO_Y>_^T>RS>O54=/= M[_B+YXY/OL<4?_Z?EY7+4$7B%.!3O 6 $9%G M4_^\0@219R/:7(!D3"?TQTR ',P*-SCQ?RL?1&3%B#;CG>73_W@VI%]0-#X= M@.]?!K>UF57_UN?2 $(U(8V"&_^%K_XSM5_M]@;"?%N/, MB($^'PG8 !9=0X^.HX;=/(U7A=5@N8':7S7WK<4Q*4T9-9OA-&?2SJ<'PH%\ MH =SP0@RE@OH(OWU?X93+1=S83H>3 OG<.1GT\MG9=PT?X<,>D7(/(*2("38 M<$""DV ?V @[=?TI8)D(!E([.QY MYA\AU3-E@#:?!F@+ H&O$/?WQ$ _T8R7%4W5@+$@Y"("&G3B#^7W7R$QH!\R MJ P>@XB,_1/#C#+ZWQ4H#68QH!PU%<=(@?Y?_\*Z$ $A%6;$"M%X0]&))J%% M==<+,-@4/46VG-57:>4SV-]64\<,4=]=1'?T:2))VU7$#7(OOR #. KB+@2@ M5H3+ ((HDUK&26E R6#G-S*1,LV:3W;@K"X,80#H!3Z$S,\J"/M5,-25",@/ M88/[(.ZW^DU^ %+SYQ&B5TG@/R02[A5C3$D(")%_&"$TM.(8@?H/^V/\N80/ MGABSYN5\*EDR(E'! V0U&%5A:T2?+31,4?;$U4H%L)' MO,Q]\Q5.A;N56-@5>F:>%J<5\Y1:+UU80.),,(83>V2]<4%6H5&&U; [:PRW M!;VH6O(.7U< C4$(#-[CV5T^+5-U964M6=#=,N/SF$'%CC[6\Q%VW)X,DW"X M2YC)6-=!S=!>,=!Q/>E@L.?RS%_T&M)3/5E;6.#Q)$%I./*:E(,4 M 4)@#G&X''Y'R]VED]'T@_F>IW-];4'Z6(J6UX@^,('$U^T52Y,7-$/*V#DJ MH/=R 39 "!3,B2C!-CY61HS4.SWK5^F1H0Z+TM@M/+QT/U! 'XVK;&#WDNYM\+0_R M>QK4M%<4_2Z-CD-0S61F9=[THLD8-UBBG36]Q'P:#S_C2MU% A)K9.:D- F' MCR8$KG5SDY$GX>5.C57*@UR-"E38:&,./FLQ7<-T!$%I1Q"!> -=.$@9FC9\ M=4V;VNCDXJ5P@R*,M]ZP03C<&)6Y+"YFCBM3)D) NX]8UOR4AJ+12$/DZ3B9 M'9SH9=V$2"(V)5[5-\=/\H29]461#R,5\$ O?E8IQ8P]1ZC,(M<&W34QWGC$ M! 9'DQ/J@[I)3_:8_!(_X83GX.^2!;%1^=H0T73.T#%%0"&CRQ$[4-2< M@]S<.4S5G5?GX7GLXKH(1MDYO9"H='6I7!P1KTBTX6OH3(MT^,5"L5")Z"_J M;/^BIF8BIG@IWKQXTER$-J"9J/[D/L?(/L0(DGE*8,0H$HXOZ1L_!@/&B>Z- M.;@/IC"\V^UF;66'4U2A:"Z^>$E5%[40_6:_("@C==5F@%#+V&4E+T6A@:4- M"8+0D$Q3O! P@Y-'! LYB1#4:4/?((R_H%-TT.!Q'UKSXS=U/)O+JVC%:# L M$SJUZP5 RTN4&!7!@FD1LT>( 6*\U9,8T$R#S"&%->Q)0,10V#C(&3HC04HS MN!!MQQS]5Q#2?S-?!M,V?H0T%0>HNG",@Q,1U9VY7QB/+=8H.+\Y@;N5;?T6H5S7%3SUY49!R]5C*5(J=; M<3SA(V_%/58UUY%)=#[J/.GC'L0H1C8-((]G- 8\:QX3R 0J?1)C2.@_\H__ M$-FS!")#3.":Y^-A@AH,P@/5E%&0(H8ST.R!ZP]1%BU"D&\@L#,'UB\,I"S8 M\9!*8"-AI36)-CS2\2?EH(^W%?@XCLE5@E$G\_507J!+'./*&#XW8$$TN#A3 M;Z/(4PF)3K7,:34>:30 9+B(#)$NIV*D-N1<@SE !LDZ%E9B4J+DNL1U9-"/ MAURE+O1+<_7$O%+M&P6I8/E\1*01J>RD%A?>W!1C&5893;<#TM T7J+9U$,. MD.E5)6-D!3QCF=JG0!:135$-P%;Q @;1K423BX6$>03"F&-ZHM?A1A^1QB/ M;I58W53DC(84NM0OA Y+AM!)60&/_BCSR7QK%FB5PE!A $W ,[FH4'<0^G;R M '>>"!*+R)6[A)+=@:S MI#:T\MR21X_K G)%5F6,>FAH<3EW38WU+6DO1]QHL[N0AU<5:*/%](H5T*0PN9:=9M.T>4BC95:9C9/*GS6)18E? ME-?!(R,V+PN/\131Z&Z\#/(RLNECN)7W^ *-3Z"@:8C3,2\KXN43 TDYFTN] M8\C9-) 0I@1*UHGZ6J.8(2X\FA8TJ"5CC$5.SDUZ$?RBP%R4^1Y&F3)A M:0M?1EE9D8HFF#@93M(^;Q24PTQFB%47-)EKY6DDI8QUUKR4+Y;S8N]983+E M:0;3/?"6E4U]Q!I(_L / \;;*-G27R.X@@& M3<9^'.6:%]U\DX@ES(1-+I;6)#B9"RU?C.4U&1D>EHIE8YE81I:(VS&W3,:( M_J'V^)?)4OCAA$?DC9:%6=G4/6U[XUEJ80414G8,:3DMNI:,514%%+98!Y"R MPY,IE$AAO\;F]&_:BU,I3,9; IOS HT!8=Q:(3?3E#'*BXD5P!AZCIXEU]\% M>$@5W,-;EH0BE?(C(X*'T"0 PS*>9X8-$T3?<9=_3:M7^X1!^UAY26/M9E$1 MM'/M0#JSPG6)JM4R/H[!)&K)DDZ/\")BE5+TI343GIE/+EM:D4PE$K4G1Y'99+7:5!1__8FM=B$BE4CG6:%O\)5+E6+*9DF7)^&;6 M. V4/?7?E8SOW$;FD9T\\0Y/1L'( %LCPVAD"C]3#?+F.V$__-CMP_CD2XO/ M&!0='H3&E"-GUNA-YF&I^=MYFBF/=*<-33.#4Z-H&5)\I5@50-]<7MBGNAK6DG"9K )[#@]8^9W^-CHENH<91947CY2 MY;,I;6IKT&94:6U6FZ95M$EM3ILOI1%C[N@XZA--*9EU>B>E,YF_,#:@HB7# M;7J;R\PWIH^S*B8,G5V1(P8UO#E,5%/X0.^T&+#IL)7;KHU M!)VBQL;->_60!M48=F13Y7R9B,$XD&$6%7$BF/0F=)/T.#+LBU[7[SV87% Z M5&790'V=&/87[9N@#!)#BP5IV=Y@$\!0+G1;!6;SC%HN)Y4$'^E1D]95N*.M MDTE4OY80F7U[C:;Z3PM!]=F-*J"3&7')FX^E=\ECXG4G6&2)G_AV 9WFN:-,.E ;M&'@,HM3% M*&:=L.;_=RH:C9E=/SB3V63D"P:T9NUD^2 V2">">"3>/AE7;I3!2Y7)QQ!A MEEIP)#+NGKHG/E,ZE8H?3^WI[GF'&:*9"#Z9=<#B"D@/LC.G)X8S*0:15!0^ M"#1ZBE\9YA/S?9P\(TR3? ,&?"H M/L!8(&GQ*).:9?\2XW62! UP]TG^0@7:H,,K9H0\UN,YWS6>0-J85^"9B/_B MDE,M6G((:%JC@!*@.IN>QY6!GX_B$M4%QF5>$!Y4+%Z@QF*QV,GH65DGLSAB MTIGZ@LQH/VGTZ4%F>J47@I!:>Y5T%BC4O8UZ5V,^<>6Y>N]B$NHM/:!1* MYS6A&-$KY83J>4[5+\A5@2YHXUTUD8UR"2@#:H"N1&%H 5J& HP-Z!A5JA4O M6VCHN;7533Z>(QF6G9']X]+WF+&1&)#:-WWRGY%G Q7894WCHX GB 9X[=H> MD]_==X):G>E_XF!RW$'3AOIHVF#K%?I),MOF#]HTX5BYC!8Z,Z9%Z&" &)#% M3LW5O;?1V#@5'5 3S*5]_B;S3V\8CL)N;0YPLVH!R'.08_ADQ@&07=GS(_7 M&2UN=>/T^8WNHQRC-$H 4:,4T#5:8P:)V:CG%C"MCTW2OKEO!@'Q*+2Y^]F M"ZF?<\J48-\@!71K0HM;44FJ#3DRF5U,QD).GZ$5IC,X^7Q@&2+H1)6-&6)2 M*,>D5#[!X&*X/2Z(6T/85FHU02E6Y;K +D; +6:\;$(* "N9&PF+8Q@O5FK) M7A?=\X+#O7PQ3T%#_&$^8%PE@_/D;B;/"R=\K3$%'"I#@PF(QLU:AL/@AT43 M"M-X@4@PC5$)_/B')E)F.,:(HQ&7&#*20FM;6FO]*O=%0&ENX2@.A0 H1T3"ZC MFZ9_4PSYLILZ@+SI;YJ;!J?$Z6*#FX*8R^+>91=@IM^3IO2:%J:':70J>TVG MSZEA:KF$?1 G4EE"F775#M0#@(WQ4AD@#C*+3@'7OEVGT"EUVII*I]7I81J;UF"<96#Y,8E*KUN\%;E M5581/U4O!5_$5UGZ(3$YKR(C)YF:,CK0=#KA#$ NS^:VN34WM!8WV#W=;Z\9 M8)DA!C_N3#>CUH0W4,X9]_/4/VT1:&/GH&*5#XSJ.%8S3T]7NI:^1[],&-?% MX:@\ZK#8HVIQ0&H'9*-VI4J-2S/0=(?7Y<=$2,%)B]G((X.6;Z62NK71>&^L MDB!W@ TWUIQ[4\&=3B10F,@^7"Z 3/1W_LEW)!P/]F%E2W8BPY2+!3<.W6]X M)U%-(MG!%$:A>='.O^88T:EOIISJ( MAE>BVF Q0K,3ZH-,755A:@-XT;T_LA>N9*F2/IBJKM3'V%-OSN;$0OE3,Y>\ MB("-JL1-A2/LN% #P-'R[Q7S2CQ&:A"1"'29Q2613$M4"ESQ]PT(%@>R C- M"ITCZ%-\1:H+J;+3Z?BED1?!(WP)7N0@X[5X+:N)*A$XO]V6':B2BN*L4OCC MY20J/#?14_Y#CWHQFUEJ"FGZ6K076?C;,#4_7"4%"Q&,YZH_Q=PPHHK1(1G\ M'31W(/^"IJJI\^J >*;J9KE84#3^[:C3C6]J M;)S%6K'^K#YKT%JQ8JRNZL;ZHT%]EPO/]-%<+SS*4JE3KU4IS9:V7G*C*M48NM,S&)N^U.=1-4NJYA&LAJ1>:M.JK$=B^6K"^ MK2 6!3:P(EP$:]V*K2L9K+J]6# I7E,FA9&J-%>I:KAZ-('B MNAI2NH/6X4D6J4*B]^"6-5+17W J)(6GSJF8ZYV:N9XRE2O56M(L-=P@=0:R M\F"B#WXC#=?D['.39^>8\11=^Q()-<#B0"_-[H; OF\.P5;8J%)3FM*,1+WX M;;OBN_K4K73C2[R ?6@N"83C0NXH<3E:#&NY@$I73^JZ'CUSYM'#]'0R3%^< M#CL#WCP^K DGYF@U\-A[=)7R+KH9D,3UZ+#2C ZKMO)&1RS^^#"Q45-LIY<< M@7TUIXT*HXHP72G6],N$75 4NY/A3YIL=+J??K+0*21+Q$ZR MCRREV@79J#NJ5L.[=9PPE0ZT*FZRP!%@R@3A<%'/2U/+2EN%Z9@S;PEQH4^N M=(S]@09L 0OL*+(<56"('@T!HU1>\2Y%7SGJ F/':D+Y%X.3?4%,+F<%=VP1 M2@?83G;+[&':+-1E[$PNU)*R],W&26G7UA67O:^T5C_Z\[QD4E@>ZMBM;$V? MIMA(DD)0E]2EY3D4%B@1=U(]'2??^,%WGM(4,=Z>72/@ ^;TVO6/+M>$[,W9/[I)@- MW^5D!/!(AI^<2L.Y/ R7(=/2EHZ"4L8#Q0Q,/I(U.U'9B;SLT%.GUE^I6,83 M?R$_K)2KE'(=JVG>UH4!U4OH6^13*P9?"\Q;$_A\"H7@;B,R%6]<%4VSK;&C M>U]$D]6Z,Q#CTVIPFZU5J6:J5=/6ILF M48/,%[->O5FT(I=9IM)$P4MSY-'>'[!Q@%/$$/Y)-77#T"OEX-)*/=*._ MT"^TE@H5W-*=45&6FO,8.^U<$(6?T4ER:N9&ZU2NINHEILM$MP!6(%/=9ERE MZEZ)>GU$W)WNPLB,0JXL_%H3/;4B)NN85_8P)- "TS/E68#1&?/8NCX#4@D4!("4!IZJ0-9C973\3U(CUNC5LW9H4=,"<0J=#,25?05MSSPFTVZ4S. MDWO-1QH8[I7B9F J;HNK\["U+&Z,BX'-N![8B[OB/DO &C2CU)1J&ZT0T-%6 MCEPGB0FATE$(W>+79*TY&-)7).$@; ]<247%J7Y=7'*7W%E>VAOXHM;]L/RI M*/N^R426ZCBC]I ^].UT9!T=0[4/QP.7 3U/C_BJF5D[:@T@*,,:/ M"ZO;C M-C1,$%0*E>:H;FVTE,I>LC5 CDJE^B[>FW?IUA9CQ NANR.YM?[;K"761DLS M5@[3Z/9(8<&#!"V1L^U4?ML:0DC$5F UBBHV&]71J>=^NGENJ(OGCKJ.;(X* ME VS.9A2,Q9MM$7 G"OT66^^H1DCM<$[Z5LFUM/R;DN-#G#8:>S5;A%O4!>% M0Y]"77&7OF3:HCP-[=ATLPUO)MS()+]\"B],JVO>-5J5F[E;W:2='I)96/,\ M>39D.3,CM8S)S3)#ZX2[_FP/>M$)5ON!*SL]^D>(HKYD1].4L EH5#X6BW,5*^:\ =L+&NNPL3 MH$?CBZL++]VJBZQY=KNE,013ONND!DQC#$T+\6&I]E*TZY]*N]*N@SKM&G#. M*34;R%"JE9("YY:R/)#F$8<]?8P/H%SUTGPRC&POQH&5NE2O>63J>E.I+#:+ M'(:=E<]@.*^AL5^L['7RIKMS+NREF:9+BFPX4S2!YC[NR]B1QV(X8)OCXJI[7[A+W/(.(;ZQZ^A>_F MX_<6OH/OXZO%1;Y!4.2;H]Z]E6SFB_ENOI2L@7CY=KZ@K[L;=<6Z9ZR\\]*1 MO8"3'><08*8U:XHXZY1Q;B\9%Z3*ODVGYU/[PKYB'.Y+^\:^NB\6]_GTOK,O M\'O[!K]!*FQ#0"5;B1;[@/IJB)Z<&M6*R;H-G?_VFR4QD%S+![U\7!0.##6X M0D>S3GV$9V4O.ECQM<9TK)NLSB/Z]H(M[]*E\*JZBYS+J_!:D.T+?33,_&(6 M4Q0KD;U*!Y]0VS#AO]E2VFDK?B\6+ZJ#?.&R(:'VTI\1M(UL,4L3S=^)MM<;WY7-8KJ%$X^Y/$Y.D$NY:JK@4*9;L8G,R3]HE] MFI>AY'"IP*I+=&.R 6LO<#M#OV@P)ENT \$H4Y76 ORHCCK6G;\UI@J[J]), M!,J"P/5O$7PK&<% $A%\!"_!NY('K,L(P*X4JP.I"4(*@,"GY7QNR&5,:].N ML_:2MGOM?L%"[TQ+ H_!RI*V6_-4L]6L%FP2.K2/(04E(4Y;AN&] U,1 8.L M$0 !JT!J[\-Z16FI]&3-&[W8G^JGT*FEBBT18K1.K"4K M,8A+3H6$H=JJG%P/7"RU-7B<-^O(I7\"8Y3G"2_!R%0P!P.GP*1P4,MYA5ZE ML&BK"A]*+:#\^-2,4LU[8^DD$3TYK#)O#8%PZ#P^/P.:P.3U#O<,#D#HO#\G Z M3 ^O1C8M.BP&X\,CG6KDUL!L/$_' ]7 _MNRVC]HL9 MY4N,Z[EK";^BF1\.UF(E@D//0VQY8<%T;Q03SB*7:/ 9# 9[P4)O5HP5;\5_ M$A?<\E'%,D\^O :W<1'Q]"+P_3O;-X30Y'C!3UT[^@B3P9U%1N^A/AS/2*H;!5N*6*4*S@!Q&!<( ME@-9/!?J#Z;O1;J[%6U(/DERR%B 9C793'W3GUK;6;8J4(#T]OC&.B17J'9R M,=5I(PAJ/A@66I]U4.[T^ BS1D)RYM?.^Q19\MG&PGAS3KDDM0 M$%Y8P?Q&\AG?8_EN/@T,W98A^V(<&%D\O@.XN1L5.I(XL7+WA_WN)RGLI **<,"A$#.,WA1'9PAE0!#(CE07*,(R2;"6)KML26";L?2C.!3]6Q">Y7U M-AE[04*L;^/#EJ)=$'OF!0$X;."87!>WO#ZL\X;PZC4FP/TZ8//J% MR>U>F$Q$Z;#*EIR,?@FQ8A2PB[GU2AY,"5=+[6("XL=:*/^ZAS)ANB;WO63H3]3K"K%+3\&(^1F6!5A/Z-\ ?()NK5J\\3ZSKWZ1A#O.B MG"8W2%>EN#V%4^MPZLT*C]<$YLHRL%Q2'935KX (L:?G, VW$G,D*S3QS M*?/Y-LR3+-)\G1G'DA;3+-"FOP#M>]0K>T&]SIALI$;,:AA<\_YFLA[JT>S; M>*A),YCT,A.Q?^"OI#/K,4$PS@SL1,T&;!7W!54S%M73+%^1JV)>1LPN7- MA/*IPS?OS%%7C'SSY%JRLZZ,BZU;:S(J2SK#GJC,5OHR\F+!7JJ<.5=S7V4Q M*SP;S]8.+%;,2E=\*ESCX]( FY!=FAOAR[$C<),:LX%?TB^+JXJ'Y*[.-]N0 MO&D,O1AU_48@V*TLFK6L:7.W_"TO=KY)+.!ZP9,R9[2 T).LVC[)K<]%L;/V#07/.[#H[T/0RVQP[ MYW1(LP1]@=U/9G/]#$%/T+CR VU!&Z?Y4P8]-&_0WI/<[#TUT%:S.IA""]!Z M,Q5SP:S0^[.4US_KS$/4T3RS)LWD\/IL+J'GY[LOT6]3K_OXR%S/)NT0#SZ2/PUP7JS!)<+#71K_1J$P1 M[?J.6[2R#ITK$S,";?T&1%-4L/+78W-,W02C3-[S_@IR=LQZ]$/H)P\2[263T",TJ&ZE3K,;& &W1M6F@]SE3I?,TIEQ/T\NAL^W, MY$S.@_,%?4)[TT8J:,9$!\'ALBT-B8D^!G4"_4_WTPFU+=U0HZ6_S>^FUSS4 M$W40?$!3U+ .57I1AV;L=#^]4%/4%:I&?=TDU 7U,Y@QG<9B[_J[*BW.!O7+ M[%"_OY@TYZPK;U0YZHG*3"?41"DH+=\JU%\03OTF?] ^M3ZMU;3]I"P'Q5\25:R95M/"#($&3$;00JZK2"9GS&>B2],S MV6*^G-0L*C71?;42_3?7K#P/1%-8"\%XTG6#&$O,8,_6_!%'S1F5.HT[2]%2 M8CJ-R(;+YK2=N5%%T6;SRBPO*#U=NS^[Q4HM)',S-- M/UO2G$]UO,@K;^U-(LS+SIX;H)#'_U! MN7/K&__J-"LH$D='"[:JBVFMI4Y*(,_*3%D!U/).(?-."P&*[;,NLS!"VXJ=@ \RN&>+,&J?5<9R"?6#SV%NCQG3"+'[J[\ZY M+/]R8S;\&?^:V4:JEFU!HM'Z#H_]];C9V7*:#6>K@[JRFHW+@-EGMIU-9N?9 M<+:8[3K[V6CL>KM4=]GD+I:-_KK)_4T?PPVRJP^-KR/$J8-W#4FSOLTZ&W,2 M9+(2 ?Y"=[UI.=/X]*RC.4=[/4P:C3*OK/!O?Q,?[M$'M@79+_>" +:S"KN= M,N8UAA-KY]ELX.6K.D?,M[;O_##7V@WSZ1PQS]IIMI+]1JMAJW83PV03-]-I MM!S!V='%E ,W=%6EE;44C5HSUGD%]P/7! $UC+0JOUF=*W7I*]L=J03VR#S$ M"L&AIL";:MNJ.#8@DV[/-H%M4^4;@C[ -KS];H/$"I-(?"J'SOAV#&-KX]K\ MMJ_M;^?49S36S&,[@#:8\"XJRJW8XH\(LTE&VQJ346)WUUO>C M8F/;,@ ?I+NT1YXVK&.:ZC2V]6A&8O=RO1S[!%_R+Y\P=I9R>\)X8,MM/[_< M-]B4W>0@V*CQHVUS2]BM=LV-<^OG$VH,LW,7W5CWU:UU ]V+G,^]=0O=7S?1'78; MW6-WULUUG]U@-]#M=:/=8C?;S7.GW;:CY/)"Q]T@3NAR:?L+3W=N%TJBO\HV M96P]=\RQUU5D<%97.18TX^-05'SW!X.)_D+%MH.#M+TV>/4[".KI87D-!AL2 M'IOM\_N940N\$'9('2I'+[1SS#UAC]3C,H3MTFS*23:P'6EKV:KW67IZ?]ZL M=WSM>@^VG?+:W6 WRNLVZFU@+]B9]^ZM>C/2OK?L;7K3WKUW[*U[&]_R;84] M8!_?N3?LW7P7W\TWW35[W]ZC=Q#-?"_?SO> S7])S 17YAS[Y33=M\SE6:.] M!G<5,WZ'WY_M]^WGI*-+++8M*]AES\QV>-S]-CINLF1XH[\?3%?4<(N!D7

,_M@)?>N_<"/H%' MX%JV! ->@%/@&3@$?H%?X,:T!YZ @^ =./GM61-<*[BUT^M\MB". M9RUEM=^R@EA9?$_1[31E30ZVRA+J:5QYTSA .)=%+4; MMM' -A.^A"-WPEO-&H53.U.X'UB%*[Q7)19.C5WA3[AQS86O.I9R$PZ%M[RN M310N:'?8HL^^7&PGV";U5O.#]]W0M1 >"8^9H?BB+0D7KS"V9CXPTR) ]J3.,OLQ[CBY!*. M?83K6@1V(NXO S<1JJ.]R$'9[/,SR(@#@#VVL"V,!^/$N'R+9._>Q7B2G8PC MXT4VD#W)[LI.CA +C9/?[U'(=VW7X*.+.[F7.DBQC8.4-W\PT5#KFY^9VEJ, M6T5@)X$=8HKCX5!S7GA:G6@C=P2X$B8_$[8^]A+MC-?C178RCF3OXW^S7="/ M_^/C%C\>D /D^'C*)) 7Y&CO?IC&4M>=MJ/[&/'A7QA=.S1:;W,Q7%R1&Z88 MN2<;>4VE'#GY?#OSU1F30!U'&[9OM2^>F6[6Q2PN3H:OY/L;2QYYO^1IM$CN MDJOD+7E-_I+3Y#=Y&ZT\I]0\^9WTB(O,E%.DJ9)'.T+Y3RXY5TK 7)]3KWTU M8 X>T\/]RCQY3,.Y="[$,O>C%AT^C/AZ:99JY3\<5UXUA]A?N8U-*]LR)7@% M+H)_X!AX"AZ"F^!^(%NN@9_@:3D*+I?'Y58W6CZ"V^5X.5Q^EZ\S'/A/ MY>#V6>Y5U%7"L5P;,"N"IF#Q\4Y$"-[,?/1!^HS;@3<9X'T<:Y,Y\^^ M=$>-2GO2C*QM?3:'S43SWIW)6LV=;(7S- >[H&P;QEO=1PX8P@N?LH&?/$J]6 VE.Y:VNK/ :Z3H.3PIK!.0D MIH+*)E&1VL8620=&[6")8DB;[8+*UR_-XYO2OQWRZ.L,GUT*>AD,*B?H/RQ] MBIUBZ!SZA>ZA+^@@NH4>HCLXHGD9WD9WAXC9_;()*1R6C82KN!52 ZV+K@T^ M34CAY A--5H'5FXDO;B,Y6^/CD1;YWD,&ZTQ43TH\<("O,'.LX+LE7"89VY5 M_)+.R5$Y#&1Z6A5-:S7H78 %<>5C''9Q 7>3[493Z\I7)39XX]40,X=G\_6% MO4;2?.B5J[BZ@N)DLO&72J_K B<:V2J4["[7"4I'Z+9#Z[ MXY%>([\&-5->IWZK&W":<^42>E,](EA=RG7ZUY@ZL#?9FDF<.GSNJ9^$^5*I M#JJSZJ,Z!0JMG^J5\W2Z*K%QS8ZT[IM*Z\A;J\ZM2^-^.I_^IT?.,C9=S!T> M=BW7*\IE 9-BX-)8P()[/R]%B.P 94T?]07B<7 #$K@^KI._\#F@+JYO%XP2 M[A3Z4'<8W2JK66)T=>RT"S<54^YZ,(=)VXP?DB;2ZDV.DWK&YG*3ZYBRO.JO M=ZPQC,:.L7OL'#O(WJ\KZR1[< .?(V[Y$N+&I;>6>#/2VKE0U]0URT5@64$; MHETKO/VP=2IV.L4<8SR>?*DX1S_PY0_K(3W._;H(-;#;,?3;-"7U\(>)&T;' MM"OM!EDOJ_;Z:P;LS^Y"E\ZVI=K'F^ZT"W3!.P='ZH)/SNEPW,B;N0^WS^FF MB?K)OJNSFF,,KCOY MVROWRL"ZF=X?=YWJ;QJKORY=:7N=>)4^N?XZB->QP^V.>_A,N:OM_KJ%JJ/J MX.=Y3K?/F;$[I[@..P-[V3JTG:F7[J-[E]I[=:G.NO[4NG?K(-)YCF>Q,-W3 MCM9\Y9R $V\#R,Q8:=DE-P(OH>(,F;1PE5S2Z7Z88;/C=7FO\SV-,1A7O#V\ M[3P5;,Y3'6(T EI"-))27K$?"M/74>S8Y4SD#?*KX[F>!+7B0JUQWYWA\7AZ MC)PJD:WO]:G3JJ!ONU%,-+C 3&-OSL%#EP4_\=VXO,CN[Z6Y6/J\]^__^PI# M@BZ3'A#L9+L5;_7F^YKK2F,A31?'P#_P"[P"G\!_P%1M,10N/CLJCOQRP*AD M*26!?NB!I4Z@L5V!P>G^C+IU"/>GBS'6-*=!4I6.8-JN8C-"4_Y"O,[PC:QM M:J/\J5,-CKV:U?6O5/ ;>H]Q>:!; L1SYEH>4 =#"*,F,I@M \ID]1J821/ M)D>7I3F_2]FLS&ALB2X<'^G=%R-ZI[,(UL*.BBV[3KS MY!+Z+J)#\V\H %?-3_/6O#2_GMKFV[RR \SVQ;)-OBS(A/,Y4%ZQK[4/!)UQ MS:N:,!XF,E_!'][+6UT.S\^- !PT;\_7\_A\/*_/JRYVY >#RR@_MU3^]S99 M-VE2GIKQ+/*+_&ZJT+= MN73 'Z%AW@2/PT#P#GP$7]*?]*S28/S1"W"*SK-#LYJR 'P.?\-GRA]W" :X M89>NH#I'!EE(#.%[T],W,#]]%A_ S_0R_0ZOPP]OQC3)_;WM:Q1?79O"\$P7 MG#.%T"%TO5P9KFK#X]&-\:.\)$,"$3W8_-QX/!D,K[D$J]ZC(I=@;3B%5]Q< M=^?RMWPL3\KG;G"]AU1P.3&@COK3U"YX+8QEON2AS0@\/;_/S_. ?5\?V-_S M?WWQ-A\)]@@\ B] 3. M/0HP!>0!;0 ,"X(^ 0"B ^[?&$?#7POWQOX M+HAC$.'/]R<^@R]%$/>F@G'/_:0 :0 *L >D &< "M ^L %/DRPWN_VTH,1 ML.$S 82!'H#?OPW&?0N Y%/W_CT*8"W("6& >/_2,0B/D;$P-P !? K"XA:X M 'H%X ("V D_"H:0]+@ H@)<4*XI '#^W"!',@1Y!8%CYKSYBP?@Q! <,'Z3 ML=!XB"@@ 4(C%\@'>0=4L1@ +)H]86!:# E\@5\@%0 A4($+X(( !I0!'3 8 MF $-Q9>*,80&HX$"X.DG"+7):J =/J?OM$BB$ +J,%F@AK$!J9^J[]%O/JM M!^.PM4@?X\*J_P*<^D?)T:( @ ![ +A@ZQ\MJ;[' (L^\S^"U"VK EX@''@ M&PS[S/ZR_P*,+;T!FT#K5_O6_MR@[9?ZW'YK$"1\^V8 M5_MEQ!82Y(0)# ? M^HG' K9,^^%^D# WP!_<@6-@[C/[V+X^4K5 */?^LH^VW N:25O@MO3[(H45 M\>Z_"7$+LX]M@ !]P+3/ZB<(0\-%(2' 0T%5#CKE_K ?L1_!TS\N;Y^\N[W M^@]_>5 D2/R\"+%O[$/\(__&WQ$D^VX P2][>/O1/FT"[G/[LL>X'_/#^S0_ MET#NN_P]Q,X?[CO[T+ZTO^W3_#:_T#_SG_MPB[J?(^CZ[K[2/_17^_*^!+(= M= <$/QDP-Y !00+RP!HH*YI$N"\Z6"D$?P]1.G )M$K8;Y%P"=D*F4+P)_TK M@R21\"_["W_#3^N'_&Y+Q3_J3_L9/Q#1\:_[2C_(_^M_^FY+RV_RY_UC ,OO M\K,M:('FX?/3_$Y+XB\4+/[G_K,/^3?[^?[DW^T'_3)_N?_S%_V9O\O/]DL? M['Z0T/2W_4\_O@_?T_M4?[R_[S_[> C!_^\W_F> XJ^T./Y" Q"Q]J?[;3_" MK^Z;^W&_P__WH_QCP+!?[!/^AO_/C_C'_H__S5_Z6_NPO^*O_!_]S;[D__QK M_D3_OF_YMP8PO]%/_9_[G#_.C_3C_J _T^^U' E./_2_[$?]J+^]K_J3+?M^ MZ^_UWPMI"UBQMLS^R'_M/P8(_MS^YZ^UZ/Y9^ZH'! (#@7)A# 8J/85^Y(+AX$Q (. 37 WV$60 M^K9_S;X5H$V !F@'L %Z_YI]-H@88)<@!F@3F$T, 1$## (C8"/!!_$#7/8% M 1$#3 @BX#W!NR!% "^P 0A^3\ @@@YP>:!.. +* *> ?H$J8$\ "[BR$ +> M#? ][X X/;OA] 5>/>5 $^ .0NS0$V!,$$@N/<5^S($G(@V8/EO4^%DT !: M(-H +K^40%< \^<;$/?5% B!R[]MQ"%P=J C\ D( C\"C, =056B1! ' "ND M :=]V(8!(&SO 3@&. *_H9_GSX'H!0! H@ #%10 !E_KP,Z@!F@+ :."M< M_TH(G< (X-IB^N?RRR1L$8@%B$ !X,\/^V !Q *"<9_<((]H,M/_D *#/#1 M_BR G8B=Q+(B$5A"P#[8 O$#O()C0@ %U^9H")0!S@45 @<##P!N: ?PG6@#S0")@YL ;2 M_, /Q<"G11[ )E /U#YD!QQ^X3[L@T_B _AB0"#L [$/L@@S ?;A)/$!E 3> M#V0150*"WW[A1M#P*R&D E>!!8*U@F:A-C @Z 8.)V* + M_QI^"0)X8+4O()A>( AR*"""L<"^P-/")7A:@ FV BD$>X-/15(0_\>O( , M 'U_#<#%@/D!P!?JL_AE#!B H4"M8$6 *S@!5/99^W8#$H(5 570Y.?L0POF M DD#USZWX"M0*>$8L )6'L0 JP4<01[ +2@&4"2<'R2!> "WH*D >&!/:"0@ M$!R"YSX<@TV )! 8G#F8"E(*9HMI!%HPIY @^ >&^^B"EX2>0.4!QU HX!MT M_9A]:D %0";P]V<&0 MN!:4(V@&>8$S012#\._E)(<2"> +48/&/YI?]R_R) M^]Z"0D'*7V-A&_%BV$HD'<0 '@'@@5!@'W@WP/@P _, N\&Y 4$AV) Y ZN M!T0#.0))8'$0(\CMPP,D!W>#:$'Q0!U0)_@")!!,!D$ WD&GP$=@.;@!MH"Y\%P7WSAO<#[^_\Q_+""8<'AQ%@0-=@:S KJ M!V.#<@ )H"G0+'CN>P;. : 0K\!9X#OPY]<7["3H_&B!#,+@('1P+I@7Q VZ M_,*#S0G/P&W@!< >% _>"Q*!!D(HQ%(0V&<:W \&",D+3<&>X%EA;^ ?+ !. M!56"#;\WP?U!BD#PZQ V)VR$'P$,X4>@D9 Y>!-L&.0&]4&KX'UP[D<:1#Z@ M'E #$*Z+7[F/--@7/!>P &,(P@6=06*AU$<:'!#,!N0 3L*<0 M"_ ^(7!WZ?/2,CRFTPH"<*$Y+ZJX)!0 ,@DO .@"*L$8L($ 9FP++@6M/;M M!J]_),*=PDY 2^@0"/=]"<.$NT%CP3Z0)$@%1$'T!/804 DZ L%/L! =] F< M$H9&^T V :-P'\CFHXLT"B>!DL)8P:70!0 J6$+L V<(!+_I8*\OW) M!X*$5\$NX:?/2G@1>!/V!\>$<( CX8"P3M@:N!-""+E]?T+\ !@"GA D$!1* M @F%84!#H4_@*5$;4!2&^R:%TD&.@&N058@EW!.^$,A\4PD%Q*B0VX9 M'\ 00@*CQ8%P_M ;*$5\"]>$)D#2H/EA!=@:!"SX!=$ NPCL@_'AT\@L P7F@G1!BZ!S5_]$*)846 9W$%C!-2!2H"L\%SWX-P04CSZ_G= M"L]]3H;:8!.P->!DZ/XQ T.$N,&?W\%PY\?SPVM=#X!*$ M"T H 7XG^F V+^/2&A^L GP M X)@,/ H>#PD. #F/9U'^@ #((OVOVD<$CK.QP:"T0K71"+">.02FA^D!*( M5BPF+YVLQN1P26A^(!-<#CT>YHYU2-+#W+$Y%$]4!.0"E\.7SNQ"=2CH6QT: M3@R'Y@>2 \@#! &B!70#FV'M<,:P.WP_ $[K B8"E 7-P!8@IE#>!@\) ,, M#\D I'A(@"4<$LP=@W; LP#P6'T$/!(?6P(L#"0ET, M#LT -X#OX?:0#J!P@!QFCNH=S)7Q8>&&C@0#" -D-2(<[L/"KI+M2'OT/.C@Q0!C &Z*V(5=2'R\.N"D)C!E &\*K0 M ,H #Q#^87[/?&A!E)5DCAJ(C4/S0VSD"@&$ / M$IX%9HX>X@^Q#*!#?!QV$$N(6XX80 41B>C.T"%:#L.'8@!0G[/@>5@:E"(2 M$56(GD,28@R@@&@&& /< %"("L0"X@U@#*!#1!W.59HK'_,-9 01QC,A%C &@$+V(^,,M(@FQ=!CRRR0$ M"QT#> "70+'/6H%8N!A&)9B#APD2 2=B59$R!/;-!UH"H$11(EFBE.@@/"7> M*G8-1 :(H;[PT^<)9 'Z)K &J &%PP*02@CLXQ!T#98+98 IP"_Q59@@Z"5B M VD0,4,@H*G":] 5*!0$^/@"'X%7(/A!=W!-3/[1#,]]803;@5^@FV@A9!!2 M$W0'QH5S(LB G!@')!R #':&+X!MXCLQG(A.1 W$)AB"^4*"'ST19( M4 DB M J$$\8(D@,-C1$#P8_:-$@&*Q\2O0>VAH,CM*_9I^ZP+%(3:']$@2C$WD"6X <0$R< *$ ?@"3@INXD]17/ PY/:! M'ZB)5 2S0#=Q1\B'& >2 >\ 2$5KXE#Q(V $)".$"/R)'\760$+QA( _""E& M("0+!+^)0**@(H!3#"JN$X>*9D4E16R@=K!3-!;"_>R#K<1/WX]P;E#L"]#= M"S($O(R2 5?B0I Y\!*:"%D##;_=0)I 59@@0"@4(6)]=[_&(8F09I SB%DP M$TN#-(-HHK7O8+@<> 'T$"J+>8 9(#OPVJ=9U/YA_]R!ML%K'VAQ9Q@#$ F\ M"MQ^3@$I0L;0*6#VVP'& 4Q^/8231>W E @4Q $N^PZ&?4,50I>@(K!;1!SJ M%CN#Q;Y%Q7_A8 CLFRO>!X."X3YUA?.@(C@1G#_D$O$ WKTB8*X"NJB/2 ). M%VT"F47_@Y>B3+&K<$&('PA^N,6*P SPM5CLLR L!HR+C<4U@%! M7!>G"@V M_(I]Z46A0&T1OS V9/:%%\F'NL7[(H-@1/"+,/G!*_05\D638FNQ]F#R,R\^ M!6:+M<3:(L'/P-@&2"U.+!J,<,*WXKS0<+A8?$1,#%J&H,#"8F213NCRHRQN M"+.+:4+.XEOPLSAB%"T&%O,7<(G]1O_A;3!,$%Q,5Q$6YHGM1P)A<7%GT M*IB+-H%5!76QN4BKV$9X]ZR+V\5M!'81R"BF,%-X%X4'X,44HWB1P%A>E"08 M%UF&]P(?X8RQV =EG"_2!_V$2D;\XHHQR[A?% H %W,,\8H (W)1PI@J9!,V M %$3+8J"'^=! ,A@=#"N%JL$!L8PQ<5PU8<'O!1F"#07+@"2P#XP;]AP8!#X MC3(';H5+8:"Q(0@E0$RT&%9]PD5-@@(@T6CN4RX>!\J!@876C7-QRD#PJV!$ M&I<093]F7WQQT9BG0#2R)IA]CL9*XP3CTCAIM B(&FT"41;M(J4QW.=P8!"D M&C.-W+Y6XTM W %KK/99&DLRJD93(ZMQU!BZ,!74&IE]%9 65J[Q#4#P"S;. M3WZ-RSYC8^-BV%AL5 KUR)B-X3[ B93@V*CVBS8Z&Y>-R,:Y *C@)3 J@#9R M^[(JW$9?8[7QVP@4>0G8';*-=!&)AZ\(W?CG>SBP&]6-Q@)T(^#$W-@6D#>2 M";X?WL9JW^R"3!#BRS<"&TD%#@@BHZZ1VQ=/"3CZ&Y=]!4?8Q<$1!%!PQ#=F M&^LX],:%XZ> /[!N'#=6^R:.#$>!([$QW(=QI#9N%PE^GX)IX[G1XLCL"SF& M&R6.!I9>@;CQX\AQ+%V\!&X 9(*'H\LQB8)IM#AN&O^+'09/(Z,"U&AC1#*V M',D$-,=2X\:1X/C>"SK6&F^.G49.8YBQUI<@"#&0 =*,G4;*'MYBT@?A0T\, M^X [0HUWT) ,P$2N(WX]J9[_8840!Q@PK!A1\8\>^XY:/O^<44#=(".P G\0 ,T^,P 2#X%@($OW= 7R"3, M'CT%2PC)HQ$@]Y@",#[R'DT(O\SQN8??BBQ# ^/I["P'-1<-!=J&/0 $@'L][^T<5 ;V"Q:?<0P,4 M^/A[TP*G0(1@_,A_O @0^0Q\"+[/XXEO[/@@V E(^ J0PX7!8XFA<2$7D E< M^.)[TSW^WN>1(^ 8( /('PU\J$>^8QA@#1![-#O.'M%=-KZVXQ+@DD 8D/ A M 7Z**06SP-D1*V $X#S^'SE\V $!I.CQ[UA^]/*M!@D$!+[G'A. X\ LX K, M 7Z0Y<;O7MMQ", =J .(!O:/2X#Z'@52^8@&&!%@!.2/\3TGY. :0(=(#]HS+Q0<"#G.^% M %1 MT M(;L"*8 5) OK/< >$4-.(CE\.X(/Y!4@!;#AXSB<'9M"DL@G)!WRPW>'1$'^ M^))\00 V %= #( =$/-I)IH7+0PIP7=ONK=M^!%&^(I\>@$(HV,@*C![=&J8 M"ER100 7P)8O") &Z!DP^9Y[7 4@!( 49 =X *D (A["(W;'@J ":"-5#B4 M]^H 9X OWQQ +V M(QD$QCW1Q"3A\X@&8$@Z) &/2P"0Y(Z&VQA1L3UJ(XV/5)_$D>(O<2^$<40!Z@'WD;,>XM 6Z2^KTCY%Z 0$ &J$?^ M)*L 01'BN_ 9^+211;XCI$I )_"-_$GB(_61?0&NI*_(N%>2).[A M)%$ 2(#U ,?!)QF.U#S6(M, ^4@ )#_R'*F*! LH(=R2?4GCHQ+@#="&I$<6 M^#R2$LESI%,C+ F6]$I.!)H,A$D4P%526?!YW$HR)D.2!XVU2@,2"0"71 $L M >H %$@4P/7 #1":'$W^'I5[IDGV7I /!7 %Z$RZ)O>.34DSQU/RL6'<@TWR M)+L43#Z[@W$O'&F;S$KF)E&3(P%E9.GQ*+F.M!:L 5J29\F/I&82,Z&.E )< M)/5[\P)+PD9RRW>/_!W0 =H#$8M"@5!R%6G;,/,!]ZB3NDCN0(-1-#"/3 /4 M(Y6/X<@D +5@\-"/U!3R)7V3[,@"GQ3@#;!WC$WV),F3QSU:) I )ED&6$\> M.F(%WCT4@!6 .GF:&%AU$ZJ M'U\%#P?)XQ&@-;F(9 ,T(CE\M4DI FD2-]F?-!88]RZ/ODDK@(+R]_C<0P)X M'HF-H,>^@(@B-GF=E/!A)AV4O0))HN011_F!M +4]\X+&SZ.Y$]R',E36$P2 M]^1(ZDB!I%]2OS>+K$5N$<( F808)5:R-(FD/"1A%\-[!2PX<6:$GB M)P&/)LI7@91@Q >B1 %H*8V/:\JQ8%WR2*F6'$H2=MH"DL>OY/XQ"Z"@E"^8 M((&414KM(Y\2'3FG=$#6*;4 Y8>]HWQA3PFGY%!N'>4"I928 #8"!@G=.PPX M(S^0T4BGP#2RQ1<<'B65\,HZG[<27$F-'%>6*[$"/TE_)OW%?&+5F0<\O&1;N28+F63*(,C22/",N)P<)R3AG?*_+A M+,L";P 7 ,\2#9 0^#S* ZRN@!3 ,/TK0XQ?R#EDHV#RB M R3?,S)$&N^$Z0.X@77_IQ9IE:D$X^ 0:2P#U$02="0N"3S$9^ M()T 98#H0<@22/E<,$OV)GV7X$>>Y$2@=C"UO%0&%CP%KTLC #-R#JFMG%I^ M'Z,'#<;Z9(POR=>[3/+!)+U\8(7G0O6R_7" 7%ZRL!0(>H4@)-\12:"X=.XU M+E$ / 43P1N@B%12^$(J]SR7=0#0Y<8RN:=\)%TJ]W:5JLO4Y1R29,F"#"Q( M$&U\,<@$W][Q(K!]&%GN'[L'70$+9E@ 5*!P^.X9'X^78H $YGJ 0'!V+&BD M!N)[23XEP([@O%"X,>[% )A\G$62I0/& F/_/)=*?5[5\PMGQ9S]I@ ^6(:'X< 0T7L0 M@(I 3R .< M'84"@QL\9#SROE?DFQ5@)^>8N3V$1LF H"$E<#66"MX&%P+=GES MF$J\.T] M]Z@ UP/\GEP@)UG?N^\E^620^4?4X $R"PF"U&&2(-<#+. ,( M'LN8!PV>0%8R$5GD[R+[!_+$+N,F]##4@:A(1/>"![+/(E M!2@"3TL0IJ02K% [&&=*,PF4X$@N0'1/ 4")]/#!,DN9W2IU")-%1B M [>9O QR8=Z5#ZV(+Z0G$?" 'FAOG="T.[I M]C $8AW)HXD 73#.)&.:,7V7!DH/W^UR#E"7="X<*F63U4?E(WVR"AA[W#^R M-+U\/HP1=2^]A[*/"=%ZZ6B4CCXS+3\VA\#/-I'T4#GX$]Y/Z1L@#A8TBZ M,LT"'TCA >?RN;?27%FB,B-\VL<90DWA//"%I%V"'C.9=,T[8D13MZ?0"&KN M]Q*1;4?.)0,3/T"@3/(]!K25H %H06(S:I"(U#ZN B.8/S[CHW+AO_B%3/*) M,Y69:$MB!0H 27"&_#L*#ZX$+('5)C,3!8#1S!. *;5\N\R Q#42]#AXU&M* M*C^:(4W/(]R2I&G0W&:N-!.:)4@6WW.O)W &N @X!= $;XD'WUR)>"&Q&FR M*?F0(,Q7IG./#9D]X%A>$F*/HL?DIF>3.V"*K"7X+<>;WLQ18#NR*HG)Y%SF M]8Q[CY-#X6-\<&JLTBWS3SN:=$K$ M(\L FTU,)9?GBPD'6#[J'5./*8#X81#8 5 9\=C293ODJF@/ GL M"=^8QCW" $S!#%D&D%** 2($R4?.[Q M'BT"<0+5IDH26@";U&6>4?I+ML[/GD-RU,DE, *8.N6=.+&$ 4/5IE[S,) 3&#P4 M^!:9GROQ@E^)&J.+(V:X(&0> M'PF<@DX4 U2X(D"@ J !H@$J$A[)F(STADCFG3&^/*/*@&*IVKS#LE3* M-KF9\@5T0S0SLW?BW$%L,^F9'TCR@1+313 '0%\2!8P"G\<+Y3USFRD:2$+F M#/R<[\Y22B\3I'EAQ&WB..F<(T\FP:U@_QCC>^X)!!\%TX+]IG[/\0BO,NY5 M*3]\XDWQP)! @0FK1'MR/O>/24^4)FES_[C,'&E*%0I\B$Y)9N-(XPGWE&T: M/7^**,^2S#5RY0G=BQ[T.=./.DY,I5/G"[-7V7E.&GJ>34R20- 3DSGT;%0V M.,>.F018'UK@"UGD0W3Z-C.9*DT$GV/SP1?A"_X1/I.91;[29Y&/MRE[_#N& M^91[L$='Y,3@PPD5<&O.&CV;%0'BGO#SLCG>"YH(]L'^CW% %HS"JG^5$>6.(.;S[V!8$\@:\FLI&DB M"O:97\A=YARD 1GZ5$YR^$P1DLJDP ?29U#@2TER,Q5\"H#4HY^BG3F/?!1L M^1"=63\\C)H+OQ#??RVZV^!J:!\C-XP4#'"F./.^9 M(R^>/TW.@*-%\NC4[%D^]TR:FJ0&&1PH-6X0F@ PI+F&QV!;"8[$\)WX?S[PD:>'>^ M=%*.DL?>)>^RP!?B[(/&0%$ /,BK91Z@P@E4J'L"^?1[DE!W)")T9'D8^%FB M /Z0C<_=YC7SOO?13[E H@3P_#VG%\"0Q>?4=#.)]S3 5K Y$@F M/-F9VL>40L73$9E^C&PB-G.:ILP&'U@!S8F!6*LL-[,#84KAYI:/+Y *W3O: M(!N274W?Y313^UA6 'DF^5J?14^$ %2@#6"6% _Z+@N8%$SQ(^JSU=GZC$EV M!0@.0-"&*"0T%NKXE"\(-NF=GT<+Y]FS@1D+-3YZ-U<#"]"/YGG!^@E3D!RT M 1RA!A:*)A)S[LGT_$!J0A.12;YE9A/3T]F\?&R .\&9-P#V'DYRWKFZK&+N M-I$-4%$4P'M@R]>B8'Y6/0D$9P"SI+6@IUGD&^XIO_8*S4ME9'S/N!?F Z0 M'?4*T4>NJ.:QA=%MG()$*(L =<>$0V !+]J Q )L^2B8K4W"I_# 7)FX2&^* M,%T TX+S B"3L2D4+7_"'!N9"0>*YO=3ZMGE2UB2/SF0\D^MI.\R._#U''2F M%*P%+0"C@((OLLD84'\^,1NCJE$7@$K 1("Q#%UV*4R7]E 70/KS,OJ_]!1\ M,8^@_3U1Z"E4)S 1 UB(_5[1<@D7QW *.BJ?(9""UH ,4U7J%?S%0D6!3^J M!. K4V;9JOS*E"7C 4*-G.:]L=C)1Y@&UJ:#'+*D:JCG@(;7\,S_C04^.0%W41LEW; %P, ^:TTS.XSZT4QF*/'H2 M(&.6$,[6*%0RRL<<#6$."$B8LU$4IFU48PG#W(QZ+M.?$E#EIHWOW&E^G%H6 M^5Z;;$T&*6$ ,3IX?" :]SR0;4?'@(&2>$G*]!E<0R&B]7U"Z9TPTX^/9K F.+,&4K5% 9H_49_ CI0&4,(6D*\S1994OAGDD75;N M0%$ VD@GP5!A*4 %H'9*+46#_S_6PU5A;*!5."I8%+H*C%*.0ANBW'>W> +$ ", end From fritsv@cwi.nl Mon May 9 18:09:11 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA25111; Mon, 09 May 94 14:00:18 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Mon, 9 May 1994 16:09:12 +0200 Received: by specht.cwi.nl id AA01028 (5.65b/3.8/CWI-Amsterdam); Mon, 9 May 1994 16:09:11 +0200 Date: Mon, 9 May 1994 16:09:11 +0200 Message-Id: <9405091409.AA01028=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: reachability for unbounded buffer systems From: robg@info.win.tue.nl (Rob Gerth) The reachability problem for systems consisiting of sets of finite state systems communicating thru unbounded, perfect FIFO queues is undecidable. However, there are decidable subcases. One class is indicated in a paper by Jan Pachl in the Conference on Protocol Specification and Verification VII in 1987: reachability is decidable for systems that have the property that at any control point the possible queue contents are recognizable. What I would like to know is the progress that has been made since then. Both in finding practical algorithms for showing reachability, possibly for subclasses of systems, and in generalizing Pachl's results. If there is an interest, I 'll summarize to the net. Thanks, Rob -- # internet: robg@win.tue.nl | Rob Gerth # # EUT: HG 8.85 | Department of Computing Science # # voice: +31-(0)40-474389/4124 | Eindhoven University of Technology # # fax: +31-(0)40-463992 | 5600 MB Eindhoven, The Netherlands # From fritsv@cwi.nl Tue May 10 14:25:31 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA05871; Tue, 10 May 94 06:25:41 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Tue, 10 May 1994 12:25:31 +0200 Received: by specht.cwi.nl id AA02177 (5.65b/3.8/CWI-Amsterdam); Tue, 10 May 1994 12:25:31 +0200 Date: Tue, 10 May 1994 12:25:31 +0200 Message-Id: <9405101025.AA02177=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: paper available (draft) From: Lawrence C Paulson The following paper is available by anonymous ftp from the University of Cambridge. Instructions: * Connect to host ftp.cl.cam.ac.uk [128.232.0.56] * Use login id "ftp" with your internet address as password * put ftp in BINARY MODE ("binary") * go to directory ml (by typing "cd ml") * "get" the file final.ps.gz from that directory. Lawrence C Paulson, University Lecturer Computer Laboratory, University of Cambridge, Pembroke Street, Cambridge CB2 3QG, England Tel: +44(0)223 334623 Fax: +44(0)223 334678 A Concrete Final Coalgebra Theorem for ZF Set Theory by Lawrence C. Paulson A special final coalgebra theorem, in the style of Aczel's, is proved within standard Zermelo-Fraenkel set theory. Aczel's Anti-Foundation Axiom is replaced by a variant definition of function that admits non-well-founded constructions. Variant ordered pairs and tuples, of possibly infinite length, are special cases of variant functions. Analogues of Aczel's Solution and Substitution Lemmas are proved in the style of Rutten and Turi. The approach is less general than Aczel's; non-well-founded objects can be modelled only using the variant tuples and functions. But the treatment of non-well-founded objects is simple and concrete. The final coalgebra of a functor is its greatest fixedpoint. The theory is intended for machine implementation and a simple case of it is already implemented using the theorem prover Isabelle. The theorem, like Aczel's, applies only to functors that are uniform on maps. This property is discussed and it is noted that the identity functor is not uniform on maps, a point omitted from previous literature. From fritsv@cwi.nl Tue May 17 14:23:16 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA03881; Tue, 17 May 94 06:23:34 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Tue, 17 May 1994 12:23:17 +0200 Received: by specht.cwi.nl id AA04788 (5.65b/3.8/CWI-Amsterdam); Tue, 17 May 1994 12:23:16 +0200 Date: Tue, 17 May 1994 12:23:16 +0200 Message-Id: <9405171023.AA04788=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Graduate School in CS From: ereijone@ra.abo.fi (Eeva Reijonen) Turku Centre for Computer Science TUCS - GRADUATE SCHOOL IN COMPUTER SCIENCE Dear Receiver, I should be grateful if you could forward the following information about our Graduate School to students currently considering studies aiming to the Doctoral degree in Computer Science. Thank you very much for your help. Yours sincerely, Prof. Ralph-Johan Back Director of TUCS Ms. Eeva Reijonen Secr. for TUCS ___________________________________________________________ TURKU CENTRE FOR COMPUTER SCIENCE - TUCS Graduate School The Graduate School of Turku Centre for Computer Science (TUCS) offers a programme for gaining the Doctoral (Ph.D.) degree in Computer Science. It is open for students from everywhere. The teaching language of the school is English. Prerequisites are either a Bachelor's or a Master's degree in Computer Science or in a closely related field. Study time is expected to be 6 years when starting from Bachelor's level and 4 years from Master's level. The Ph.D. degree of Finnish universities is internationally well recognized and highly regarded. The Ph.D. degree is in most countries the basic requirement for a university level tenured position in Computer Science. It also provides a solid basis for doing applied research within companies active in the Information Technology field. Specialists in this strongly expanding field are in great demand, and will be so for the foreseeable future. Turku Centre for Computer Science co-ordinates Master and Doctoral level education as well as research in Computer Science among the three universities in Turku; University of Turku, Abo Akademi University and Turku School of Economics and Business Administration. Presently there are 11 professors and around 30 other Ph.D. level researchers in Computer Science at TUCS. The Graduate School offers advanced level courses in Computer Science and supervision of students within existing research projects. Students are expected to take courses from at least two of the main research areas. Each student is assigned a supervisor from one of these fields. The main areas of research at TUCS are: - Theoretical Computer Science (TCS) - Algorithmics (A) - Software Engineering (SE) - Information Systems (IS) STUDIES AT TUCS Curriculum Requirements The curriculum for the degrees of Master of Science, Master of Business Administration and the Doctor of Philosophy follow the Finnish standard requirements.The Master's degree requires 40 credits in addition to the B.Sc. exam. Part of these credits are obtained by taking courses and part by writing a Master's thesis. The Ph.D. degree normally requires a Master's degree. In addition, the student has to get an additional 40 credits in the form of courses and do research leading up to a Ph.D. thesis. A standard course, covering approximately 50 hours of lectures, 20 hours of assignments in class and a smaller project assignment will usually give 5 credits. There are also smaller courses and seminars, giving 1-3 credits. Academic year The academic year is from August 1 to July 31. Fall term goes from September to December, with lectures from Sept. 10 to Dec. 10. Spring term goes from January to May, with lectures from Jan. 10 to May 10. Course examinations are usually concentrated to the end of the terms. Financing the Studies The Graduate School offers a certain number of grants to new students each year. The grant is sufficient to cover housing and the basic living expenses. The grants are given for 2 years at a time, the continuation being conditional on progress made during the previous two years. Maximum time is 4 years starting from a Master's degree and 6 years starting from a Bachelor's degree. There are presently no tuition fees for the Graduate School. The students are expected to enroll the students' union, which involves a rather reasonable annual fee, in exchange for the services offered by the students' unions. This service includes e.g. support with housing arrangements, subsidized meals and subsidized heath care. LOCATION OF TUCS Finland is a rather sparsely populated northern country, mostly covered by forests and lakes. Turku is the oldest city in Finland, founded in the 13th century. It was the capital of Finland until the beginning of 19th century. Nowadays it has approximately 160.000 inhabitants. The city is located at the south-west coast of Finland, at the entrance to one of the worlds largest and most beautiful archipelagos, with around 40.000 islands stretching the gulf between Finland and Sweden. TUCS and its Graduate School are situated in the Turku Technology Center. The Computer Science departments of the three universities in Turku are all located in this center, together with a number of other university departments in Biology, Biochemistry, Physics and so on. The center also houses a large number of high-tech companies in Computer and Communication Technology, Electronics, Biotechnology and Material Sciences. The Technology Center provides a fertile research environment with ample opportunities for collaboration between industry and the academia. APPLICATION PROCEDURE Applicants to the school should write a letter to the Director of TUCS. The letter should contain a formal application to the school, together with the following information: 1. Curriculum vitae 2. Financing plan for studies 3. Application for financial support, if requested 4. Letters of recommendation (2) 5. Official copy of examinations earned 6. Certificate of knowledge of English 7. Research interests (optional) As certificate of knowledge of English, TOEFL test (minimum 600 points) or corresponding knowledge of English is required for applicants outside Finland. Deadline for applications is June 11, 1994 for studies starting in September 1994. Application deadline for studies to be started in January 1995 is October 15, 1994. By the deadlines the applications should be received by the Director of TUCS. Additional information about studies at TUCS and about application procedure is given by the secretary and the Director of TUCS. CONTACT ADDRESSES Director of TUCS: Professor Ralph-Johan Back Turku Centre for Computer Science TUCS Lemminkaisenkatu 14 A, FIN - 20520 Turku, Finland phone: + 358 - 21 - 654 382 e-mail: backrj@abo.fi Secretary of TUCS: Ms. Eeva Reijonen Turku Centre for Computer Science TUCS Lemminkaisenkatu 14 A, FIN - 20520 Turku, Finland phone: + 358 - 21 - 654 204 fax: + 358 - 21 - 654 732 e-mail: ereijone@abo.fi ------------------------------------------------------- Eeva Reijonen, project secretary Turku Centre for Computer Science - TUCS/Abo Akademi Lemminkaisenkatu 14, FIN-20520 Turku, Finland phone: +358-21-654204 e-mail: ereijone@ra.abo.fi ------------------------------------------------------- From fritsv@cwi.nl Tue May 17 14:24:58 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA03889; Tue, 17 May 94 06:25:15 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Tue, 17 May 1994 12:24:59 +0200 Received: by specht.cwi.nl id AA04792 (5.65b/3.8/CWI-Amsterdam); Tue, 17 May 1994 12:24:58 +0200 Date: Tue, 17 May 1994 12:24:58 +0200 Message-Id: <9405171024.AA04792=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: PODC94 Program From: James H. Anderson [The following information can be ftp'd anonymously from thumper.bellcore.com in pub/podc/podc94prog.tex thumper's IP address is 128.96.41.1] PODC '94 PROGRAM AND REGISTRATION IMPORTANT NOTE: Please note that hard copies of this program will NOT be widely distributed. This policy has allowed us to reduce registration fees substantially below last year's. Also note that the room accomodations INCLUDE meals. Since we have to pay for these rooms on July 15th to hold them, it is critical that you register promptly. There are nearby hotels, but the rate are likely to be higher and will not include meals. LATE REGISTRATION FEES WILL BE IMPOSED FOR CONFERENCE REGISTRATIONS POSTMARKED AFTER JULY 15th. Association for Computing Machinery Thirteenth Annual Symposium on Principles of Distributed Computing Griffin Commons on the UCLA Campus Los Angeles, California (U.S.A.) Sponsored by ACM SIGOPS and SIGACT With the support of The Computer Science Department at University of California, Los Angeles August 14-17, 1994 ---- ---- ---- ---- ---- ---- ---- ---- ---- ---- PODC '94 Conference Registration --- UCLA --- August 14-17, 1994 Program registration includes: Sunday night reception, Banquet, coffee breaks and proceedings. Please circle the appropriate registration fees (quoted in US Dollars). NOTE: The student registration fee includes the banquet. Students NOT wishing to attend the banquet may deduct $35.00 from the registration fee. Please make your check or money order in US Dollars payable to: PODC '94. Before July 15 After July 15 ACM Member $215.00 $285.00 Non member $285.00 $355.00 Full time student $110.00 $135.00 Please mail to: PODC94 Registration c/o James E. Burns Bellcore, 3X-114 331 Newman Springs Road Red Bank, NJ 07701-5699 Name: _________________________________________ Affiliation: __________________________________ Surface Address: ______________________________ _________________________________________ _________________________________________ Name on badge: ________________________________ email: ________________________________________ ACM number: ___________________________________ Student ID number: ____________________________ Phone: ________________________________________ Dietary Restrictions: __________________________________________________ A conference registration/information desk will be set up in Griffin Commons at the UCLA Conference Center throughout the meeting hours of the conference. ---- ---- ---- ---- ---- ---- ---- ---- ---- ---- PODC '94 Hotel Registration --- August 14-17, 1994 The PODC Committee must pay for the rooms in advance in order to reserve them. Please send in your (prepaid) reservations as early as possible, but no later than July 15, 1994. Availability and price of rooms after that date is uncertain. Please make your check or money order in US Dollars payable to: PODC '94. Accommodations at Sunset Village include breakfast, lunch and dinner in the Griffin Commons Dining Hall, in the same complex where the meetings will be held. Rooms include phone, TV, private bath, and daily maid service. Singles run $90.00/person/night, and doubles $70.00/person/night. Accommodations at UCLA Residence Halls include breakfast, lunch and dinner in the Residence Hall Cafeteria. Rooms include phones and maid service upon arrival. A community bath is located on each floor. Singles run $63.00/person/night, and doubles $42.00/person/night. Name: _________________________________________ Surface Address: ______________________________ _________________________________________ _________________________________________ Phone: ________________________________________ Arrival Date/Time: ____________________________ Departure Date/Time: __________________________ Sharing with: _________________________________ NOTE: The full amount must be paid in advance! Sunset Village: $90.00 single $70.00 double Residence Halls: $63.00 single $42.00 double Room accomodations: _____ Nights at $______/night Parking Permit: _____ Days at $5.00/day Total Remitted: $______________ Please mail reservations to: PODC94 Registration c/o James E. Burns Bellcore, 3X-114 331 Newman Springs Road Red Bank, NJ 07701-5699 ---- ---- ---- ---- ---- ---- ---- ---- ---- ---- General Information Symposium Site PODC94 will be held on the campus of the University of California, Los Angeles. August in Los Angeles is warm (average 76F) and sunny with cooler evenings. Los Angeles offers activities to suit almost any taste, from beaches and mountains, to theater and museums, to night clubs and amusement parks. No matter what sights you plan on taking in, be sure to pack your sunglasses. Transportation to UCLA BY AIR: Los Angeles International Airport is located approximately 12 miles from the UCLA campus. Car rental can be arranged through any major rental car agency. If driving from the airport, take the San Diego Freeway (the 405) North to Sunset Boulevard Exit East and follow BY CAR directions below. Taxi Service is available from the airport to Westwood Village and the UCLA Residential Complex. Individual one-way fares range from approximately $14.00 for Super Shuttle (310-338-1111) to $25.00 for a taxi (Yellow Cab 310-837-7252, Checker Cab 310-822-7777). Bus service between the airport and UCLA is available through RTD bus line #560 (call 213-626-4455 for schedule and fare information). BY CAR: Heading South on the San Diego Freeway (the 405) take the Sunset Boulevard Exit. At the stop light turn left onto Sunset Boulevard. Proceed east on Sunset Boulevard to Bellagio. Heading North on the San Diego Freeway (the 405) take the Sunset Boulevard Exit. At the stop light turn right onto Sunset Boulevard. Proceed east on Sunset Boulevard to Bellagio. >From Sunset, turn right onto Bellagio and proceed to the stop sign at the top of the hill. At the stop sign, turn left onto De Neve Drive. Proceed down the hill and park in the SV parking structure. Passports, Visas, and Foreign Exchange Participants are advised to check their individual circumstances for entry into the United States. Proceedings The proceedings will be distributed to all participants at the symposium. Remote Computer Access There will be terminals available for remotely accessing your home machines. Conference Committee Program Chair: David Peleg -- Weizmann Institute and IBM T.J. Watson General Chair: Jim Anderson -- University of North Carolina at Chapel Hill (anderson@cs.unc.edu) Treasurer: Jim Burns -- Bellcore (burns@nova.bellcore.com) Local Arrangements: Elizabeth Borowsky -- University of California at Los Angeles (podc94@cs.ucla.edu) Program Committee James Anderson---University of North Carolina at Chapel Hill Brian Bershad---University of Washington Israel Cidon---Sun Labs and Technion Michael J. Fischer---Yale University Shay Kutten---IBM T.J. Watson Yishay Mansour---Tel-Aviv University Keith Marzullo---University of California at San Diego David Peleg---Weizmann Institute, IBM T.J. Watson Mark Tuttle---DEC Cambridge Research Lab Orli Waarts---IBM Almaden Jennifer Welch---Texas A&M University Agenda and Technical Program ---Sunday, August 14--- Opening Reception, Griffin Commons Terrace ---Monday, August 15--- Session 1. Chair: Israel Cidon 8:30 Invited Lecture Jon S. Turner University Washington at St. Louis 9:30 Reconciliations John Howard, Shmuel Katz Mitsubishi Electric Research Lab, The Technion 9:50 Repeatable and portable message-passing programs Robert Cypher, Eric Leu IBM T.J. Watson, IBM Almaden 10:10 Coffee Break Session 2. Chair: Jim Anderson 10:40 Making operations of concurrent data types fast Martha J. Kosa Tennessee Technological University 11:00 Delimiting the power of bounded size synchronization objects Yehuda Afek, Gideon Stupp Tel-Aviv University 11:20 Wait-freedom vs. bounded wait-freedom in public data structures Hagit Brit, Shlomo Moran The Technion 11:40 Contention-free complexity of shared memory algorithms Rajeev Alur, Gadi Taubenfeld AT&T Bell Labs 12:00 Lunch Session 3. Chair: David Peleg 1:50 Self-stabilizing algorithms for finding centers and medians of trees Mehmet Hakan Karaata, Sriram V. Pemmaraju, Steven C. Bruell, Sukumar Ghosh University of Iowa 2:00 Leader Election in the presence of link failures Gurdip Singh Kansas State University 2:10 Stabilizing algorithms for diagnosing crash failures Jeffery C. Line, Sukumar Ghosh University of Iowa 2:20 On the coding of dependencies in distributed computations Claude Jard, Guy-Vincent Jourdan IRISA/CNRS Beaulieu 2:30 Probabilistic self-stabilizing mutual exclusion in uniform rings Joffroy Beauquier, Sylvie Dela\"et Universit\'e de Paris Sud 2:40 The impact of synchronization on the session problem Marios Mavronicolas University of Cyprus 2:50 A fault-tolerant dynamic resource allocation algorithm Injong Rhee Texas A&M University 3:00 Implementation of authenticated communication based on hierarchy-relative naming scheme Nobuhisa Fujinami Sony Computer Science Laboratory 3:10 Derivation of fault-tolerance properties of distributed algorithms Philippe Qu\'einnec, G\'erard Padiou IRIT Toulouse 3:20 Towards a minimal object-oriented language for distributed and concurrent programming Matthias Radestock, Susan Eisenbach Imperial College 3:30 CoLa: a coordination language for massive parallelism B\'eat Hirsbrunner, Marc Aguilar, Oliver Krone Universit\'e de Fribourg 3:40 Coffee Break Session 4. Chair: Mark Tuttle 4:00 Using belief to reason about cache coherence Lily B. Mummert, J.M. Wing, M. Satyanarayanan Carnegie Mellon University 4:20 Open systems in TLA Mart\'in Abadi and Leslie Lamport DEC Systems Research Center 4:40 ENF event predicate detection in distributed systems Willard Korfhage, Hsien-Kuang Chiou Polytechnic University 5:00 Mixed consistency: a model for parallel programming D. Agrawal, M. Choy, H.V. Leong, A.K. Singh University of California at Santa Barbara 5:20 Global flush communication primitive for sending a message to a group of processes Ashwani Gahlot, Mohan Ahuja and Timothy Carlson IBM Research Triangle, University of California at San Diego, Ohio State University 6:00 Banquet, Griffin Commons Study Lounge ---Tuesday, August 16--- Session 5. Chair: Orli Waartz 8:30 A checkpoint protocol for an entry consistent shared memory system Nuno Neves, Miguel Castro, Paulo Guedes IST - INESC Lisboa 8:50 A performance evaluation of lock-free synchronization protocols Anthony LaMarca University of Washington 9:10 Using $k$-exclusion to implement resilient, scalable shared objects James H. Anderson, Mark Moir University of North Carolina at Chapel Hill 9:30 Disjoint-access parallel implementations of strong shared memory primitives Amos Israeli, Lihu Rappoport The Technion 9:50 Coffee Break Session 6. Chair: Mark Tuttle 10:20 Time-optimal message-efficient work performance in the presence of faults Roberto De Prisco, Alain Mayer, Moti Yung Columbia University, Columbia University, IBM T.J. Watson 10:40 Resilience of general interactive tasks Benny Chor, Lee-Bath Nelson The Technion, Stanford University 11:00 Asynchronous computations with optimal resilience Michael Ben-Or, Boaz Kelmer, Tal Rabin Hebrew University 11:20 Coins, weights and bounded-time contention in balancing networks William Aiello, Ramarathnam Venkatesan, Moti Yung Bellcore, Bellcore, IBM T.J. Watson 11:40 A combinatorial treatment of balancing networks Costas Busch and Marios Mavronicolas University of Cyprus 12:00 Lunch Session 7. Chair: Shay Kutten 1:50 A characterization of networks supporting linear interval routing Pierre Fraigniaud, Cyril Gavoille Ecole Normale Sup\'erieure de Lyon 2:10 Potential function analysis of greedy hot-potato Routing Amir Ben-Dor, Shay Halevi and Assaf Schuster The Technion 2:30 The virtual path layout problem in fast networks Ornan Gerstel, Shmuel Zaks The Technion 2:50 Self-stabilization by counter flushing George Varghese Washington University at St. Louis 3:10 Memory-efficient and self-stabilizing network Reset Baruch Awerbuch, Rafail Ostrovsky MIT, University of California at Berkeley and ICSI 3:30 Coffee Break Session 8. Chair: Jennifer Welch 3:50 Efficient dynamic load sharing algorithm using scheduling information Seung Ho Cho, Seung Ryeol Choi, Sang Young Han Kangnam University, Seoul National University, Seoul National University 4:00 A recognise-and-accuse policy to speed up distributed processes A. Genco, G. Lo Re Universita di Palermo, Consiglio Nazionale delle Ricerche 4:10 Controlling real-time asynchronous tasks with ESTEREL synchronous language M. Adelantado, F. Boniol ONERA-CERT/DERI Toulouse 4:20 Consistency and conformance in ODP Howard Bowman, John Derrick University of Kent 4:30 XMP++: an object-oriented solution for hiding the complexity of network management protocols Sakari Rahkila, Susanne Stenberg Nokia Research Center 4:40 A compositional verification method for LOTOS Hacene Fouchal Institut National des Telecommunications Evry 4:50 Verification of a distributed algorithm K. Sere, M. Wald\'en University of Kuopio, \oAbo Akademi University 5:00 The formal verification of an ATM network Paul Curzon University of Cambridge 5:10 A verification method based on homomorphic model abstractions Ulrich Nitsche German National Research Centre for Computer Science 5:20 Modelling garbage collection algorithms using CCS and temporal logic Howard Bowman, John Derrick, Richard Jones University of Kent 5:30 Integrated support environment for concurrent process calculi Sen Yoshida, Atsushi Togashi and Norio Shiratori Tohoku University 8:00 Business Meeting and Rump Session: Buenos Aires Room, Sunset Canyon Recreational Center ---Wednesday, August 17--- Session 9. Chair: Keith Marzullo 8:30 Invited Lecture: A Quantitative Case for Networks of Workstations (NOW) David Patterson University of California at Berkeley 9:30 Adaptive algorithms for PASO systems Jeffery Westbrook, Lenore Zuck Yale University 9:50 Uniform actions in asynchronous distributed systems Dalia Malki, Ken Birman, Aleta Ricciardi, Andr\'e Schiper Hebrew University, Cornell University, Bell Northern Research, Ecole Polytechnique F\'ed\'erale Lausanne 10:10 Coffee Break Session 10. Chair: Yishay Mansour 10:40 Observable clock synchronization Danny Dolev, R\"udiger Reischuk, Ray Strong IBM Almaden 11:00 Knowledge, timed precedence and clocks Yoram Moses, Ben Bloom Weizmann Institute and Oxford University, Weizmann Institute 11:20 A formally verified algorithm for clock synchronization under a hybrid fault model John Rushby SRI International 11:40 Proving time bounds for randomized distributed algorithms Nancy Lynch, Isaac Saias, Roberto Segala MIT 12:00 Lunch Session 11. Chair: Orli Waartz 1:50 Set-Linearizability and obliviousness: foundations of the study of asynchronous computability Gil Neiger Georgia Institute of Technology 2:00 Dynamic sets for search David Steere, M. Satyanarayanan, Jeannette Wing Carnegie Mellon University 2:10 The competitive analysis of wait-free algorithms and its application to the cooperative collect problem Miklos Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts IBM Almaden, Yale University, IBM Almaden, IBM Almaden 2:20 Simulating fail-stop in asynchronous distribute systems Laura Sabel, Keith Marzullo Cornell University, University of California at San Diego 2:30 PCODE: efficient parallel computing over distributed environments Jehoshua Bruck, Danny Dolev, Ching-Tien Ho, Rimon Orni, Ray Strong IBM Almaden 2:40 On the memory overhead of distributed snapshots Lior Shabtai and Adrian Segall The Technion 2:50 Adaptive video on demand Sudhanshu Aggarwal, Juan Garay, Amir Herzberg MIT, IBM T.J. Watson, IBM T.J. Watson 3:00 Distributed pursuit-evasion: some aspects of privacy and security in distributed computing P. Spirakis, B. Tampakas Computer Technology Institute Patras 3:10 Contention in counting networks Costas Busch, Nikos Hardavellas, Marios Mavronicolas University of Cyprus 3:20 Coffee Break Session 12. Chair: Jennifer Welch 3:40 Set consensus using arbitrary objects Maurice Herlihy, Sergio Rajsbaum DEC Cambridge Research Lab, MIT 4:00 Wait-freedon vs. t-resiliency and the robustness of wait-free hierarchies Tushar Chandra, Vassos Hadzilacos, Prasad Jayanti, Sam Toueg IBM T.J. Watson, University of Toronto, Dartmouth College, Cornell University 4:20 A gap theorem for concensus types Gary L. Peterson, Rida A. Bazzi, Gil Neiger Spelman College, Georgia Institute of Technology, Georgia Institute of Technology 4:40 On the use of registers in achieving wait-free consensus Rida A. Bazzi, Gil Neiger, Gary L. Peterson Georgia Institute of Technology, Georgia Institute of Technology, Spelman College 5:00 Consensus power makes sense! Elizabeth Borowsky, Eli Gafni University for California at Los Angeles ----------**********----------**********----------**********---------- Jim Anderson anderson@cs.unc.edu PODC94 General Chair Computer Science Dept 919 962-1757 (voice) University of North Carolina 919 962-1799 (fax) Chapel Hill, NC 27599-3175 From fritsv@cwi.nl Tue May 17 14:27:14 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA03897; Tue, 17 May 94 06:27:29 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Tue, 17 May 1994 12:27:14 +0200 Received: by specht.cwi.nl id AA04806 (5.65b/3.8/CWI-Amsterdam); Tue, 17 May 1994 12:27:14 +0200 Date: Tue, 17 May 1994 12:27:14 +0200 Message-Id: <9405171027.AA04806=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: CCL94: Program and Registration From: Helene Kirchner CONSTRAINTS IN COMPUTATIONAL LOGICS CCL'94 *********************************** First International Conference Technical University, Munich September 7-9, 1994 PROGRAM INFORMATION and REGISTRATION FORM ========================================= This information is also available on the world-wide web at ftp://ftp.mpi-sb.mpg.de/pub/CCL94/ccl94.html Constraints in Computational Logics (CCL) is a new conference dedicated to all aspects of constraints in computer science, including knowledge representation, multi-paradigm programming, rewriting, deduction, and symbolic computation. It features a high-quality program of 21 refereed contributions and 5 invited lectures by Max Dauchet, Dexter Kozen, Helmut Simonis, Gert Smolka and Wayne Snyder. CONFERENCE PROGRAM ================== TUESDAY, September 6 Registration (17:00--19:00) Welcome Reception (18:00--20:00) WEDNESDAY, September 7 Registration (8:00--9:00) Welcome Address (9:00--9:15) Invited Lecture I (9:15--10:15) Chair: Jean-Pierre Jouannaud (Orsay) Wayne Snyder (Boston): "Constraints in Automated Deduction" Coffee Break (10:15--10:45) Session 1: Theorem Proving (10:45--12:15) Chair: Harald Ganzinger (MPI) 10:45 "Local Simplification" Christopher Lynch (Boston) 11:15 "Simplifying Clausal Satisfiability Problems" Peter Barth (MPI) 11:45 "Ordered Binary Decision Diagrams and the Davis-Putnam Procedure" Tomas Uribe (Stanford) & Mark E. Stickel (SRI) Lunch (12:15--14:00) Invited Lecture II (14:00--15:00) Chair: Ugo Montanari (Pisa) Gert Smolka (DFKI): "Concurrent Constraint Programming" Session 2: Concurrent Constraint Programming (15:00--16:00) Chair: Mario Rodriguez-Artalejo (Madrid) 15:00 "Constraints for Polymorphic Behaviours of Concurrent ML" Flemming Nielson & Hanne Riis Nielson (Aarhus) 15:30 "A Confluent Calculus for Higher-Order Concurrent Constraint Programming" Joachim Niehren & Gert Smolka (DFKI) Coffee Break (16:00--16:30) Session 3: Unification (16:30--18:00) Chair: Claude Kirchner (Nancy) 16:30 "Modular AC Unification of Higher-Order Patterns" Zhenyu Qian & Kang Wang (Bremen) 17:00 "Higher Order Disunification: Some Decidable Cases" Denis Lugiez (Nancy) 17:30 "``Syntactic'' AC-unification" Alexandre Boudet & Evelyne Contejean (Orsay) THURSDAY, September 8 Invited Lecture III (9:00--10:00) Chair: Mark Wallace (ECRC) Helmut Simonis (COSYTEC): "Applications of Constraint Logic Programming" Coffee Break (10:00--10:30) Session 4: Constraint Logic Programming (10:30--12:30) Chair: Mehmet Dincbas (COSYTEC) 10:30 "Repeated Redundant Inequalities in Constraint Logic Programming" Spiro Michaylov (Ohio) 11:00 "An Efficient Algorithm of Logic Programming with Constraint Hierarchy" Tsutsumi Fujio (Tokyo) 11:30 "Application of Constraint Logic Programming for VLSI CAD Tools" Renate Beckmann, Ulrich Bieker & Ingolf Markhof (Dortmund) 12:00 "Path Consistency in CLP(FD)" Philippe Codognet (INRIA) & Giuseppe Nardiello (Padova) Lunch (12:30--14:00) Invited Lecture IV (14:00--15:00) Chair: Hubert Comon (Orsay) Max Dauchet (Lille): "Symbolic Constraints and Tree Automata" Session 5: Constraint Systems (15:00--16:00) Chair: Gert Smolka (DFKI) 15:00 "A Record Calculus with Principal Types" Andreas Hense (U. Saarbr"ucken) & Gert Smolka (DKFI) 15:30 "ECOLOG: an Environment for COnstraint LOGics" Marianne Haberstrau (Orsay) Coffee Break (16:00--16:30) Session 6: Term Rewriting (16:30--18:00) Chair: Tobias Nipkow (TU M"unchen) 16:30 "On Modularity in Term Rewriting and Narrowing" Christian Prehofer (TU M"unchen) 17:00 "Higher Order Conditional Rewriting and Narrowing" J"urgen Avenhaus & Carlos Loria-Saenz (Kaiserslautern) 17:30 "Buchberger's Algorithm: a Constraint-Based Completion Procedure" Leo Bachmair (Stony Brook) & Harald Ganzinger (MPI) Conference Dinner (19:30) FRIDAY, September 9 Invited Lecture V (9:00--10:00) Chair: Leszek Pacholski (Wroclaw) Dexter Kozen (Cornell): "Set Constraints and Logic Programming" Coffee Break (10:00--10:30) Session 7: Constraint Systems (10:30--12:30) Chair: Klaus Schulz (LMU M"unchen) 10:30 "Set Constraints in Some Equational Theories" Witold Charatonik (Wroclaw) 11:00 "How to Win a Game with Features" Rolf Backofen & Ralf Treinen (DKFI) 11:30 "Some new Decidability Results on Positive and Negative Set Constraints" Remi Gilleron, Sophie Tison & Marc Tommasi (Lille) 12:00 "Solving Simplification Ordering Constraints" Patricia Johann (U Saarbr"ucken) & Rolf Socher-Ambrosius (FH Emden) CONFERENCE ORGANIZATION Conference Chair: Tobias Nipkow Program Chair: Jean-Pierre Jouannaud Publicity Chair: Helene Kircher Program Committee: A. Aiba, A. Colmerauer, M. Dincbas, H. Ganzinger, S. Haridi, P. Van Hentenryck, J. Jaffar, J.-P. Jouannaud, C. Kirchner, D. Miller, U. Montanari, F. Orejas, L. Pacholski, F. Pfenning, M. Rodriguez-Artalejo, K. Schulz, M. Wallace CONFERENCE OFFICE ================= Please address registration form and inquiries to: Anita Sch"on CCL'94 Fakult"at f"ur Informatik Technische Universit"at M"unchen D-80290 M"unchen Germany Email: ccl@informatik.tu-muenchen.de Tel: +49 89 2105 8168 (Monday - Friday, 10:00-13:00) Fax: +49 89 2105 8169 REGISTRATION FORM ================= Last Name ____________________________________________ First Name ____________________________________________ Affiliation ___________________________________________ Street Address ________________________________________ _______________________________________________________ City __________________________________________________ State/Zip _____________________________________________ Country _______________________________________________ Phone(s) ______________________________________________ Fax ___________________________________________________ E-mail ________________________________________________ Special dietary requirements __________________________ Total Fee: ___________________ Payment (tick one): __ Eurocheque __ Bank Transfer (include copy) Registration without payment will not be considered. For early registration, payment must be received by 1 August. Fees will be returned in full for any written cancellation received before 1 August. No refund will be made after this date. The registration fee includes conference participation, a copy of the proceedings, coffee breaks, the welcome reception and the conference dinner. The registration fee is DM 150 for early registration through 1 August and DM 200 after that date. All fees are in German currency, payable with Eurocheque or by bank transfer. Payment can be made by crossed Eurocheque payable to "Prof. Tobias Nipkow", or by bank transfer to: Bank: Hypo Bank M"unchen Bank code: 700 200 01 Account no: 6410676212 Account holder: Prof. Tobias Nipkow Intended use: CCL94 SWIFT code: HYPO DE MM Bank transfers should specify registrant's name. Please ask your bank to arrange the transfer free of charges to the beneficiary. ACCOMODATION ============ A block of rooms has been reserved (until 1 July) at Hotel Arcade Dachauer Str. 21 80335 M"unchen Germany Tel: +49 89 55 19 30 Fax: +49 89 55 19 31 02 The cost of rooms is as follows (breakfast is included): Single room DM 125/night Double room DM 166/night Reservations should be made by the participants directly with the Hotel. Please mention "Constraints in Computational Logics" and, if possible, include your credit card details to guarantee your reservation. The Arcade Hotel is located downtown, 10 minutes walking distance from the conference site. Other arrangements can be made by contacting the Munich Tourist Office: Munich Tourist Office 80313 M"unchen Germany Tel: +49 89 23 235 (Mo.-Th. 9-3, Fr. 9-12.30) Fax: +49 89 23 313 LOCATION AND TRAVEL =================== Munich is located in the heart of Bavaria, at the south-east corner of Germany. The city is home to 1.3 million people, and has excellent museums, concert halls, and restaurants. The renowned beer gardens offer a unique way for people to relax and meet friends. The famous Oktoberfest begins September 17. Munich is close to the Bavarian Alps and Austria. The weather in early September is very pleasant, with temperatures around 22 C. and a low likelihood of rain. Munich offers superb access by air, rail, and road. The new Munich International Airport has frequent flights to and from all major cities. By rail, the city offers easy access to all major European centres. Upon registration you will receive more detailed information on how to get to the hotel and the conference site. From fritsv@cwi.nl Tue May 24 18:28:50 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA09542; Tue, 24 May 94 10:29:13 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Tue, 24 May 1994 16:28:50 +0200 Received: by specht.cwi.nl id AA11743 (5.65b/3.8/CWI-Amsterdam); Tue, 24 May 1994 16:28:50 +0200 Date: Tue, 24 May 1994 16:28:50 +0200 Message-Id: <9405241428.AA11743=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Tempus Summer School in Budapest From: cora@ludens.elte.hu Second Announcement & program of ALGEBRAIC LOGIC and the METHODOLOGY OF APPLYING IT, July 11-17, 1994, Budapest, which is part of the TEMPUS Summer School series for Algebraic and Categorial Methods in Computer Science. This will be the third one in the above mentioned series of summer schools, attached to the TEMPUS project entitled "Algebraic and Categorial Methods in Computer Science". The summer school is sponsored by the European Community TEMPUS office. S C I E N T I F I C P R O G R A M Courses: ________________________________________________________________ | | | WILLEM BLOK and DON PIGOZZI: General Algebraic Logic | | | | VAUGHAN PRATT: Chu Spaces: Complementarity and Uncertainty in | | Rational Mechanics | | | | YDE VENEMA: Boolean Algebras with Operators & Modal Logic | | | | ISTVAN NEMETI and HAJNAL ANDREKA: Algebras of Relations of | | Various Ranks & their Applications | | | | WORKSHOP GIVEN BY YOUNG RESEARCHERS: Decidability issues and | | logics related to the dynamic trend | | | | UNIVERSAL ALGEBRA TUTORIAL | |________________________________________________________________| ABSTRACTS OF COURSES: Pratt: "Chu Spaces: Complementarity and Uncertainty in Rational Mechanics" "Rational mechanics" captures mind-body duality for autonomous agents in essentially the same way that quantum mechanics captures momentum-position duality for physical systems, with Chu spaces in place of Hilbert spaces. Chu spaces expose a Heisenberg-like uncertainty principle as a previously unnoticed yet prominent feature of Stone duality. --------------- Venema: "Boolean Algebras with Operators & Modal Logic" Formalisms related to Modal Logic play an important role in theoretical computer science: think of examples like epistemic logic, dynamic logic or relational algebra. Such formalisms can be treated in a nice algebraic way via the theory of Boolean Algebras with Operators (BAOs). The course will be centered around two themes: (1) the duality between BAOs and Relational (Kripke) Structures, and (2) modal/algebraic languages to describe these structures. We will review some important and elegant theorems, like automatic completeness results for a large class of logics. --------------- Nemeti and Andreka: "Algebras of Relations of Various Ranks & their Applications" Theories of relations (binary ones, ternary relations, n-ary ones etc.) play an essential role both in Computer Science and in Logic. Besides quantifier logics, they are important for e.g. logics of the dynamic trend, resource-sensitive logics, substractural logics, logics of actions etc. We will study algebras whose elements are relations. Research in this area has been going on for 140 years, hence its theory is powerful and profoundly applicable. The goal of the course is to make rich theory accessible, to provide insight into why and how it works, and to highlight the main directions in which it is "moving". --------------- Workshop given by young researchers: "Decidability issues and logics related to the dynamic trend" The workshop will consist of talks given by young researchers from the Logic School centered around Amsterdam and Budapest. The topics will be related to those of the main courses. A tentative list is: decidability issues (decision problems for Boolean algebras with operators, relation algebras and algebras of relations of higher ranks), decidability of logics of the dynamic trend, positive results on the finitization problem (e.g. on the search for powerful algebras of relations forming a finitely axiomatizable equational class), the connection between algebraic logic and logic. This list is more likely to expand than shrink. The purpose of these talks is to focus on new results and provide the audience with open problems which might be rewarding to work on. The speakers of the workshop will be Viktor Gyuris, Agnes Kurucz, Maarten Marx, Szabolcs Mikulas and Andras Simon. --------------- Universal Algebra tutorial This elementary course presents those basics of universal algebra which will be needed for the rest of the summer school. It is optional depending on the background of the participant. --------------- A TENTATIVE schedule of the programme is in the chart below. Abbreviations: UA tuto = Universal Algebra tutorial A-N = Andreka-Nemeti B-P = Blok-Pigozzi workshop = workshop given by young researchers +---------+---------+---------+---------+---------+---------+ | Monday | Tuesday |Wednesday|Thursday | Friday |Saturday | |=======|=========|=========|=========|=========|=========|=========| | 8- 9 | | UA tuto | | | | | |-------|---------|---------|---------|---------|---------|---------| | 9-10 | Pratt | UA tuto |workshop |workshop |workshop |workshop | |-------|---------|---------|---------|---------|---------|---------| | 10-11 | Pratt | B-P | Pratt | B-P | Pratt | B-P | |-------|---------|---------|---------|---------|---------|---------| | 11-12 | UA tuto | B-P | A-N | B-P | Pratt | Venema | |-------|---------|---------|---------|---------|---------|---------| | 12-13 | | | | | | | |-------|---------|---------|---------|---------|---------|---------| | 13-14 | | | | | | | |-------|---------|---------|---------|---------|---------|---------| | 14-15 | A-N | Venema | E | Venema | A-N | to be | |-------|---------|---------|---------|---------|---------|announced| | 15-16 | A-N | Venema | X | Venema | A-N | later | |-------|---------|---------|---------|---------|---------|---------| | 16-17 | | Salibra | C | to be | to be | | |-------|---------|---------|---------|announced|announced|---------| | 17-18 | | | U | later | later | | |-------|---------|---------|---------|---------|---------|---------| | 18-19 | | | R | | | | |-------|---------|---------|---------|---------|---------|---------| | 19-20 | party | | S | | | | |-------|---------|---------|---------|---------|---------|---------| | 20-21 | party | | ION | | | | +-------+---------+---------+---------+---------+---------+---------+ LECTURE NOTES: Every registered participant will receive basic lecture notes for each course indicated in the program. Besides these notes, scientific papers for further reading and extra copies of the lecture notes will be sold throughout the summer school. G E N E R A L I N F O R M A T I O N ACCOMMODATION: In double bedrooms for 14 DM/day, or in single bedrooms for 18 DM/day, in Summer Hotel Hill. The lectures will be in the same building. 25m swimming pool and several other sport facilities will be available. MEALS: Continental breakfast for 4 DM/day, lunch for 5,3 DM/day. SOCIAL PROGRAMS: We plan a reception on Monday evening and a sight seeing afternoon on Wednesday. REGISTRATION FEE: 120 DM for participants 50 DM for accompanying persons. REGISTRATION: Please send name, address (including e-mail, if available) and gender to the addresses given below as soon as you can. Please indicate if you plan to bring a guest or indicate the name of participant with whom you wish to share accommodation. Also indicate if you have any special request (e.g. vegetarian meals). The number of participants is limited, therefore registrations is accepted in the order of receipt. TRAVEL: Budapest has two airport terminals, Ferihegy I and Ferihegy II. From both terminals you have the same possibilities to come to the center. The most convenient way is offered by the Minibus-Service at very reasonable price. They take you to any address in Budapest with their comfortable 8-seaters, for 600 Hungarian forints (equivalent to 10 DM) per person. The tickets are available at the LRI Airport passenger service counters. You can choose to use buses called "Centrum Airport Service" as well. These buses leave every 30 minutes to Erzsebet square in central Budapest for 200 forints (equivalent to 3,3 DM), from where you can take tram no. 49 or no. 47 to "Moricz Zsigmond korter", the nearest square to your accommodation (Summer Hotel Hill, Menesi street 5), which is 5 minutes walking from the tram station at Moricz Zsigmond korter. For use of trams and buses, tickets must be purchased in advance, for 25 forints (0.5 DM) each trip. One can buy tickets from automatons (there are some automatons at the airport terminal bus stations) or from small shops selling newspaper or tobacco. Taxi from Ferihegy to central Budapest costs about 2000 forints (equivalent to 33 DM). From Nyugati palyaudvar (Western Railway Station) you can reach Moricz Zsigmond korter by tram no. 4 or no. 6. From Keleti palyaudvar (Eastern Railway Station) to Moricz Zsigmond korter take bus no. 7 or no. red 7, from Deli palyaudvar (Southern Railway Station) tram no. 61. PAYMENT: Payment is expected in cash on the day of arrival in German marks(DM). ORGANIZING COMMITTEE: Hajnal Andreka, Miklos Ferenczi, Istvan Nemeti and Ildiko Sain ORGANIZING SECRETARY: Corinna Farkas ADDRESSES: Please send your correspondence to BOTH of the following two e-mail addresses: cora@ludens.elte.hu and h1468sai@ella.hu, or to the following mailing address: Ildiko Sain, Mathematical Institute, Budapest, Pf. 127, H-1364, Hungary. Fax: (36-1) 117-7166 (indicate: To Ildiko Sain). PLEASE, DISTRIBUTE THIS ANNOUNCEMENT FREELY. Hoping to hear from you, best regards from the organizers. From fritsv@cwi.nl Thu May 26 12:13:53 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA05074; Thu, 26 May 94 04:14:17 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Thu, 26 May 1994 10:13:53 +0200 Received: by specht.cwi.nl id AA13417 (5.65b/3.8/CWI-Amsterdam); Thu, 26 May 1994 10:13:53 +0200 Date: Thu, 26 May 1994 10:13:53 +0200 Message-Id: <9405260813.AA13417=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Job Opportunity in Formal Verification From: Albert Camilleri General Systems Lab - Hewlett-Packard, Roseville, California, USA Re: Formal Verification job openings. ----------------------------------------------------------------------- Hewlett-Packard is a technological and market leader in RISC computer systems. We believe that becoming a leader in Formal Verification will help support and maintain our technological lead. We are presently hiring verification engineers with skills and interests in Formal Verification in order to staff a small-but-growing team whose charter is to apply formal methods to a wide variety of computer system design problems. This is an opportunity to research and develop formal techniques which will have genuine impact on the computer industry. Requirements: o BS, MS or Ph.D degree in EE, CE, CS, CEE or CSEE. o Experience in one of the following areas: VLSI, Firmware, board design or system simulation. o Solid understanding of computer architecture. o Minimum 4 years experience in formal verification. o Strong communication and teamwork skills. o Must be flexible and willing to work in more than one of the skill areas listed above. In addition to the above requirements, previous experience in one or more of the following areas is preferred: o Integrated circuit design, verification, tools and methodologies. o VLSI testing, characterization, diagnostics. o CPU board design. o RISC Assembly language programming, C programming. o Computer systems architecture and design. o Behaviorial modeling. In this position, you will be a member of an exciting lab team responsible for the definition, design, verification and testing of our leading edge Mid-Range Computer Servers. In addition to a broad benefits package which includes relocation support, you'll enjoy the attractive lifestyle and affordable housing in Roseville. Roseville is situated not far from Sacramento, the state's capital, and both San Francisco and Lake Tahoe are just a few hours away. The area also offers many recreational choices including boating on nearby rivers and lakes. Hewlett-Packard is one of the world's leaders in the research, development and manufacturing of computing and electronic measuring equipment for people in business, industry, science, engineering, health care and education. HP recently completed its 1993 fiscal year with over $20 billion in total revenue and rated number two in the U.S. and number three worldwide in total combined computer systems, software and peripherals revenue. The company has enjoyed steady growth and no unprofitable quarters throughout its history. For immediate consideration, send your resume to: Albert Camilleri ac@hprpcd.rose.hp.com (e-mail) OR Hewlett-Packard Company Attn: Site Employment, Job Code MD01 8000 Foothills Blvd Roseville, CA 95747 Hewlett-Packard is an equal employment opportunity employer dedicated to affirmative action and workforce diversity. From fritsv@cwi.nl Thu May 26 16:11:39 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA05861; Thu, 26 May 94 08:12:11 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Thu, 26 May 1994 14:11:40 +0200 Received: by specht.cwi.nl id AA13800 (5.65b/3.8/CWI-Amsterdam); Thu, 26 May 1994 14:11:39 +0200 Date: Thu, 26 May 1994 14:11:39 +0200 Message-Id: <9405261211.AA13800=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: CONCUR '94 Programme and Call for Registration From: concur94@sics.se Below follows the CONCUR '94 programme and registration information in text and latex format: ========================================================= text version: CONCUR'94 Fifth International Conference on Concurrency Theory August 22 - 25 1994 Uppsala, Sweden PROGRAMME and CALL FOR REGISTRATION AIM CONCUR'94 is the Fifth International Conference on Concurrency Theory. The basic aim of the CONCUR conferences is to communicate advances in concurrency theories and applications. The first two meetings were held in Amsterdam in August 1990 and 1991, the third in Stony Brook, New York, U.S.A., in August 1992, and the fourth meeting was held in Hildesheim, Germany, in August 1993. The proceedings of these conferences have appeared in Springer-Verlag's Lecture Notes in Computer Science series as volumes 458, 527, 630, and 715, and the proceedings of CONCUR '94 will appear in the same series. The programme of CONCUR '94 includes presentations of selected papers, invited presentations, and tutorials. We also welcome participants to bring and demonstrate software packages that are relevant to the aims of the conference. More information regarding demonstrations is available later in this programme. VENUE The conference will be held at ``Folkets hus'' in central Uppsala, from which many tourist attractions are within walking distance. Accommodation will be close to the conference site. Uppsala is situated 70 km north of Stockholm, and can be conveniently reached from Stockholm Arlanda airport, which is situated 35 km south of Uppsala. PROGRAMME COMMITTEE Ralph-Johan Back, Jos Baeten, Eike Best, Ed Clarke, Mads Dam, Rob van Glabbeek, Cliff Jones, Bengt Jonsson (organising committee chair), Kim Larsen, Ugo Montanari, Mogens Nielsen, Catuscia Palamidessi, Joachim Parrow (program committee chair), Scott Smolka, Bernhard Steffen, Colin Stirling, P.S. Thiagarajan, Frits Vaandrager, Pierre Wolper, and Zhou Chaochen. INVITED SPEAKERS David Dill (Stanford University, USA), Jean-Yves Girard (CNRS, France), Paris Kanellakis (Brown University, USA), Mogens Nielsen (University of Aarhus, Denmark), and Prakash Panangaden (McGill University, Canada). TUTORIAL LECTURES Ralph-Johan Back (Abo Akademi, Finland), Costas Courcoubetis (Institute of Computer Science, FORTH, and University of Crete, Greece), Jean-Claude Fernandez and Joseph Sifakis (VERIMAG, France), and Robert de Simone (INRIA, France). DEMOS We invite participants to organise demonstrations. Sun workstations will be available at the conference site. Please contact Anders Andersson (e-mail: concur94-demo@docs.uu.se) well in advance to settle issues concerning requirements and installation, so that software packages can be transferred and installed in due time. SPONSORS Support for CONCUR '94 has been generously provided by: Ericsson Telecom Telia Research The Wenner-Gren Scientific Foundation The Swedish National Board for Industrial and Technical Development The Swedish Research Council for Engineering Sciences The Swedish Natural Science Research Council SCIENTIFIC PROGRAMME Sunday, August 21 19:00-21:00 Welcome Reception at ``Folkets Hus'' Monday, August 22 8:00- Registration 8:45-9:00 Welcome 9:00-10:00 Invited Lecture: Geometry of interaction J.-Y. Girard (CNRS, France) 10:00-10:30 A compositional semantics for Statecharts using labeled transition systems A.C. Uselton and S.A. Smolka (State University of New York at Stony Brook, USA) 10:30-11:00 Coffee and refreshments 11:00-11:30 On the decidability of non-interleaving process equivalences A. Kiehn (TU Munchen, Germany) and M. Hennessy (University of Sussex, England) 11:30-12:00 Regularity of BPA-systems is decidable S. Mauw and J.C. Mulder (Eindhoven University of Technology, The Netherlands) 12:00-12:30 A fast algorithm for deciding bisimilarity of normed context-free processes Y. Hirshfeld (Tel Aviv University, Israel) and F. Moller (SICS, Sweden) 12:30-14:00 Lunch 14:00-15:30 Tutorial: Model-based verification methods and tools J.C. Fernandez (VERIMAG, France), J. Sifakis (VERIMAG, France) and R. de Simone (INRIA, France) The tutorial is accompanied by a hands-on section, which can be completed by attendees during the remaining conference on the available Sun workstations. 15:30-16:00 New results in the analysis of concurrent systems with an indefinite number of processes M. Girkar and R. Moll (University of Massachusetts, USA) 16:00-16:30 Coffee and refreshments 16:30-17:00 Verification of nonregular temporal properties for context-free processes A. Bouajjani (VERIMAG, France), R. Echahed (LGI-IMAG, France) and R. Robbana (VERIMAG, France) 17:00-17:30 Pushdown processes: parallel composition and model checking O. Burkart (RWTH Aachen, Germany) and B. Steffen (Universit{t Passau, Germany) 17:30-18:00 Local model checking for parallel compositions of context-free processes H. Hungar (University of Oldenburg, Germany) 18:30- Reception in the main university building Tuesday, August 23 8:30-9:30 Invited Lecture: The logical structure of concurrent constraint programming languages P. Panangaden (McGill University, Canada) 9:30-10:00 Countable non-determinism and uncountable limits P. Di Gianantonio, F. Honsell and S. Liani (Universita di Udine, Italy), G. Plotkin (University of Edinburgh, Scotland) 10:00-10:30 SProc categorically J.R.B. Cockett and D.A. Spooner (University of Calgary, Canada) 10:30-11:00 Coffee and refreshments 11:00-12:30 Tutorial: From timed graphs to hybrid automata C. Courcoubetis (FORTH, and University of Crete, Greece) 12:30-14:00 Lunch 14:00-15:00 Invited Lecture: Hierarchical models of synchronous circuits D. Dill (Stanford University, USA) 15:00-16:00 The observational power of clocks R. Alur (AT&T Bell Laboratories, USA), C. Courcoubetis (FORTH and University of Crete, Greece) and T.A. Henzinger (Cornell University, USA) 15:30-16:00 A dynamic approach to timed behaviour J. Gunawardena (Hewlett-Packard, USA) 16:00-16:30 Coffee and refreshments 16:30-17:00 Algebras of processes of timed Petri nets J. Winkowski (Instytut Podstaw Informatyki PAN, Poland) 17:00-17:30 Operational semantics for the Petri box calculus M. Koutny (University of Newcastle upon Tyne, England), J. Esparza (University of Edinburgh, Scotland) and E. Best (Universit{t Hildesheim, Germany) 17:30-18:00 Weak sequential composition in process algebras A. Rensink and H. Wehrheim (Universit{t Hildesheim, Germany) Wednesday, August 24 8:30-9:30 Invited Lecture: Efficient parallelism vs reliable distribution: a tradeoff for concurrent computations P. Kanellakis (Brown University, USA) 9:30-10:00 On unifying assumption-commitment style proof rules for concurrency Q. Xu (Abo Akademi, Finland), A. Cau (Christian-Albrechts Universitat zu Kiel, Germany) and P. Collette (Universite Catholique de Louvain, Belgium) 10:00-10:30 Liveness and fairness in Duration calculus J.U. Skakkebaek (Technical University of Denmark) 10:30-11:00 Coffee and refreshments 11:00-11:30 A symbolic semantics for the pi-calculus M. Boreale and R. De Nicola (Universita di Roma ``La Sapienza'', Italy) 11:30-12:00 On bisimulation in the pi-calculus D. Walker (University of Warwick, England) 12:00-12:30 Characterizing bisimulation congruence in the pi-calculus X. Liu (University of Sussex, England) 12:30-14:00 Lunch 14:00-14:30 The limit view of infinite computations N. Klarlund (University of Aarhus, Denmark) 14:30-16:00 Tutorial: Trace Refinement of Action Systems R.J.R. Back (Abo Akademi, Finland) 16:30- Excursion and Conference Dinner Thursday, August 25 8:30-9:30 Invited Lecture: Bisimulation for models in concurrency M. Nielsen (University of Aarhus, Denmark) 9:30-10:00 Invariants in process algebra with data M.A. Bezem and J.F. Groote (Utrecht University, The Netherlands) 10:00-10:30 Testing-based abstractions for concurrent systems R. Cleaveland (North Carolina State University, USA) and J. Riely (University of North Carolina, USA) 10:30-11:00 Coffee and refreshments 11:00-11:30 A congruence theorem for structured operational semantics with predicates and negative premises C. Verhoef (Eindhoven University of Technology, The Netherlands) 11:30-12:00 Deriving complete inference systems for a class of GSOS languages generating regular behaviours L. Aceto (University of Sussex, England) 12:00-12:30 Process algebra with partial choice J.C.M. Baeten (Eindhoven University of Technology, The Netherlands) and J.A. Bergstra (University of Amsterdam and Utrecht University, The Netherlands) 12:30-14:00 Lunch 14:00-14:30 Probabilistic simulations for probabilistic processes R. Segala and N. Lynch (Massachusetts Institute of Technology, USA) 14:30-15:00 Fully abstract characterizations of testing preorders for probabilistic processes S. Yuen (Nagoya University, Japan), R. Cleaveland (North Carolina State University, USA), Z. Dayar (North Carolina State University, USA) and S.A. Smolka (State University of New York at Stony Brook, USA) 15:00-15:30 Composition and behaviors of probabilistic I/O automata S.-H. Wu, S.A. Smolka and E.W. Stark (State University of New York at Stony Brook, USA) ABSTRACTS FOR TUTORIAL PROGRAMME Model-Based Verification Methods and Tools J. C. Fernandez, J. Sifakis (VERIMAG, France), R. de Simone (INRIA, France) Monday, August 22, 14:00 - 15:30 We describe established verification methods in the framework of communicating concurrent systems, focusing on model-based approaches implemented by existing tools for automatic verification. Such tools can be sorted by several features: input description language, specification style for properties (temporal logic vs operational behaviour), type of interpretation (linear time vs branching time). In contrast, most share the same modeling into labeled transition systems. In addition to the techniques of model-checking (or satisfaction of a temporal logic formula by a model) and model comparison (by behavioural equivalence or behavioural inclusion), we also present several methods for model simplification (abstraction, quotient minimisation,...). In all cases we face the issues of algorithmic complexity, of expressivity, and also of clarity and simplicity of usage. We end with an extensive description of the verification tools Aldebaran and Auto developed in our groups, followed by a tentative hands-on session for the attendees. From Timed Graphs to Hybrid Automata Costas Courcoubetis (Institute of Computer Science, FORTH, and University of Crete, Greece) Tuesday, August 23, 11:00 - 12:30 We discuss various automata-theoretic formalisms for the specification and verification of real-time systems. We start with the general formalism of the hybrid automata as a model and specification language for hybrid systems. This is an extension of the traditional automata on infinite words in which the behavior of variables is governed in each state by a set of differential equations. Then we introduce the models of the timed automata and the integration graphs as special cases of the hybrid automata. We discuss the complexity of important verification issues related to the above models such as reachability and model-checking, and we survey the related algorithms. Trace Refinement of Action Systems Ralph-Johan Back (Abo Akademi University, Turku, Finland) Wednesday, August 24, 14:30 - 16:00 Action systems provide a general description of reactive systems, capable of modeling terminating, aborting and infinitely repeating systems. Arbitrary sequential program statements can be used to describe the behavior of atomic actions. Action systems are used to extend the Refinement Calculus, originally designed for sequential program refinement, to handle refinement of parallel and reactive systems. This permits systems to be built in which sequential and parallel constructs can be arbitrarily nested within each other. We will describe a behavioral semantics for action systems, in terms of execution traces, and define refinement of action systems based on this semantics. We show that trace refinement is a special case of data refinement of sequential programs. We give a general proof rule for action system refinement in a reactive context. This general proof rule can be shown both sound and complete for trace refinement under certain rather reasonable restrictions. Forward and backward simulation proof methods both arise as special cases of this general rule. We show how to derive specialized versions of these proof rules to handle situations that arise often in practical applications. We illustrate the use of reactive system refinement with an example. (Joint work with J. von Wright) ABSTRACTS OF INVITED LECTURES Geometry of Interaction Jean-Yves Girard (CNRS, France) Monday, August 22, 09:00 - 10:00 Geometry of Interaction is based on the idea that the ultimate explanation of logical rules is through the cut-elimination procedure. This is achieved by means of a pure geometric interpretation of normalization~: o proofs are operators on the Hilbert space describing I/O dependencies o cut-elimination is the solution of an I/O equation \[U(x \oplus \sigma(a)) = y \oplus a\] (the cut $\sigma$ expressing a feedback of some output of the proof U to some input of U) o termination is nilpotency of the operator $\sigma U$ o execution is expressed by \[RES (U,\sigma) := (1-\sigma^2)U(1-\sigma U)^{-1}(1-\sigma^2)\] This interpretation is available for full linear logic, which means, using translations for all constructive logics, in particular for typed lambda-calculi. It also works for untyped calculus, modulo a slight weakening of the hypotheses, expressing the absence of deadlock. Geometry of Interaction expresses a pure local asynchronous form of execution. Among the distinguished features of this execution, let us mention the distinction between public and private data... By the way there are two ways to combine operators in a way respecting privacy, and these two ways correspond to the two conjunctions of linear logic. The Logical Structure of Concurrent Constraint Programming Languages Prakash Panangaden (McGill University, Canada) Tuesday, August 23, 08:30 - 09:30 The Concurrent Constraint Programming paradigm has been the subject of growing interest as the focus of a new paradigm for concurrent computation. Like logic programming it claims close relations to logic. In fact these languages are logics in a certain sense that we make precise. In recent work it was shown that the denotational semantics of determinate concurrent constraint programming languages forms a categorical structure called a hyperdoctrine which is used as the basis of the categorical formulation of first order logic. What this connection shows is the combinators of determinate concurrent constraint programming can be viewed as logical connectives. In the present work we extend these ideas to the operational semantics of these languages and thus make available similar analogies for the indeterminate concurrent constraint programming languages. We also describe a linear extension of concurrent constraint programming and discuss hyperdoctrines for such languages. The discussion concludes with an examination of the prospects for understanding other formalisms for concurrent computation in the same way. One need never have heard of a hyperdoctrine in order to follow the talk. (Joint work with N. Mendler, P. Scott and R. Seely) Hierarchical Models of Synchronous Circuits David Dill (Stanford University, USA) Tuesday, August 23, 14:00 - 15:00 We seek a behavioral model of synchronous circuit operation which generalizes Mealy machines in several ways: o It should allow the expression of nondeterministic behavior. o It should allow parallel composition of machines and hiding of output signals. o It should not restrict bidirectional communication between machines. o It should deal reasonably with zero-delay cycles, which can be present in unrestricted communication graphs. o It should provide a preorder that precisely captures the proper relationship between implementation and specification behaviors. o It should allow the computation of the "most general environment" of a circuit. Surprisingly, given the attention that has been paid to switching theory over the years, no adequate model exists meeting these criteria. Devising such a model is more challenging than we had expected. This talk is a description of several of the specific problems that arise, along with solutions to some of them. Efficient Parallelism vs Reliable Distribution: a Tradeoff for Concurrent Computations Paris Kanellakis (Brown University, USA) Wednesday, August 24, 08:30 - 09:30 Concurrent computations should combine efficiency with reliability, where efficiency is usually associated with parallel and reliability with distributed computing. Such a desirable combination is not always possible, because of an intuitive tradeoff: efficiency requires removing redundancy from computations whereas reliability requires some redundancy. We survey a spectrum of algorithmic models (from fail-stop, synchronous to asynchronous and from exact to approximate computations) in which reliability is guaranteed with small tradeoffs in efficiency. We illustrate a number of cases where optimal tradeoffs are achievable. A basic property of all these models (of some interest in the study of concurrency) is that ``true'' read/write concurrency is necessary for fault tolerance. In particular, we show how algorithms can be designed so that, in each execution, the total concurrency used can be closely related to the faults that can be tolerated. (Joint work with D. Michailidis and A. Shvartsman) Bisimulation for Models in Concurrency Mogens Nielsen (University of Aarhus, Denmark) Thursday, August 25, 08:30 - 09:30 Recently, Joyal, Nielsen and Winskel suggested a categorical definition of bisimulation, applicable to a wide range of models for concurrency with an accompanying notion of observations. The definition is in terms of span of open maps, and it coincides with Milner's strong bisimulation for the standard model of labelled transition systems with sequential observations. In this talk we investigate this categorical notion of bisimulation for a selection of alternative models and observations (like Petri Nets with nonsequential observations), focusing on game theoretical and logical characterizations. GENERAL INFORMATION Conference Venue The conference will be held in the conference facilities in ``Folkets Hus'', Dragarbrunnsgatan 46, in central Uppsala. The majority of accommodation possibilities are located within a 1-15 minute walk from the conference site. Uppsala, situated 70 km north of Stockholm, is the fourth largest city in Sweden with almost 160.000 inhabitants and a decidedly academic atmosphere. Uppsala University, founded in 1477, is the oldest university in Scandinavia and has more than 20.000 students. The weather in Uppsala in August is warm, with a temperature around 15-20 degrees Celsius (60-70 Fahrenheit), ranging between very sunny and rain. A pullover and a raincoat or umbrella can at times be useful. Travel Information Uppsala can be conveniently reached from Stockholm Arlanda airport, which is situated 35 km south of Uppsala. Stockholm Arlanda airport is served by most major airlines. There is a regular bus service (No. 801) directly from the airport to Uppsala city centre every half hour. There are train connections between Stockholm and Uppsala every hour (50 minute ride). From Stockholm, it takes approximately 45 minutes along highway E4 to reach Uppsala by car. Registrants will receive detailed travel information with their confirmation. Registration Please register for CONCUR'94 by sending the attached registration and accommodation form to the Conference Secretariat, by regular mail or fax (see later page} for address information). Note that forms cannot be sent by e-mail. Fees, all indicated in Swedish crowns (SEK), are as follows. before July 15 after July 15 Regular fee SEK 1.700 SEK 2.200 Student fee SEK 900 SEK 1.100 The regular fee includes attendance to all sessions, a copy of the proceedings, conference dinner, lunches, refreshments, and excursion. The reduced student fee includes the same benefits as the regular fee except for the conference dinner and excursion, which have to be paid for separately (500 SEK) when applying for the student fee. The same extra fee for the conference dinner and excursion applies for accompanying persons. Requests for refunds will be honoured until August 1, except for an administrative fee of SEK 400. The registration should reach Uppsala Turist & Kongress NO LATER THAN JULY 15!!! Payments All payments are to be made in SEK. Please effect payment either o By Postal Giro to No. 19 57 52 - 1, Uppsala Turist & Kongress, mark payment ``CONCUR 94''. o By international money order, payable to Uppsala Turist & Kongress, mark payment ``CONCUR 94'' (note that personal checks will not be accepted). o By money transfer to: Foereningsbanken Uppsala, No. 7124-12-773 70, Box 276, S - 753 22 Uppsala, Sweden. o By credit card: American Express, Visa, Master Card, and Eurocard are accepted. Accommodation To reserve your accommodation, please fill in the Hotel Reservations section on the registration form and return it to the Conference Secretariat (see later page for address information), preferably no later than July 15, 1994. We have made preliminary reservations until July 15 in Hotel Svava and Hotel Linne in central Uppsala. A less expensive alternative is Samariterhemmet, a guest house with limited service. Still cheaper are rooms in private apartments (Bed and Breakfast style) which can be reserved through the conference registration service (Uppsala Turist & Kongress). Prices are as follows: Hotel Single room/night Double room/night Svava SEK 675 SEK 800 Linne SEK 650 SEK 850 Samariterhemmet (limited supply) SEK 430 SEK 650 Private room (B&B) SEK 190 (1st night) SEK 190 (1st night) SEK 150(from 2nd night) SEK 150 (from 2nd night) If you wish to share a room, please indicate the name of your room-mate. Meals Coffee Breaks, and Lunches will be served at the conference site. Lunches are served in the ``Winter Garden'' of ``Folkets Hus''. Social Events A reception preceding the conference will be held in the conference facilities on Sunday, August 21 at 19.00. A reception and welcome by Uppsala University will be held in the main university building on Monday, August 22 at 18.30. Excursion and conference dinner are combined in a boat trip on Lake M{laren from Uppsala to Skokloster Castle, a 17th century palace, with one of the largest collections of weaponry in the world. The castle is one of the most splendid examples of Swedish 17th-century county estate architecture and is very well preserved. The boat leaves on Wednesday, August 24 at 16.30. Currency Information The currency in Sweden is the Swedish Crown (SEK). The exchange rate (in May 1994) is approximately 7.8 SEK for 1 US$. All major credit cards are generally accepted in hotels, restaurants, shops, etc. Conference and Hotel Registration should be directed to the Conference secretariat: CONCUR '94 Uppsala Turist & Kongress Fyris Torg 8, S-753 10 Uppsala, Sweden. Tel: +46 - 18 - 27 48 08 Fax: +46 - 18 - 69 24 77 Correspondence on Other Matters should be directed to the Scientific secretariat: CONCUR '94 c/o Dept. of Computer Systems Uppsala University Box 325, S-751 05 Uppsala, Sweden Tel: +46 - 18 - 18 30 21 Fax: +46 - 18 - 55 02 25 e-mail:concur94@docs.uu.se Electronic Conference Information is available: For anonymous FTP users: host FTP.DoCS.UU.SE file docs/concur94/program.{txt,tex,dvi,ps} For WWW users: http://WWW.DoCS.UU.SE/concur94 For Gopher users: HOST=gopher.DoCS.UU.SE PORT=70 PATH=1/eng/docs/concur94 TYPE=1 NAME="CONCUR '94 conference" Conference jointly organised by: Dept. of Computer Systems, Uppsala University Swedish Institute of Computer Science Dept. of Teleinformatics, Royal Institute of Technology CUT HERE FOR REGISTRATION FORM REGISTRATION FORM Concur'94 - Fifth International Conference on Concurrency Theory, Uppsala, Sweden, August 22-25, 1994 Please type or use capital letters! REGISTRATION Family name:_______________________ First name:___________________________ Affiliation:_____________________________________________Title:___________ Address(work):____________________________________________________________ Code/City:_________________________ Country:______________________________ Telephone:_________________ Fax:________________ E-mail:__________________ Name(s) of accomp. person(s): ____________________________________________ REGISTRATION FEES Before July 15 After July 15 SEK Participant 1.700 SEK 2.200 SEK _______ Student 900 SEK 1.100 SEK _______ SOCIAL PROGRAMME Excursion to Skokloster Castle by Boat, Wednesday August 24. No. of Persons Participants 0 Students/Accompanying Persons 500 SEK/person} _______ TOTAL FEE(registation + Social programme) _______ PAYMENT Indicate which of the following means of payment you will use: 1. ____ Postal Giro No. 19 57 52-1, Uppsala Turist & Kongress, Sweden. 2. ____ International money order payable to Uppsala Turist & Kongress, ``CONCUR-94'', Fyris Torg 8, S-753 10 Uppsala, Sweden. 3. ____ Transfer to bank account: Foereningsbanken Uppsala, No. 7124-12-773-70, Box 276, S-753 22 Uppsala, Sweden. 4. ____ Credit Card: ____ American Express ____ Visa ____ Master Card ____ Eurocard Number:____________________ Exp. Date:____ Signature:___________________ Card Holder: ___________________________________________________________ Authorized address of card holder: _____________________________________ ACCOMMODATION ____ I will make my own arrangements. Please number your accommodation reservation in order of preference! Arrival date:__________ Departure date:__________ Hotels Single Room Double Room Hotel Svava ____ 675 SEK ____ 800 SEK Hotel Linne ____ 650 SEK ____ 850 SEK Samarithemmets G{sthem ____ 430 SEK ____ 650 SEK (shower in corridor) (shower in corridor) Tariffs quoted are per room per night including breakfast and all rooms have private WC and shower/bath, if not otherwise specified. Prices are subject to adjustment Single Room Double Room Accommodation ____ 190 SEK/1st night ____ 190 SEK/1st night in private rooms (price per person) ____ 150 SEK/2nd night ____ 150 SEK/2nd night ____ 3-Bed-room; 150 SEK/night Sheets for hire; 35 SEK. Breakfast is not included. Access to kitchen. I'm sharing my double/triple room with: _____________________________________ o Hotel reservations will be handled on a ``first come - first served'' basis. o Payment for the hotel can be made in cash or by credit card when leaving the hotel. USEFUL INFORMATION o All fees, except an administration cost of SEK 400 will be refunded, if cancellations are made before August 1, 1994. No refunds will be given after August 1, 1994. o The confirmation will be sent out in July 1994. Return this form BEFORE JULY 15, 1994 to: Uppsala Turist & Kongress ``CONCUR-94'', Fyris torg 8, S-753 10 Uppsala, SWEDEN. Tel: +46-18-27 48 07. Fax: +46-18-69 24 77. ========================================================= LaTeX version: \documentstyle[12pt]{article} \message{A4 paper size} %\textwidth=159.2mm %210mm - 1in * 2 for margins %\textheight=236.2mm %297mm - 1in * 2 for margins %\oddsidemargin=0mm %\evensidemargin=0mm %\topmargin=-15mm % \hoffset=-1.4cm % \voffset=1.8cm \setlength{\parindent}{0mm} \setlength{\parskip}{3.5pt} \setlength{\topmargin}{0mm} \setlength{\headheight}{0mm} \setlength{\headsep}{0mm} \setlength{\textheight}{230mm} \setlength{\oddsidemargin}{0mm} \setlength{\textwidth}{160mm} \begin{document} \begin{center} {\LARGE \bf CONCUR'94} \\ {\large \bf Fifth International Conference on \\ Concurrency Theory \\ August 22 - 25 1994 \\ Uppsala, Sweden} \\ {\Large \bf PROGRAMME and CALL FOR REGISTRATION } \end{center} \section*{Aim} CONCUR'94 is the Fifth International Conference on Concurrency Theory. The basic aim of the CONCUR conferences is to communicate advances in concurrency theories and applications. The first two meetings were held in Amsterdam in August 1990 and 1991, the third in Stony Brook, New York, U.S.A., in August 1992, and the fourth meeting was held in Hildesheim, Germany, in August 1993. The proceedings of these conferences have appeared in Springer-Verlag's Lecture Notes in Computer Science series as volumes 458, 527, 630, and 715, and the proceedings of CONCUR '94 will appear in the same series. The programme of CONCUR '94 includes presentations of selected papers, invited presentations, and tutorials. We also welcome participants to bring and demonstrate software packages that are relevant to the aims of the conference. More information regarding demonstrations is available later in this programme. \section*{Venue} The conference will be held at ``Folkets hus'' in central Uppsala, from which many tourist attractions are within walking distance. Accommodation will be close to the conference site. Uppsala is situated 70 km north of Stockholm, and can be conveniently reached from Stockholm Arlanda airport, which is situated 35 km south of Uppsala. \subsection*{Programme Committee} Ralph-Johan Back, Jos Baeten, Eike Best, Ed Clarke, Mads Dam, Rob van Glabbeek, Cliff Jones, Bengt Jonsson (organising committee chair), Kim Larsen, Ugo Montanari, Mogens Nielsen, Catuscia Palamidessi, Joachim Parrow (program committee chair), Scott Smolka, Bernhard Steffen, Colin Stirling, P.S.\ Thiagarajan, Frits Vaandrager, Pierre Wolper, and Zhou Chaochen. \subsection*{Invited Speakers} David Dill (Stanford University, USA), Jean-Yves Girard (CNRS, France), Paris Kanellakis (Brown University, USA), Mogens Nielsen (University of {A}{a}rhus, Denmark), and Prakash Panangaden (McGill University, Canada). \subsection*{Tutorial Lectures} Ralph-Johan Back ({\AA}bo Akademi, Finland), Costas Courcoubetis (Institute of Computer Science, FORTH, and University of Crete, Greece), Jean-Claude Fernandez and Joseph Sifakis (VERIMAG, France), and Robert de Simone (INRIA, France). \subsection*{Demos} We invite participants to organise demonstrations. Sun workstations will be available at the conference site. Please contact Anders Andersson (e-mail: concur94-demo@docs.uu.se) well in advance to settle issues concerning requirements and installation, so that software packages can be transferred and installed in due time. \section*{Sponsors} \bigskip Support for CONCUR '94 has been generously provided by: \begin{center} Ericsson Telecom \\ Telia Research \\ The Wenner-Gren Scientific Foundation \\ The Swedish National Board for Industrial and Technical Development \\ The Swedish Research Council for Engineering Sciences \\ The Swedish Natural Science Research Council \end{center} \newpage {\Large SCIENTIFIC PROGRAMME} \medskip Sunday, August 21 \medskip \begin{small} \begin{tabular}{rp{12cm}} 19:00-21:00 & Welcome Reception at ``Folkets Hus''\\ \end{tabular} \end{small} \medskip Monday, August 22 \begin{small} \begin{tabular}{rp{12cm}} 8:00- & Registration\\ 8:45-9:00 & Welcome \\ 9:00-10:00 & {\bf Invited Lecture}: {\it Geometry of interaction} \\ & J.-Y. Girard (CNRS, France)\\ 10:00-10:30 & {\it A compositional semantics for Statecharts using labeled transition systems} \\ & A.C. Uselton and S.A. Smolka (State University of New York at Stony Brook, USA)\\ 10:30-11:00 & Coffee and refreshments\\ 11:00-11:30 & {\it On the decidability of non-interleaving process equivalences} \\ & A. Kiehn (TU M\"{u}nchen, Germany) and M. Hennessy (University of Sussex, England) \\ 11:30-12:00 & {\it Regularity of BPA-systems is decidable} \\ & S. Mauw and J.C. Mulder (Eindhoven University of Technology, The Netherlands)\\ 12:00-12:30 & {\it A fast algorithm for deciding bisimilarity of normed context-free processes} \\ & Y. Hirshfeld (Tel Aviv University, Israel) and F. Moller (SICS, Sweden)\\ 12:30-14:00 & Lunch\\ 14:00-15:30 & {\bf Tutorial}: {\it Model-based verification methods and tools} \\ & J.C. Fernandez (VERIMAG, France), J. Sifakis (VERIMAG, France) and R. de Simone (INRIA, France)\\ & The tutorial is accompanied by a hands-on section, which can be completed by attendees during the remaining conference on the available Sun workstations. \\ 15:30-16:00 & {\it New results in the analysis of concurrent systems with an indefinite number of processes} \\ & M. Girkar and R. Moll (University of Massachusetts, USA) \\ 16:00-16:30 & Coffee and refreshments\\ 16:30-17:00 & {\it Verification of nonregular temporal properties for context-free processes} \\ & A. Bouajjani (VERIMAG, France), R. Echahed (LGI-IMAG, France) and R. Robbana (VERIMAG, France)\\ 17:00-17:30 & {\it Pushdown processes: parallel composition and model checking} \\ & O. Burkart (RWTH Aachen, Germany) and B. Steffen (Universit{\"a}t Passau, Germany)\\ 17:30-18:00 & {\it Local model checking for parallel compositions of context-free processes} \\ & H. Hungar (University of Oldenburg, Germany)\\ 18:30- & Reception in the main university building \end{tabular} \end{small} \newpage Tuesday, August 23 \medskip \begin{small} \begin{tabular}{rp{12cm}} 8:30-9:30 & {\bf Invited Lecture}: {\it The logical structure of concurrent constraint programming languages} \\ & P. Panangaden (McGill University, Canada)\\ 9:30-10:00 & {\it Countable non-determinism and uncountable limits} \\ & P. Di Gianantonio, F. Honsell and S. Liani (Universit\`{a} di Udine, Italy), G. Plotkin (University of Edinburgh, Scotland) \\ 10:00-10:30 & {\it SProc categorically} \\ & J.R.B. Cockett and D.A. Spooner (University of Calgary, Canada) \\ 10:30-11:00 & Coffee and refreshments\\ 11:00-12:30 & {\bf Tutorial}: {\it From timed graphs to hybrid automata} \\ & C. Courcoubetis (FORTH, and University of Crete, Greece)\\ 12:30-14:00 & Lunch\\ 14:00-15:00 & {\bf Invited Lecture}: {\it Hierarchical models of synchronous circuits} \\ & D. Dill (Stanford University, USA)\\ 15:00-16:00 & {\it The observational power of clocks} \\ & R. Alur (AT\&T Bell Laboratories, USA), C. Courcoubetis (FORTH and University of Crete, Greece) and T.A. Henzinger (Cornell University, USA)\\ 15:30-16:00 & {\it A dynamic approach to timed behaviour} \\ & J. Gunawardena (Hewlett-Packard, USA)\\ 16:00-16:30 & Coffee and refreshments\\ 16:30-17:00 & {\it Algebras of processes of timed Petri nets} \\ & J. Winkowski (Instytut Podstaw Informatyki PAN, Poland)\\ 17:00-17:30 & {\it Operational semantics for the Petri box calculus} \\ & M. Koutny (University of Newcastle upon Tyne, England), J. Esparza (University of Edinburgh, Scotland) and E. Best (Universit{\"a}t Hildesheim, Germany) \\ 17:30-18:00 & {\it Weak sequential composition in process algebras} \\ & A. Rensink and H. Wehrheim (Universit{\"a}t Hildesheim, Germany)\\ \end{tabular} \end{small} \newpage Wednesday, August 24 \medskip \begin{small} \begin{tabular}{rp{12cm}} 8:30-9:30 & {\bf Invited Lecture}: {\it Efficient parallelism vs reliable distribution: a tradeoff for concurrent computations} \\ & P. Kanellakis (Brown University, USA)\\ 9:30-10:00 & {\it On unifying assumption-commitment style proof rules for concurrency} \\ & Q. Xu (\AA bo Akademi, Finland), A. Cau (Christian-Albrechts Universit{\"a}t zu Kiel, Germany) and P. Collette (Universit\'e Catholique de Louvain, Belgium)\\ 10:00-10:30 & {\it Liveness and fairness in Duration calculus} \\ & J.U. Skakkeb{\ae}k (Technical University of Denmark)\\ 10:30-11:00 & Coffee and refreshments\\ 11:00-11:30 & {\it A symbolic semantics for the $\pi$-calculus} \\ & M. Boreale and R. De Nicola (Universit\`{a} di Roma ``La Sapienza'', Italy)\\ 11:30-12:00 & {\it On bisimulation in the $\pi$-calculus} \\ & D. Walker (University of Warwick, England)\\ 12:00-12:30 & {\it Characterizing bisimulation congruence in the $\pi$-calculus} \\ & X. Liu (University of Sussex, England)\\ 12:30-14:00 & Lunch\\ 14:00-14:30 & {\it The limit view of infinite computations} \\ & N. Klarlund (University of {A}{a}rhus, Denmark)\\ 14:30-16:00 & {\bf Tutorial}: {\it Trace Refinement of Action Systems} \\ & R.J.R. Back (\AA bo Akademi, Finland)\\ 16:30- & Excursion and Conference Dinner\\ \end{tabular} \end{small} \newpage Thursday, August 25 \medskip \begin{small} \begin{tabular}{rp{12cm}} 8:30-9:30 & {\bf Invited Lecture}: {\it Bisimulation for models in concurrency} \\ & M. Nielsen (University of {A}{a}rhus, Denmark)\\ 9:30-10:00 & {\it Invariants in process algebra with data} \\ & M.A. Bezem and J.F. Groote (Utrecht University, The Netherlands) \\ 10:00-10:30 & {\it Testing-based abstractions for concurrent systems} \\ & R. Cleaveland (North Carolina State University, USA) and J. Riely (University of North Carolina, USA)\\ 10:30-11:00 & Coffee and refreshments\\ 11:00-11:30 & {\it A congruence theorem for structured operational semantics with predicates and negative premises} \\ & C. Verhoef (Eindhoven University of Technology, The Netherlands)\\ 11:30-12:00 & {\it Deriving complete inference systems for a class of GSOS languages generating regular behaviours} \\ & L. Aceto (University of Sussex, England)\\ 12:00-12:30 & {\it Process algebra with partial choice} \\ & J.C.M. Baeten (Eindhoven University of Technology, The Netherlands) and J.A. Bergstra (University of Amsterdam and Utrecht University, The Netherlands)\\ 12:30-14:00 & Lunch\\ 14:00-14:30 & {\it Probabilistic simulations for probabilistic processes} \\ & R. Segala and N. Lynch (Massachusetts Institute of Technology, USA)\\ 14:30-15:00 & {\it Fully abstract characterizations of testing preorders for probabilistic processes} \\ & S. Yuen (Nagoya University, Japan), R. Cleaveland (North Carolina State University, USA), Z. Dayar (North Carolina State University, USA) and S.A. Smolka (State University of New York at Stony Brook, USA) \\ 15:00-15:30 & {\it Composition and behaviors of probabilistic I/O automata} \\ & S.-H. Wu, S.A. Smolka and E.W. Stark (State University of New York at Stony Brook, USA)\\ \end{tabular} \end{small} \newpage {\bf \Large Abstracts for Tutorial Programme} \medskip {\large Model-Based Verification Methods and Tools} \medskip J. C. Fernandez, J. Sifakis (VERIMAG, France), R. de Simone (INRIA, France) Monday, August 22, 14:00 - 15:30 We describe established verification methods in the framework of communicating concurrent systems, focusing on model-based approaches implemented by existing tools for automatic verification. Such tools can be sorted by several features: input description language, specification style for properties (temporal logic {\em vs} operational behaviour), type of interpretation (linear time {\em vs} branching time). In contrast, most share the same modeling into labeled transition systems. In addition to the techniques of model-checking (or satisfaction of a temporal logic formula by a model) and model comparison (by behavioural equivalence or behavioural inclusion), we also present several methods for model simplification (abstraction, quotient minimisation,...). In all cases we face the issues of algorithmic complexity, of expressivity, and also of clarity and simplicity of usage. We end with an extensive description of the verification tools {\sc Aldebaran} and {\sc Auto} developed in our groups, followed by a tentative hands-on session for the attendees. \bigskip {\large From Timed Graphs to Hybrid Automata} \medskip Costas Courcoubetis (Institute of Computer Science, FORTH, and University of Crete, Greece) Tuesday, August 23, 11:00 - 12:30 We discuss various automata-theoretic formalisms for the specification and verification of real-time systems. We start with the general formalism of the hybrid automata as a model and specification language for hybrid systems. This is an extension of the traditional automata on infinite words in which the behavior of variables is governed in each state by a set of differential equations. Then we introduce the models of the timed automata and the integration graphs as special cases of the hybrid automata. We discuss the complexity of important verification issues related to the above models such as reachability and model-checking, and we survey the related algorithms. \bigskip {\large Trace Refinement of Action Systems} \medskip Ralph-Johan Back (\AA bo Akademi University, Turku, Finland) Wednesday, August 24, 14:30 - 16:00 Action systems provide a general description of reactive systems, capable of modeling terminating, aborting and infinitely repeating systems. Arbitrary sequential program statements can be used to describe the behavior of atomic actions. Action systems are used to extend the Refinement Calculus, originally designed for sequential program refinement, to handle refinement of parallel and reactive systems. This permits systems to be built in which sequential and parallel constructs can be arbitrarily nested within each other. We will describe a behavioral semantics for action systems, in terms of execution traces, and define refinement of action systems based on this semantics. We show that trace refinement is a special case of data refinement of sequential programs. We give a general proof rule for action system refinement in a reactive context. This general proof rule can be shown both sound and complete for trace refinement under certain rather reasonable restrictions. Forward and backward simulation proof methods both arise as special cases of this general rule. We show how to derive specialized versions of these proof rules to handle situations that arise often in practical applications. We illustrate the use of reactive system refinement with an example. (Joint work with J. von Wright) \bigskip {\bf \Large Abstracts of Invited Lectures} \medskip {\large Geometry of Interaction} \medskip Jean-Yves Girard (CNRS, France) Monday, August 22, 09:00 - 10:00 Geometry of Interaction is based on the idea that the ultimate explanation of logical rules is through the cut-elimination procedure. This is achieved by means of a pure geometric interpretation of normalization~: \begin{itemize} \item proofs are operators on the Hilbert space describing I/O dependencies \item cut-elimination is the solution of an I/O equation \[U(x \oplus \sigma(a)) = y \oplus a\] (the cut $\sigma$ expressing a feedback of some output of the proof $U$ to some input of $U$) \item termination is nilpotency of the operator $\sigma U$ \item execution is expressed by \[RES (U,\sigma) := (1-\sigma^2)U(1-\sigma U)^{-1}(1-\sigma^2)\] \end{itemize} This interpretation is available for full linear logic, which means, using translations for all constructive logics, in particular for typed $\lambda$-calculi. It also works for untyped calculus, {\em modulo} a slight weakening of the hypotheses, expressing the absence of deadlock. Geometry of Interaction expresses a pure local asynchronous form of execution. Among the distinguished features of this execution, let us mention the distinction between public and private data\ldots\ By the way there are two ways to combine operators in a way respecting privacy, and these two ways correspond to the two conjunctions of linear logic. \bigskip {\large The Logical Structure of Concurrent Constraint Programming Languages} \medskip Prakash Panangaden (McGill University, Canada) Tuesday, August 23, 08:30 - 09:30 The Concurrent Constraint Programming paradigm has been the subject of growing interest as the focus of a new paradigm for concurrent computation. Like logic programming it claims close relations to logic. In fact these languages {\em are} logics in a certain sense that we make precise. In recent work it was shown that the denotational semantics of determinate concurrent constraint programming languages forms a categorical structure called a hyperdoctrine which is used as the basis of the categorical formulation of first order logic. What this connection shows is the combinators of determinate concurrent constraint programming can be viewed as logical connectives. In the present work we extend these ideas to the operational semantics of these languages and thus make available similar analogies for the indeterminate concurrent constraint programming languages. We also describe a linear extension of concurrent constraint programming and discuss hyperdoctrines for such languages. The discussion concludes with an examination of the prospects for understanding other formalisms for concurrent computation in the same way. One need never have heard of a hyperdoctrine in order to follow the talk. (Joint work with N. Mendler, P. Scott and R. Seely) \bigskip {\large Hierarchical Models of Synchronous Circuits} \medskip David Dill (Stanford University, USA) Tuesday, August 23, 14:00 - 15:00 We seek a behavioral model of synchronous circuit operation which generalizes Mealy machines in several ways: \begin{itemize} \item It should allow the expression of nondeterministic behavior. \item It should allow parallel composition of machines and hiding of output signals. \item It should not restrict bidirectional communication between machines. \item It should deal reasonably with zero-delay cycles, which can be present in unrestricted communication graphs. \item It should provide a preorder that precisely captures the proper relationship between implementation and specification behaviors. \item It should allow the computation of the "most general environment" of a circuit. \end{itemize} Surprisingly, given the attention that has been paid to switching theory over the years, no adequate model exists meeting these criteria. Devising such a model is more challenging than we had expected. This talk is a description of several of the specific problems that arise, along with solutions to some of them. \bigskip {\large Efficient Parallelism vs Reliable Distribution: a Tradeoff for Concurrent Computations} \medskip Paris Kanellakis (Brown University, USA) Wednesday, August 24, 08:30 - 09:30 Concurrent computations should combine efficiency with reliability, where efficiency is usually associated with parallel and reliability with distributed computing. Such a desirable combination is not always possible, because of an intuitive tradeoff: efficiency requires removing redundancy from computations whereas reliability requires some redundancy. We survey a spectrum of algorithmic models (from fail-stop, synchronous to asynchronous and from exact to approximate computations) in which reliability is guaranteed with small tradeoffs in efficiency. We illustrate a number of cases where optimal tradeoffs are achievable. A basic property of all these models (of some interest in the study of concurrency) is that ``true'' read/write concurrency is necessary for fault tolerance. In particular, we show how algorithms can be designed so that, in each execution, the total concurrency used can be closely related to the faults that can be tolerated. (Joint work with D. Michailidis and A. Shvartsman) \bigskip {\large Bisimulation for Models in Concurrency} \medskip Mogens Nielsen (University of {A}{a}rhus, Denmark) Thursday, August 25, 08:30 - 09:30 Recently, Joyal, Nielsen and Winskel suggested a categorical definition of bisimulation, applicable to a wide range of models for concurrency with an accompanying notion of observations. The definition is in terms of span of open maps, and it coincides with Milner's strong bisimulation for the standard model of labelled transition systems with sequential observations. In this talk we investigate this categorical notion of bisimulation for a selection of alternative models and observations (like Petri Nets with nonsequential observations), focusing on game theoretical and logical characterizations. \section*{GENERAL INFORMATION} \subsubsection*{Conference Venue} The conference will be held in the conference facilities in ``Folkets Hus'', Dragarbrunnsgatan 46, in central Uppsala. The majority of accommodation possibilities are located within a 1 -- 15 minute walk from the conference site. Uppsala, situated 70 km north of Stockholm, is the fourth largest city in Sweden with almost 160.000 inhabitants and a decidedly academic atmosphere. Uppsala University, founded in 1477, is the oldest university in Scandinavia and has more than 20.000 students. % \subsubsection*{Climate} The weather in Uppsala in August is warm, with a temperature around 15-20 degrees Celsius (60-70 Fahrenheit), ranging between very sunny and rain. A pullover and a raincoat or umbrella can at times be useful. \subsubsection*{Travel Information} Uppsala can be conveniently reached from Stockholm Arlanda airport, which is situated 35 km south of Uppsala. Stockholm Arlanda airport is served by most major airlines. There is a regular bus service (No.\ 801) directly from the airport to Uppsala city centre every half hour. There are train connections between Stockholm and Uppsala every hour (50 minute ride). From Stockholm, it takes approximately 45 minutes along highway E4 to reach Uppsala by car. Registrants will receive detailed travel information with their confirmation. \subsubsection*{Registration} Please register for CONCUR'94 by sending the attached registration and accommodation form to the Conference Secretariat, by regular mail or fax (see page~\pageref{addrinfo} for address information). Note that forms cannot be sent by e-mail. Fees, all indicated in Swedish crowns (SEK), are as follows. \begin{tabular}{l|ll} & before July 15 & after July 15\\ Regular fee & SEK 1.700 & SEK 2.200 \\ Student fee & SEK 900 & SEK 1.100\\ \end{tabular} The regular fee includes attendance to all sessions, a copy of the proceedings, conference dinner, lunches, refreshments, and excursion. The reduced student fee includes the same benefits as the regular fee except for the conference dinner and excursion, which have to be paid for separately (500 SEK) when applying for the student fee. The same extra fee for the conference dinner and excursion applies for accompanying persons. Requests for refunds will be honoured until August 1, except for an administrative fee of SEK 400. The registration should reach Uppsala Turist \& Kongress {\bf no later than July 15}. \subsubsection*{Payments} All payments are to be made in SEK. Please effect payment either \begin{itemize} \item By Postal Giro to No.\ 19 57 52 - 1, Uppsala Turist \& Kongress, mark payment ``CONCUR 94''. \item By international money order, payable to Uppsala Turist \& Kongress, mark payment ``CONCUR 94'' (note that personal checks will not be accepted). \item By money transfer to: F{\"o}reningsbanken Uppsala, No.\ 7124 - 12 - 773 70, Box 276, S - 753 22 Uppsala, Sweden. \item By credit card: American Express, Visa, Master Card, and Eurocard are accepted. \end{itemize} \subsubsection*{Accommodation} To reserve your accommodation, please fill in the Hotel Reservations section on the registration form and return it to the Conference Secretariat (see page~\pageref{addrinfo} for address information), preferably no later than July 15, 1994. We have made preliminary reservations until July 15 in {\sl Hotel Svava} and {\sl Hotel Linn{\'e}} in central Uppsala. A less expensive alternative is {\sl Samariterhemmet}, a guest house with limited service. Still cheaper are rooms in private apartments (Bed and Breakfast style) which can be reserved through the conference registration service (Uppsala Turist \& Kongress). Prices are as follows: \begin{tabular}{lll} Hotel & Single room/night & Double room/night\\\hline Svava & SEK 675 & SEK 800 \\ Linn\'e & SEK 650 & SEK 850 \\ Samariterhemmet (limited supply) & SEK 430 & SEK 650 \\ Private room (BoB) & SEK 190 (1st night) & SEK 190 (1st night) \\ & SEK 150 (from 2nd night) & SEK 150 (from 2nd night) \end{tabular} If you wish to share a room, please indicate the name of your room-mate. \subsubsection*{Meals} Coffee Breaks, and Lunches will be served at the conference site. Lunches are served in the ``Winter Garden'' of ``Folkets Hus''. \subsubsection*{Social Events} A reception preceding the conference will be held in the conference facilities on Sunday, August 21 at 19.00. A reception and welcome by Uppsala University will be held in the main university building on Monday, August 22 at 18.30. Excursion and conference dinner are combined in a boat trip on Lake M\"alaren from Uppsala to {\sl Skokloster Castle}, a 17th century palace, with one of the largest collections of weaponry in the world. The castle is one of the most splendid examples of Swedish 17th-century county estate architecture and is very well preserved. The boat leaves on Wednesday, August 24 at 16.30. \subsubsection*{Currency Information} The currency in Sweden is the Swedish Crown (SEK). The exchange rate (in May 1994) is approximately 7.8 SEK for 1 US \$. All major credit cards are generally accepted in hotels, restaurants, shops, etc. {\bf Conference and Hotel Registration} should be directed to the Conference secretariat: \label{addrinfo} CONCUR '94 \\ Uppsala Turist \& Kongress \\ Fyris Torg 8, S-753 10 Uppsala, Sweden. \\ Tel: +46 - 18 - 27 48 08 \\ Fax: +46 - 18 - 69 24 77 \\ {\bf Correspondence on Other Matters} should be directed to the Scientific secretariat: CONCUR '94 \\ c/o Dept.\ of Computer Systems\\ Uppsala University \\ Box 325, S-751 05 Uppsala, Sweden \\ Tel: +46 - 18 - 18 30 21 \\ Fax: +46 - 18 - 55 02 25 \\ e-mail:concur94@docs.uu.se \\ {\bf Electronic Conference Information} is available: \medskip \begin{tabular}{ll} For anonymous FTP users: & host {\tt FTP.DoCS.UU.SE}, \\ & file {\tt docs/concur94/program.\{txt,tex,dvi,ps\}} \\ For WWW users: & {\tt http://WWW.DoCS.UU.SE/concur94} \\ For Gopher users: & {\tt HOST=gopher.DoCS.UU.SE PORT=70} \\ & {\tt PATH=1/eng/docs/concur94 TYPE=1} \\ & {\tt NAME="CONCUR '94 conference"} \\ \end{tabular} \begin{center} {\Large Conference jointly organised by:} \\ Dept. of Computer Systems, Uppsala University \\ Swedish Institute of Computer Science \\ Dept. of Teleinformatics, Royal Institute of Technology \end{center} \newpage \begin{center} \LARGE{Registration Form} \\ \large{Concur'94 - Fifth International Conference on Concurrency \\ Theory, Uppsala, Sweden, August 22-25, 1994} \end{center} \centerline{Please type or use capital letters!} {\bf REGISTRATION} Family name: \hrulefill First name: \hrulefill \\ Affiliation: \makebox[3.5in]{\hrulefill} Title: \hrulefill \\ Address(work): \hrulefill \\ Code/City: \hrulefill Country: \hrulefill \\ Telephone: \hrulefill Fax: \hrulefill E-mail: \hrulefill \\ Name of accomp. person: \hrulefill \medskip \begin{tabular}{@{}lrrr@{}} {\bf REGISTRATION FEES} & Before July 15 & After July 15 & SEK \\ \cline{2-4} \\ Participant & 1.700 SEK & 2.200 SEK & \hrulefill \\ Student & 900 SEK & 1.100 SEK & \hrulefill \\ \\ {\bf SOCIAL PROGRAMME} & & & \\ \multicolumn{4}{@{}l} {Excursion to Skokloster Castle by Boat, Wednesday August 24.} \\ \\ & & No. of Persons & \\ \cline{3-3} \\ Participants & & \hrulefill & 0 \\ \multicolumn{2}{@{}l}{Students/Accompanying Persons, 500 SEK/person} & \hrulefill & \hrulefill \\ \\ & & {\bf TOTAL FEE} & \hrulefill \\ \end{tabular} {\bf PAYMENT} Indicate which of the following means of payment you will use: \begin{description} \item {1. $\Box$} Postal Giro No. 19 57 52-1, Uppsala Turist \& Kongress, Sweden. \item {2. $\Box$} International money order payable to Uppsala Turist \& Kongress, ``CONCUR-94'', Fyris Torg 8, S-753 10 Uppsala, Sweden. \item {3. $\Box$} Transfer to bank account: F\"oreningsbanken Uppsala, No. 7124-12-773-70, Box 276, S-753 22 Uppsala, Sweden. \item {4.} Credit Card: $\Box$ American Express $\Box$ Visa $\Box$ Master Card $\Box$ Eurocard \end{description} Number: \makebox[1.5in]{\hrulefill} Exp. Date: \makebox[0.5in]{\hrulefill} Signature: \hrulefill \\ Card Holder: \hrulefill \\ Authorized address of card holder: \hrulefill \\ \newpage {\bf ACCOMMODATION} \hfill $\Box$ I will make my own arrangements. {\it Please number your accommodation reservation in order of preference!} \\ Arrival date:\makebox[1in]{\hrulefill} Departure date:\makebox[1in]{\hrulefill} \begin{tabular}{@{}lllll@{}} Hotels & \multicolumn{2}{l}{Single Room} & \multicolumn{2}{l}{Double Room} \\ \hline \\ Hotel Svava & $\Box$ & 675 SEK & $\Box$ & 800 SEK \\ Hotel Linn\'e & $\Box$ & 650 SEK & $\Box$ & 850 SEK \\ Samarithemmets \\ G\"asthem & $\Box$ & 430 SEK (shower in corridor) & $\Box$ & 650 SEK (shower in corridor) \\ \\ \multicolumn{5}{l} {Tariffs quoted are per room per night including breakfast and all rooms have private} \\ \multicolumn{5}{l} {WC and shower/bath, if not otherwise specified. Prices are subject to adjustment.} \\ \\ & \multicolumn{2}{l}{Single Room} & \multicolumn{2}{l}{Double Room} \\ \hline \\ Accommodation in & $\Box$ & 190 SEK/first night & $\Box$ & 190 SEK/ first night \\ private rooms & & 150 SEK/second night & & 150 SEK/second night \\ (price per person) & & & & \\ & $\Box$ & 3-Bed-room; 150 SEK/night \end{tabular} \begin{itemize} \item Sheets for hire; 35 SEK. Breakfast is not included. Access to kitchen. \end{itemize} I'm sharing my double/triple room with: \hrulefill \\ \vspace{-5mm} \begin{itemize} \item Hotel reservations will be handled on a ``first come - first served'' basis. \item Payment for the hotel can be made in cash or by credit card when leaving the hotel. \end{itemize} {\bf USEFUL INFORMATION} \begin{itemize} \item All fees, except an administration cost of SEK 400 will be refunded, if cancellations are made before August 1, 1994. No refunds will be given after August 1, 1994. \item The confirmation will be sent out in July 1994. \end{itemize} \begin{center} {\Large{\bf Return this form before July 15, 1994 to: \\ Uppsala Turist \& Kongress ``CONCUR-94'', \\ Fyris torg 8, S-753 10 Uppsala, SWEDEN. \\ Tel: +46-18-27 48 07. \\ Fax: +46-18-69 24 77. }} \end{center} \end{document} ================================================== From fritsv@cwi.nl Fri May 27 12:29:41 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA19349; Fri, 27 May 94 04:30:07 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Fri, 27 May 1994 10:29:41 +0200 Received: by specht.cwi.nl id AA14798 (5.65b/3.8/CWI-Amsterdam); Fri, 27 May 1994 10:29:41 +0200 Date: Fri, 27 May 1994 10:29:41 +0200 Message-Id: <9405270829.AA14798=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: 1-day Open Workshop, Zaragoza, June 20 From: E.Best@informatik.uni-hildesheim.de (Eike Best) ---------------------------------------------------------------- 1-DAY CALIBAN OPEN WORKSHOP, JUNE 20, 1994, ZARAGOZA ---------------------------------------------------------------- SCHEDULE ---------------------------------------------------------------- MORNING SESSION 1, Chair: Raymond Devillers 9:00- 9:30 Jetty KLeijn, Leiden: Local Event Structures 9:30-10:00 Eugenio Battiston, Fiorella De Cindio, Milano: The specification of a quasi-real case by means of OBJSA nets in the OBJSA net environment ONE 10:00-10:30 Kimmo Varpaaniemi, Helsinki: ARA and PROD: Lotos and Petri Nets in Computer Aided Verification 10:30-11:00 BREAK MORNING SESSION 2, Chair: Fiorella De Cindio 11:00-11:30 Luca Bernardinello, Giorgio De Michelis, Milano: On Synchronic and Enlogic Structure of Transition Systems 11:30-11:50 Johan Lilius, Helsinki: Folding Place/Transition Nets. 11:50-12:10 Brigitte Rozoy, Paris: Context Traces and Transition Systems 12:10-12:30 Richard Hopkins, Newcastle: Voting on Synchronous Communications 12:30 END of MORNING SESSION LUNCH BREAK AFTERNOON SESSION 1, Chair: Johan Lilius 15:00-15:30 Javier Esparza, M"unchen/Edinburgh/Hildesheim: Trapping Mutual Exclusion in the Box Calculus 15:30-16:00 Raymond Devillers, Bruxelles: Synchronisation Operators for the Petri Box Calculus 16:00-16:20 Maciej Koutny, Newcastle: Structural Operational Semantics of Box Expressions 16:20-16:50 BREAK AFTERNOON SESSION 2, Chair: Jetty Kleijn 16:50-17:10 Martin Hesketh, Newcastle: Axiomatisation of a Subset of the Box Calculus 17:10-17:30 Bernd Grahlmann, Hildesheim: Current Status of the PEP Project and Implementation 17:30-17:50 Elisabeth Pelz, Paris: A High Level Net Semantics of B(PN)2 Compatible with the Low Level Semantics 17:50-18:10 Nikolay Anisimov, Wladiwostok: A Notion of Macroplaces for Net Calculi 18:10-18:30 Didier Buchs, Geneve/Paris: Hierarchical Algebraic Petri Nets and the SANDS/CO-OPN Tool END OF WORKSHOP ---------------------------------------------------------------- From fritsv@cwi.nl Fri May 27 17:24:48 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA20340; Fri, 27 May 94 09:25:17 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Fri, 27 May 1994 15:24:49 +0200 Received: by specht.cwi.nl id AA15293 (5.65b/3.8/CWI-Amsterdam); Fri, 27 May 1994 15:24:48 +0200 Date: Fri, 27 May 1994 15:24:48 +0200 Message-Id: <9405271324.AA15293=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: JOB in LORRAINE From: Dominique Mery Be a Research System Sofware Engineer at INRIA Lorraine ? A good idea ! You are interested by the new technologies of parallel and very-high-performance machines, want participate in the evolution and maintenance of a state-of-the-art computer network with INRIA Lorraine, CRIN and the Charles Hermite Center, like to work in a dynamic and friendly system team can appreciate the charms of the good life of Lorraine... These are four reasons to apply for a job as : Research engineer Competitive entry examination in June/July 1994 Forms available : 3 June 1994 Submission deadline : 6 June 1994 For forms and conditions of employment, contact : D. Villiiras (phone number : [33] 83 59 30 10) For questions concerning the position, contact : A. Quiri (phone number : [33] 83 59 30 38 or email : quere@loria.fr) Career profile : good experience with programming Unix systems and parallel machines. Specific competence with parallel architectures and performance measurement. Functions : responsible (with system administrators) for the computing environment of the Centre Lorrain de Compitence en Modilisation et Calcul ` Hautes Performances. -- ================================ Dominique MERY CRIN-CNRS & INRIA Lorraine Universite' Henri Poincare' - Nancy 1 ================================ BP 239 54506 VANDOEUVRE-LES-NANCY FRANCE ================================ email: mery@loria.fr phone: (33) 83 59 20 14 fax: (33) 83 41 30 79 ================================ From fritsv@cwi.nl Fri May 27 17:26:43 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA20354; Fri, 27 May 94 09:27:07 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Fri, 27 May 1994 15:26:44 +0200 Received: by specht.cwi.nl id AA15307 (5.65b/3.8/CWI-Amsterdam); Fri, 27 May 1994 15:26:43 +0200 Date: Fri, 27 May 1994 15:26:43 +0200 Message-Id: <9405271326.AA15307=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Paper on a pi-calculus with locations that can fail From: Sanjiva Prasad Roberto Amadio and I would like to announce the availability of our paper Localities and Failures We look forward to your comments and suggestions. The paper, which is registered as an ECRC tech report (ECRC-94-18), is available by anonymous ftp from ftp.ecrc.de in compressed postscript format. The directory is: /pub/ECRC_tech_reports/reports and the file is: ECRC-94-18.ps.Z The UNIX shell command uncompress ECRC-94-18.ps.Z will extract the postscript file. Note: ECRC tech reports are typeset using designer fonts (Fruchtiger and Garamond). In case printing the file is a problem, or if you have problems with ftp, please contact me (sanjiva@ecrc.de). With regards, Sanjiva (sanjiva@ecrc.de) %----------------------------ABSTRACT-------------------------------------- Localities and Failures Roberto M Amadio Sanjiva Prasad CRIN-INRIA, Nancy ECRC Munich BP 239, F-54506 Arabellastrasse 17 Vand\oe{uvre}, FRANCE 81925 Muenchen, GERMANY amadio@loria.fr sanjiva@ecrc.de We present a simple extension of the $\pi$-calculus with located actions and channels and with location names as first-class data, which models the notion of locality and failure present in the higher-order, distributed programming language Facile. The interaction between localities and failures distinguishes our approach from previous ones where the notion of locality is considered in isolation. We argue that the combination of these two features leads, at least from the distributed programming viewpoint, to a more natural semantics. We then discuss the translation of this calculus into a standard simply-sorted $\pi$-calculus and show its adequacy with respect to a barbed bisimulation based semantics. In the translation each location is represented by a special process which interacts, by means of a simple protocol, with any process of the original program that wants to access resources depending on that location. We also apply our translation in the verification of a very simple fault-tolerant program. Thus, we support the view that --- at least in theory --- reasoning about such distributed applications can be carried out in the familiar interleaving semantics of the $\pi$-calculus. {\bf Keywords:} $\pi$-calculus, distributed programming language, localities, failure, barbed bisimulation, adequacy, verification. From fritsv@cwi.nl Wed Jun 1 16:04:28 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA11629; Wed, 01 Jun 94 08:04:58 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Wed, 1 Jun 1994 14:04:29 +0200 Received: by specht.cwi.nl id AA19717 (5.65b/3.8/CWI-Amsterdam); Wed, 1 Jun 1994 14:04:28 +0200 Date: Wed, 1 Jun 1994 14:04:28 +0200 Message-Id: <9406011204.AA19717=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Reminder: LICS'94 Registration From: felty@research.att.com (Amy Felty) REMINDER: THE DEADLINE FOR LICS EARLY REGISTRATION IS JUNE 6. LOGIC IN COMPUTER SCIENCE ******************************** Ninth Annual IEEE Symposium July 3-7, 1994, Paris, France NOTE: Advance payment for registration by credit card is not possible. However, it is possible to pay by credit card or cash in French Francs on location at CNAM. In order to get the early registration rate, send the registration form so that it is received before June 6, circle the reduced rate (and the banquet fee if you wish to attend the banquet), and indicate that you will pay on site with cash or one of the following authorized cards: Visa international, Eurocard, MasterCard. If you choose to pay by this method and are subsequently unable to attend, you are requested to send mail to symposia@inria.fr. Other forms of payment (as stated in the brochure, but with some clarification) are as follows. Payment must be in French currency. 1. Bank check (also called foreign draft in the US) or postal check made payable to Agent Comptable de l'INRIA. 2. Bank transfer. Beneficiary: Agent Comptable de l'INRIA Bank Name: Tresorierie Generale des Yvelines Bank Address: Versailles Bank Code: 10071 Branch Code: 78000 Account Number: 00044009 15389 Specify your name and "Conference reference LICS94" [Note that the account number as stated in the brochure is divided into bank code, branch code, and account number here.] 3. Postal transfer to CCP Paris---30041-00001-09099 45 B 020-31. 4. Institutional Purchase Order. [Complete program and registration information is available on the world-wide web at http://www.research.att.com/lics/ Postscript, dvi, latex and plain text versions of the conference brochure are available via anonymous ftp from research.att.com in directory /dist/lics.] From fritsv@cwi.nl Fri Jun 3 13:15:26 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA08194; Fri, 03 Jun 94 05:16:02 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Fri, 3 Jun 1994 11:15:26 +0200 Received: by specht.cwi.nl id AA21894 (5.65b/3.8/CWI-Amsterdam); Fri, 3 Jun 1994 11:15:26 +0200 Date: Fri, 3 Jun 1994 11:15:26 +0200 Message-Id: <9406030915.AA21894=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Surveys on formal verification? From: Hans van der Schoot Hello, Could anybody please give me references of some good and accurate survey papers on formal verification methods, in particular program verification and protocol verification methods. I have been looking in the literature of mid seventies up to '94, but found very few: Palmer & Sabnani - A survey of protocol verification techniques MILCOM'86 Sajkowski - Evaluation of protocol verification techniques 7th Int. Conf. on Comp. Comm. Yuang - Survey of protocol verification techniques based on finite state models Comp. Netw. Symp. 1988, Washington D.C. Gouda - Protocol verification made simple: a tutorial Comp. Netw. & ISDN Syst., 25, 9, 1993 Sajkowski - Protocol verification techniques: status quo and perspectives PSTV IV None of these seem to go in to a detailed evaluation/comparison of/among the different techniques. Thanx in advance! Regards -- Hans -- ============================================================== Hans van der Schoot tel.: +1 613 564 9544/9106 (w) Dept. of Computer Science +1 613 778 7300 (h) University of Ottawa fax: +1 613 564 3491. 150 Louis Pasteur email: vdschoot@csi.uottawa.ca Ottawa, Ontario Canada K1N 6N5 "There are no strangers, only friends we don't recognize" - Hank Wangford From fritsv@cwi.nl Fri Jun 3 16:00:20 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA08634; Fri, 03 Jun 94 08:01:00 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Fri, 3 Jun 1994 14:00:22 +0200 Received: by specht.cwi.nl id AA22181 (5.65b/3.8/CWI-Amsterdam); Fri, 3 Jun 1994 14:00:20 +0200 Date: Fri, 3 Jun 1994 14:00:20 +0200 Message-Id: <9406031200.AA22181=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Position in Twente From: brinksma@cs.utwente.nl PLEASE FORWARD THIS TO YOUR COLLEAGUES Associate Professor (m/f) "Distributed Systems Design" Tele-Informatics and Open Systems Group University of Twente, Enschede, The Netherlands Position number: 1092/93/189 The Tele-Informatics and Open Systems (TIOS) group is a multidisciplinary group of the Departments of Computer Science and Electrical Engineering. The research and teaching of this group is directed towards various aspects of the design, implementation and analysis of open distributed systems, and on methods and techniques for developing telematics and telecommunication systems. The research is done in multidisciplinary projects which are, to a large extent, internationally oriented. Your tasks: The research tasks concern the development of architecture design and implementation methods and techniques for (open) distributed systems within the discipline group on architecture design and implementation methods. Such distributed systems can vary from simple protocols to complex telematics applications, such as Hospital Information Systems and Mobile Networks. You will have the opportunity to co-operate with other researchers in the areas of formal methods, design tools, application protocol systems, communication systems, transmission systems and operational aspects. The teaching tasks are related to the research tasks and concern the responsibility for under-graduate and post-graduate courses, as well as the supervision of Master and PhD students. You will participate in the management tasks of the group, which includes the initiation and submission of project proposals for (inter)national projects, and the participation in management committees of the Department of Computer Science. What is required and offered: We expect you to have knowledge in, and experience with, systematic design methods for (open) distributed systems, and software and hardware environments in which these systems are implemented. In case you are active in another but related area, and wish to switch your interest to the area of open distributed systems design, you are also invited to apply to this position. You have a PhD degree and have a substantial publication list. You are capable of functioning in (international) multidisciplinary research projects, where you give guidance and leadership to fellow researchers, undergraduates and PhD students. You possess lecturing skills as a prerequisite for high quality teaching. [The salary ranges, depending on the age and experience of the candidate, from 6.879,- to 9.282,- Dutch guilders per month.] Information More information can be obtained by contacting: Prof.dr.ir. C.A. Vissers phone: + 31 53 893675 fax: 31 53 333815 e-mail: vissers@cs.utwente.nl Applications Written applications should be sent, together with a recent curriculum vitae, to the following address: University of Twente t.a.v. drs. F.J. van der Avert Director of the Department of Computer Science PO Box 217 7500 AE Enschede the Netherlands Please mention the position number in your letter. -------- From fritsv@cwi.nl Mon Jun 6 14:42:53 1994 Return-Path: Received: from charon.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA06051; Mon, 06 Jun 94 06:43:28 EDT Received: from specht.cwi.nl by charon.cwi.nl with SMTP id ; Mon, 6 Jun 1994 12:42:54 +0200 Received: by specht.cwi.nl id AA25346 (5.65b/3.8/CWI-Amsterdam); Mon, 6 Jun 1994 12:42:53 +0200 Date: Mon, 6 Jun 1994 12:42:53 +0200 Message-Id: <9406061042.AA25346=fritsv@specht.cwi.nl> To: concurrency@cwi.nl Subject: Nordic Workshop on Program Correctness 94 From: Kim Guldstrand Larsen First Announcement and Call for Participation 6th NORDIC WORKSHOP ON PROGRAMMING THEORY Aarhus, Denmark, 17-19 October 1994 The objective of the workshop is to bring together researchers from the Nordic and Baltic countries interested in programming theory, in order to improve mutual contacts and cooperation. Typical topics of the workshop include (but are not limited to): - Semantics of programs - Programming logics - Program verification - Formal specification of programs - Program synthesis - Program transformation and program refinement - Modeling of concu