From Frits.Vaandrager@cs.kun.nl Tue Feb 6 20:49:41 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA03819; Tue, 06 Feb 96 13:49:58 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Tue, 6 Feb 1996 19:49:42 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id TAA20753 (8.6.10/2.2); Tue, 6 Feb 1996 19:49:41 +0100 Received: by daphnis.cs.kun.nl id TAA07344 (8.6.10/2.1); Tue, 6 Feb 1996 19:49:41 +0100 Date: Tue, 6 Feb 1996 19:49:41 +0100 Message-Id: <199602061849.TAA07344@daphnis.cs.kun.nl> To: concurrency@@cwi.nl Subject: Lectureship in Computer Science From: "Roy L. Crole" LEICESTER UNIVERSITY, UK DEPARTMENT OF MATHEMATICS & COMPUTER SCIENCE Lectureship in Computer Science Applications are invited for a Lectureship in Computer Science in the Department of Mathematics and Computer Science. This post is tenable from 1 October 1996 or as soon as possible thereafter. The Department of Mathematics and Computer Science is divided into four groups: Pure Mathematics, Applied Mathematics, Computer Science and Statistics. The Computer Science Group has recently appointed three new lecturers, and will consist of nine members of staff when Iain A. Stewart takes up his appointment as Professor of Computer Science in March 1996. This lectureship is intended to strengthen the group with regard to both teaching and research. The group aims to expand even further in the near future. The Computer Science Group is firmly research oriented and current research interests include: artificial intelligence and expert systems; categorical logic; complexity theory; concurrency theory; fault-tolerant, real-time and dependable systems; finite model theory; formal languages and automata theory; formal methods for software development and programming language design; information systems; software engineering; type theory. The successful applicant will be ambitious, able to develop their own research within a multi-faceted environment, and have a strong research record and potential. There is no restriction regarding the area of research, and applicants with expertise in any area of Computer Science, and not just those listed above, are welcomed. The new lecturer will be required to teach at undergraduate and postgraduate level, and to perform administrative duties as directed by the Head of Department. There will be ample scope for a person of energy, drive and ambition to assume a rewarding role in a young and dynamic department. Initial salary, dependent upon qualifications and experience, will be on the Lecturer Grade A scale 15,154 to 19,848 p.a. Candidates who are interested in the lectureship are invited, if they so wish, to contact Professor Iain Stewart (telephone +44 (0)1792 295397, e-mail i.a.stewart@swansea.ac.uk) or Dr Rick Thomas (telephone +44 (0)116 252 3411, email rmt@mcs.le.ac.uk), who would be pleased to discuss the lectureship further. Information is also available on the WWW [http://www.mcs.le.ac.uk]. Further particulars and application forms are available from the Personnel and Planning Office (Academic Appointments), University of Leicester, University Road, LEICESTER, LE1 7RH, United Kingdom. Telephone +44 (0)116 252 2758. The closing date for applications is 29th March 1996. Please quote reference A5058. From Frits.Vaandrager@cs.kun.nl Wed Feb 7 10:45:52 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA17033; Wed, 07 Feb 96 03:46:39 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Wed, 7 Feb 1996 09:45:55 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id JAA01062 (8.6.10/2.2); Wed, 7 Feb 1996 09:45:53 +0100 Received: by daphnis.cs.kun.nl id JAA08248 (8.6.10/2.1); Wed, 7 Feb 1996 09:45:52 +0100 Date: Wed, 7 Feb 1996 09:45:52 +0100 Message-Id: <199602070845.JAA08248@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: CFP: ESSLI96 Workshop on LP systems From: Vitor Santos Costa I am sending this to several mailing lists. Please apologise if you receive several messages. Call for Papers Workshop on High Performance Logic Programming Systems European Summer School on Logic, Language, and Information Prague, Czech Republic August, 1996 The 1996 section on Computation of the European Summer School on Logic Language and Information will include a workshop on the implementation of Logic Programming Systems. ESSLI'96 main focus will be the interface between logic, linguistics, and computation, particularly where it concerns the modelling of human linguistic and cognitive abilities. As such, the programme includes courses, workshops and symposia covering a variety of topics within six areas of interest: Logic, Language, Computation, Logic and Computation, Computation and Language, and Language and Logic. Workshops will provide an opportunity for PhD students and other young researchers to present their work and gain informed feedback and useful contacts. The ESSLI'96 workshop on High Performance Logic Programming Systems will be a broad forum on the current research on the sequential and parallel implementation of the languages based on the logic programming paradigm. In more detail, the areas of interest to the workshop will be: o techniques for the fast execution of logic programs, including native code execution o support for extensions to traditional logic programming, such as constraints, or concurrency. o compilation technology, including global analysis of logic programs, for instance, based on abstract interpretation. o implementation of parallelism in logic programming, both implicit and explicit. o performance evaluation of logic programs, not only based on toy applications, but also based on actual applications. The workshop will particularly welcome practical evaluation of the new advances in logic programming implementation, and especially applications to the area of Computational Linguistics. The workshop is part of the section on Computation that also includes an introductory course by P. Cousot on Abstract Interpretation, advanced courses by P. Van Roy on the "High Performance Implementation of Logic Programming Systems", by Alan Mycroft on "Static Analysis and Functional Languages", by Manuel Hermenegildo on "Static Analysis of Constraint Systems", by Faron Moller on "Algorithms for Equivalence and Model Checking", and a Symposium on "Concurrent Systems" organised by Seif Haridi. ESSLI'96 will take place in Prague, Czech Republic, from August 12 until August 23. Authors willing to present their work are invited to submit an extended abstract, or preferably a full paper, to the workshop organizers by May 1, 1996. Authors will be notified of the acceptance or rejection of their papers by June 1, 1996. Final versions of accepted papers are due on July 1, 1995. Electronic submission of the LaTeX document and related postscript figures is strongly encouraged. The workshop organisation plans to make the accepted papers and the workshop proceedings available on the WWW. Authors using LaTeX are encouraged to use the llncs.sty style file and any postscript figures that appear in the text should be imported using the epsf.sty style file. Hopefully, this will enable the organisation to produce a coherently formatted proceedings. Relevant Info: Submission deadline: 15th May. Notification of authors: 15th June Electronic submissions: vitor@cos.ufrj.br, vsc@ncc.up.pt Address for mail submissions: V\'{\i}tor Santos Costa Visiting Researcher COPPE/Sistemas Centro de Tecnologia, Bloco H-319 Universidade federal do Rio de Janeiro Cidade Universit\'aria, Ilha do Fund\~ao C.P.: 68511 Rio de Janeiro Brasil Tel. +55-21-5902552 Fax. +55-21-5902552 Web Page for the Workshop: http://www.cos.ufrj.br/vitor/ Web Page for ILSS: http://ufal.ms.mff.cuni.cz/ -------------------------------------------------------------------------- This announcement has been posted at several lists. Our apologies if you receive this announcement more than once. -------------------------------------------------------------------------- *** Please Distribute Among Your Colleagues *** ANNOUNCEMENT OF the Eighth European Summer School in Logic, Language, and Information ESSLLI'96 to be held in Prague, Czech Republic from August 12 until August 23, 1996 Organized under auspices of FoLLI, the European Association for Logic, Language and Information URL: http://ufal.ms.mff.cuni.cz INTRODUCTION After summerschools in Groningen (1989), Saarbruecken (1990), Leuven (1991), Colchester (1992), Lisbon (1993), Copenhagen (1994), and Barcelona (1995), the eighth European Summer School in Logic, Language, and Information will be held in Prague, Czech Republic, from August 12 until August 23, 1996. Alike the other summerschools, the main focus will be the intersection of the areas of between logic, linguistics, and computation, particularly where it concerns the modelling of human linguistic and cognitive abilities. As such, the programme includes courses, workshops and symposia covering a variety of topics within six areas of interest: Logic, Language, Computation, Logic & Computation, Computation & Language, and Language & Logic. Courses are cast at both introductory and advanced levels. Introductory courses are designed to familiarize students with new fields and do not presuppose any background knowledge, while advanced courses are designed to allow participants to acquire more specialized expertise in areas they are already familiar with. Workshops are chaired by an expert in the field and will provide an opportunity for PhD students and other young researchers to present their work and gain informed feedback and useful contacts. Symposia will typically consist of a series of presentations on a timely topic by people active in the relevant areas. Both workshops and symposia are intended to encourage collaboration and cross-fertilization of ideas by stimulating in-depth discussion of issues which are in the forefront of current research in the field. Besides courses, workshops and symposia, there will also be evening lecturers, in which highly actual topics in research in Logic, Language and Information will be addressed. A novelty at ESSLLI'96 is the student session. Students are encouraged to submit short papers describing WORK IN PROGRESS on topics in the areas covered by the summer school. See section 2 for more information on the student session. Below, more detailed information is given about: 1. The programme of ESSLLI'96, given for each of the six areas pointed out above; 2. The ESSLLI'96 Student Session 3. Local information: ESSLLI'96 site, accommodation, social events; 4. "For More Information": The ESSLLI'96-WebSite, local organization committee. Also, more information can be found at the ESSLLI'96 Website, http://ufal.ms.mff.cuni.cz The Local Organization Committee hopes to welcome you at ESSLLI'96 in Prague, in August this year! ========================================================================================= 1. The Programme of ESSLLI'96 The programme of ESSLLI'96 is presented here for each of the areas or 'sections', providing for each the courses, workshop(s) and symposium, together with lecturers (courses) respectively organizers (workshops, symposia). Note that this information can also be obtained from the ESSLLI'96 Website (http://ufal.ms.mff.cuni.cz), together with more detailed information as abstracts, a preliminary schedule, and addresses of teachers. * SECTION LOGIC - Introductory Course: D. de Jongh (Amsterdam), A. Visser (Utrecht): Intuitionistic Logic - Advanced Courses: J. Krajicek (Prague): Classical Propositional Logic and Its Complexity S. Gottwald (Leipzig): Many Valued and Fuzzy Logics J. van den Does (Utrecht), D. Westerstahl (Stockholm): Quantification Logic V. de Paiva (Cambridge): Categorial Proof Theory and Linear Logic - Workshop: Philippe Smets (Bruxelles): Quantitative and Symbolic Approaches to Uncertainty - Symposium: Matthias Baaz (Vienna): Proof Theory and Computational Aspects of Many-Valued Logics * SECTION Language - Introductory Courses: Eva HajicovA, Vladimor Petkevic, Petr Sgall (Prague): Dependency Grammar: Linguistic Motivation and Formal Specification - Advanced Courses: Regine Eckhardt (Tuebingen): What Do Events Look Like, and What Are They Good for? Jean Lowenstamm (Paris): The Syntax of Phonological Expressions Klaus Netter (Saarbruecken): Unification Grammars Igor Mel'cuk (Montreal): Morphology and Meaning - Workshop: Anne Abeille (Paris) and Paola Monachesi (Tilburg): Surface-Based Syntax and Romance Languages - Symposium: Ivan Sag (Stanford): Syntax and Semantics of Coordination * SECTION Computation - Introductory Courses: Patrick Cousot (Paris): Abstract Interpretation - Advanced Courses: P. Van Roy (Saarbruecken): High Performance Implementation of Logic Programming Systems Alan Mycroft (Cambridge): Static Analysis and Functional Languages Manuel Hermenegildo (Madrid): Static Analysis of Constraint Systems Faron Moller (Sweden): Algorithms for Equivalence and Model Checking - Workshop: V. Santos Costa (Porto): High Performance Logic Programming Systems - Symposium: Seif Haridi (SICS Sweden): Concurrent Systems * SECTION Logic & Computation - Introductory Courses: Antonia Huertas and Maria Manzano (Barcelona): Extensions of First Order Logic Rajeev GorO (Australian National University): Tableau Methods for Modal and Temporal Logics - Advanced Courses: Thorsten Altenkirch (Edingburgh):Integrated Verification in Type Theory Johan van Benthem (Amsterdam): Dynamic Logic and Information Flow Wiebe van der Hoek and Cees Witteveen (Utrecht): Principles of Nonmonotonic Reasoning David Basin and Sean Matthews (Saarbruecken): Logical Frameworks and Philosophical Logics Peter Gardenfors (Lund): Conceptual Spaces and Cognitive Semantics - Workshop: Maarten de Rijke (Warwick): Observational Equivalence and Logical Equivalence - Symposium: Hans van Ditmarsch (Groningen): Logic, Education and Computation * SECTION Computation & Language - Introductory Courses: Gerald Gazdar (Sussex): Introduction to Natural Language Processing Mats Rooth (Stuttgart): Statistical Techniques for NLP - Advanced Courses: Julie Carson-Berndsen and Dafydd Gibbon (Bielefeld): The Logic of Speech Recognition Ann Copestake (Stanford) and Alex Lascarides (Edinburgh): Integrating the Lexicon and Pragmatics Richard Crouch (Cambridge) and Massimo Poesio (Edinburgh): Discourse Interpretation with Underspecified Representations James Pustejovsky and Michael Johnston (Brandeis): Generative Lexicon Theory and The Computational Lexicon K. Vijay-Shanker (Delaware) and David Weir (Sussex): Formal and Computational Aspects of Tree Adjoining Grammars and Related Constrained Grammar Formalisms - Workshops: Walter Daelemans (with Ted Briscoe): Machine Learning of Natural Language John Carroll (with Ted Briscoe): Robust Parsing - Symposium: Antonion Sanfilippo (England): Current Issues in Lexicalist MT * SECTION Language & Logic - Introductory Courses: Paul King (Tuebingen): From Unification to Constraint: An Evolving Formalism for Head-driven Phrase Structure Grammar Werner Saurer (Saarbruecken): Representation and Inference in DRT - Advanced Courses: Steven Abney and Fritz Hamm (Tuebingen): Syntax and Semantics of Nominalization Jaap van der Does and Michiel van Lambalgen (Amsterdam): Substructural Quantification Pavel Materna (Prague): Transparent Intensional Logic -- a Fine Grained Analysis of Natural Language Jerry Seligman (Bloomington): Information Systems James Rogers (Pennsylvania): Topics in Model-Theoretic Syntax - Workshops: Uwe Moennich and Hans Peter Kolb (Tuebingen): The Mathematics of Syntactic Structure Barbara Partee (UMass) and Jaroslav Peregrin (Prague): Discourse Kinematics, Topic-Focus Structure, and Logics - Symposium: Ruth Kempson (London) and Wilfried Meyer-Viol: Dependency in Logic and Natural Language --------------------------------------------------------------------------------------- 2. A Novelty at ESSLLI'96: The Student Session A novelty at ESSLLI'96 is the student session. The purpose of the student session is to provide students with an opportunity to present their work in progress and get valuable feedback by senior researchers and "colleague-students". To that end, students are encouraged to submit papers of 4-5 pages (including references), describing work in progress (so as to benefit most from feedback). The areas of interest are essentially the areas of the summer school: Logic, Language, Computation, Logic & Language, Logic & Computation, and Language & Computation. Papers will be reviewed by a committee of students with expertize in the respective areas. The student session has been designated its own timeslot in the schedule of ESSLLI'96. Such basically means that there will be a 90-minutes student session EVERY DAY, in parallell with maximally five courses. Depending on the number and quality of submitted papers, either only in the first week or in both weeks. The session will not be a poster session! Students will be presenting their work in a 20+10 minutes talk. At the moment, we are in the process of putting together the Student Session Program Committee. The deadline for submissions will be the end of April. Electronic submissions are highly encouraged. Submission formats that will be accepted are PostScript (A4-pages), standard Tex/Latex, RTF, and plain text, or laser-quality hardcopies (3) sent to the secretariat. Please, inquire at the ESSLLI'96 WebSite or at the ESSLLI'96 secretariat for more information. Note that, in order to present a paper at the ESSLLI'96 Student Session, you have to register as a participant to ESSLLI'96. --------------------------------------------------------------- 3. Local Information on ESSLLI'96: ESSLLI'96 will be hosted by the Faculty of Electronical Engineering, Czech Technical University, in Dejvice, Prague. The site is easily accessible by all means of public transportation: Tram, metro, and bus are in 5-10 minutes walking distance, and will take you to virtually any place in the city. We arrange for accommodation in student dormitories conveniently located in the faculty's surroundings. All the dormitories are located in side streets, so the rooms are quiet. The neighbourhood is nice, without much local traffic. The dormitories provide double or single rooms and differ with respect to the rooms having their own bathroom or there being shared showers and toilets on each floor. More detailed descriptions can be found at the ESSLLI'96 WebSite. Prague is a city of wonders, as you will -undoubtly- have heard of, and you will have the possibility to explore our city during the summerschool. For those who would appreciate some assistance on their voyage of discovery we are organizing several guided tours in the evenings or during the weekend. Furthermore, there will of course be the ESSLLI-party, as well as a welcome-reception. ---------------------------------------------------------------------------------------- 3. The ESSLLI'96 WebSite, Local organization Detailed information about ESSLLI'96 is provided at the ESSLLI'96 Website. The site contains information about the programme (courses, lecturers, abstracts, schedule), registration, accommodation, the ESSLLI'96 site (local maps, travel information, etc.), the social programme, and all further information relevant to the summer school. Important information can be downloaded in the form of postscript-files. The Website allows for dynamically switching between the graphical and text-version of a page, and is updated every week, week and a half so as to provide always the most up-to-date information. The ESSLLI'96 Local Organization Committee is composed from people from - The Institute of Formal and Applied Linguistics, Department of Mathematics and Physics, Charles University, Prague. - The Institute of Theoretical and Computational Linguistics, Department of Philosophy, Charles University, Prague. - Department of Computers, Faculty of Electrical Engineering, Czech Technical University, Prague; - FoLLI, the European Association for Logic, Language and Information. The committee can be reached at the ESSLLI'96-secretariat: - Normal Mail: ESSLLI'96, UFAL MFF UK, Malostranske nam. 25, 118 00 Praha 1, Czech Republic - Telephone: ++42-2-245.10.286 (ask our operator for "linguistics") - Fax: ++42-2-53.27.42 - EMail: esslli@ufal.mff.cuni.cz - WWW: http://ufal.ms.mff.cuni.cz/ From Frits.Vaandrager@cs.kun.nl Thu Feb 8 20:17:57 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA18459; Thu, 08 Feb 96 13:18:37 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Thu, 8 Feb 1996 19:17:59 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id TAA03762 (8.6.10/2.2); Thu, 8 Feb 1996 19:17:58 +0100 Received: by daphnis.cs.kun.nl id TAA10739 (8.6.10/2.1); Thu, 8 Feb 1996 19:17:57 +0100 Date: Thu, 8 Feb 1996 19:17:57 +0100 Message-Id: <199602081817.TAA10739@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Dutch Specification Day (announcement) From: Rom Langerak Hereby you are cordially invited to attend the Dutch Specification Day to be held on Thursday 21 March at the University of Twente, Enschede. Below you find the preliminary program; please accept our apologies if you receive multiple copies of this announcement. ---------------------------------------------------------------------------- THIRD DUTCH SPECIFICATION DAY 21 March 1996, University of Twente ---------------------------------------------------------------------------- This event will be organised for the third time; the first Specification Day was held on 25 June 1993 (TUE/KUB), the second on 19 October 1994 (TUE). The theme of these days is formal specification in computer science. Both formal techniques and their application in practice are addressed. This initiative is supported by the research schools IPA (Institute for Programming science and Algorithmics) and SIKS (School for Information and Knowledge Systems), and the research institute CTIT (Centre for Telematics and Information Technology). The program features four presentations by invited speakers. Material relevant to the presentations will be handed out. The preliminary program: THURSDAY 21 MARCH ----------------- 10.00 - 10.30 Welcome, coffee 10.30 - 11.30 Leslie Lamport (DEC Research): Specifying Systems: Some Impious Platitudes 11.30 - 12.30 Muffy Thomas (University of Glasgow): Formal Specification and Analysis in Safety-Critical Systems 12.30 - 13.45 Lunch 13.45 - 15.45 J.R. Abrial: Formal construction of the architecture of a software system, a case study with B. 15.45 - 16.15 tea/coffee break 16.15 - 17.00 Speaker from Dutch industry (to be announced) ---------------- Place: University of Twente, Enschede: "Collegezalencomplex" CC4 (this will be indicated from the main entrance of the campus) Costs: fl 35,- to cover lunch, coffee breaks and handouts. To be paid cash at the beginning of the specification day. Registration : We kindly request you to register in advance by e-mail, before 11 March 1996, by sending the form below to the following e-mail address: langerak@cs.utwente.nl This is also the address to write to if you have any questions. Looking forward to welcoming you on 21 March, the organizers, Peter Apers Ed Brinksma ------------------------------------------------------------------ ------------------------------------------------------------------ THIRD DUTCH SPECIFICATION DAY 21 March 1996, University of Twente *** Registration Form *** Name: Affiliation: e-mail address: Please specify dietary restrictions for lunch, if any: ------------------------------------------------------------------- From Frits.Vaandrager@cs.kun.nl Mon Feb 12 11:30:18 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA19939; Mon, 12 Feb 96 04:31:27 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 12 Feb 1996 10:30:21 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id KAA19635 (8.6.10/2.2); Mon, 12 Feb 1996 10:30:18 +0100 Received: by daphnis.cs.kun.nl id KAA17041 (8.6.10/2.1); Mon, 12 Feb 1996 10:30:18 +0100 Date: Mon, 12 Feb 1996 10:30:18 +0100 Message-Id: <199602120930.KAA17041@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Call for Papers : FSTTCS 1996(TeX version) From: "Foundations of Software Tech. and Theor.Comp.Sci" % %FSTTCS-16, Call for Papers, LaTeX Version % \documentstyle[titlepage]{article} % \oddsidemargin 6pt \evensidemargin 6pt \marginparwidth 90pt \marginparsep 10pt \topmargin -33pt \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} \begin{titlepage} % % 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\bf Call for Papers} \end{center} \begin{center} {\large \it Sixteenth 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 18--20, 1996, Hyderabad, India} \end{center} \end{minipage} \bigskip %================================================================= % The committees go in a parbox on the left %================================================================= \parbox[t]{5.5cm}{ \noindent {\bf Programme Committee:} \medskip \begin{tabular}{l} V. Arvind (IMSc, Madras)\\ V. Chandru \\ \hspace*{5mm}(IISc, Bangalore) {\bf (Chair)}\\ S. Chaudhuri (MPI, Saarbr\"{u}cken)\\ S-W. Cheng (HKUST, Hongkong)\\ T.K. Dey (IIT, Kharagpur)\\ H. Edelsbrunner \\ \hspace*{5mm}(UIUC, Urbana-Champaign)\\ J.J.M. Hooman \\ \hspace*{5mm}(EindhovenU, Eindhoven)\\ P. Jalote (IIT, Kanpur)\\ S. Kannan (UPenn, Philadelphia)\\ D. Kapur (SUNY, Albany)\\ M. Nielsen (BRICS, Aarhus)\\ S. Prasad (IIT, Delhi)\\ A.K. Pujari (UHyd, Hyderabad)\\ V. Raman (IMSc, Madras)\\ R.K. Shyamasundar \\ \hspace*{5mm}(TIFR, Bombay)\\ G. Sivakumar (IIT, Bombay)\\ M. Sohoni (IIT, Bombay)\\ P.S. Thiagarajan \\ \hspace*{5mm}(SPIC Sci.\ Found., Madras)\\ H. Venkateswaran\\ \hspace*{5mm}(GaTech, Atlanta)\\ V. Vinay (IISc, Bangalore) \end{tabular} \vspace*{5cm} \noindent {\bf Local Arrangements:} \medskip Arun K, Pujari ({\bf Chair})\\ Computer \& Information Sciences\\ University of Hyderabad\\ Hyderabad 500~046, India\\ {\sf akpcs@uohyd.ernet.in}\\ Fax: +91--40--258125/258145 } %\end{parbox} % %================================================================= % Vertical line goes in a parbox after the committees %================================================================= % \parbox[t]{5mm}{ \rule[-21cm]{0.2mm}{21.5cm} } %\end{parbox} % %================================================================= % Conference information goes in a minipage to the right of the line %================================================================= % \begin{minipage}[t]{12.7cm} The 16th Annual FST \& TCS Conference will take place in Hyderabad. This year's conference is being organized by the University of Hyderabad. \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; Finite Model Theory; Logical Aspects of Computational Complexity (including Proof Theoretic Approaches and Complexity of Formal Proof Systems); Constructive Mathematics; Linear Logic; 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. Electronic submissions will be possible and detailed instructions will be posted on the conference homepage on WWW shortly. However, as this electronic submission facility is being tried for the first time, we strongly encourage authors to also submit at least one hard copy. Papers should be limited to 4500 words (about 12 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 referee. 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 1996} \> \\ Notification to Authors \> : \> \parbox{4cm}{\hspace*{\fill} 1 August 1996} \> \\ Final Version of Accepted Papers due on \> : \> \parbox{4cm}{\hspace*{\fill} 8 September 1996} \> \end{tabbing} \smallskip \noindent {\bf Address:} Send papers to: \begin{tabbing} XX \= Computer Science \& Automation \hspace{5mm} \= E-mail \= : \= \+ \kill Vijay Chandru \> E-mail \> : \> {\sf chandru@csa.iisc.ernet.in}\\ FST \& TCS 15 \> \> \> {\sf fsttcs@csa.iisc.ernet.in}\\ Computer Science \& Automation \> Fax \> : \> +91--80--334 1683\\ Indian Institute of Science \> \> \> \\ Bangalore 560 012, INDIA \> \> \> \end{tabbing} \smallskip For Electronic Submissions: \begin{tabular}{l} {\sf http://www.csa.iisc.ernet.in/fsttcs.html} \end{tabular} \end{minipage} \end{titlepage} \end{document} From Frits.Vaandrager@cs.kun.nl Mon Feb 12 13:05:34 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA20469; Mon, 12 Feb 96 06:06:19 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 12 Feb 1996 12:05:37 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id MAA24854 (8.6.10/2.2); Mon, 12 Feb 1996 12:05:35 +0100 Received: by daphnis.cs.kun.nl id MAA17185 (8.6.10/2.1); Mon, 12 Feb 1996 12:05:34 +0100 Date: Mon, 12 Feb 1996 12:05:34 +0100 Message-Id: <199602121105.MAA17185@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: ACTORS From: Here there are the results of my query about process algebras semantics for ACTORS. Gianna Reggio ***** Actors as a Coordination Model of Computation N. Raja - R.K.Shyamasundar (technical report??) 1995 email raja@tifrvax.res.in (the POLYADIC PI-CALCULUS is used to to provide a semantic foundation for ACTORS ) Towards an Algebra of Actors Mauro Gaspari Technical report University of Bologna 1995 email gaspari@cs.unibio.it Agha G. - Mason I.A. - Smith S. - Talcott C. Towards a theory of Actor computation Concur 93 LNCS n. 715 1993 Full version in Journal of Functional programming, 1993 Talcott C. Interaction Semantics for Components of Distributed Systems 1995 to be presented at FMOODS96 email clt@sail.standford.edu =================================================================== Gianna Reggio Dipartimento di Informatica e Scienze dell'Informazione Universita' di Genova Via Dodecaneso 35 - 16146 Genova (Italy) Phone: +39-10 3536702 Fax: +39-10 3536699 email: reggio @ disi.unige.it From Frits.Vaandrager@cs.kun.nl Mon Feb 12 11:30:18 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA29655; Mon, 12 Feb 96 15:10:52 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 12 Feb 1996 10:30:21 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id KAA19635 (8.6.10/2.2); Mon, 12 Feb 1996 10:30:18 +0100 Received: by daphnis.cs.kun.nl id KAA17041 (8.6.10/2.1); Mon, 12 Feb 1996 10:30:18 +0100 Date: Mon, 12 Feb 1996 10:30:18 +0100 Message-Id: <199602120930.KAA17041@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Call for Papers : FSTTCS 1996(TeX version) From: "Foundations of Software Tech. and Theor.Comp.Sci" % %FSTTCS-16, Call for Papers, LaTeX Version % \documentstyle[titlepage]{article} % \oddsidemargin 6pt \evensidemargin 6pt \marginparwidth 90pt \marginparsep 10pt \topmargin -33pt \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} \begin{titlepage} % % 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\bf Call for Papers} \end{center} \begin{center} {\large \it Sixteenth 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 18--20, 1996, Hyderabad, India} \end{center} \end{minipage} \bigskip %================================================================= % The committees go in a parbox on the left %================================================================= \parbox[t]{5.5cm}{ \noindent {\bf Programme Committee:} \medskip \begin{tabular}{l} V. Arvind (IMSc, Madras)\\ V. Chandru \\ \hspace*{5mm}(IISc, Bangalore) {\bf (Chair)}\\ S. Chaudhuri (MPI, Saarbr\"{u}cken)\\ S-W. Cheng (HKUST, Hongkong)\\ T.K. Dey (IIT, Kharagpur)\\ H. Edelsbrunner \\ \hspace*{5mm}(UIUC, Urbana-Champaign)\\ J.J.M. Hooman \\ \hspace*{5mm}(EindhovenU, Eindhoven)\\ P. Jalote (IIT, Kanpur)\\ S. Kannan (UPenn, Philadelphia)\\ D. Kapur (SUNY, Albany)\\ M. Nielsen (BRICS, Aarhus)\\ S. Prasad (IIT, Delhi)\\ A.K. Pujari (UHyd, Hyderabad)\\ V. Raman (IMSc, Madras)\\ R.K. Shyamasundar \\ \hspace*{5mm}(TIFR, Bombay)\\ G. Sivakumar (IIT, Bombay)\\ M. Sohoni (IIT, Bombay)\\ P.S. Thiagarajan \\ \hspace*{5mm}(SPIC Sci.\ Found., Madras)\\ H. Venkateswaran\\ \hspace*{5mm}(GaTech, Atlanta)\\ V. Vinay (IISc, Bangalore) \end{tabular} \vspace*{5cm} \noindent {\bf Local Arrangements:} \medskip Arun K, Pujari ({\bf Chair})\\ Computer \& Information Sciences\\ University of Hyderabad\\ Hyderabad 500~046, India\\ {\sf akpcs@uohyd.ernet.in}\\ Fax: +91--40--258125/258145 } %\end{parbox} % %================================================================= % Vertical line goes in a parbox after the committees %================================================================= % \parbox[t]{5mm}{ \rule[-21cm]{0.2mm}{21.5cm} } %\end{parbox} % %================================================================= % Conference information goes in a minipage to the right of the line %================================================================= % \begin{minipage}[t]{12.7cm} The 16th Annual FST \& TCS Conference will take place in Hyderabad. This year's conference is being organized by the University of Hyderabad. \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; Finite Model Theory; Logical Aspects of Computational Complexity (including Proof Theoretic Approaches and Complexity of Formal Proof Systems); Constructive Mathematics; Linear Logic; 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. Electronic submissions will be possible and detailed instructions will be posted on the conference homepage on WWW shortly. However, as this electronic submission facility is being tried for the first time, we strongly encourage authors to also submit at least one hard copy. Papers should be limited to 4500 words (about 12 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 referee. 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 1996} \> \\ Notification to Authors \> : \> \parbox{4cm}{\hspace*{\fill} 1 August 1996} \> \\ Final Version of Accepted Papers due on \> : \> \parbox{4cm}{\hspace*{\fill} 8 September 1996} \> \end{tabbing} \smallskip \noindent {\bf Address:} Send papers to: \begin{tabbing} XX \= Computer Science \& Automation \hspace{5mm} \= E-mail \= : \= \+ \kill Vijay Chandru \> E-mail \> : \> {\sf chandru@csa.iisc.ernet.in}\\ FST \& TCS 15 \> \> \> {\sf fsttcs@csa.iisc.ernet.in}\\ Computer Science \& Automation \> Fax \> : \> +91--80--334 1683\\ Indian Institute of Science \> \> \> \\ Bangalore 560 012, INDIA \> \> \> \end{tabbing} \smallskip For Electronic Submissions: \begin{tabular}{l} {\sf http://www.csa.iisc.ernet.in/fsttcs.html} \end{tabular} \end{minipage} \end{titlepage} \end{document} From Frits.Vaandrager@cs.kun.nl Mon Feb 12 13:05:34 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA29653; Mon, 12 Feb 96 15:10:50 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 12 Feb 1996 12:05:37 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id MAA24854 (8.6.10/2.2); Mon, 12 Feb 1996 12:05:35 +0100 Received: by daphnis.cs.kun.nl id MAA17185 (8.6.10/2.1); Mon, 12 Feb 1996 12:05:34 +0100 Date: Mon, 12 Feb 1996 12:05:34 +0100 Message-Id: <199602121105.MAA17185@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: ACTORS From: Here there are the results of my query about process algebras semantics for ACTORS. Gianna Reggio ***** Actors as a Coordination Model of Computation N. Raja - R.K.Shyamasundar (technical report??) 1995 email raja@tifrvax.res.in (the POLYADIC PI-CALCULUS is used to to provide a semantic foundation for ACTORS ) Towards an Algebra of Actors Mauro Gaspari Technical report University of Bologna 1995 email gaspari@cs.unibio.it Agha G. - Mason I.A. - Smith S. - Talcott C. Towards a theory of Actor computation Concur 93 LNCS n. 715 1993 Full version in Journal of Functional programming, 1993 Talcott C. Interaction Semantics for Components of Distributed Systems 1995 to be presented at FMOODS96 email clt@sail.standford.edu =================================================================== Gianna Reggio Dipartimento di Informatica e Scienze dell'Informazione Universita' di Genova Via Dodecaneso 35 - 16146 Genova (Italy) Phone: +39-10 3536702 Fax: +39-10 3536699 email: reggio @ disi.unige.it From Frits.Vaandrager@cs.kun.nl Tue Feb 13 01:01:10 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA03957; Mon, 12 Feb 96 18:01:53 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Tue, 13 Feb 1996 00:01:12 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id AAA19498 (8.6.10/2.2); Tue, 13 Feb 1996 00:01:11 +0100 Received: by daphnis.cs.kun.nl id AAA18233 (8.6.10/2.1); Tue, 13 Feb 1996 00:01:10 +0100 Date: Tue, 13 Feb 1996 00:01:10 +0100 Message-Id: <199602122301.AAA18233@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: CfParticipation FroCoS'96 From: Stephan Kepser Call for Participation First International Workshop ``Frontiers of Combining Systems'' FroCoS'96 March 26-29, 1996, Munich, Germany. Information and Program in the WWW: http://www-lti.informatik.rwth-aachen.de/~stephan/frocos96.html (http://www.cis.uni-muenchen.de/hot/frocos96.html) In order to simplify our organisation we would kindly ask you to register no later than 11.03.1996. In various areas of logic, computation, language processing, and artificial intelligence there is an obvious need for using specialized formalisms and inference mechanisms for special tasks. In order to be usable in practice, these specialized systems must be combined with each other, and they must be integrated into general purpose systems. The development of general techniques for the combination and integration of special systems has been initiated in many areas, and the Workshop ``Frontiers of Combining Systems'' intends to offer a common forum for these research activities. Furthermore, it gives the possibility to present results on particular instances of combination and integration, and on their practical use. Topics of the workshop are: * combination of logics (e.g., modal logics, logics in AI, ...) * combination of constraint solving techniques (unification and matching algorithms, general symbolic constraints, numerical constraints, ...) and combination of decision procedures * integration of equational and other theories into deductive systems (e.g. theory resolution, constraint resolution, constraint paramodulation, ...) * combination of term rewriting systems * integration of data structures (e.g., sets, multisets, lists) into CLP formalisms and deduction processes * hybrid systems in computational linguistics, knowledge representation, natural language semantics, and human computer interaction * logic modelling of multi-agent systems. Invited Speakers: B. Buchberger, A. Colmerauer, D. Gabbay, U. Glaesser, M. Stickel Program Committee: F. Baader, P. Baumgartner, P. Blackburn, A. Bockmayr, A. Boudet, J. Calmet, A. Colmerauer, D.M. Gabbay, H. Kirchner, H.J. Ohlbach, J. Pfalzgraf, M. de Rijke, W. Rounds, M. Schmidt-Schauss, K.U. Schulz. Program Chair: F. Baader & K.U. Schulz. Local Organization: K.U. Schulz, CIS, University of Munich, Wagmuellerstr. 23, D-80538 Muenchen, Germany E-mail: schulz@thecube.cis.uni-muenchen.de From Frits.Vaandrager@cs.kun.nl Tue Feb 13 01:02:24 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA03986; Mon, 12 Feb 96 18:03:10 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Tue, 13 Feb 1996 00:02:26 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id AAA19559 (8.6.10/2.2); Tue, 13 Feb 1996 00:02:25 +0100 Received: by daphnis.cs.kun.nl id AAA18239 (8.6.10/2.1); Tue, 13 Feb 1996 00:02:24 +0100 Date: Tue, 13 Feb 1996 00:02:24 +0100 Message-Id: <199602122302.AAA18239@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: FOOL Workshop call for papers From: kim@bull.cs.williams.edu (Kim Bruce) Call for Papers The Third International Workshop on Foundations of Object-Oriented Languages FOOL 3 July 24-25, 1996 New Brunswick, New Jersey Held in conjunction with LICS '96 and the Federated Logic Conference While object-oriented programming languages have swept the programming community over the last decade, it has taken longer for the language theory community to develop sound theoretical foundations for these languages. However, work over the last several years has provided a better understanding of the key concepts of object-oriented languages, and has led to important developments in the type theory, semantics, and verification of object-oriented languages. This workshop is designed to bring together researchers to share new ideas and results. The first two workshops in this series were sponsored jointly by the NSF and ESPRIT. They were open by invitation only, with the first held in association with the American Types Jumelage in October, 1993, at Stanford University, and the second held in association with LICS '94 in Paris. A report on the first two meetings appeared in ACM SIGPLAN Notices, March, 1994, pp. 3-11 and February, 1995, pp. 5-11. Both are also available through the FOOL home page at http://www.cs.williams.edu/~kim/FOOL. FOOL 3 will be held immediately before LICS '96 and the Federated Logic Conference in New Brunswick, New Jersey. The workshop will be held at the Hyatt-Regency Hotel in New Brunswick. Unlike the first two workshops, this workshop will be open, and submissions are invited in the general area of theoretical foundations of object-oriented languages. The range of topics includes semantics, calculi, type theory, and program verification of object-oriented languages. We also welcome contributions on foundational issues related to concurrent and distributed object-oriented languages. Program Committee: Kim Bruce, Williams College (Chair) Luca Cardelli, DEC-SRC Giuseppe Castagna, CNRS & Ecole Normale Superieure Cliff Jones, Manchester University Giuseppe Longo, CNRS & Ecole Normale Superieure John Mitchell, Stanford University Benjamin Pierce, Cambridge University Didier Remy, INRIA Local Arrangements: Jon Riecke, Bell Laboratories Submissions: We solicit submissions on original research not published or accepted for publication elsewhere. Extended abstracts not to exceed 2500 words (approximately 5 pages) should be submitted to the program chair by Monday, April 1, 1996. We prefer to receive electronic copies of the submissions. Electronic copies in postscript and formatted for US letter size paper should be e-mailed to fool-submit@cs.williams.edu. If electronic submission is impossible, 9 copies of the abstract should be mailed to: Prof. Kim Bruce FOOL Workshop Department of Computer Science 200 Bronfman Science Center Williams College Williamstown, MA 01267 USA All submissions must be received by midnight on April 1, 1996. (Please do not submit papers before March 1 as the proper software will not be installed until then.) The cover page should include a return postal address and an electronic mail address (if possible). Authors will be notified of acceptance of their paper by May 15, 1996. A world-wide web page will be created and made available as an informal electronic conference proceedings. An eventual journal issue devoted to selected papers, following the usual journal refereeing process, is under discussion. Since the main focus in selecting workshop contributions will be the intrinsic interest and timeliness of the work, authors are encouraged to submit position papers and descriptions of work in progress as well as finished papers. Final copies of accepted papers for the electronic proceedings will be due on June 21. Correspondence and questions should be sent to fool-info@cs.williams.edu or to the address above. Please do not send questions to fool-submit as mail to that account will be handled automatically by a script. From Frits.Vaandrager@cs.kun.nl Tue Feb 13 23:15:45 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA25766; Tue, 13 Feb 96 16:16:28 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Tue, 13 Feb 1996 22:15:47 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id WAA04928 (8.6.10/2.2); Tue, 13 Feb 1996 22:15:46 +0100 Received: by daphnis.cs.kun.nl id WAA19965 (8.6.10/2.1); Tue, 13 Feb 1996 22:15:45 +0100 Date: Tue, 13 Feb 1996 22:15:45 +0100 Message-Id: <199602132115.WAA19965@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Post-Doctoral Position at IRISA, France From: Jean-Pierre Talpin IRISA - Institut de Recherche en Informatique et Systemes Aleatoire Post-Doctoral Position in Distributed Real-Time Systems ----------------------- Applications are invited for a one-year post-doctorate position at IRISA starting on July 1st, 1996 or at a mutually agreeable date after. This position would be ideally suited to a candidate who wishes to build upon her or his record in a rather unique environment of collaborative fundamental and experimental research. The selected candidate will participate to a large-scale R&D colaborative project involving a major company in the area of telecommunication and several research groups at INRIA-Rennes (IRISA) and INRIA-Sophia Antipolis. Areas of interest include concurrency theory and applications, reactive systems, synchronous and asynchronous programming paradigms, object-oriented distributed systems, specification and verification of distributed systems with applications in the area of telecommunications. A demonstrated publishing record and the ability to actively participate in the experiments of a collaborative R&D environment are a significant advantage. Strong communication skills, both written and oral, are desirable. Research at IRISA spans a wide range of activities from the development of hardware components to the implementation of advanced applications. Parallelism is a key concept being studied in circuit and novel architecture design. The building of parallel or distributed systems hiding complex hardware resources and yet providing a simple view of the system for its users has produced original ideas in the field of fault tolerant multiprocessor systems. It is also necessary to provide the users of such machines with secure and powerful programming tools. IRISA is developing its research activities in the context of fast technological evolution and fierce international competition. The research undertaken by Irisa therefore has to be of the highest quality, and technology transfer of the results of that research to industry is very important. IRISA is located in Rennes, two hours away from Paris. Rennes is the capital of Britain, a beautiful region with plenty of character. For further information and to apply, prospective candidates are encouraged to contact: Paul Le Guernic Tel.: +33 99 84 72 42 E-mail: Paul.Leguernic@irisa.fr Jean-Pierre Talpin Tel.: +33 99 84 74 36 E-mail: Jean-Pierre.Talpin@irisa.fr Applications should be sent to Jean-Pierre Talpin IRISA/INRIA-Rennes Campus universitaire de Beaulieu 35042 Rennes Cedex France Phone: +33 99 84 74 36 Fax: +33 99 84 71 71 Additional information on IRISA is also available at: http://www.irisa.fr From Frits.Vaandrager@cs.kun.nl Tue Feb 13 23:16:45 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA25795; Tue, 13 Feb 96 16:17:20 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Tue, 13 Feb 1996 22:16:46 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id WAA04942 (8.6.10/2.2); Tue, 13 Feb 1996 22:16:45 +0100 Received: by daphnis.cs.kun.nl id WAA19970 (8.6.10/2.1); Tue, 13 Feb 1996 22:16:45 +0100 Date: Tue, 13 Feb 1996 22:16:45 +0100 Message-Id: <199602132116.WAA19970@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Workshop Announcement From: SPIN96 -- 2nd SPIN Workshop -- Call for Papers ============================================== The SPIN95 workshop, held on 16 October 1995 in Montreal, created a first opportunity for SPIN users to meet and exchange experiences, ideas, theories, wishes, gripes about formal verification tools. This year many conferences related to formal methods and verification are organized in New Jersey, as part of the DIMACS Special Year. This includes conferences such as CAV, LICS, and a series of workshops in our area. The second SPIN Workshop will therefore also be organized in New Jersey. The workshop will be held at Bell Labs in Murray Hill, on Monday 5 August 1996, just after CAV96 (Jul 31-Aug 3) held at Rutgers University, not far from Murray Hill. Details on transportation between Rutgers and Murray Hill will follow when the date of the workshop comes closer. Demo sessions of extensions, restrictions, and variations of SPIN will be organized (or of any comparable tool that is suggested). The details are as follows: Title: SPIN96 -- Second International SPIN Workshop -- Date: Monday August 5 1996 (just after LICS96 and CAV96) Place: AT&T Bell Laboratories, Murray Hill, NJ Duration: One day (tentatively: 9am - 5pm) Keynote speaker: Moshe Vardi, Rice University Papers: Papers can be up to 20 pages in length and can be either a report on work in progress or a regular research paper on work that is somehow related to the SPIN system . Demos: Tool demonstrations, of extensions, restrictions variations, or alternatives, to SPIN, are invited. Please tell us as early as possible if you plan to demonstrate software - so that we can make sure we can set it up properly and make it work. Dates: The deadline for all contributions is: Saturday June 15, 1996. Papers can be submitted electronically, in PostScript form to any one of the organizers. We will make available a Proceedings of the workshop in both printed and also, for the authors that permit us to do so, in electronic form. Organizers: Jean-Charles Gre'goire - gregoire@inrs-telecom.uquebec.ca Gerard Holzmann - gerard@research.att.com Doron Peled - doron@research.att.com URL: http://netlib.att.com/netlib/spin/ws96.html From Frits.Vaandrager@cs.kun.nl Wed Feb 14 11:51:05 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA07089; Wed, 14 Feb 96 04:51:43 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Wed, 14 Feb 1996 10:51:07 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id KAA04954 (8.6.10/2.2); Wed, 14 Feb 1996 10:51:06 +0100 Received: by daphnis.cs.kun.nl id KAA20885 (8.6.10/2.1); Wed, 14 Feb 1996 10:51:05 +0100 Date: Wed, 14 Feb 1996 10:51:05 +0100 Message-Id: <199602140951.KAA20885@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: LICS'96 Accepted Papers From: howe@research.att.com (Doug Howe) Reply-To: lics-request@research.att.com [For more on LICS'96, see http://www.research.att.com/lics/] Eleventh Annual IEEE Symposium on LOGIC IN COMPUTER SCIENCE July 27-30, 1996, New Brunswick, New Jersey, USA *** ACCEPTED PAPERS *** When Scott is Weak on the Top Abbas Edalat (Imperial College) Integration in Real PCF Abbas Edalat (Imperial College) Martin Hotzel Escardo (Imperial College) Game Semantics and Abstract Machines Vincent Danos (Paris 7 & CNRS) Hugo Herbelin (Paris 7 & INRIA) Laurent Regnier (LMD-CNRS Marseille) A Fully Abstract Domain Model for the Pi-Calculus Ian Stark (University of Aarhus) A Fully-Abstract Model for the Pi-Calculus M.P. Fiore (University of Edinburgh) E. Moggi (Universita di Genova) D. Sangiorgi (INRIA) Higher Dimensional Transition Systems Gian Luca Cattani (University of Aarhus) Vladimiro Sassone (University of Aarhus) An Algebraic Theory of Process Efficiency V. Natarajan (North Carolina State University) Rance Cleaveland (North Carolina State University) Symbolic Protocol Verification with Queue BDDs Patrice Godefroid (AT&T Bell Laboratories) David E. Long (AT&T Bell Laboratories) Reactive Modules Rajeev Alur (AT&T Bell Laboratories) Thomas A. Henzinger (Cornell University) Model-checking of Correctness Conditions for Concurrent Objects Rajeev Alur (AT&T Bell Laboratories) Ken McMillan (Cadence Berkeley Labs) Doron Peled (AT&T Bell Laboratories) Partial-Order Methods for Model Checking: >From Linear Time to Branching Time Bernard Willems Pierre Wolper (Universite de Liege) General Decidability Theorems for Infinite-State Systems Parosh Aziz Abdulla (Uppsala University) Karlis Cerans (University of Latvia) Bengt Jonsson (Uppsala University) Yih-Kuen Tsay (National Taiwan University) Efficient Model Checking via the Equational Mu-Calculus Girish Bhat (North Carolina State University) Rance Cleaveland (North Carolina State University) DATALOG SIRUPs Uniform Boundedness Is Undecidable Jerzy Marcinkowski (University of Wroclaw) A Generalization of Fagin's Theorem J. Antonio Medina (University of Massachusetts) Neil Immerman (University of Massachusetts) On the Structure of Queries in Constraint Query Languages Micheal Benedikt (AT&T Bell Laboratories) Leonid Libkin (AT&T Bell Laboratories) More about Recursive Structures: Descriptive Complexity and Zero-One Laws Tirza Hirst (The Weizmann Institute of Science) David Harel (The Weizmann Institute of Science) On the Expressive Power of Variable-Confined Logics Phokion G. Kolaitis (University of California, Santa Cruz) Moshe Y. Vardi (Rice University) Zero-One Laws for Gilbert Random Graphs Gregory L. McColm (University of South Florida) Reasoning about Local Variables with Operationally-Based Logical Relations Andrew M. Pitts (Cambridge University) The Essence of Parallel Algol Stephen Brookes (Carnegie Mellon University) Linear Logic, Monads and the Lambda Calculus Nick Benton (University of Cambridge) Philip Wadler (University of Glasgow) A Semantic View of Classical Proofs: Type-Theoretic, Categorical, and Denotational Characterizations C.-H. L. Ong (University of Oxford & National University of Singapore) Games and Full Abstraction for FPC Guy McCusker (Imperial College) A Temporal Logic Approach to Binding Time Analysis Rowan Davies (Carnegie Mellon University) On Order-Incompleteness and Finite Lambda Models Peter Selinger (University of Pennsylvania) Confluence and Preservation of Strong Normalisation in an Explicit Substitutions Calculus Cesar Munoz (INRIA) Completing Partial Combinatory Algebras with Unique Head-Normal Forms Inge Bethke (CWI and University of Utrecht) Jan Willem Klop (CWI and Vrije Universiteit) Roel de Vrijer (Vrije Universiteit) The Subtyping Problem for Second-Order Types is Undecidable Jerzy Tiuryn (Warsaw University) Pawel Urzyczyn (Warsaw University) Subtyping Dependent Types David Aspinall (University of Edinburgh) Adriana Compagnoni (University of Cambridge) Reduction-Free Normalisation for a Polymorphic System Thorsten Altenkirch (University of Edinburgh) Martin Hofmann (TH Darmstadt) Thomas Streicher (TH Darmstadt) Syntactic Considerations on Recursive Types Martin Abadi (Systems Research Center, Digital Equipment Corporation) Marcelo P. Fiore (University of Edinburgh) On the Expressive Power of Simply Typed and Let-Polymorphic Lambda Calculi Gerd G. Hillebrand (University of Pennsylvania) Paris C. Kanellakis (Brown University) A Linear Logical Framework Iliano Cervesato (Carnegie Mellon University) Frank Pfenning (Carnegie Mellon University) Complexity Analysis Based on Ordered Resolution David Basin (Max-Planck-Institut fur Informatik) Harald Ganzinger (Max-Planck-Institut fur Informatik) Solving Linear Equations over Semirings Paliath Narendran (State University of New York at Albany) Basic Paramodulation and Decidable Theories Robert Nieuwenhuis (Technical University of Catalonia) Counting Modulo Quantifiers on Finite Linearly Ordered Trees Juha Nurmonen (University of Helsinki) Simultaneous Rigid E-Unification and Related Algorithmic Problems; Skolemization and Decidability Problems for Fragments of Intuitionistic Logic Anatoli Degtyarev (Uppsala University) Yuri Matiyasevich (Steklov Institute of Mathematics) Andrei Voronkov (Uppsala University) On the Complexity of Abduction Victor W. Marek (University of Kentucky) Anil Nerode (Cornell University) Jeffrey B. Remmel (University of California, San Diego) Decision Problems for Semi-Thue Systems with a Few Rules Yuri Matiyasevich (Steklov Institute of Mathematics) Geraud Senizergues (LaBRI, Universite de Bordeaux) Relating Word and Tree Automata Orna Kupferman (AT&T Bell Laboratories) Shmuel Safra (Tel Aviv University) Moshe Y. Vardi (Rice University) An Until Hierarchy for Temporal Logic Kousha Etessami (DIMACS) Thomas Wilke (DIMACS) Locally Linear Time Temporal Logic R. Ramanujam (Universitat Kiel) A Modal Mu-Calculus for Durational Transition Systems Helmut Seidl (Universitat Trier) Semantics of Normal Logic Programs and Contested Information Shekhar Pradhan (University of Maryland, College Park & Central Missouri State University) Tarskian Set Constraints David McAllester (AT&T Bell Laboratories) Robert Givan (MIT AI Laboratory) Dexter Kozen (Cornell University) Carl Witty (MIT AI Laboratory) From Frits.Vaandrager@cs.kun.nl Thu Feb 15 21:29:55 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA09035; Thu, 15 Feb 96 14:30:40 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Thu, 15 Feb 1996 20:29:57 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id UAA25135 (8.6.10/2.2); Thu, 15 Feb 1996 20:29:56 +0100 From: Frits Vaandrager Received: by daphnis.cs.kun.nl id UAA02443 (8.6.10/2.1); Thu, 15 Feb 1996 20:29:55 +0100 Date: Thu, 15 Feb 1996 20:29:55 +0100 Message-Id: <199602151929.UAA02443@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: ICALP 96: Program and Call for Participation =============================================================================== FIRST CALL FOR PARTICIPATION AND PROGRAM 23rd INTERNATIONAL COLLOQUIUM ON AUTOMATA, LANGUAGES AND PROGRAMMING ICALP'96 JULY 8 -- JULY 12, 1996 Paderborn, Germany ******************************************************************************* ******************************************************************************* This and further information is available from the ICALP'96 www-server ************** http://www.uni-paderborn.de/~icalp96/ *********************** ******************************************************************************* ******************************************************************************* PROGRAM COMMITTEE: =============================================================================== J. Balcazar, Barcelona B. Monien, Paderborn (Co-Chairman) J. Berstel, Paris J. Munro, Waterloo R. Freivalds, Riga L. Pacholski, Wroclaw Z. Galil, New York A. Pnueli, Rehovot J. Karhumaki, Turku A. Rosenberg, Amherst R. Kemp, Frankfurt D. Sanella, Edinburgh W. Maass, Graz S. Skyum, Aarhus A. Marchetti-Spaccamela, Roma P. Spirakis, Patras J. Matousek, Praha P. Vitanyi, Amsterdam F. Meyer auf der Heide, Paderborn (Co-Chairman) INVITED SPEAKERS: =============================================================================== -- H. Ganzinger, Saarbruecken -- M. Latteux, Lille and V. Bruyere, Mons -- M. Rabin, Jerusalem and Cambridge -- A. Ranade, Berkeley and Bombay -- A. Razborov, Moscow PROGRAM: =============================================================================== MONDAY, JULY 8, 1996 ******************** 8:45 Opening 9:00 Invited Lecture: "Saturation-Based Theorem Proving" H. Ganzinger, (Saarbruecken, Germany) SESSION 1 -- PROCESS THEORY I Chair: Burkhard Monien (Paderborn, Germany) 9:50 "Algebraic Characterizations of Decorated Trace Equivalences over Tree-like Structures" X. J. Chen, R. De Nicola (Roma, Italy) 10:15 "Fast Asynchronous Systems in Dense Time" L. Jenner, W. Vogler (Augsburg, Germany) 10:40 BREAK SESSION 2 -- FAIRNESS, DOMINATION, AND THE MU-CALCULUS Chair: Amir Pnueli (Rehovot, Israel) 11:00 "A Hierarchy Theorem for the MU-Calculus" G. Lenzi (Pisa, Italy) 11:25 "An Effective Tableau System for the Linear Time MU-Calculus" J. Bradfield (Edinburgh, United Kingdom), J. Esparza, A. Mader (Muenchen, Germany) 11:50 "Characterizing Fairness Implementability for Multiparty Interaction" Y.-J. Joung (Taipei, Taiwan) 12:15 "Termination of Context-Sensitive Rewriting by Rewriting" S. Lucas (Valencia, Spain) 12:40 LUNCH SESSION 3 -- LOGIC AND ALGEBRA Chair: Leszek Pacholski (Wroclaw, Poland) 14:15 "A Complete Gentzen-style Axiomatization for Set Constraints" A. Cheng, D. Kozen (Cornell, USA) 14:40 "Fatal Errors in Conditional Expressions" M. Billaud (Bordeaux, France) 15:05 "Different Types of Arrow Between Logical Frameworks" T. Mossakowski (Bremen, Germany) 15:30 "Effective Models of Polymorphism, Subtyping and Recursion" J. Mitchell (Stanford, USA), R. Viswanathan (Cambridge, United Kingdom) 15:55 BREAK SESSION 4 -- LANGUAGES AND PROCESSES Chair: Don Sanella (Edinburgh, United Kingdom) 16:20 "Regularity of All Context-free Processes is Decidable" D. J. B. Bosscher, W. O. D. Griffioen (Amsterdam, The Netherlands) 16:45 "On Infinite Transition Graphs Having a Decidable Monadic Theory" D. Caucal (Rennes, France) 17:10 "Semi-groups Acting on Context-free Graphs" G. Senizergues (Bordeaux, France) 17:35 "Hard Sets Method and Semilinear Reservoir Method with Applications" L. P. Lisovik (Kiev, Ukraine) 18:00 END OF SESSION 19:00 Guided Walk through Paderborn TUESDAY, JULY 9, 1996 ********************* 9:00 Invited Lecture: "Bandwidth-efficient Parallel Computation" Abhiram Ranade (Berkeley, USA, and Bombay, India) SESSION 5 -- ALGEBRAIC COMPLEXITY Chair: Rainer Kemp (Frankfurt, Germany) 9:50 "Random Polynomials and Polynomial Factorization" Ph. Flajolet, X. Gourdon (LeChesnay, France) D. Panario (Toronto, Canada) 10:15 "Optimal Groebner Base Algorithms for Binomial Ideals" U. Koppenhagen and E. W. Mayr (Muenchen, Germany) 10:40 BREAK SESSION 6 -- GRAPH ALGORITHMS Chair: Sven Skyum (Aarhus, Denmark) 11:00 "Minimum Fill-in of Circle and Circular-arc Graphs" T. Kloks (Eindhoven, The Netherlands), D. Kratsch (Jena, Germany), C. K. Wong (Hong Kong) 11:25 "Practical Approximation Schemes for Maximum Induced-Subgraph Problems on K_{3,3}-free or K_5-free Graphs" Z. Z. Chen (Tokyo, Japan) 11:50 "Searching a Fixed Graph" E. Koutsoupias (Los Angeles, USA), Ch. Papadimitriou (San Diego, USA), M. Yannakakis (Murray Hill, USA) 12:15 "Improved Sampling with Applications to Dynamic Graph Algorithms" M. Rauch Henzinger (Cornell, USA), M. Thorup (Copenhagen, Denmark) 12:40 LUNCH SESSION 7 -- AUTOMATA Chair: Juhani Karhumaki (Turku, Finland) 14:15 "The Expressive Power of Existential First Order Sentences of Buechi's Sequential Calculus" J.-E. Pin (Paris, France) 14:40 "Fixpoints for Rabin Tree Automata Make Complementation Easy" R. Kaivola (Edinburgh, United Kingdom) 15:05 "New Upper Bounds to the Limitedness of Distance Automata" K. Hashiguchi (Okayama, Japan) 15:30 "Recognizing Regular Expressions by Means of Dataflow Networks" P. Raymond (Montbonnot-St. Martin, France) 15:55 BREAK SESSION 8 -- COMPLEXITY THEORY Chair: Paul Vitanyi (Amsterdam, The Netherlands) 16:20 "On the Power of Randomized Branching Programs" F. Ablayev (Kazan, Russia), M. Karpinski (Bonn, Germany) 16:45 "Hitting sets Derandomize BPP" A. E. Andreev (Moscow, Russia), A. E. Clementi (Roma, Italy), J.D.P. Rolim (Geneva, Switzerland) 17:10 "On Type-2 Probabilistic Quantifiers" R. Book (Santa Barbara, USA), H. Vollmer, K. Wagner (Wuerzburg, Germany) 17:35 "Speeding-up Single-Tape Nondeterministic Computations by Single Alternation, with Separation Results" J. Wiedermann (Prague, Czech Republic) 18:00 END OF SESSION 18:15 General Assembly of the EATCS WEDNESDAY, JULY 10, 1996 ************************ 9:00 Invited Lecture: "Variable-length Maximal Codes" Michel Latteux (Lille, France), Veronique Bruyere (Mons, Belgium) SESSION 9 -- COMBINATORICS ON WORDS Chair: Jean Berstel (Paris, France) 9:50 "On \omega-Generators and Codes" S. Julia (Sophia Antipolis, France) 10:15 "On Standard Sturmian Morphisms" A. de Luca (Roma, Italy) 10:40 BREAK SESSION 10 -- ALGORTIHMS I Chair: Ian Munro (Waterloo, Canada) 11:00 "Visual Cryptography for General Access Structures" G. Ateniese, C. Blundo, A. De Santis (Salerno, Italy), D. R. Stinson (Lincoln, USA) 11:25 "On Capital Investment" Y. Azar (Tel Aviv, Israel), Y. Bartal (Berkeley, USA), E. Feuerstein (Buenos Aires, Argentina), A. Fiat (Tel Aviv, Israel), St. Leonardi (Roma, Italy), A. Rosen (Toronto, Canada) 11:50 LUNCH 13:00 EXCURSION TO CORVEY CASTLE Visit of the Castle Library at the Principality of Corvey 19:30 CONFERENCE DINNER at the Buergerhaus "Im Schlosspark", Schloss Neuhaus THURSDAY, JULY 11, 1996 *********************** 9:00 Invited Lecture: "Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetics" Alexander Razborov (Moscow, Russia) SESSION 11 -- LOWER BOUNDS Chair: Rusins Freivalds (Riga, Latvia) 9:50 "Lower Bounds for Static Dictionaries on RAMs with Bit Operations But No Multiplication" P. B. Miltersen (Toronto, Canada) 10:15 "Lower Bounds for Row Minima Searching" P. G. Bradford, K. Reinert (Saarbruecken, Germany) 10:40 BREAK SESSION 12 -- PROCESS THEORY II Chair: Harald Ganzinger (Saarbruecken, Germany) 11:00 "On the Complexity of Relational Problems for Finite State Processes" S.K. Shukla, H.B. Hunt, D.J. Rosenkrantz, R.E. Stearns (Albany, USA) 11:25 "Deciding Finiteness of Petri Nets Up To Bisimulation" P. Jancar (Ostrava, Czech Republic), J. Esparza (Muenchen, Germany) 11:50 "Mobile Processes with a Distributed Environment" C. Bodei, P. Degano, C. Priami (Pisa, Italy) 12:15 "The Meaning of Negative Premises in Transition System Specifications II" R.J. van Glabbeek (Stanford, USA) 12:40 LUNCH SESSION 13 -- DATA STRUCTURES Chair: Paul Spirakis (Patras, Greece) 14:15 "Average Case Analyses of List Update Algorithms, with Applications to Data Compression" S. Albers (Saarbruecken, Germany), M. Mitzenmacher (Berkeley, USA) 14:40 "Self-organizing Data Structures with Dependent Accesses" F. Schulz, E. Schoemer (Saarbruecken, Germany) 15:05 "Lopsided Trees: Analyses, Algorithms and Applications" V. S.-N. Choi, M. Golin (Hong Kong) 15:30 "Optimal Logarithmic Time Randomized Suffix Tree Construction" M. Farach (Rutgers, USA), S. Muthukrishnan (Warwick, United Kingdom) 15:55 BREAK SESSION 14 -- PARALLEL ALGORITHMS Chair: Arnold Rosenberg (Amherst, USA) 16:20 "Improved Parallel Approximation of a Class of Integer Programming Programming Problems" N. Alon (Tel Aviv, Israel), A. Srinivasan (Singapore) 16:45 "Efficient Collective Communication in Optical Networks" J.C. Bermond, S. Perennes (Sophia Antipolis, France), L. Gargano, A.A. Rescigno, U. Vaccaro (Salerno, Italy) 17:10 "Shared-Memory Simulations on a Faulty-Memory DMM" B. S. Chlebus (Warszawa, Poland), A. Gambin (Dortmund, Germany), P. Indyk (Stanford, USA) 17:35 "Fast Deterministic Backtrack Search" K. T. Herley (Cork, Ireland), A. Pietracaprina, G. Pucci (Padova, Italy) 18:00 END OF SESSION 19:00 Reception by the Mayor of Paderborn FRIDAY, JULY 12, 1996 *********************** 9:00 Invited Lecture: "Parallel Computing, From Theory to Practice" Michael Rabin (Jerusalem, Israel and Harvard, USA) SESSION 15 -- DISTRIBUTED SYSTEMS Chair: Friedhelm Meyer auf der Heide (Paderborn, Germany) 9:50 "Agent Rendezvous: A Dynamic Symmetry-Breaking Problem" X. Yu (Columbia, USA), M. Yung (Watson Research Center, USA) 10:15 "Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler" Y. Aumann, M.A. Bender (Harvard, USA) 10:40 BREAK SESSION 16 -- ALGORITHMS II Chair: Alberto Marchetti-Spaccamela (Roma, Italy) 11:00 "A Formal Framework for Evaluating Heuristic Programs" L. Cowen (Baltimore, USA), J. Feigenbaum (Murray Hill, USA), S. Kannan (Philadelphia, USA) 11:25 "Improved Scheduling Algorithms for Minsum Criteria" S. Chakrabarti (Berkeley, USA), C. Phillips (Albuquerque, USA), A. Schulz (Berlin, Germany), D.B. Shmoys (Cornell, USA), C. Stein (Hanover, USA), J. Wein (Brooklyn, USA) 11:50 "On the Complexity of String Folding" M. Paterson (Warwick, United Kingdom), T. Przytycka (Odense, Denmark) 12:15 "A Polynomial-Time Algorithm for Near-Perfect Phylogeny" D. Fernandez-Baca (Ames, USA), J. Lagergren (Stockholm, Sweden) 12:40 LUNCH END OF ICALP'96 =============================================================================== GENERAL INFORMATION =============================================================================== LOCATION/CONFERENCE SITE: =============================================================================== All lectures will be given in the Conference Hall of the "Heinz Nixdorf MuseumsForum", Fuerstenallee 7, 33102 Paderborn. REGISTRATION/RECEPTION: =============================================================================== There will be a reception for all registrants from 6.00 pm to 9.00 pm on Sunday 7 at the Paderborn University, Building F, Fuerstenallee 11. This building is located next to the conference site. TRAVEL: =============================================================================== There are several ways to reach Paderborn. The airport of Paderborn/Lippstadt offers various connections to international airports (e.g. Amsterdam, London, Paris). Taxis (cost about 50 DM) and regular busses are available from the airport to the city (25 km). The nearest international airports are Duesseldorf (180 km), Hannover (160 km) and Frankfurt (300 km). There are good train connections from all these locations and other cities. Highway Connection: A33 - exit Paderborn-Zentrum. The conference site, Fuerstenallee 7, has regular connections with bus no. 11 (final destination: "Thuner Siedlung"; exit at bus stop: "Hopfenweg") from the city center as well as from the railway station. CLIMATE: =============================================================================== Daytime temperatures in July are expected to be around 22 degrees Celsius, nighttime temperatures around 15 degrees Celsius. Sunshine is expected with smaller rain showers once in a while. The conference rooms are fully air-conditioned. ACCOMODATION: =============================================================================== The room capacity of hotels in the center of Paderborn, and therefore closely to the conference site, is limited. The organizing team highly recommends your booking as soon as possible. !!! Please use the accomodation & registration form available from the !!! ICALP'96 www-page at http://uni-paderborn.de/~icalp96/ or the combined form at the end of this call or contact the organizing team. Attention: A hotel reservation, applied after June, 10 1996, cannot be guaranteed. REGISTRATION FEE: =============================================================================== Registration by May 15 after May 15 ------------------------------------------------------ Member of EATCS 360 DM 410 DM Non-member 400 DM 450 DM Student * 240 DM 290 DM Accompanying Person 120 DM 170 DM * certification of full-time student status has to be included The registration fee covers: member/ student accompanying non-member person --------------------------------------------------------- Receptions ++ ++ ++ Excursion ++ ++ ++ Guided Walk ++ ++ ++ ++ included Lunches, Refreshments ++ ++ -- -- not included Conference Dinner ++ -- ++ Proceedings ++ -- -- 1 year EATCS membership ++ -- -- The registration fee has to be paid either by bank transfer to the account (make sure that all intermediate bank charges are covered by your payment): Paderborn University Purpose: ICALP'96 Sparkasse Paderborn Account No.: 16107542 Bank Code: 472 501 01 or by a cheque (currency: German Mark (DM), Eurocheque preferred) payable to Prof. Dr. B. Monien and send it to Dr. Walter Unger, Paderborn University, Dept. of Computer Science, Fuerstenallee 11, D-33102 Paderborn, Germany !!! Please use the accomodation & registration form available from the !!! ICALP'96 www-page at http://uni-paderborn.de/~icalp96/ or the combined form at the end of this call or contact the organizing team. CANCELLATION: =============================================================================== In the case of cancellation another participant can be named without any costs. Otherwise an arrangement fee of 75.- DM has to be paid. No refund will be made to those canceling their registration after June 10. ACCOMPANYING PERSON PROGRAM: =============================================================================== In addition to the receptions, excursion and conference dinner the organizing team plans an interesting program for all accompanying persons during the talks. Tour A Visit of Detmold (a nice little town with good shopping areas), open air museum, castle, organ recital Tour B Sight-seeing Westphalia/Lippe: Schieder-Schwalenberg, Hameln and others. Tour C Visiting Kassel (famous castle and garden) All accompanying persons who are registered together with a conference parti- cipant will receive detailed information (including cost estimates for these additional activities), other interested persons will receive further informa- tion on request. EVENTS: =============================================================================== Sunday, July 7 Reception at the Paderborn University, Building F, 18:00 - 21:00 Fuerstenallee 11. This building is located next to the conference site. Monday, July 8 Guided walk through Paderborn 19:00 Tuesday, July 9 EATCS General Assembly 18:15 (at the conference site) Wednesday, July 10 Excursion to Corvey. Visit of the Castle Library at the Excursion 13:00 Principality of Corvey with its over 70.000 books and writs. Conference Dinner at the Buergerhaus "Im Schlosspark" in Schloss Neuhaus 19:30 Thursday, July 11 Reception by the Mayor of Paderborn in the City Hall 19:00 SPONSORS: =============================================================================== -- DFG - Deutsche Forschungsgemeinschaft -- Paderborn University -- Stadt Paderborn PROCEEDINGS: =============================================================================== Conference Proceedings are published by Springer-Verlag in the series "Lecture Notes in Computer Science" and will be distributed at the conference. ORGANIZING COMMITTEE: =============================================================================== Bernard Bauer Christian Scheideler Birgit Farr Willy-B. Strothmann Erich Koester Walter Unger Friedhelm Meyer auf der Heide Rolf Wanka Burkhard Monien FURTHER INFORMATION: =============================================================================== You will find all forms and a lot of additional information on the ICALP'96 www-page http://uni-paderborn.de/~icalp96/ or contact the organzing team via: email icalp96@uni-paderborn.de phone +49 5251 60-6296 fax +49 5251 60-6297 =============================================================================== =============================================================================== =============================================================================== ICALP'96 ACCOMODATION & REGISTRATION FORM =============================================================================== =============================================================================== =============================================================================== Please, fill in this form with typewriter or block letters, very legible and send it to Dr. Walter Unger Paderborn University Dept. of Computer Science Fuerstenallee 11 D-33102 Paderborn Surname: __________________________ Firstname: ________________________ Title: ___________________________ Affiliation: ______________________________________________________________ Address: ______________________________________________________________ ______________________________________________________________ ______________________ Country: ___________________________ ______________________ Phone: ___________________________ Email: ______________________ Fax: ___________________________ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Accomodation Form: If you fill in the accomodation form, the organizing team ****************** will forward it directly to the Verkehrsverein Paderborn, Marienplatz 2a, D-33098 Paderborn, Germany Phone: +49 5251 26461, Fax: +49 5251 22884 Attention: A hotel reservation, applied after June 10th, cannot be guaranteed. Arrival Date: ___________________ Time: __________________ Departure Date:__________________ Time: __________________ Please reserve: [ ] -- mark appropiately A B C from 130.- DM 80.- DM to 130.- DM up to 80.- DM ------------------------------------------------------------------------------- ___ single room(s) [ ] [ ] [ ] ___ double room(s) [ ] [ ] [ ] (Price per room and day) If no room(s) are available in selected category a) I herewith make a reservation of ___ room(s) of category ___ b) I herewith make a double room of category ___ at my exclusive disposal ___________________________________________________________ place, date and signature - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Registration Form: Complete one for each participant. ****************** [ ] -- mark appropiately my conference fee is: Registration by May 15 after May 15 ---------------------------------------------------------- Member of EATCS [ ] 360 DM [ ] 410 DM Non-member [ ] 400 DM [ ] 450 DM Student * [ ] 240 DM [ ] 290 DM * certification of full-time student Accompanying Person [ ] 120 DM [ ] 170 DM status has to be included How many: ___ Give their name(s): ___________________________________________________________ Total fee DM: ___________ [ ] I have transferred the fee to the ICALP account (no. 16107542) at the Sparkasse Paderborn (bank code 472 501 01) (make sure that all intermediate bank charges are covered by your payment, please enclode a copy ot the receipt of your payment) [ ] Cheque enclosed ___________________________________________________________ place, date and signature =============================================================================== =============================================================================== =============================================================================== From Frits.Vaandrager@cs.kun.nl Thu Feb 15 21:32:47 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA09080; Thu, 15 Feb 96 14:33:29 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Thu, 15 Feb 1996 20:32:49 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id UAA25195 (8.6.10/2.2); Thu, 15 Feb 1996 20:32:48 +0100 Received: by daphnis.cs.kun.nl id UAA02455 (8.6.10/2.1); Thu, 15 Feb 1996 20:32:47 +0100 Date: Thu, 15 Feb 1996 20:32:47 +0100 Message-Id: <199602151932.UAA02455@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Research Position From: Matthew Hennessy UNIVERSITY OF SUSSEX RESEARCH FELLOW IN THE FOUNDATIONS OF COMPUTING A Research Fellow is required for a 3-year project entitled ``Foundations for the Integration of Concurrent Distributed and Functional Computation'', under the direction of Prof. M. Hennessy and funded by the EPSRC. The aim of the project is to - provide a uniform coherent semantic foundation for concurrent, distributed and functional behaviour; - develop proof methodologies for establishing properties of process descriptions expressed in specification languages using these paradigms; - develop prototypes of supporting verification systems. The project will start on 1/4/96 and salary will be related to the academic 1A scale. A Ph.D. in Computer Science or Mathematics or equivalent experience is required. In addition to normal research duties the successful candidate will be expected to provide some assistance to undergraduate teaching. More details of the project and the conditions of service are available at ftp://ftp.cogs.sussex.ac.uk/pub/users/matthewh/details.ps To apply please submit electronic applications to matthewh@cogs.sussex.ac.uk Applications should include a detailed curriculum vitae, names of three referees with their email addresses. From Frits.Vaandrager@cs.kun.nl Fri Feb 16 00:31:45 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA13569; Thu, 15 Feb 96 17:31:51 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Thu, 15 Feb 1996 23:31:46 +0100 Received: by zeus.cs.kun.nl id XAA27665 (8.6.10/2.2); Thu, 15 Feb 1996 23:31:45 +0100 Date: Thu, 15 Feb 1996 23:31:45 +0100 Message-Id: <199602152231.XAA27665@zeus.cs.kun.nl> To: concurrency@cwi.nl Subject: AMAST Third Workshop on Real-Time Systems; Program From: Dan Ionescu (Dan Ionescu) The Third AMAST Workshop on Real-Time Systems; Models, Properties and Control Red Lion Hotel, Salt Lake City, Utah, USA March 6 - 8, 1996 This conference was sponsored by grants from the Office of Naval Research, Brigham Young University, University of Ottawa, and The University of Iowa. PROGRAM Wednesday, March 6-th Registration 8:30-9:00 Welcome: Conference Chair 9:00-12:30 Session 1: Modeling and verification, Chair: Zohar Manna 1. 9:00--9:45 Nancy Linch (MIT), Modeling and verification of automated transit systems 9:45--10:00 Discussions and break 2.10:00--10:45 Steven P. Miller (Rockwell), =46ormal verification of avionics microprocessors 10:45--11:00 Discussions and break 3.11:00-11:30 D. Luis Llana, D.de Frutos, and M.Nunez, Testing semantics for urgent timed process algebra 11:30-12:00 T.Rus and H. Abu-Dagga, Synthesizing real-time programs from CoRE specifications 4.12:00-12:30 J. Alves-Foss, G. Saghi, and D. Frincke, Multilevel data security for real-time embedded computer systems: a case study 12:30-2:00 Lunch 2:00-5:30 Session 2: Simulation and verification, Chair: Nancy Linch 5. 2:00-2:45 Zohar Manna (Stanford University), Verification of progress properties 2:45-3:00 Discussions and break 6. 3:00-3:30 Muriel Jourdan, Integrating formal verification methods of quantitative real-time properties into a development environment for robot controllers 7. 3:30-4:00 S. Kowalewski and J. Preussig, Analysis of time critical safety logic control for chemical processes 4:00-4:30 Coffee break 8.4:30-5:00 J. McManis, Verification of unpredictable real-time systems using suspension automata 9.5:00-5:30 J. Kosecka and H. Ben-Abdulah, An automated based algebra for specifying robotic agents Thursday, March 7-th Registration 9:00-12:30 Session 3: Design and validation, Chair: Steve Miller 10. 9:00--9:45 Didier Begay (University of Bordeaux), Model-checking and protocol validation 9:45--10:00 Discussions and break 11. 10:00--10:45 Jonathan Ostroff (York University), The design of real-time systems using standard untimed theories 10:45--11:00 Discussions and break 12. 11:00-11:30 C. Lambiri and D. Ionescu, Real-time and distributed models: composition, properties, and control 13. 11:30-12:00 M. Bertran, F. Oller, F. Alvarez-Cuevas,A. Duran, and M. Porta, The Llul system (TLS). An integration of formalism and simulation for parallel-distributed and real-time software synthesis and development 14. 12:00-12:30 M.Petriu, D.Petriu, and J.S.Basran, Modeling and verification of a multirobot assembly system 12:30-2:00 Lunch 2:00-5:30 Session 4: Logics and reasoning, Chair: Jonathan Ostroff 15. 2:00-2:45 Scott Woodfield (BYU), Analysis of Real Time Systems Using OSA 2:45-3:00 Discussions and break 16. 3:00-3:30 J.P.Katoen, D. Latella, E. Brinksma, and T. Bologniesi, A consistent causality based and interleaved view on a timed process algebra including timeouts 17. 3:30-4:00 L. Urbina, A constraint logic programming for hybrid systems 4:00-4:30 Coffee break 18. 4:30-5:00 P. Kosiuczenko and M. Wirsing, Timed rewriting logic 19. 5:00-5:30 V. Yodaiken, Virtual logic analyzers and feedback: Moore machine models of real-time 7:30 Banquet Friday, March 8-th 8:00-12:00 Registration 20. 8:30-12:30 Session 5: Temporal reasoning and model checking, Chair: Didier Begay 21. 9:00--9:45 E. Allen Emerson (University of Texas as Austin), Quantitative temporal reasoning} 9:45--10:00 Discussions and break 22. 10:00--10:45 George Milne (University of South Australia), The description and verification of a time sensitive protocol 10:45--11:00 Discussions and break 23. 11:00-11:30 T. Rus and E. Van Wyk, Algebraic implementation of model checking algorithms 24. 11:30-12:00 M. Faci and L. Logripo, An algebraic framework for the feature interaction problem 25. 12:00-12:30 S. Yamane, The automatic verification system for real-time systems using symbolic model-checking 12:30 - 2:00 Lunch 26.2:00-5:30 Session 6: Process algebra and real-time systems, Chair: Dan Ionescu 27.2:00-2:30 F. Cuartero, D. de Frutos, and V. Valero, PCSP: a denotation model for probabilistic processes 28. 2:30-3:00 F. Vazquez, Compositional model for formal development of real-time systems design 29. 3:00-3:30 P. Bremond-Gregoire, H. Ben-Abdalah, and I. Lee, Ordering processes in a real-time process algebra 3:30-4:00 Concluding Remarks ****************************************************************************= **** Registration The registration fee for this conference is $250; student registration is $100. Payment must be made at the conference registration desk using personal cheque, (international) money order, which must be in US dollars, or credit cards (VISA or Master Card). Cheques and money orders should be payable to "The University of Iowa". The registration fee covers lunch during the conference days, proceedings, and a banquet. A trip to the Utah ski slopes is also to be organized; the fees for this latter activity will be announced at the conference. Reservations The Red Lion Hotel/Salt Lake City, is excited to be your host hotel for your March 6-8, 1996 Real-Time Programming Workshop. Currently, we have secured a block of over night guest rooms to be utilized by attending participants with arrival on Tuesday, March 5, 1996, and departure on Saturday, March 9, 1996. The special rate that has been established for this group is as follows: Single $ 109.00 Double $ 119.00 Triple $ 129.00 Quad $ 139.00 Please remember, it is important that you make your reservations early to receive the special rate established for this event. You can do this by calling the hotel's reservations department at (801) 328-2000. You can also use our 800 numbers 1-800-RED-LION or 1-800-547-8010. Please request the group rate for AMAST REAL-TIME PROGRAMMING Workshop to ensure that you are charged properly. Also, note that all reservation requests must be guaranteed by a first night room deposit or be guaranteed with a major credit card. Guest room reservations must be made in advance of =46ebruary 14, 1996. Any individual reservations received after the cut-off date will be honored on a rate and space availability basis. The Red Lion Hotel/Salt Lake City provides 500 newly remodeled oversize guest rooms and is conveniently located in the heart of downtown Salt Lake City. We are only minutes from the Delta Center; home of the NBA Utah Jazz, the Triad Center, Capital Theater, Symphony Hall, the Crossroads Mall, and Utah's ski resorts, best known for the 'Greatest Snow on Earth' and other points of interest. The hotel also features such amenities as: free airport shuttle transportation, two restaurants, indoor heated pool, night club, hot tub, lobby lounge, health facilities, in-room coffee service. ************************************************************************= The Latex file, which we ask you to typset and post in your Department, (Institute, or other kind of organization) follows. %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%Cut it here %%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \documentstyle [11pt]{article} \textwidth =3D 6.5in \textheight =3D 8.5in \topmargin =3D -0.3in \topskip =3D 0in \oddsidemargin =3D -0.1in \evensidemargin =3D -0.1in \addtolength{\parskip}{0.5ex} \begin{document} \begin{center} {\Large \bf The Third AMAST Workshop on Real-Time Systems;}\\ {\Large \bf Models, Properties and Control}\\ {\large Red Lion Hotel, Salt Lake City, Utah, USA\\ March 6 - 8, 1996}\footnote {This conference was sponsored by grants from the Office of Naval Research, Brigham Young University, University of Ottawa, and The University of Iowa.} \bigskip{\Large {\bf PROGRAM}}\\ \end{center} \bigskip\noindent {\Large Wednesday, March 6-th}\\ \smallskip\noindent 8:00-12:00 {\bf Registration} \smallskip\noindent 8:30-9:00 {\bf Welcome: Conference Chair} \smallskip\noindent 9:00-12:30 Session 1: {\bf Modeling and verification}, Chair: Zohar Manna \medskip \noindent$\spadesuit$ {\normalsize 9:00--9:45 Invited Talk\\ Nancy Linch (MIT), {\it Modeling and verification of automated transit systems} %invited talk} % \\ \centerline{9:45--10:00 Discussions and break} %\\ \noindent$\spadesuit$ {\normalsize 10:00--10:45 Steven P. Miller (Rockwell), {\it Formal verification of avionics microprocessors} %invited talk} %\\ %\indent \centerline{10:45--11:00 Discussions and break} %\\ \medskip\noindent $\clubsuit$ 11:00-11:30 D. Luis Llana, D.de Frutos, and M.Nunez, {\it Testing semantics for urgent timed process algebra} \\ $\clubsuit$ 11:30-12:00 T.Rus and H. Abu-Dagga, {\it Synthesizing real-time programs from CoRE specifications}\\ $\clubsuit$ 12:00-12:30 J. Alves-Foss, G. Saghi, and D. Frincke, {\it Multilevel data security for real-time embedded computer systems: a case study} \begin{center} {\bf 12:30-2:00 Lunch} \end{center} \noindent 2:00-5:30 Session 2: {\bf Simulation and verification}, Chair: Nancy Linch \medskip \noindent$\spadesuit${\normalsize 2:00-2:45 Zohar Manna (Stanford University), {\it Verification of progress properties} %invited talk} %\indent \centerline{2:45-3:00 Discussions and break} %\\ \medskip\noindent $\clubsuit$ 3:00-3:30 Muriel Jourdan, {\it Integrating formal verification methods of quantitative real-time properties into a development environment for robot controllers}\\ \noindent $\clubsuit$ 3:30-4:00 S. Kowalewski and J. Preussig, {\it Analysis of time critical safety logic control for chemical processes}%\\ \begin{center} 4:00-4:30 Coffee break \end{center} \medskip\noindent $\clubsuit$ 4:30-5:00 J. McManis, {\it Verification of unpredictable real-time systems using suspension automata}\\ $\clubsuit$ 5:00-5:30 J. Kosecka and H. Ben-Abdulah, {\it An automated based algebra for specifying robotic agents}\\ \newpage \noindent {\Large Thursday, March 7-th} \bigskip\noindent 8:00-12:00, {\bf Registration} \medskip\noindent 9:00-12:30 Session 3: {\bf Design and validation}, Chair: Steve Miller \medskip \noindent$\spadesuit$ {\normalsize 9:00--9:45 Didier Begay (University of Bordeaux), {\it Model-checking and protocol validation}%, invited talk} \\ \centerline{9:45--10:00 Discussions and break} % \\ \noindent$\spadesuit$ 10:00--10:45 Jonathan Ostroff (York University),{\it The design of real-time systems using standard untimed theories}%, invited talk}\\ \centerline{10:45--11:00 Discussions and break} % \\ \medskip\noindent$\clubsuit$ 11:00-11:30 C. Lambiri and D. Ionescu, {\it Real-time and distributed models: composition, properties, and control} \\ $\clubsuit$ 11:30-12:00 M. Bertran, F. Oller, F. Alvarez-Cuevas, A. Duran, and M. Porta, {\it The Llul system (TLS). An integration of formalism and simulation for parallel-distributed and real-time software synthesis and development} \\ $\clubsuit$ 12:00-12:30 M.Petriu, D.Petriu, and J.S.Basran, {\it Modeling and verification of a multirobot assembly system} \begin{center} {\bf 12:30-2:00 Lunch} \end{center} \noindent 2:00-5:30 Session 4: {\bf Logics and reasoning}, Chair: Jonathan Ostroff \medskip \noindent$\spadesuit${\normalsize 2:00-2:45 Scott Woodfield (BYU), {\it Analysis of Real Time Systems Using OS= A} \centerline{2:45-3:00 Discussions and break} %\\ \medskip\noindent $\clubsuit$ 3:00-3:30 J.P.Katoen, D. Latella, E. Brinksma, and T. Bologniesi= , {\it A consistent causality based and interleaved view on a timed process algebra including timeouts} \\ $\clubsuit$ 3:30-4:00 L. Urbina, {\it A constraint logic programming for hybrid systems} \begin{center} 4:00-4:30 Coffee break \end{center} \medskip\noindent $\clubsuit$ 4:30-5:00 P. Kosiuczenko and M. Wirsing, {\it Timed rewriting logic} \\ $\clubsuit$ 5:00-5:30 V. Yodaiken, {\it Virtual logic analyzers and feedback= : Moore machine models of real-time} \\ \begin{center} 7:30 {\bf Banquet} \end{center} \newpage \noindent {\Large Friday, March 8-th} \bigskip\noindent 8:00-12:00 {\bf Registration}} \medskip\noindent 8:30-12:30 Session 5: {\bf Temporal reasoning and model checking}, Chair: Didier Begay \medskip \noindent$\spadesuit$ {\normalsize 9:00--9:45 E. Allen Emerson (University of Texas as Austin), {\it Quantitative temporal reasoning} %, invited talk} %\\ \centerline{9:45--10:00 Discussions and break} % \\ \noindent$\spadesuit$ 10:00--10:45 George Milne (University of South Australia), {\it The description and verification of a time sensitive protocol} %invited talk}\\ \centerline{10:45--11:00 Discussions and break} % \\ \medskip\noindent $\clubsuit$ 11:00-11:30 T.Rus and E. Van Wyk, {\it Algebraic implementation of model checking algorithms} \\ $\clubsuit$ 11:30-12:00 M. Faci and L. Logripo, {\it An algebraic framework for the feature interaction problem}\\ $\clubsuit$ 12:00-12:30 S. Yamane, {\it The automatic verification system for real-time systems using symbolic model-checking} \begin{center} {\bf 12:30 - 2:00 Lunch} \end{center} \medskip \noindent 2:00-5:30 Session 6: {\bf Process algebra and real-time systems}, Chair: Dan Ionescu \medskip\noindent $\clubsuit$ 2:00-2:30 F. Cuartero, D. de Frutos, and V. Valero, {\it PCSP: a denotation model for probabilistic processes}\\ $\clubsuit$ 2:30-3:00 F. Vazquez, {\it Compositional model for formal development of real-time systems design} \\ $\clubsuit$ 3:00-3:30 P. Bremond-Gregoire, H. Ben-Abdalah, and I. Lee, {\it Ordering processes in a real-time process algebra}\\ \begin{center} {\Large{\bf 3:30-4:00 Concluding Remarks}}\\ \end{center} \newpage \subsection*{Registration} The registration fee for this conference is \$250; student registration \$10= 0. Payment must be made at conference registration desk using personal cheque, (international) money order, which must be in US dollars, or credit cards (VISA or Master Card). Cheques and money orders should be payable to "The University of Iowa". The registration fee covers lunch during the conference days, proceedings,and a banquet. A trip to the Utah ski slopes is also to be organized; the fees for this latter activity will be announced at the conference. \subsection*{Reservations} The Red Lion Hotel/Salt Lake City, is excited to be your host hotel for your March 6-8, 1996 Real-Time Programming Workshop. Currently, we have secured a block of over night guest rooms to be utilized by attending participants with arrival on Tuesday, March 5, 1996, and departure on Saturday, March 9, 1996. The special rate that has been established for this group is as follows: \begin{center} \begin{tabular}{l l}\hline Single & \$ 109.00 \\ Double & \$ 119.00 \\ Triple & \$ 129.00 \\ Quad & \$ 139.00 \\ \hline \end{tabular} \end{center} Please remember, it is important that you make your reservations early to receive the special rate established for this event. You can do this by calling the hotel's reservations department at (801) 328-2000. You can also use our 800 numbers 1-800-RED-LION or 1-800-547-8010. Please request the group rate for AMAST REAL-TIME PROGRAMMING Workshop to ensure that you are charged properly. Also, note that all reservation requests must be guaranteed by a first night room deposit or be guaranteed with a major credit card. {\bf Guest room reservations must be made in advance of =46ebruary 14, 1996. Any individual reservations received after the cut-off date will be honored on a rate and space availability basis}. The Red Lion Hotel/Salt Lake City provides 500 newly remodeled oversize guest rooms and is conveniently located in the heart of downtown Salt Lake City. We are only minutes from the Delta Center; home of the NBA Utah Jazz, the Triad Center, Capital Theater, Symphony Hall, the Crossroads Mall, and Utah's ski resorts, best known for the 'Greatest Snow on Earth' and other points of interest. The hotel also features such amenities as: free airport shuttle transportation, two restaurants, indoor heated pool, night club, hot tub, lobby lounge, health facilities, in-room coffee service. \end{document} From Frits.Vaandrager@cs.kun.nl Wed Feb 21 12:57:13 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA20851; Wed, 21 Feb 96 05:57:58 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Wed, 21 Feb 1996 11:57:15 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id LAA10691 (8.6.10/2.2); Wed, 21 Feb 1996 11:57:14 +0100 Received: by daphnis.cs.kun.nl id LAA08520 (8.6.10/2.1); Wed, 21 Feb 1996 11:57:13 +0100 Date: Wed, 21 Feb 1996 11:57:13 +0100 Message-Id: <199602211057.LAA08520@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Open Positions in Stockholm, Sweden From: Dear Colleagues, This is to advertise open positions at the Royal Institute of Technology, Stockholm: A full chair (professor) in Teletraffic Systems and three lectureships (lektorat) in Teleinformatics of which two are focussed on Telecommunication Systems and one on Computer Systems. The closing dates are this week, but it is normally enough to send just a short fax and supply CV and reprints etc. within a few weeks. Please forward this to any you think could be interested. Information about the positions, our department, and how to apply can be found at http://www.it.kth.se/misc/jobs/ Joachim Parrow From Frits.Vaandrager@cs.kun.nl Wed Feb 21 12:58:23 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA20869; Wed, 21 Feb 96 05:59:07 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Wed, 21 Feb 1996 11:58:26 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id LAA10726 (8.6.10/2.2); Wed, 21 Feb 1996 11:58:24 +0100 Received: by daphnis.cs.kun.nl id LAA08525 (8.6.10/2.1); Wed, 21 Feb 1996 11:58:23 +0100 Date: Wed, 21 Feb 1996 11:58:23 +0100 Message-Id: <199602211058.LAA08525@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Submission for the Concurrency List From: Maarten de Rijke The IGPL and FoLLI Prize for the Best Idea of the Year The Interest Group in Pure and Applied Logics (IGPL) and the European Foundation of Logic, Language and Information (FoLLI) are happy to announce the annual prize for the best idea of the year in the area of pure and applied logic. There are many prizes in the community and they are usually won by leading researchers with an established body of research. However, progress also depends on fresh insights and sudden ideas, often coming from young people in the field. It is the latter ideas that we want to encourage. We therefore invite nominations for the second US$ 1000 annual IGPL and FoLLI Prize for the Best Idea of the Year. We are thinking of solutions to challenging open questions, but also of attractive new research ideas, novel connections between different aspects of logic, language and computation, etcetera. These should be surprising, and enhance the connectivity in our field. We call upon IGPL and FoLLI members and any other researchers in pure and applied logic to put forward candidates, who came out with a prize worthy good idea in 1995. It should be an idea published or in preprint during the year. In certain cases, we are also prepared to consider prize essays written precisely for this purpose. Proposals with personal background and case for support should be sent to the FoLLI chairman, Professor Wilfrid Hodges School of Mathematical Sciences, Queen Mary and Westfield College, Mile End Road, London E1 4NS, United Kingdom email: w.hodges@qmw.ac.uk The prize committee consists of the FoLLI chairman, the editorial board of the Bulletin of the IGPL and the FoLLI board members. Deadline for proposals for the 1995 prize is 1 May 1996. The top five candidates will be invited to publish their ideas in a special issue of the Bulletin of the IGPL and the committee will write an editorial describing the importance of these ideas. -- Maarten de Rijke Phone: +44 1203 52 4258 Fax: +44 1203 52 5714 Dept. of Computer Science University of Warwick Coventry CV4 7AL Email: mdr@dcs.warwick.ac.uk WWW: http://www.dcs.warwick.ac.uk/~mdr From Frits.Vaandrager@cs.kun.nl Wed Feb 21 12:59:56 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA20946; Wed, 21 Feb 96 06:01:00 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Wed, 21 Feb 1996 12:00:00 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id LAA10794 (8.6.10/2.2); Wed, 21 Feb 1996 11:59:58 +0100 Received: by daphnis.cs.kun.nl id LAA08531 (8.6.10/2.1); Wed, 21 Feb 1996 11:59:56 +0100 Date: Wed, 21 Feb 1996 11:59:56 +0100 Message-Id: <199602211059.LAA08531@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Call for Papers - FTRTFT '96, reminder From: Matz Kindahl Could you please help me redistribute this again. If you have any additional addresses that you think I should send the call for papers to, please send me a mail. Call for Papers FTRTFT'96 4th International School and Symposium Formal Techniques in Real Time and Fault Tolerant Systems Sept 9-10 (School) and Sept 11-13 (Symposium) 1996, Uppsala, Sweden OBJECTIVES Computer systems are becoming increasingly widespread in real-time and safety-critical applications. Such systems are characterized by the crucial need to manage their complexity in order to produce reliable designs. Formal techniques offer a foundation for systematic design of complex systems. They have beneficial applications throughout the engineering process, from the capture of requirements through specification, design, coding and compilation, down to the hardware which embeds the system into its environment. Their use may presuppose novel system architectures and design principles. The school and symposium are devoted to considering the problems and the solutions in safe system design, and to examining how well the use of advanced design techniques and formal methods for design, analysis and verification serves in relating theory to practical realities. This is the fourth in a line of International Schools and Symposia, previous were held at Warwick 1989, at Nijmegen 1992, and at L|beck 1994. Proceedings of these symposia are published as volumes 331, 571, and 863 in the LNCS series by Springer Verlag. SUBMISSIONS Paper Submissions are invited for the Symposium on the development and use of formal techniques and mathematical reasoning in design of real time, fault-tolerant and/or embedded systems, covering all stages from requirements analysis to hardware and/or software implementation. In addition to general topics, special themes of this symposium will be: * Verification Tools and/or Algorithms for Real Time and Fault Tolerant Systems * Tools and Algorithms Supporting Formal Methods * Requirements for and Verification of Safety-Critical Systems * Scheduling and Timing Constraints in Real Time Systems * Formal Methods for Real Time and Fault Tolerant Systems in Industrial Practice. * Fault Tolerance * Hybrid Systems * Synchronous Languages - their Theory and Tools * Case Studies in Application of Methods Six copies of a paper, not exceeding 20 double-spaced standard pages, accompanied by a one-page abstract should reach the program committee co-chair at the below address no later than March 1, 1996. Mailing addresses (postal, fax, and electronic) of corresponding author should be indicated on each copy. Notification of Acceptance by May 15. Final text by June 30. Accepted papers will be published in the LNCS series by Springer Verlag. TOOLS DEMONSTRATIONS Demonstrations of software tools that support formal approaches to the development of real time, fault-tolerant and/or embedded systems are invited for the school and symposium. Proposers should contact the Tools Demonstration Chair. VENUE School and Symposium will be held in the city of Uppsala (population ca. 140.000). Uppsala is located 70 km north of Stockholm and 35 km north of Stockholm Arlanda international airport. FOR MORE INFO Consult our WWW page at: http://www.docs.uu.se/ftrtft96/ PROGRAM COMMITTEE A. Burns (University of York), C. Dwork (IBM Almaden), T. Henzinger (Cornell University, Ithaca, N.Y.), H.Hansson (Uppsala University), J. Hooman (Eindhoven University of Technology), B. Jonsson (co-chair) (Uppsala University), M. Joseph (University of Warwick), B. Kurshan (AT&T/Bell Labs, New Jersey), K. Larsen (Aalborg University), N. Leveson (University of Washington), A. Mok (University of Texas, Austin), E.R. Olderog (University of Oldenburg), J. Parrow (co-chair) (Royal Inst. of Technology, Stockholm), Z. Peng (Linkvping University), A. Pnueli (Weizmann Inst., Rehovot), A.P. Ravn (DTU, Lyngby), W.-P. de Roever (University of Kiel), F. Schneider (Cornell University, Ithaca, N.Y.), J. Sifakis (IMAG-LGI, Grenoble), J. Torin (Chalmers University of Technology), J. Vytopil (Kath. University, Nijmegen), K.-E. Erzin (Lund University of Technology) ORGANIZING COMMITTEE Parosh Abdulla: Publicity Per Gunningberg: Local Organization Hans Hansson: Sponsorship Wang Yi: Tools Demonstrations STEERING COMMITTEE M. Joseph (University of Warwick), A. Pnueli (Weizmann Inst., Rehovot), H. Rischel (DTU, Lyngby), W.-P. de Roever (University of Kiel), J. Vytopil (Kath. University, Nijmegen) ADDRESSES Program Committee Co-Chair Tools Demonstration Chair Bengt Jonsson Wang Yi Uppsala University Uppsala University Dept. of Computer Systems Dept. of Computer Systems Box 325, S-751 05 Uppsala, Sweden Box 325, S-751 05 Uppsala, Sweden tel: + 46 18 - 183157 tel: + 46 18 - 183110 fax: + 46 - 18 - 550225 fax: + 46 - 18 - 550225 e-mail: bengt@docs.uu.se e-mail: yi@docs.uu.se From Frits.Vaandrager@cs.kun.nl Wed Feb 21 12:57:13 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA27015; Wed, 21 Feb 96 12:36:31 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Wed, 21 Feb 1996 11:57:15 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id LAA10691 (8.6.10/2.2); Wed, 21 Feb 1996 11:57:14 +0100 Received: by daphnis.cs.kun.nl id LAA08520 (8.6.10/2.1); Wed, 21 Feb 1996 11:57:13 +0100 Date: Wed, 21 Feb 1996 11:57:13 +0100 Message-Id: <199602211057.LAA08520@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Open Positions in Stockholm, Sweden From: Dear Colleagues, This is to advertise open positions at the Royal Institute of Technology, Stockholm: A full chair (professor) in Teletraffic Systems and three lectureships (lektorat) in Teleinformatics of which two are focussed on Telecommunication Systems and one on Computer Systems. The closing dates are this week, but it is normally enough to send just a short fax and supply CV and reprints etc. within a few weeks. Please forward this to any you think could be interested. Information about the positions, our department, and how to apply can be found at http://www.it.kth.se/misc/jobs/ Joachim Parrow From Frits.Vaandrager@cs.kun.nl Wed Feb 21 12:58:23 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA27272; Wed, 21 Feb 96 12:50:58 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Wed, 21 Feb 1996 11:58:26 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id LAA10726 (8.6.10/2.2); Wed, 21 Feb 1996 11:58:24 +0100 Received: by daphnis.cs.kun.nl id LAA08525 (8.6.10/2.1); Wed, 21 Feb 1996 11:58:23 +0100 Date: Wed, 21 Feb 1996 11:58:23 +0100 Message-Id: <199602211058.LAA08525@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Submission for the Concurrency List From: Maarten de Rijke The IGPL and FoLLI Prize for the Best Idea of the Year The Interest Group in Pure and Applied Logics (IGPL) and the European Foundation of Logic, Language and Information (FoLLI) are happy to announce the annual prize for the best idea of the year in the area of pure and applied logic. There are many prizes in the community and they are usually won by leading researchers with an established body of research. However, progress also depends on fresh insights and sudden ideas, often coming from young people in the field. It is the latter ideas that we want to encourage. We therefore invite nominations for the second US$ 1000 annual IGPL and FoLLI Prize for the Best Idea of the Year. We are thinking of solutions to challenging open questions, but also of attractive new research ideas, novel connections between different aspects of logic, language and computation, etcetera. These should be surprising, and enhance the connectivity in our field. We call upon IGPL and FoLLI members and any other researchers in pure and applied logic to put forward candidates, who came out with a prize worthy good idea in 1995. It should be an idea published or in preprint during the year. In certain cases, we are also prepared to consider prize essays written precisely for this purpose. Proposals with personal background and case for support should be sent to the FoLLI chairman, Professor Wilfrid Hodges School of Mathematical Sciences, Queen Mary and Westfield College, Mile End Road, London E1 4NS, United Kingdom email: w.hodges@qmw.ac.uk The prize committee consists of the FoLLI chairman, the editorial board of the Bulletin of the IGPL and the FoLLI board members. Deadline for proposals for the 1995 prize is 1 May 1996. The top five candidates will be invited to publish their ideas in a special issue of the Bulletin of the IGPL and the committee will write an editorial describing the importance of these ideas. -- Maarten de Rijke Phone: +44 1203 52 4258 Fax: +44 1203 52 5714 Dept. of Computer Science University of Warwick Coventry CV4 7AL Email: mdr@dcs.warwick.ac.uk WWW: http://www.dcs.warwick.ac.uk/~mdr From Frits.Vaandrager@cs.kun.nl Wed Feb 21 12:59:56 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA27694; Wed, 21 Feb 96 13:11:34 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Wed, 21 Feb 1996 12:00:00 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id LAA10794 (8.6.10/2.2); Wed, 21 Feb 1996 11:59:58 +0100 Received: by daphnis.cs.kun.nl id LAA08531 (8.6.10/2.1); Wed, 21 Feb 1996 11:59:56 +0100 Date: Wed, 21 Feb 1996 11:59:56 +0100 Message-Id: <199602211059.LAA08531@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Call for Papers - FTRTFT '96, reminder From: Matz Kindahl Could you please help me redistribute this again. If you have any additional addresses that you think I should send the call for papers to, please send me a mail. Call for Papers FTRTFT'96 4th International School and Symposium Formal Techniques in Real Time and Fault Tolerant Systems Sept 9-10 (School) and Sept 11-13 (Symposium) 1996, Uppsala, Sweden OBJECTIVES Computer systems are becoming increasingly widespread in real-time and safety-critical applications. Such systems are characterized by the crucial need to manage their complexity in order to produce reliable designs. Formal techniques offer a foundation for systematic design of complex systems. They have beneficial applications throughout the engineering process, from the capture of requirements through specification, design, coding and compilation, down to the hardware which embeds the system into its environment. Their use may presuppose novel system architectures and design principles. The school and symposium are devoted to considering the problems and the solutions in safe system design, and to examining how well the use of advanced design techniques and formal methods for design, analysis and verification serves in relating theory to practical realities. This is the fourth in a line of International Schools and Symposia, previous were held at Warwick 1989, at Nijmegen 1992, and at L|beck 1994. Proceedings of these symposia are published as volumes 331, 571, and 863 in the LNCS series by Springer Verlag. SUBMISSIONS Paper Submissions are invited for the Symposium on the development and use of formal techniques and mathematical reasoning in design of real time, fault-tolerant and/or embedded systems, covering all stages from requirements analysis to hardware and/or software implementation. In addition to general topics, special themes of this symposium will be: * Verification Tools and/or Algorithms for Real Time and Fault Tolerant Systems * Tools and Algorithms Supporting Formal Methods * Requirements for and Verification of Safety-Critical Systems * Scheduling and Timing Constraints in Real Time Systems * Formal Methods for Real Time and Fault Tolerant Systems in Industrial Practice. * Fault Tolerance * Hybrid Systems * Synchronous Languages - their Theory and Tools * Case Studies in Application of Methods Six copies of a paper, not exceeding 20 double-spaced standard pages, accompanied by a one-page abstract should reach the program committee co-chair at the below address no later than March 1, 1996. Mailing addresses (postal, fax, and electronic) of corresponding author should be indicated on each copy. Notification of Acceptance by May 15. Final text by June 30. Accepted papers will be published in the LNCS series by Springer Verlag. TOOLS DEMONSTRATIONS Demonstrations of software tools that support formal approaches to the development of real time, fault-tolerant and/or embedded systems are invited for the school and symposium. Proposers should contact the Tools Demonstration Chair. VENUE School and Symposium will be held in the city of Uppsala (population ca. 140.000). Uppsala is located 70 km north of Stockholm and 35 km north of Stockholm Arlanda international airport. FOR MORE INFO Consult our WWW page at: http://www.docs.uu.se/ftrtft96/ PROGRAM COMMITTEE A. Burns (University of York), C. Dwork (IBM Almaden), T. Henzinger (Cornell University, Ithaca, N.Y.), H.Hansson (Uppsala University), J. Hooman (Eindhoven University of Technology), B. Jonsson (co-chair) (Uppsala University), M. Joseph (University of Warwick), B. Kurshan (AT&T/Bell Labs, New Jersey), K. Larsen (Aalborg University), N. Leveson (University of Washington), A. Mok (University of Texas, Austin), E.R. Olderog (University of Oldenburg), J. Parrow (co-chair) (Royal Inst. of Technology, Stockholm), Z. Peng (Linkvping University), A. Pnueli (Weizmann Inst., Rehovot), A.P. Ravn (DTU, Lyngby), W.-P. de Roever (University of Kiel), F. Schneider (Cornell University, Ithaca, N.Y.), J. Sifakis (IMAG-LGI, Grenoble), J. Torin (Chalmers University of Technology), J. Vytopil (Kath. University, Nijmegen), K.-E. Erzin (Lund University of Technology) ORGANIZING COMMITTEE Parosh Abdulla: Publicity Per Gunningberg: Local Organization Hans Hansson: Sponsorship Wang Yi: Tools Demonstrations STEERING COMMITTEE M. Joseph (University of Warwick), A. Pnueli (Weizmann Inst., Rehovot), H. Rischel (DTU, Lyngby), W.-P. de Roever (University of Kiel), J. Vytopil (Kath. University, Nijmegen) ADDRESSES Program Committee Co-Chair Tools Demonstration Chair Bengt Jonsson Wang Yi Uppsala University Uppsala University Dept. of Computer Systems Dept. of Computer Systems Box 325, S-751 05 Uppsala, Sweden Box 325, S-751 05 Uppsala, Sweden tel: + 46 18 - 183157 tel: + 46 18 - 183110 fax: + 46 - 18 - 550225 fax: + 46 - 18 - 550225 e-mail: bengt@docs.uu.se e-mail: yi@docs.uu.se From Frits.Vaandrager@cs.kun.nl Thu Feb 22 10:54:26 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA11810; Thu, 22 Feb 96 03:55:14 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Thu, 22 Feb 1996 09:54:30 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id JAA01679 (8.6.10/2.2); Thu, 22 Feb 1996 09:54:28 +0100 Received: by daphnis.cs.kun.nl id JAA10362 (8.6.10/2.1); Thu, 22 Feb 1996 09:54:26 +0100 Date: Thu, 22 Feb 1996 09:54:26 +0100 Message-Id: <199602220854.JAA10362@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: CFP: Hawaii Intl Conf: ENGINEERING COMPLEX COMPUTER SYSTEMS From: broggi@Verdi.Eng.UniPR.IT (Alberto Broggi) Should you receive multiple copies of this call-for-papers, please accept my apologies. If you maintain a list of call-for-papers, please add this to your list. ============================================================================== CALL FOR PAPERS * ENGINEERING COMPLEX COMPUTER SYSTEMS * Thirtieth Annual HAWAII INTERNATIONAL CONFERENCE ON SYSTEMS SCIENCES HICSS - 30 Maui, Hawaii, January 7-10, 1997 Papers are invited for the Minitrack on ENGINEERING COMPLEX COMPUTER SYSTEMS as part of the Advanced Technology track at the Hawaii International Conference on System Sciences (HICSS). 1. PURPOSES Modern computer systems and applications embody many different characteristics and properties that are currently addressed, studied, and optimized independently. Nevertheless, although it is of basic importance to focus on these aspects independently, as a whole these properties feature a complex interrelationship, and thus a higher-level view of the complete project becomes mandatory. While perhaps some of the earlier computer systems could be described, designed and implemented with a particular focus on one objective (such as fault-tolerance or timeliness), or using a single method (such as Structured Programming), it is very questionable whether such modern and future applications can be. Nowadays almost all electronic products are becoming more and more software based: complex computer systems are becoming common in many sectors, such as manufacturing, communications, defense, transportation, aerospace, hazardous environments, energy, health care, etc. These systems feature a number of different characteristics (such as distributed processing, heterogeneous computational paradigms, high speed networks, novel bus systems, or special-purpose hardware enhancements in general) and performance requirements (such as real-time behavior, fault tolerance, security, adaptability, development time and cost, long life concerns). The concurrent satisfaction of the systems requirements have a considerable impact on the hardware characteristics and vice-versa. The analysis of the complete project, as a whole, is a major point in the design of the computer system itself and plays a basic role throughout the entire system life. The ECCS Minitrack will bring together industrial, academic, and government experts from these various disciplines, to determine how the disciplines' problems and solution techniques interact within the whole system. Researchers, practitioners, tool developers and users, and technology transition experts are all welcome. 2. ADDRESSED TOPICS: Papers are solicited on all major aspects of ECCS including specifying, designing, prototyping, building, testing, operating, maintaining, and evolving of complex computer systems, including: * Software engineering, re-engineering, reverse engineering * Complex real-time architectures, tools, environments and languages * AI and intelligent systems * Database and data management * Dependable real-time systems * Virtual reality, multimedia, real-time imaging * Algorithms, optimization and analysis * Analytical techniques * Megaprogramming, visual programming * Performance estimation, prediction and optimization * Prototyping and testing techniques * Formal methods and formal specification techniques * Hardware/software co-design * Communications, networking, mobile computing * Highly heterogeneous, distributed and parallel platforms * Case studies and project reports 3. MINITRACK COORDINATORS Alberto Broggi Alexander D. Stoyenko Dip. Ingegneria dell'Informazione Real-Time Computing Laboratory, CIS Universita` di Parma New Jersey Institute of Technology I-43100 Parma, Italy Newark, New Jersey 07102 USA Fax: +39 - 521 905723 Fax: (201) 596-5777 Email: broggi@CE.UniPR.IT Email: alex@vulcan.njit.edu Papers should be submitted to: Alberto Broggi HICSS'97 ECCS Coordinator Dipartimento di Ingegneria dell'Informazione Universita` di Parma, Viale delle Scienze I-43100 Parma, Italy 4. FURTHER AND UP-TO-DATE INFORMATION: Further information about the ECCS Minitrack are available at the following WWW address: http://WWW.CE.UniPR.IT/hicss/eccs If you wish to receive automatic updates about this event, please send Email to: broggi@CE.UniPR.IT indicating "ECCS" as subject. * INSTRUCTIONS FOR SUBMITTING PAPERS: 1. Submit 6 (six) copies of the full paper, consisting of 20 - 25 pages double-spaced including title page, abstract, references and diagrams directly to the minitrack coordinator. 2. Do not submit the paper to more than one minitrack. The paper should contain original material and not be previously published or currently submitted for consideration elsewhere. 3. Each paper must have a tile page which includes the title, full name of all authors, and their complete addresses including affiliation(s), telephone number(s) and e-mail address(es). 4. The first page of the paper should include the title and a 300-word abstract. * DEADLINES: March 15, 1996: Abstracts submitted to track coordinators for guidance and indication of appropriate content: authors unfamiliar with HICSS or those who wish additional guidance are encouraged to contact any coordinator to discuss potential papers. June 1, 1996: Full papers submitted to the appropriate track, or minitrack coordinator. August 31, 1996: Notification of accepted papers mailed to authors. October 1, 1996: Accepted manuscripts, camera-ready , sent to minitrack coordinators; one author from each paper must register by this time. November 15, 1996: All other registrations must be received. Registrations received after this deadline may not be accepted due to space limitation. * CONFERENCE PROCEEDINGS: The conference Proceedings are published and distributed by IEEE Computer Society. The ENGINEERING COMPLEX COMPUTER SYSTEMS Minitrack is part of the Advanced Technology. For more information on the Advanced Technology Track contact: Ralph H. Sprague, Jr. E-mail: sprague@hawaii.edu Voice: (808) 956-7082 Fax: (808) 956-9889 * OTHER CONFERENCE TRACKS There are three other majors tracks in the conference: Software, Digital Documents, and Information Systems. The Information Systems Track has several minitracks that focus on a variety of research topics in Collaboration Technology, Decision Support and Knowledge-Based Systems, and Organizational Systems and Technology. For more information on the other tracks, please contact: Software Technology Track: Hesham El-Rewini rewini@unocss.unomaha.edu Digital Documents Track: M. Stuart Lynn msylnn@ucop.edu Information Systems Track: Ralph H. Sprague, Jr. sprague@hawaii.edu Jay F. Nunamaker, Jr. nunamaker@bpa.arizona.edu Eileen Dennis (Track Assistant) edennis@uga.cc.uga.edu The purpose of HICSS is to provide a forum for the interchange of ideas, research results, development activities, and applications among academicians and practitioners in computer-based systems sciences. The conference consists of tutorials, advanced seminars, presentations of accepted papers, open forum, tasks forces, and plenary and distinguished guest lectures. There is a high degree of interaction and discussion among the conference participants because the conference is conducted in a workshop-like setting. For more information on the conference, please contact the conference coordinator: Barbara Edelstein College of Business Administration University of Hawai'i 2404 Maile Way Honolulu, HI 96822 Voice: (808) 956-3251 Fax: (808) 956-9685 E-mail: hicss@hawaii.edu or visit the World Wide Web page: http://www.cba.hawaii.edu/hicss From Frits.Vaandrager@cs.kun.nl Thu Feb 22 10:54:26 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA17837; Thu, 22 Feb 96 10:52:13 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Thu, 22 Feb 1996 09:54:30 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id JAA01679 (8.6.10/2.2); Thu, 22 Feb 1996 09:54:28 +0100 Received: by daphnis.cs.kun.nl id JAA10362 (8.6.10/2.1); Thu, 22 Feb 1996 09:54:26 +0100 Date: Thu, 22 Feb 1996 09:54:26 +0100 Message-Id: <199602220854.JAA10362@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: CFP: Hawaii Intl Conf: ENGINEERING COMPLEX COMPUTER SYSTEMS From: broggi@Verdi.Eng.UniPR.IT (Alberto Broggi) Should you receive multiple copies of this call-for-papers, please accept my apologies. If you maintain a list of call-for-papers, please add this to your list. ============================================================================== CALL FOR PAPERS * ENGINEERING COMPLEX COMPUTER SYSTEMS * Thirtieth Annual HAWAII INTERNATIONAL CONFERENCE ON SYSTEMS SCIENCES HICSS - 30 Maui, Hawaii, January 7-10, 1997 Papers are invited for the Minitrack on ENGINEERING COMPLEX COMPUTER SYSTEMS as part of the Advanced Technology track at the Hawaii International Conference on System Sciences (HICSS). 1. PURPOSES Modern computer systems and applications embody many different characteristics and properties that are currently addressed, studied, and optimized independently. Nevertheless, although it is of basic importance to focus on these aspects independently, as a whole these properties feature a complex interrelationship, and thus a higher-level view of the complete project becomes mandatory. While perhaps some of the earlier computer systems could be described, designed and implemented with a particular focus on one objective (such as fault-tolerance or timeliness), or using a single method (such as Structured Programming), it is very questionable whether such modern and future applications can be. Nowadays almost all electronic products are becoming more and more software based: complex computer systems are becoming common in many sectors, such as manufacturing, communications, defense, transportation, aerospace, hazardous environments, energy, health care, etc. These systems feature a number of different characteristics (such as distributed processing, heterogeneous computational paradigms, high speed networks, novel bus systems, or special-purpose hardware enhancements in general) and performance requirements (such as real-time behavior, fault tolerance, security, adaptability, development time and cost, long life concerns). The concurrent satisfaction of the systems requirements have a considerable impact on the hardware characteristics and vice-versa. The analysis of the complete project, as a whole, is a major point in the design of the computer system itself and plays a basic role throughout the entire system life. The ECCS Minitrack will bring together industrial, academic, and government experts from these various disciplines, to determine how the disciplines' problems and solution techniques interact within the whole system. Researchers, practitioners, tool developers and users, and technology transition experts are all welcome. 2. ADDRESSED TOPICS: Papers are solicited on all major aspects of ECCS including specifying, designing, prototyping, building, testing, operating, maintaining, and evolving of complex computer systems, including: * Software engineering, re-engineering, reverse engineering * Complex real-time architectures, tools, environments and languages * AI and intelligent systems * Database and data management * Dependable real-time systems * Virtual reality, multimedia, real-time imaging * Algorithms, optimization and analysis * Analytical techniques * Megaprogramming, visual programming * Performance estimation, prediction and optimization * Prototyping and testing techniques * Formal methods and formal specification techniques * Hardware/software co-design * Communications, networking, mobile computing * Highly heterogeneous, distributed and parallel platforms * Case studies and project reports 3. MINITRACK COORDINATORS Alberto Broggi Alexander D. Stoyenko Dip. Ingegneria dell'Informazione Real-Time Computing Laboratory, CIS Universita` di Parma New Jersey Institute of Technology I-43100 Parma, Italy Newark, New Jersey 07102 USA Fax: +39 - 521 905723 Fax: (201) 596-5777 Email: broggi@CE.UniPR.IT Email: alex@vulcan.njit.edu Papers should be submitted to: Alberto Broggi HICSS'97 ECCS Coordinator Dipartimento di Ingegneria dell'Informazione Universita` di Parma, Viale delle Scienze I-43100 Parma, Italy 4. FURTHER AND UP-TO-DATE INFORMATION: Further information about the ECCS Minitrack are available at the following WWW address: http://WWW.CE.UniPR.IT/hicss/eccs If you wish to receive automatic updates about this event, please send Email to: broggi@CE.UniPR.IT indicating "ECCS" as subject. * INSTRUCTIONS FOR SUBMITTING PAPERS: 1. Submit 6 (six) copies of the full paper, consisting of 20 - 25 pages double-spaced including title page, abstract, references and diagrams directly to the minitrack coordinator. 2. Do not submit the paper to more than one minitrack. The paper should contain original material and not be previously published or currently submitted for consideration elsewhere. 3. Each paper must have a tile page which includes the title, full name of all authors, and their complete addresses including affiliation(s), telephone number(s) and e-mail address(es). 4. The first page of the paper should include the title and a 300-word abstract. * DEADLINES: March 15, 1996: Abstracts submitted to track coordinators for guidance and indication of appropriate content: authors unfamiliar with HICSS or those who wish additional guidance are encouraged to contact any coordinator to discuss potential papers. June 1, 1996: Full papers submitted to the appropriate track, or minitrack coordinator. August 31, 1996: Notification of accepted papers mailed to authors. October 1, 1996: Accepted manuscripts, camera-ready , sent to minitrack coordinators; one author from each paper must register by this time. November 15, 1996: All other registrations must be received. Registrations received after this deadline may not be accepted due to space limitation. * CONFERENCE PROCEEDINGS: The conference Proceedings are published and distributed by IEEE Computer Society. The ENGINEERING COMPLEX COMPUTER SYSTEMS Minitrack is part of the Advanced Technology. For more information on the Advanced Technology Track contact: Ralph H. Sprague, Jr. E-mail: sprague@hawaii.edu Voice: (808) 956-7082 Fax: (808) 956-9889 * OTHER CONFERENCE TRACKS There are three other majors tracks in the conference: Software, Digital Documents, and Information Systems. The Information Systems Track has several minitracks that focus on a variety of research topics in Collaboration Technology, Decision Support and Knowledge-Based Systems, and Organizational Systems and Technology. For more information on the other tracks, please contact: Software Technology Track: Hesham El-Rewini rewini@unocss.unomaha.edu Digital Documents Track: M. Stuart Lynn msylnn@ucop.edu Information Systems Track: Ralph H. Sprague, Jr. sprague@hawaii.edu Jay F. Nunamaker, Jr. nunamaker@bpa.arizona.edu Eileen Dennis (Track Assistant) edennis@uga.cc.uga.edu The purpose of HICSS is to provide a forum for the interchange of ideas, research results, development activities, and applications among academicians and practitioners in computer-based systems sciences. The conference consists of tutorials, advanced seminars, presentations of accepted papers, open forum, tasks forces, and plenary and distinguished guest lectures. There is a high degree of interaction and discussion among the conference participants because the conference is conducted in a workshop-like setting. For more information on the conference, please contact the conference coordinator: Barbara Edelstein College of Business Administration University of Hawai'i 2404 Maile Way Honolulu, HI 96822 Voice: (808) 956-3251 Fax: (808) 956-9685 E-mail: hicss@hawaii.edu or visit the World Wide Web page: http://www.cba.hawaii.edu/hicss From Frits.Vaandrager@cs.kun.nl Thu Feb 22 10:54:26 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA21245; Thu, 22 Feb 96 13:18:01 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Thu, 22 Feb 1996 09:54:30 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id JAA01679 (8.6.10/2.2); Thu, 22 Feb 1996 09:54:28 +0100 Received: by daphnis.cs.kun.nl id JAA10362 (8.6.10/2.1); Thu, 22 Feb 1996 09:54:26 +0100 Date: Thu, 22 Feb 1996 09:54:26 +0100 Message-Id: <199602220854.JAA10362@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: CFP: Hawaii Intl Conf: ENGINEERING COMPLEX COMPUTER SYSTEMS From: broggi@Verdi.Eng.UniPR.IT (Alberto Broggi) Should you receive multiple copies of this call-for-papers, please accept my apologies. If you maintain a list of call-for-papers, please add this to your list. ============================================================================== CALL FOR PAPERS * ENGINEERING COMPLEX COMPUTER SYSTEMS * Thirtieth Annual HAWAII INTERNATIONAL CONFERENCE ON SYSTEMS SCIENCES HICSS - 30 Maui, Hawaii, January 7-10, 1997 Papers are invited for the Minitrack on ENGINEERING COMPLEX COMPUTER SYSTEMS as part of the Advanced Technology track at the Hawaii International Conference on System Sciences (HICSS). 1. PURPOSES Modern computer systems and applications embody many different characteristics and properties that are currently addressed, studied, and optimized independently. Nevertheless, although it is of basic importance to focus on these aspects independently, as a whole these properties feature a complex interrelationship, and thus a higher-level view of the complete project becomes mandatory. While perhaps some of the earlier computer systems could be described, designed and implemented with a particular focus on one objective (such as fault-tolerance or timeliness), or using a single method (such as Structured Programming), it is very questionable whether such modern and future applications can be. Nowadays almost all electronic products are becoming more and more software based: complex computer systems are becoming common in many sectors, such as manufacturing, communications, defense, transportation, aerospace, hazardous environments, energy, health care, etc. These systems feature a number of different characteristics (such as distributed processing, heterogeneous computational paradigms, high speed networks, novel bus systems, or special-purpose hardware enhancements in general) and performance requirements (such as real-time behavior, fault tolerance, security, adaptability, development time and cost, long life concerns). The concurrent satisfaction of the systems requirements have a considerable impact on the hardware characteristics and vice-versa. The analysis of the complete project, as a whole, is a major point in the design of the computer system itself and plays a basic role throughout the entire system life. The ECCS Minitrack will bring together industrial, academic, and government experts from these various disciplines, to determine how the disciplines' problems and solution techniques interact within the whole system. Researchers, practitioners, tool developers and users, and technology transition experts are all welcome. 2. ADDRESSED TOPICS: Papers are solicited on all major aspects of ECCS including specifying, designing, prototyping, building, testing, operating, maintaining, and evolving of complex computer systems, including: * Software engineering, re-engineering, reverse engineering * Complex real-time architectures, tools, environments and languages * AI and intelligent systems * Database and data management * Dependable real-time systems * Virtual reality, multimedia, real-time imaging * Algorithms, optimization and analysis * Analytical techniques * Megaprogramming, visual programming * Performance estimation, prediction and optimization * Prototyping and testing techniques * Formal methods and formal specification techniques * Hardware/software co-design * Communications, networking, mobile computing * Highly heterogeneous, distributed and parallel platforms * Case studies and project reports 3. MINITRACK COORDINATORS Alberto Broggi Alexander D. Stoyenko Dip. Ingegneria dell'Informazione Real-Time Computing Laboratory, CIS Universita` di Parma New Jersey Institute of Technology I-43100 Parma, Italy Newark, New Jersey 07102 USA Fax: +39 - 521 905723 Fax: (201) 596-5777 Email: broggi@CE.UniPR.IT Email: alex@vulcan.njit.edu Papers should be submitted to: Alberto Broggi HICSS'97 ECCS Coordinator Dipartimento di Ingegneria dell'Informazione Universita` di Parma, Viale delle Scienze I-43100 Parma, Italy 4. FURTHER AND UP-TO-DATE INFORMATION: Further information about the ECCS Minitrack are available at the following WWW address: http://WWW.CE.UniPR.IT/hicss/eccs If you wish to receive automatic updates about this event, please send Email to: broggi@CE.UniPR.IT indicating "ECCS" as subject. * INSTRUCTIONS FOR SUBMITTING PAPERS: 1. Submit 6 (six) copies of the full paper, consisting of 20 - 25 pages double-spaced including title page, abstract, references and diagrams directly to the minitrack coordinator. 2. Do not submit the paper to more than one minitrack. The paper should contain original material and not be previously published or currently submitted for consideration elsewhere. 3. Each paper must have a tile page which includes the title, full name of all authors, and their complete addresses including affiliation(s), telephone number(s) and e-mail address(es). 4. The first page of the paper should include the title and a 300-word abstract. * DEADLINES: March 15, 1996: Abstracts submitted to track coordinators for guidance and indication of appropriate content: authors unfamiliar with HICSS or those who wish additional guidance are encouraged to contact any coordinator to discuss potential papers. June 1, 1996: Full papers submitted to the appropriate track, or minitrack coordinator. August 31, 1996: Notification of accepted papers mailed to authors. October 1, 1996: Accepted manuscripts, camera-ready , sent to minitrack coordinators; one author from each paper must register by this time. November 15, 1996: All other registrations must be received. Registrations received after this deadline may not be accepted due to space limitation. * CONFERENCE PROCEEDINGS: The conference Proceedings are published and distributed by IEEE Computer Society. The ENGINEERING COMPLEX COMPUTER SYSTEMS Minitrack is part of the Advanced Technology. For more information on the Advanced Technology Track contact: Ralph H. Sprague, Jr. E-mail: sprague@hawaii.edu Voice: (808) 956-7082 Fax: (808) 956-9889 * OTHER CONFERENCE TRACKS There are three other majors tracks in the conference: Software, Digital Documents, and Information Systems. The Information Systems Track has several minitracks that focus on a variety of research topics in Collaboration Technology, Decision Support and Knowledge-Based Systems, and Organizational Systems and Technology. For more information on the other tracks, please contact: Software Technology Track: Hesham El-Rewini rewini@unocss.unomaha.edu Digital Documents Track: M. Stuart Lynn msylnn@ucop.edu Information Systems Track: Ralph H. Sprague, Jr. sprague@hawaii.edu Jay F. Nunamaker, Jr. nunamaker@bpa.arizona.edu Eileen Dennis (Track Assistant) edennis@uga.cc.uga.edu The purpose of HICSS is to provide a forum for the interchange of ideas, research results, development activities, and applications among academicians and practitioners in computer-based systems sciences. The conference consists of tutorials, advanced seminars, presentations of accepted papers, open forum, tasks forces, and plenary and distinguished guest lectures. There is a high degree of interaction and discussion among the conference participants because the conference is conducted in a workshop-like setting. For more information on the conference, please contact the conference coordinator: Barbara Edelstein College of Business Administration University of Hawai'i 2404 Maile Way Honolulu, HI 96822 Voice: (808) 956-3251 Fax: (808) 956-9685 E-mail: hicss@hawaii.edu or visit the World Wide Web page: http://www.cba.hawaii.edu/hicss From Frits.Vaandrager@cs.kun.nl Tue Feb 27 14:12:13 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA17046; Tue, 27 Feb 96 07:12:53 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Tue, 27 Feb 1996 13:12:15 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id NAA26796 (8.6.10/2.2); Tue, 27 Feb 1996 13:12:14 +0100 Received: by daphnis.cs.kun.nl id NAA19835 (8.6.10/2.1); Tue, 27 Feb 1996 13:12:13 +0100 Date: Tue, 27 Feb 1996 13:12:13 +0100 Message-Id: <199602271212.NAA19835@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: FMCAD96: Second Call For Papers From: srivas +-------------------------------------------------------+ | | | CALL FOR PAPERS | | | | The International Conference on | | | | Formal Methods in Computer-Aided Design: | | (FMCAD -- Successor to TPCD) | | | | Palo Alto, CA, USA | | 6 - 8. November 1996 | | | | In Cooperation with IFIP WG 10.5 | | CO-SPONSORED BY | | Hewlett-Packard Company, Cadence Berkeley Labs, | | Synopsys Inc., and LSI Logic Corporation | | | +-------------------------------------------------------+ FOCUS AND OBJECTIVES ==================== International Conference on Formal Methods in Computer-Aided Design '96 (FMCAD '96) is a forum for presenting state-of-the-art tools and techniques based on formal methods for computer-aided design of hardware. The location and the industrial sponsorship of the conference provide a unique opportunity for researchers in the field to interact with engineers from the Silicon Valley semiconductor and CAD companies. The objective is to cover all relevant formal aspects of work in computer-aided system design including verification, synthesis and testing. A special focus of this conference will be on the integration of complementary techniques and tools. The conference, will cover original research in this area, as well as case studies, technology transfer, and other practical experiments. It is intended to publish the Proceedings in time for distribution at the conference in the Springer LNCS series. Specific technical areas of FMCAD '96 include, but are not limited to: * New hardware verification techniques based on theorem proving, state exploration, model-checking, and BDDs * Correct by construction approaches to hardware design, such as synthesis and transformation * Hybrid approaches that integrate synthesis and verification or different verification techniques * Integration of formal methods with CAD tools, such as synthesis, simulation, and design exploration * Formal verification techniques for hardware description languages, such as VHDL, Verilog * Case studies and application of formal methods in industry This conference is a sequel in a series of IFIP WG 10.2/10.5 sponsored conferences with similar themes that have been most recently held in 1992 and 1994 under the banner ``Theorem Provers In Circuit Design.'' The intended audience includes workers in the field of hardware verification and synthesis as well as practising digital designers with an interest in formal methods. The conference will include contributed research papers, invited talks, tutorials, and tool demonstrations. INVITED SPEAKERS ================ (1) David Dill, Stanford University, USA (2) Kurt Keutzer, Synposys Inc., USA (3) J S. Moore, Computational Logic Inc., USA PAPERS: 15 page, 11-point limit with abstract, containing original research in sufficient detail to assess its merits and relevance. Simultaneous submission to other conferences or journals and submission of previously published material are not allowed. TUTORIALS: 4 page abstract, 15 page, 11-point for final. We encourage presentations of tools on a suitable set of completely worked out examples. Submit in electronically self-contained Postscript to: fmcad96@csl.sri.com. Email submission is strongly encouraged for speeding up the reviewing process. When this is not possible, send seven hard-copies to: PAPERS TUTORIALS -------------- -------------- Mandayam Srivas Albert Camilleri Re: FMCAD '96 Re: FMCAD '96 SRI International (EL-262) HEWLETT-PACKARD COMPANY M/S 5596 333 Ravenswood Avenue 8000 FOOTHILLS BOULEVARD Menlo Park, CA 94025, USA ROSEVILLE CA 95747-5596, USA Email: srivas@csl.sri.com Email: ac@hprpcd.rose.hp.com Tel: +1 415-859-6136 Tel : +1 916 785 8488 Fax: +1 415-859-2844 Fax : +1 916 785 3096 Please direct all paper and program inquiries to fmcad96@csl.sri.com. Registration questions may be directed to vijay@lsil.com. For more information see our World Wide Web home page at http://www.csl.sri.com/FMCAD96. IMPORTANT DATES: Submission deadline: April 15, 1996 Notification of acceptance: June 17, 1996 Proceedings version of accepted papers due: July 15, 1996 ORGANIZERS: Program Chair: Mandayam Srivas, SRI International, USA Tutorials Chair: Albert Camilleri, Hewlett Packard Company, USA Registration Chair: Vijay Nagasamy, LSI Logic Inc., USA PROGRAM COMMITTEE: D. Borrione (TIMA, France) R. Brayton (University of California, Berkeley, USA) R. Bryant (CMU, USA) R. Camposano (Synposys Inc., USA) L. Claesen (IMEC, Belgium) E. Clarke (CMU, USA) C. Delgado Kloos (Universidad Politecnica de Madrid, Spain) M. Fujita (Fujitsu Labs, USA) S. German (IBM, Yorktown Heights, USA) M. Gordon (University of Cambridge, UK) O. Grumberg (Technion, Haifa, Israel) W. Hunt (Computational Logic, Inc., USA) S. Johnson (University of Indiana, USA) R. Kumar (FZI, Karlsruhe, Germany) M. Leeser (Northeastern University, USA) P. Loewenstein (Sun Microsystems, USA) K. McMillan (Cadence Berkeley Lab, USA) C. Seger (Intel, Oregon, USA) J. Staunstrup (Technical University, Denmark) V. Stavridou (Queen Mary and Westfield College, UK) P.A. Subrahmanyam (AT&T, USA) J. Van Tassel (Texas Instruments, USA) From Frits.Vaandrager@cs.kun.nl Tue Feb 27 14:18:12 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA17170; Tue, 27 Feb 96 07:18:49 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Tue, 27 Feb 1996 13:18:14 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id NAA27046 (8.6.10/2.2); Tue, 27 Feb 1996 13:18:13 +0100 Received: by daphnis.cs.kun.nl id NAA19857 (8.6.10/2.1); Tue, 27 Feb 1996 13:18:12 +0100 Date: Tue, 27 Feb 1996 13:18:12 +0100 Message-Id: <199602271218.NAA19857@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Third Dutch Specification Day (21 March): Final Program From: Rom Langerak Hereby you are cordially invited to attend the Dutch Specification Day to be held on Thursday 21 March at the University of Twente, Enschede. Below you find the program; please accept our apologies if you receive multiple copies of this announcement. ---------------------------------------------------------------------------- THIRD DUTCH SPECIFICATION DAY 21 March 1996, University of Twente ---------------------------------------------------------------------------- This event will be organised for the third time; the first Specification Day was held on 25 June 1993 (TUE/KUB), the second on 19 October 1994 (TUE). The theme of these days is formal specification in computer science. Both formal techniques and their application in practice are addressed. This initiative is supported by the research schools IPA (Institute for Programming science and Algorithmics) and SIKS (School for Information and Knowledge Systems), and the research institute CTIT (Centre for Telematics and Information Technology). The program features four presentations by invited speakers. Material relevant to the presentations will be handed out. The program (you find some abstracts at the end of this announcement): THURSDAY 21 MARCH ----------------- 10.00 - 10.30 Welcome, coffee 10.30 - 11.30 Leslie Lamport (DEC Research): Specifying Systems: Some Impious Platitudes 11.30 - 12.30 Muffy Thomas (University of Glasgow): Formal Specification and Analysis in Safety-Critical Systems 12.30 - 13.45 Lunch 13.45 - 15.45 Jean-Raymond Abrial (Independent consultant and researcher): Formal construction of the architecture of a software system, a case study with B. 15.45 - 16.15 tea/coffee break 16.15 - 17.00 Klaas Wijbrans (CMG): The BOS project: practical experiences with formal specification. ---------------- Place: University of Twente, Enschede: "Collegezalencomplex" CC4 (this will be indicated from the main entrance of the campus) Costs: fl 35,- to cover lunch, coffee breaks and handouts. To be paid cash at the beginning of the specification day. Registration : We kindly request you to register in advance by e-mail, before 11 March 1996, by sending the form below to the following e-mail address: langerak@cs.utwente.nl This is also the address to write to if you have any questions. Looking forward to welcoming you on 21 March, the organizers, Peter Apers Ed Brinksma ------------------------------------------------------------------ ------------------------------------------------------------------ THIRD DUTCH SPECIFICATION DAY 21 March 1996, University of Twente *** Registration Form *** Name: Affiliation: e-mail address: Please specify dietary restrictions for lunch, if any: ------------------------------------------------------------------- ABSTRACTS: Specifying Systems: Some Impious Platitudes ------------------------------------------- (by Leslie Lamport) A view of formal specification from a hot-air balloon positioned high above the center of TLA, providing some glimpses of neighboring territories. Formal Specification and Analysis in Safety-Critical Systems ------------------------------------------------------------ (by Muffy Thomas) How can formal specification and analysis be employed in the development of safety-critical systems? We look at some aspects of this question through 2 case studies based on the Therac-25 (a linear accelerator used for radiotherapy treatment). A a variety of formalisms and analysis techniques are employed, including process algebra (LOTOS), first order logic, modal logic, simulation, model checking and machine-assisted theorem proving. We conclude by considering how one might relate formal specification to issues of reliability, safety, and safety cultures in complex systems. Formal construction of the architecture of a software system, ------------------------------------------------------------- a case study with B. ------------------- (by Jean-Raymond Abrial) The problem that I address in this presentation is the formal design of a control system using B. The main goal is to make expicit the methodology that is used while analysing and constructing the system. I explore an approach in which specifying and designing are not clearly separated as is usually recommended. The idea is to make a "non-flat" specification using the technique of refinement as a means of gradually introducing the details of the problem. This departs of the well-known classical use of refinement which is often understood as a means of gradually introducing only the details of the implementation. Finally, we would like to investigate how the proposed architecture can "resist" some modifications of the external specifications imposed by the client. From Frits.Vaandrager@cs.kun.nl Tue Feb 27 22:30:34 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA26121; Tue, 27 Feb 96 15:31:11 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Tue, 27 Feb 1996 21:30:36 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id VAA08171 (8.6.10/2.2); Tue, 27 Feb 1996 21:30:35 +0100 Received: by daphnis.cs.kun.nl id VAA20519 (8.6.10/2.1); Tue, 27 Feb 1996 21:30:34 +0100 Date: Tue, 27 Feb 1996 21:30:34 +0100 Message-Id: <199602272030.VAA20519@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: FV Position at HP From: Albert Camilleri TO WHOM IT MAY CONCERN ====================== Please pass on the following. Appologies in advance to anyone receiving multiple copies of this announcement. ---------------------------------------------------------------------------- General Systems Lab - Hewlett-Packard Company, Roseville, California, USA Re: Formal Verification job openings. ---------------------------------------------------------------------------- The General Systems Laboratory of Hewlett-Packard is once again hiring verification engineers with skills and interests in Formal Verification. Successful applicants will join a small-but-growing team whose charter is to apply Formal Methods to a variety of computer system design problems. This is an opportunity to 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 3 years experience in formal verification. o Strong communication and teamwork skills. o Must be flexible and willing to work in areas other than Formal Methods. In addition to the above requirements, previous experience in some 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 Behavioural modeling. o Industrial use of Formal Methods. Successful candidates for this position will become members of an exciting lab team responsible for the definition, design, verification and testing of our leading edge Mid-Range Computer Servers and High-End Workstations. 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 1995 fiscal year with over $30 billion in total revenue, and is currently rated as the number one world-wide supplier of Unix Systems and the number two computer company world-wide. The company has enjoyed steady growth and no unprofitable quarters throughout its history. For immediate consideration, email your resume to: fvjobs@rosemail.rose.hp.com or post, quoting Job Ad #3558, to Hewlett-Packard Company Attn: Employment Response Center, MS 20AZ 3000 Hanover Street Palo Alto, CA 94304-1181 Hewlett-Packard is an equal employment opportunity employer dedicated to affirmative action and workforce diversity. ------------------------------------------------------------------------------ From Frits.Vaandrager@cs.kun.nl Wed Feb 28 23:35:26 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA19224; Wed, 28 Feb 96 16:36:03 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Wed, 28 Feb 1996 22:35:28 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id WAA26042 (8.6.10/2.2); Wed, 28 Feb 1996 22:35:27 +0100 Received: by daphnis.cs.kun.nl id WAA22507 (8.6.10/2.1); Wed, 28 Feb 1996 22:35:26 +0100 Date: Wed, 28 Feb 1996 22:35:26 +0100 Message-Id: <199602282135.WAA22507@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: FTRTFT '96 : e-mail submissions. From: Matz Kindahl A number of people have asked for information regarding electronic submissions and/or extensions of the deadline for FTRTFT '96. Contributors who wish to submit electronically are kindly asked to send an PostScript version of the paper to ftrtft96-submission@docs.uu.se, or at least an abstract, to reach us by March 4, and in addition submit 6 paper copies to reach the program co-chairman by March 8. Original CFP follows ---------------------------------------------------------------- Call for Papers FTRTFT'96 4th International School and Symposium Formal Techniques in Real Time and Fault Tolerant Systems Sept 9-10 (School) and Sept 11-13 (Symposium) 1996, Uppsala, Sweden OBJECTIVES Computer systems are becoming increasingly widespread in real-time and safety-critical applications. Such systems are characterized by the crucial need to manage their complexity in order to produce reliable designs. Formal techniques offer a foundation for systematic design of complex systems. They have beneficial applications throughout the engineering process, from the capture of requirements through specification, design, coding and compilation, down to the hardware which embeds the system into its environment. Their use may presuppose novel system architectures and design principles. The school and symposium are devoted to considering the problems and the solutions in safe system design, and to examining how well the use of advanced design techniques and formal methods for design, analysis and verification serves in relating theory to practical realities. This is the fourth in a line of International Schools and Symposia, previous were held at Warwick 1989, at Nijmegen 1992, and at L|beck 1994. Proceedings of these symposia are published as volumes 331, 571, and 863 in the LNCS series by Springer Verlag. SUBMISSIONS Paper Submissions are invited for the Symposium on the development and use of formal techniques and mathematical reasoning in design of real time, fault-tolerant and/or embedded systems, covering all stages from requirements analysis to hardware and/or software implementation. In addition to general topics, special themes of this symposium will be: * Verification Tools and/or Algorithms for Real Time and Fault Tolerant Systems * Tools and Algorithms Supporting Formal Methods * Requirements for and Verification of Safety-Critical Systems * Scheduling and Timing Constraints in Real Time Systems * Formal Methods for Real Time and Fault Tolerant Systems in Industrial Practice. * Fault Tolerance * Hybrid Systems * Synchronous Languages - their Theory and Tools * Case Studies in Application of Methods Six copies of a paper, not exceeding 20 double-spaced standard pages, accompanied by a one-page abstract should reach the program committee co-chair at the below address no later than March 1, 1996. Mailing addresses (postal, fax, and electronic) of corresponding author should be indicated on each copy. Notification of Acceptance by May 15. Final text by June 30. Accepted papers will be published in the LNCS series by Springer Verlag. TOOLS DEMONSTRATIONS Demonstrations of software tools that support formal approaches to the development of real time, fault-tolerant and/or embedded systems are invited for the school and symposium. Proposers should contact the Tools Demonstration Chair. VENUE School and Symposium will be held in the city of Uppsala (population ca. 140.000). Uppsala is located 70 km north of Stockholm and 35 km north of Stockholm Arlanda international airport. FOR MORE INFO Consult our WWW page at: http://www.docs.uu.se/ftrtft96/ PROGRAM COMMITTEE A. Burns (University of York), C. Dwork (IBM Almaden), T. Henzinger (Cornell University, Ithaca, N.Y.), H.Hansson (Uppsala University), J. Hooman (Eindhoven University of Technology), B. Jonsson (co-chair) (Uppsala University), M. Joseph (University of Warwick), B. Kurshan (AT&T/Bell Labs, New Jersey), K. Larsen (Aalborg University), N. Leveson (University of Washington), A. Mok (University of Texas, Austin), E.R. Olderog (University of Oldenburg), J. Parrow (co-chair) (Royal Inst. of Technology, Stockholm), Z. Peng (Linkvping University), A. Pnueli (Weizmann Inst., Rehovot), A.P. Ravn (DTU, Lyngby), W.-P. de Roever (University of Kiel), F. Schneider (Cornell University, Ithaca, N.Y.), J. Sifakis (IMAG-LGI, Grenoble), J. Torin (Chalmers University of Technology), J. Vytopil (Kath. University, Nijmegen), K.-E. Erzin (Lund University of Technology) ORGANIZING COMMITTEE Parosh Abdulla: Publicity Per Gunningberg: Local Organization Hans Hansson: Sponsorship Wang Yi: Tools Demonstrations STEERING COMMITTEE M. Joseph (University of Warwick), A. Pnueli (Weizmann Inst., Rehovot), H. Rischel (DTU, Lyngby), W.-P. de Roever (University of Kiel), J. Vytopil (Kath. University, Nijmegen) ADDRESSES Program Committee Co-Chair Tools Demonstration Chair Bengt Jonsson Wang Yi Uppsala University Uppsala University Dept. of Computer Systems Dept. of Computer Systems Box 325, S-751 05 Uppsala, Sweden Box 325, S-751 05 Uppsala, Sweden tel: + 46 18 - 183157 tel: + 46 18 - 183110 fax: + 46 - 18 - 550225 fax: + 46 - 18 - 550225 e-mail: bengt@docs.uu.se e-mail: yi@docs.uu.se From Frits.Vaandrager@cs.kun.nl Wed Feb 28 23:36:46 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA19259; Wed, 28 Feb 96 16:37:20 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Wed, 28 Feb 1996 22:36:47 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id WAA26062 (8.6.10/2.2); Wed, 28 Feb 1996 22:36:46 +0100 Received: by daphnis.cs.kun.nl id WAA22512 (8.6.10/2.1); Wed, 28 Feb 1996 22:36:46 +0100 Date: Wed, 28 Feb 1996 22:36:46 +0100 Message-Id: <199602282136.WAA22512@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: 2nd CfP: FORTE/PSTV'96 From: "FORTE-PSTV'96" ! Submission deadline: April 19, 1996 ------------------------------------------------------------------------ _____ ___ ____ _____ _____ ______ ____ _______ ___ ___ __ | ___/ _ \| _ \_ _| ____| / / _ \/ ___|_ _\ \ / ( ) _ \ / /_ | |_ | | | | |_) || | | _| / /| |_) \___ \ | | \ \ / /|/ (_) | '_ \ | _|| |_| | _ < | | | |___ / / | __/ ___) || | \ V / \__, | (_) | |_| \___/|_| \_\|_| |_____/_/ |_| |____/ |_| \_/ /_/ \___/ 2nd Call for Papers IFIP TC6/WG6.1 Joint International Conference on FORMAL DESCRIPTION TECHNIQUES for Distributed Systems and Communication Protocols, and PROTOCOL SPECIFICATION, TESTING, AND VERIFICATION Kaiserslautern, Germany, 8-11 October 1996 URL: http://www.informatik.uni-kl.de/aggotz/forte.pstv96 FORTE/PSTV'96 will address Formal Description Techniques (FDTs) applicable to Communication Protocols and Distributed Systems (such as Estelle, Lotos, SDL, ASN.1, TTCN, Z, Automata, Process Algebras, Logics). The conference will be a forum for presentation of the state of the art in theory, application, tools and industrialization of FDTs, and will provide an excellent orientation for newcomers. For the first time, the hitherto separate conferences FORTE and PSTV will be combined into a joint edition. Research papers and industrial usage reports as well as proposals for tutorials (advanced technology seminars), poster displays and tool demonstrations are solicited, particularly in the following areas: - FDT-based system and protocol - Extensions of FDTs engineering - Semantical foundations - Practical experience and case - Real-time and probability aspects studies - Protocol testing - FDT-application to distributed - Conformance testing, test selection systems, highspeed protocols, and test coverage multimedia protocols, mobile - Performance modeling and analysis communication, Intelligent - Quality of Service modeling and Networks, network management, analysis network security - Verification and validation - FDT-based implementation - Protocol synthesis - Corporate strategic and financial - Tools and tool support consequences of FDT use FORTE/PSTV'96 will start with one day of tutorials and advanced technology seminars, and will continue with three days of technical presentations. Tool presentations and poster displays will be possible throughout the conference. The conference will be held at the Dorint Hotel Kaiserslautern. Conference Chairperson: Reinhard Gotzhein (University of Kaiserslautern, D) Conference Organization Chairperson: Jan Bredereke (University of Kaiserslautern, D) Important dates: April 19, 1996 Submission deadline (for more details, see below) June 24, 1996 Notification of acceptance July 19, 1996 Camera-ready copy for final proceedings due Program committee: G. v. Bochmann (Univ. of Montreal, Canada), T. Bolognesi (CNUCE, Italy), J. Bredereke (Univ. of Kaiserslautern, Germany), E. Brinksma (Univ. of Twente, Netherlands), S. Budkowski (INT, France), A. Cavalli (INT, France), S. T. Chanson (Univ. of Science and Technology, Hong Kong), J. P. Courtiat (LAAS-CNRS, France), P. Dembinski (Academy of Science, Poland), W. Effelsberg (Univ. of Mannheim, Germany), U. Herzog (Univ. of Erlangen, Germany), T. Higashino (Univ. of Osaka, Japan), D. Hogrefe (Univ. of Berne, Switzerland), G. Holzmann (AT&T, USA), S. P. Iyer (NC State Univ., USA), J. Kroon (PTT Research, Netherlands), P. Ladkin (Univ. of Bielefeld, Germany), G. Leduc (Univ. of Liege, Belgium), S. Leue (Univ. of Waterloo, Canada), L. Logrippo (Univ. of Ottawa, Canada), J. de Meer (GMD FOKUS, Germany), E. Najm (ENST, France), J. Quemada (Technical Univ. of Madrid, Spain), H. Rudin (IBM, Switzerland), R. Tenney (Univ. of Massachusetts, Boston, USA), K. Turner (Univ. of Stirling, UK), S. T. Vuong (Univ. of British Columbia, Canada) 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/PSTV'96 Organization Committee or by World-Wide Web as described below. A cover letter naming a contact author (including postal and E-mail address) and indicating the preferred category (research paper or industrial 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 another conference or by a journal; furthermore it should state that, in case of acceptance, one of the authors will attend FORTE/PSTV'96 and present the paper. Authors may propose a list of Program Committee members whom they consider to be particularly qualified to review their submission. - Proposals for tool demonstrations (including hard- and software requirements) and poster displays. - Proposals for tutorials and advanced technology seminars. All submissions should be sent to Jan Bredereke. For further information: Jan Bredereke, University of Kaiserslautern, P.O. Box 3049, D-67653 Kaiserslautern, Germany, Tel.: +49 631 205-3426 (Reinhard Gotzhein), -3287 (Jan Bredereke), -2640 (Fax), E-mail: forte.pstv96@informatik.uni-kl.de To obtain additional information (Postscript copy of the Call for Papers, keyword list, etc.), you may also browse our World-Wide Web pages, the URL is http://www.informatik.uni-kl.de/aggotz/forte.pstv96 Expression of interest in FORTE/PSTV'96: If you are interested in FORTE/PSTV'96, please return the following information to the Conference Organization Chairperson (preferably by E-mail to forte.pstv96@informatik.uni-kl.de): Name (including title): ............................................... Affiliation: .......................................................... Address: .............................................................. Tel: ................ Fax: ............. Email: ....................... o I would like to receive further information about FORTE/PSTV'96 by MAIL or ELECTRONIC MAIL (please indicate), please put me on your mailing lists. o I intend to submit to FORTE/PSTV'96 a research paper / an industrial usage report / a proposal for a tool demonstration / a proposal 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: ........................................................... From Frits.Vaandrager@cs.kun.nl Wed Feb 28 23:38:06 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA19292; Wed, 28 Feb 96 16:38:42 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Wed, 28 Feb 1996 22:38:08 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id WAA26081 (8.6.10/2.2); Wed, 28 Feb 1996 22:38:07 +0100 Received: by daphnis.cs.kun.nl id WAA22517 (8.6.10/2.1); Wed, 28 Feb 1996 22:38:06 +0100 Date: Wed, 28 Feb 1996 22:38:06 +0100 Message-Id: <199602282138.WAA22517@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Post Doc Position From: sleue@swen.uwaterloo.ca (Stefan Leue) Post-Doc Position in Software Engineering Applications are invited for a one-year definite term Post-Doc position at the Department of Electrical and Computer Engineering of the University of Waterloo. The research of the candidate to fill the position should address the general area of graphical and visual specification methods in the context of object-oriented analysis and design methods for concurrent real-time systems. Candidates should have research experience and/or interest in most of the following areas: + Formal specification techniques for concurrent distributed systems. + Object-Oriented Software Engineering. + Visual specification techniques, in particular Message Sequence Charts. + CASE tools. + Specification of real-time requirements. An aptitude for programming and knowledge of C++ and/or Smalltalk are desirable. The research will be carried out in close cooperation with a leading Canadian software tool development company (ObjecTime Limited). To be considered for the position, candidates must have a PhD (or expect to receive one by the start date) in Computer Engineering, Computer Science or a closely related field, and a previous research record of high quality. The start date is flexible but preferably before July 1, 1996. Depending on the availability of funds, the position may be renewable. Interested candidates should send a cover letter, their C.V. plus names and postal as well as e-mail addresses of at least 2 references as soon as possible, preferably by e-mail, to: Stefan Leue Department of Electrical & Computer Engineering University of Waterloo Waterloo, Ontario N2L 3G1 Canada e-mail: sleue@swen.uwaterloo.ca tel.: +1 519 885 1211 or +1 519 888 4567, extension 5313 fax.: +1 519 746 3077 In accordance with Canadian immigration requirements, this advertisement is primarily directed to Canadian citizens and permanent residents. However, other applicants will be considered. This appointment is subject to the availability of funds. Further Information: The University of Waterloo is located in the Kitchener-Waterloo urban area (population appr. 300.000), some 120 km west of Toronto, in approximately equal distance from Lake Ontario, Lake Huron, Lake Erie and Georgian Bay. The Department of Electrical & Computer Engineering is one of the leading E&CE departments in Canada, with strong research activities in Software Engineering and Telecommunications. This advertisement also appears on the WWW page http://swen.uwaterloo.ca/~sleue/postdoc.html. From Frits.Vaandrager@cs.kun.nl Wed Feb 28 23:44:04 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA19375; Wed, 28 Feb 96 16:44:40 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Wed, 28 Feb 1996 22:44:05 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id WAA26132 (8.6.10/2.2); Wed, 28 Feb 1996 22:44:05 +0100 Received: by daphnis.cs.kun.nl id WAA22541 (8.6.10/2.1); Wed, 28 Feb 1996 22:44:04 +0100 Date: Wed, 28 Feb 1996 22:44:04 +0100 Message-Id: <199602282144.WAA22541@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: CAV'96: Accepted Papers From: Rajeev Alur Reply-To: alur@research.att.com CAV '96: Accepted Papers ======================== Regular Submissions: -------------------- Polynomial-time algorithms for testing probabilistic bisimulation and simulation C. Baier (Universit\"at Mannheim, Germany) Pushdown processes: games and model checking I. Walukiewicz (Aarhus University, Denmark) Module checking O. Kupferman (Bell Laboratories, USA), M.Y. Vardi (Rice University, USA) Symbolic verification of communication protocols with infinite state spaces using QDDs B. Boigelot (Universit\'e de Li\`ege, Belgium), P. Godefroid (Bell Laboratories, USA) Automatic translation of natural-language system specifications into temporal logic R. Nelken (Tel-Aviv University, Israel), N. Francez (The Technion, Israel) A partition refinement algorithm for the $\pi$-calculus M. Pistore (University of Pisa, Italy), D. Sangiorgi (INRIA Sophia-Antipolis, France) Verifying the SRT division algorithm using theorem proving techniques E.M. Clarke (Carnegie Mellon University, USA), S.M. German (IBM Watson Research Center, USA), X. Zhao (Carnegie Mellon University, USA) Verification of arithmetic circuits by comparing two similar circuits M. Fujita (Fujitsu Laboratories, USA) Saving space by fully exploiting invisible transitions H. Miller and S. Katz (The Technion, Israel) Using on-the-fly verification techniques for the generation of conformance test suites J.-C. Fernandez (INRIA/VERIMAG, France), C. Jard (CNRS, France), T. J\'eron (INRIA/IRISA, France), G. Viho (Universit\'e de Rennes I, France) Mechanically verifying a family of multiplier circuits D. Kapur and M. Subramaniam (SUNY Albany, USA) Atomicity refinement and trace reduction theorems E.P. Gribomont (Universit\'e de Li\`ege, Belgium) Verification of an audio protocol with bus collision using UPPAAL J. Bengtsson (Uppsala University, Sweden), D. Griffioen (CWI, The Netherlands), K. Kristoffersen and K.G. Larsen (Aalborg University, Denmark), F. Larsson, P. Pettersson, and W. Yi (Uppsala University, Sweden) Temporal verification by stepwise transformations L. de Alfaro and Z. Manna (Stanford University, USA) Powerful techniques for the automatic generation of invariants S. Bensalem (VERIMAG, France), Y. Lakhnech (Christian-Albrechts Universit\"at Kiel, Germany), H. Saidi (VERIMAG, France) Symbolic model checking using algebraic geometry G.S. Avrunin (University of Massachusetts at Amherst, USA) Analysis of timed systems based on time-abstracting bisimulations S. Tripakis and S. Yovine (VERIMAG, France) Model checking local properties of distributed systems F. Wallner and J. Esparza (Technische Universit\"at M\"unchen, Germany) Selective quantitative analysis and interval model checking: verifying different facets of a system S. Campos and E.M. Clarke (Carnegie Mellon University, USA), O. Grumberg (The Technion, Israel) Automated verification by induction with associative-commutative operators N. Berregeb, A. Bouhoula, and M. Rusinowitch (INRIA Lorraine, France) Verification of fair transition systems O. Kupferman (Bell Laboratories, USA), M.Y. Vardi (Rice University, USA) HORNSAT, model checking, verification, and games S.K. Shukla, H.B. Hunt III, and D.J. Rosenkrantz (SUNY Albany, USA) Automatic verification of parameterized synchronous systems E.A. Emerson and K.S. Namjoshi (The University of Texas at Austin, USA) A conjunctively decomposed boolean representation for symbolic model checking K.L. McMillan (Cadence Berkeley Labs, USA) Verifying systems with replicated components in Mur$\phi$ C.N. Ip and D.L. Dill (Stanford University, USA) Modular verification of SRT division H. Rue\ss, M.K. Srivas, N. Shankar (SRI International, USA) Protocol verification by aggregation of distributed actions S. Park and D.L. Dill (Stanford University, USA) Verifying safety properties of differential equations M.R. Greenstreet (University of British Columbia, Canada) Verifying invariants using theorem proving S. Graf and H. Saidi (VERIMAG, France) Deductive model checking H.B. Sipma, T.E. Uribe, and Z. Manna (Stanford University, USA) A platform for combining deductive with algorithmic verification A. Pnueli and E. Shahar (Weizmann Institute, Israel) Verifying continuous-time Markov chains A. Aziz (The University of Texas at Austin, USA), K. Sanwal (Bell Laboratories, USA), V. Singhal (Cadence Berkeley Labs, USA), R.K. Brayton (University of California at Berkeley, USA) Tool and Project Submissions: ----------------------------- Verification by behavior abstraction: a case study of service interaction detection in intelligent telephone networks C. Capellmann (Deutsche Telekom, Germany), R. Demant, R. Galvez-Estrada, F. Fatahi-Vanani, U. Nitsche, and P. Ochsenschl\"ager (GMD, Germany) Verification support environment F. Koob, M. Ullmann, and S. Wittmann (Bundesamt f\"ur Sicherheit in der Informationstechnik, Germany) The real-time graphical interval logic toolset L.E. Moser, P.M. Melliar-Smith, Y.S. Ramakrishna, G. Kutty, and L.K. Dillon (University of California at Santa Barbara, USA) Marrella: a tool for simulation and verification D. Ambroise (Universit\'e de Caen, France), B. Rozoy (Universit\'e de Paris XI, France) MDG tools for the verification of RTL designs Z. Zhou and X. Song (Universit\'e de Montr\'eal, Canada), F. Corella (Hewlett-Packard, USA), M. Langevin (GMD, Germany), E. Cerny and S. Tahar (Universit\'e de Montr\'eal, Canada) The FC2TOOLS set A. Bouali, A. Ressouche, V. Roy, and R. de Simone (INRIA Sophia-Antipolis, France) EVP: integration of FDTs for analysis and verification of communication protocols P.M. G\'omez and J.M.T. Linero (Universidad de M\'alaga, Spain) The state of SPIN G.J. Holzmann and D. Peled (Bell Laboratories, USA) Verifying the safety of a practical concurrent garbage collector G. Gonthier (INRIA Rocquencourt, France) Symbolic model checking E.M. Clarke (Carnegie Mellon University, USA), K.L. McMillan (Cadence Berkeley Labs, USA), S. Campos and V. Hartonas-Garmhausen (Carnegie Mellon University, USA) The Concurrency Factory: an integrated environment for specification, simulation, verification, and implementation of real-time concurrent systems R. Cleaveland (North Carolina State University, USA), P.M. Lewis, S.A. Smolka, and O. Sokolsky (SUNY Stony Brook, USA) The NCSU Concurrency Workbench R. Cleaveland and S.T. Sims (North Carolina State University, USA) CADP (C\AE SAR/ALD\'EBARAN Distribution Package): a protocol validation and verification toolbox J.-C. Fernandez, H. Garavel, A. Kerbrat, R. Mateescu, L. Mounier, and M. Sighireanu (INRIA/VERIMAG, France) The METAFrame'95 environment B. Steffen, T. Margaria, A. Cla\ss en, and V. Braun (Universit\"at Passau, Germany) VIS: a system for verification and synthesis R.K. Brayton, A. Sangiovanni-Vincentelli, A. Aziz, S.-T. Cheng, S. Edwards, S. Khatri, Y. Kukimoto, S. Qadeer, R.K. Ranjan, T.R. Shiple, G. Swamy, and T. Villa (University of California at Berkeley, USA), G.D. Hachtel, F. Somenzi, and A. Pardo (University of Colorado at Boulder, USA), S. Sarwary (Lattice Semiconductor, USA) STeP: deductive-algorithmic verification of reactive and real-time systems N. Bj\o rner, A. Browne, E. Chang, M. Col\'on, A. Kapur, Z. Manna, H.B. Sipma, and T.E. Uribe (Stanford University, USA) COSPAN R.H. Hardin (Bell Laboratories, USA), Z. Har'El (The Technion, Israel), R.P. Kurshan (Bell Laboratories, USA) PVS: combining specification, proof checking, and model checking S. Owre, S. Rajan, J.M. Rushby, N. Shankar, and M.K. Srivas (SRI International, USA) The Mur$\phi$ verification system D.L. Dill, A.J. Hu, C.H. Yang, A. Drexler, R. Melton, S. Park, C.N. Ip, and U. Stern (Stanford University, USA) From Frits.Vaandrager@cs.kun.nl Fri Mar 1 09:34:17 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA19078; Fri, 01 Mar 96 02:35:00 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Fri, 1 Mar 1996 08:34:19 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id IAA04676 (8.6.10/2.2); Fri, 1 Mar 1996 08:34:18 +0100 Received: by daphnis.cs.kun.nl id IAA25031 (8.6.10/2.1); Fri, 1 Mar 1996 08:34:17 +0100 Date: Fri, 1 Mar 1996 08:34:17 +0100 Message-Id: <199603010734.IAA25031@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: AMAST'96 Preliminary Program From: scollo@cs.utwente.nl (Pippo Scollo) ======================================================================= [With apologies if you get this announcement more than once. G. Scollo] ----------------------------------------------------------------------- o This announcement is also available via WWW or FTP, resp. at URL: WWW : http://www.cs.utwente.nl/data/amast/amast96/PrelProg.txt FTP : ftp://ftp.cs.utwente.nl/pub/doc/amast/amast96/PrelProg.txt o The registration forms will be sent soon. o A word-wide-web page containing information about the conference is reachable by URL: http://www.pst.informatik.uni-muenchen.de/amast96 e-mail: amast96-info@informatik.uni-muenchen.de ----------------------------------------------------------------------- ********************************************* * ***************************************** * * * * * * * * * * * FIFTH INTERNATIONAL CONFERENCE ON * * * * * * * * * * * * ALGEBRAIC METHODOLOGY * * * * * * * * AND * * * * * * * * SOFTWARE TECHNOLOGY * * * * * * * * AMAST '96 * * * * * * * ***************************************** * ********************************************* July 1-5, 1996 Ludwig-Maximilians-Universit"at Munich, Germany. Preliminary Program @@@@@@@@@@@@@@@@@@@@@@@ @ @ @ EDUCATION DAY @ @ @ @@@@@@@@@@@@@@@@@@@@@@@ MONDAY, JULY 1st, 1996 10.00 - 18.00 An experience with MEC in a real industrial project Andre Arnold University of Bordeaux, France Industrial Applications of ASF+SDF Arie van Deursen Techn. Univ. Eindhoven, The Netherlands Industrial Trials of Formal Specification John Fitzgerald University Newcastle upon Tyne, UK Using Heterogeneous Formal Methods in Distributed Software Engineering Education Bernd Kramer Fern-Universitat Hagen, Germany Applying Research Results in the Industrial Environment: The Case of the TRIO Specification Language Dino Mandrioli Politecnico di Milano, Italy Introducing Formal Methods to Software Engineers Through OMG's CORBA Environment and Interface Definition Language Sriram Sankar Sun Microsystems Laboratories, USA @@@@@@@@@@@@@@@@@@@@@@@ @ @ @ CONFERENCE SCHEDULE @ @ @ @@@@@@@@@@@@@@@@@@@@@@@ TUESDAY, JULY 2nd, 1996 @@@@@@@@@@@@@@@@@@@@@@@ 08.00-8.45 Registration 08.45-9.00 Opening 09:00-10:00 Invited Talk Classification Approach to Design Douglas Smith Kestrel Institute, Palo Alto, USA 10:00-10:15 Discussion 10:15-10:45 Coffee Break 10:45-12:15 Session 1: Theorem Proving Semantic Foundations for Embedding HOL in Nuprl D. J. Howe AT&T Bell Laboratories, Murray Hill Free Variable Tableaux for a Many Sorted Logic with Preorders A. Gavilanes, J. Leach, S. Nieva Univ. Complutense Madrid Automating Induction over Mutually Recursive Functions D. Kapur, M. Subramaniam University at Albany, New York 12:15-13:45 Lunch 13:45-15:15 Session 2: Algebraic Specification Pushouts of Order-Sorted Algebraic Specifications A. E. Haxthausen and F. Nickl The Technical University of Denmark, Lyngby and sd&m, M"unchen A Formal Framework for Modules with State D. Ancona and E. Zucca UniversitaB Object-Oriented Implementation of Abstract Data Type Specifications R. Hennicker and C. Schmitz Ludwig-Maximilians-Universit"at M"unchen and Universit"at T"ubingen 15:15-15:30 Coffee Break 15:30-16:30 System Demo Presentations SPECWARE: an Advanced Environment for the Formal Development of Complex Software Systems R. Juellig, Y. Srinivas, J. Liu Kestrel Institute, Palo Alto ASSPEGIQUE: An Integrated Specification Environment Providing Inter-Operability of Tools M. Bidoit*, C. Choppy** and F. Voisin*** LIENS, C.N.R.S. & Ecole Normale Supe'rieure,Paris*, IRIN, Universite' de Nantes & Ecole Centrale, Nantes**, LRI, C.N.R.S. & Universite' de Paris-Sud, Orsay*** Towards Integrating Algebraic Specification and Functional Programming: the Opal System K. Didrich, C. Gerke, W. Grieskamp, C. Maeder, P. Pepper Technische Universit"at Berlin InterACT: An Interactive Theorem Prover for Algebraic Specifications R. Geisler, M. Klar, F. Cornelius Technische Universit"at Berlin A new Proof-Manager and Graphic Interface for the Larch Prover F. Voisin LRI, C.N.R.S. & Universite' de Paris-Sud, Orsay TERSE: A Visual Environment for Supporting Analysis, Verification and Transformation of Term Rewriting Systems N. Kawaguchi, T. Sakabe, Y. Inagaki Nagoya University 16:30-16:45 Coffee Break 16:45-18:15 Session 3: Concurrent and Reactive Systems On the Completeness of the Equations for the Kleene Star in Bisimulation Wan Fokkink Utrecht University An Equational Axiomatization of Observation Congruence for Prefix Iteration L. Aceto and A. Ingolfsdottir Alborg University Finite Axiom Systems for Testing Preorder and De Simone Process Languages I. Ulidowski Kyoto University WEDNESDAY, JULY 3rd, 1996 @@@@@@@@@@@@@@@@@@@@@@@@@@ 08:30-09:30 Invited Talk Constructive Semantics of Esterel: From Theory to Practice Gerard Berry Centre de Math. Appl., Sophia Antipolis, France 09:30-09:45 Discussion 09:45-10:15 Coffee Break 10.15-12:15 Session 4: Program Verification Using Ghost Variables to Prove Refinement M. Marcus and A. Pnueli Weizmann Institute of Science, Rehovot Tracing the Origins of Verification Conditions R. Fraer INRIA Sophia Antipolis, France Preprocessing for Invariant Validation E. P. Gribomont University of Lie`ge Formal Verification of SIGNAL Programs: Application to a Power Transformer Station Controller M. Le Borgne*, H. Marchand*, E. Rutten*, M. Samaan** IRISA/INRIA,Rennes*, EDF/DER, EP, dept. CCC, Chatou** 12:15-13:45 Lunch 13:45-14:45 Invited Talk The Discrete Time Toolbus J.A. Bergstra and P. Klint CWI Amsterdam, The Netherlands 14:45-15:00 Discussion 15:00-15:15 Coffee Break 15:15-16:15 System Demo Presentations The TOOLBUS Coordination Architecture P. Klint University of Amsterdam A Demonstration of ASD: The Action Semantic Description Tools A. van Deursen and P. D. Mosses Eindhoven University of Technology and Aarhus University Using Occurrence and Evolving Algebras for the Specification of Language-Based Programming Tools Arnd Poetzsch-Heffter Technische Universit"at M"unchen ECHIDNA: A System for Manipulating Explicit Choice Higher Dimensional Automata R. Buckland and M. Johnson Macquarie University Verification using PEP S. Melzer, S. Romer, J. Esparza Technische Universit"at M"unchen The FC2TOOLS Set A. Bouali, A. Ressouche, V. Roy, R. de Simone INRIA Sophia-Antipolis & Ecole des Mines de Paris 16:15-16:30 Coffee Break 16:30-18:00 Session 5: Concurrent and Reactive Systems A Study on the Specification and Verification of Performance Properties Xiao Jun Chen*, F. Corradini**, R. Gorrieri*** Universita` "La Sapienza", Roma*, University of Sussex, Brighton**, Universita` di Bologna*** Symbolic Bisimulation for Timed Processes M. Boreale Istituto per L'Elaborazione dell'Informazione-C.N.R.,Pisa Approximative Analysis by Process Algebra with Graded Spatial Actions Y. Isobe, Y. Sato, K. Ohmaki Electrotechnical Laboratory, Tsukuba THURSDAY, JULY 4th, 1996 @@@@@@@@@@@@@@@@@@@@@@@@ 08:30-09:30 Invited Talk Boolean Formalism and Explanations Eric C. R. Hehner University of Toronto, Canada 09:30-09:45 Discussion 09:45-10:15 Coffee Break 10.15-11:45 Session 6: Logic Programming and Term Rewriting Proving Existential Termination of Normal Logic Programs M. Marchiori University of Padova Programming in Lygon: An Overview J. Harland*, D. Pym**, M. Winikoff*** Royal Melbourne Institute of Technology, Melbourne*, University of London**, University of Melbourne*** Some Characteristics of Strong Innermost Normalization M. R. K. Krishna Rao Max-Planck-Institut fB 11.45-12.15 System Demo Presentations Programming in LYGON: A System Demonstration J. Harland*, D. Pym**, M. Winikoff*** Royal Melbourne Institute of Technology, Melbourne*, University of London**, University of Melbourne*** CtCoq: a System Presentation J. Bertot and Y. Bertot INRIA Sophia-Antipolis The TYPELAB Specification and Verification Environment F. W. von Henke, M. Luther, M. Strecker, M. Wagner Universit"at Ulm 12:15-13:45 Lunch 13:45-14:45 Invited Talk On the Emergence of Properties in Component-Based Systems J. L. Fiadeiro University of Lisbon, Portugal 14:45-15:00 Discussion 15:00-15:15 Coffee Break 15:15-16:15 System Demo Presentations Incremental Formalization B. Steffen, T. Margaria, A. Classen, V. Braun Universit"at Passau PROPLANE: A Specification Development Environment Jeanine Souquieres and Nicole Levy Universite' de Nancy A Logic-Based Technology to Mechanize Software Components Reuse Patrick Parot INRIA Le Chesnay TkGofer: A Functional GUI Library W. Schulte, T. Schwinn, T. Vullinghs Universit"at Ulm Object-oriented Design of a Class Library for a Metamodel based on Algebraic Graph Theory S. Erdmann and I. Classen Technische Universit"at Berlin 16:15-16:30 Coffee Break 16:30-18:00 Session 7: Algebraic and Logical Foundations Algebraic View Specification B. Paech Technische UniversitB Towards Heterogeneous Formal Specifications G. Bernot, S. Coudert, P. Le Gall Universite' d'Evry A Categorical Characterization of Consistency Results C. Baier and M. Majster-Cederbaum Universit"at Mannheim FRIDAY, JULY 5th, 1996 @@@@@@@@@@@@@@@@@@@@@@@@ 08:30-09:30 Invited Talk Algebraic Specification of Reactive Systems Manfred Broy Technische UniversitB 09:30-09:45 Discussion 09:45-10:15 Coffee Break 10.15-11:45 Session 8: Concurrent and Reactive Systems A Model for Mobile Point-To-Point Data-Flow Networks without Channel Sharing R. Grosu and K.Stolen Technische Universit"at M"unchen Coalgebraic Specifications and Models of Deterministic Hybrid Systems B. Jacobs CWI, Amsterdam A Bounded Retransmission Protocol for Large Data Packets J.F. Groote and J. van de Pol Utrecht University 11.45-12.15 System Demo Presentations Resolution of Goals with the Functional and Logic programming Language LPG: Impact of Abstract Interpretation Didier Bert, Kamel Adi, Rachid Echahed IMAG-LSR,CNRS, Grenoble Combining Reductions and Computations in ReDuX R. B"undgen and W. Lauterbach Universit"at T"ubingen Conditional Directed Narrowing S. Limet and P. Rety LIFO-Universite' d'Orleans 12:15-13:45 Lunch --------------------------------------------------------------------------- The registration forms will be sent soon. A word-wide-web page containing information about the conference is reachable by URL: http://www.pst.informatik.uni-muenchen.de/amast96 . e-mail: amast96-info@informatik.uni-muenchen.de From Frits.Vaandrager@cs.kun.nl Fri Mar 1 09:37:38 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA19096; Fri, 01 Mar 96 02:38:14 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Fri, 1 Mar 1996 08:37:39 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id IAA04716 (8.6.10/2.2); Fri, 1 Mar 1996 08:37:38 +0100 Received: by daphnis.cs.kun.nl id IAA25040 (8.6.10/2.1); Fri, 1 Mar 1996 08:37:38 +0100 Date: Fri, 1 Mar 1996 08:37:38 +0100 Message-Id: <199603010737.IAA25040@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Summary Petri net semantics for SDL From: bernd@informatik.uni-hildesheim.de (Bernd Grahlmann) Dear All, first of all `thank you' for the replies to my query concerning any kind of Petri net semantics for SDL. (Which means Specification Description Language) Of course I would like to offer a summary of the responses: Sorry, but before presenting it, I would like to give a statement to a question posed by some of you: There had been some questions whether or not the department of computer science at our university (Hildesheim) had already been closed by our government. It's right that our prime minister (of lower-saxony) Gerhard Schr"oder and our minister for agriculture (oops sorry) science and culture Helga Schuchardt want to close it (to come back to agriculture or whatever). They heard that politicians always have to do the opposite of the things they promissed. They promissed that education, qualification and technology is the most important thing for Germany (e.g. due to lack of agriculture). But, after being elected they instantly forgot about it. Now, they want to close the computer science department in Hildesheim! At the moment something about 200 persons are employed within the whole university. They want to cut 48.5, which means 25 percent (persons financed by third parties not included). They want that we believe the university will survive anyhow and that it is a good decision. No-one in the university believes it. Thus the whole !-) university is on strike for more than 3 weeks now. It is no usual strike! It is an active one. Students as well as staff and professors organized seminars on related topics. They analysed the political situation and they are organizing a lot of things: E.g. a 48 h non-stop lecture (always two in parallel). At the moment active strike means that there are courses, eventhough it is vacation. This means the whole university acts in solidarity. There is no official paper saying that the computer science department will be closed, so far. Our actions and particularly our arguments managed to convince at least a part of the public, more and more articles in newspapers, ... supported this progress. Thus, perhaps it is not to late to avoid the relapse to agriculture. (By the way nothing against agriculture, but it should not be the only thing :-) I would like to encourage everyone to send a fax to the responsible politicians: Nieders"achsisches Ministerium f"ur Wissenschaft und Kultur Hannover Frau Helga Schuchardt Fax: (+49) 0511 / 120 - 2393 For those interested in more details I can recommend the following WWW addresses (sorry, some of them are in german): http://www.uni-hildesheim.de/~azin0999/streik/Vermischtes/Summary-UK.html http://www.uni-hildesheim.de/~azin0999/streik/streik.html http://www.uni-hildesheim.de/~azin0999/streik/FaxAktionII/Aufruf.html http://www.informatik.uni-hildesheim.de/FB4/Institute/Informatik/satire_eng.html http://www.informatik.uni-hildesheim.de/FB4/Institute/Informatik/nahebeihannoverix.html OK, I hope you read it and you agree with me, that it has been worth mentioning it, even though this should not be a political forum. ******************************************************************* Here is the summary: 1. Stefan Leue did some work on `Specifying Real-Time Requirements for SDL Specifications - A Temporal Logic-Based Approach' for PSTV'95. You can get it via WWW: http://www.swen.uwaterloo.ca/~sleue By the way some parts of his Ph.D. are also dealing with SDL ;-) 2. There had been some hints to the work of Grabowski, Graubmann and Rudolph Jens Grabowski wrote a master thesis: `Statische und dynamische Analysen f"ur SDL-Spezifikationen auf der Basis von Petri-Netzen und Sequence-Charts.' http://iamwww.unibe.ch:80/~grabowsk/ e-mail: grabowsk@iam.unibe.ch (Uni Bern or TH Luebeck ???) The work was supervised by Dr. E. Rudolph (TU Muenchen), Prof. Valk and Prof. Hogrefe (Siemens ZFE in M"unchen). 3. Ursula Hinkel is working within a project dealing with Verification of SDL specification. They developped a stream-based semantics based on ancient work of Prof. Broy. e-mail: hinkel@informatik.tu-muenchen.de (TU Muenchen) 4. Nisse Husberg is working on a SDL front-end for PROD. (Helsinki University of Technology) 5. There is a Licentiate of Technology Thesis at Helsinki Univ. of Tech on it, by Markus Lindqvist, dated something like 1989 or so. A paper on it was written to the SDL Forum about that time, perhaps with Esa Kettunen. 27. F. De Cindio, G. Lanzarone, A. Torgano: A Petri Net Model of SDL. Proceedings of the 5th European Workshop on Application and Theory of Petri Nets, Aarhus 1984, 272-289. 68. M. Lindqvist: Translation of the Specification Language SDL into Predicate/Transition Nets. Licentiate's Thesis, Helsinki University of Technology, Digital Systems Laboratory, 1987. (sorry for the disorder, but I really don't want to change Kurt Jensen's order :-) 69. Heinz Kabutz is working on the analysis of SDL models via Petri nets at the university of Capetown. e-mail: heinz@cs.uct.ac.za or better: kabutz@tlse.verilog.fr He did some performance analysis, covering special time-outs and FIFO queues. This work was presented at a conference in Warsaw (I hope that's right) last year. He is now working on an SDL editor for MS-Windows and Unix/Motif as a front-end for his master thesis. The mentioned work yielded the mentioned joint paper dealing wiht queueing Petri nets: @InProceedings{BK95a, author = "Bause,F. and Kabutz,H. and Kemper,P. and Kritzinger,P.", title = "{SDL} and {P}etri Net performance analysis of Communication systems", series = "IFIP", booktitle = "Proc. 15th int. Symp Protocol Specification, Testing and Verification", year = 1995, publisher = "Chapman \& Hall" } Falko Bause: bause@ls4.informatik.uni-dortmund.de (Universitdt Dortmund) Peter Kemper: kemper@lamia.informatik.uni-dortmund.de (Universitdt Dortmund) 70. There was a hint by Mat Farrington (by the way he said that he loves our PEP tool (http://www.informatik.uni-hildesheim.de/~pep/HomePage.html ;-) that TORAS might deal with SDL. He suggested to ask Steffen Krotsch (steffen@spri.levels.unisa.edu.au) who's in the middle of doing a survey of Petri net tools and is well versed in "which tool does what". (University of South Australia) 71. There had been some hints on further papers by Markus Lindquist. Some as GMD papers. 72. At the University of Oldenburg there is some on-going work on giving an M-nets semantics to SDL. So far the work was done by Josef Tapken and Detlev Kuntze (two master thesis supervised by Hans Fleischhack - Hans.Fleischhack@arbi.informatik.uni-oldenburg.de) 72.1 There was a hint on a paper mapping Estelle to SPNs exists. Which is of course interesting. 72.2 Of course, there had been an error message by the mailing-list !-) 72.3 SDL might also mean: Standard Deontic Logic. 73. Gerard Memmi suggests: I remember CNET developed 8-10 years ago a semantics of SDL in Petri Nets. They even developed a tool. Contact Gerard Barberie CNET Issy-les_moulineaux or Prof. Claude Girault at U. Pierre et Marie Curie, Paris. 74. There had been some hints to work done at the Humboldt Universit"at zu Berlin www.informatik.hu-berlin.de/~edimitro/SDL_TN.html www.informatik.hu-berlin.de/Institut/struktur/systemanalyse/SITE/SDL-tools.html Evgeni Dimitrov uses extended Petri nets (time & data aspects) for an SDL semantics and for verification of SDL specifications. They are working on an SDL development environment: The SITE-Tool. email: edimitro@informatik.hu-berlin.de 75. Simon Moerks wrote: At the Department of Information Technology here at Technical University of Denmark we are currently working on a paper on real-time semantics for SDL. The paper is based on my master's thesis, which uses an interval logic (Duration Calculus) for giving semantics for SDL. The approach is NOT verification, but merely to clarify "what is the meaning of an SDL specification?", and to point out some "wooly" points of the CCITT description of SDL. I'm not sure whether you'll find it of any use, but a PS-file of the thesis can be found at: http://www.it.dtu.dk/~sm/publications.html E-mail: sm@it.dtu.dk Thanks to everyone who helped. And sorry for the somehow unusual way of presenting the summary, Bernd Grahlmann ********************************************************************* Bernd Grahlmann Universit"at Hildesheim Dipl. Inform. Institut f"ur Informatik Telefon (+49) 05121 / 883 -760 /-740 Samelsonplatz 1 Telefax (+49) 05121 / 860 475 D-31141 Hildesheim bernd@informatik.uni-hildesheim.de http://www.informatik.uni-hildesheim.de/~bernd/HomePage.html ********************************************************************* From Frits.Vaandrager@cs.kun.nl Fri Mar 1 09:39:39 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA19112; Fri, 01 Mar 96 02:40:38 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Fri, 1 Mar 1996 08:39:40 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id IAA04740 (8.6.10/2.2); Fri, 1 Mar 1996 08:39:40 +0100 Received: by daphnis.cs.kun.nl id IAA25046 (8.6.10/2.1); Fri, 1 Mar 1996 08:39:39 +0100 Date: Fri, 1 Mar 1996 08:39:39 +0100 Message-Id: <199603010739.IAA25046@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: TACAS'96/AIN'96 Final Programs: please circulate From: Tiziana Margaria __________________________________________________________ !!!!!! CALL FOR PARTICIPATION !!!!!! __________________________________________________________ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | TACAS '96 | | | | Second International Workshop on | | Tools and Algorithms | | for the Construction and Analysis of Systems | | | | March 27 - 29, 1996 | | Passau (Germany) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ together with the adjoint **************************************** * AIN'96 * * * * International Workshop on * * Advanced Intelligent Networks * * * * March 25 - 26, 1996 * * Passau (Germany) * **************************************** Final program, registration forms and local information on how to reach Passau are available per www under http://www.uni-passau.de/fmi/lehrstuehle/steffen/cfp/ EXTENDED DEADLINE for EARLY REGISTRATION: March 7th, 1996 . NOTE: a few extra slots for demos have been made available. To announce new demos, please send an e-mail to the Local Organizer (tiziana@fmi.uni-passau.de). Deadline: March 10th. From Frits.Vaandrager@cs.kun.nl Mon Mar 4 13:46:28 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA12487; Mon, 04 Mar 96 06:47:15 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 4 Mar 1996 12:46:30 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id MAA15763 (8.6.10/2.2); Mon, 4 Mar 1996 12:46:29 +0100 Received: by daphnis.cs.kun.nl id MAA00746 (8.6.10/2.1); Mon, 4 Mar 1996 12:46:28 +0100 Date: Mon, 4 Mar 1996 12:46:28 +0100 Message-Id: <199603041146.MAA00746@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: WPDRTS'96 From: wsindh@win.tue.nl (Dieter Hammer) CALL FOR PARTICIPATION 4TH INTERNATIONAL WORKSHOP ON PARALLEL AND DISTRIBUTED REAL-TIME SYSTEMS (WPDRTS) April 15, 16, 1996, Honolulu, Hawaii at The 10th IEEE International Parallel Processing Symposium (IPPS) Sponsors: The US NSWC, The US Army MICOM, Hollands Signaal The 4th WPDRTS will feature presentations that demonstrate original unpublished research pertaining to real-time systems that are parallel and/or distributed. The projects presented will represent experimental and commercial systems, their scientific and commercial applications, and theoretical foundations. Topics to be addressed in the paper presentations (as they relate to parallel and distributed real-time systems) include: -FAULT TOLERANCE -RUN-TIME SYSTEMS -ARCHITECTURE AND HARDWARE -MULTIMEDIA -COMMUNICATIONS AND NETWORKING -REAL-TIME DATABASES -ANALYSIS, VALIDATION AND SIMULATION -NEW PARADIGMS AND LANGUAGES -FORMAL METHODS -TOOLS AND ENVIRONMENTS -SYSTEMS ENGINEERING AND REENGINEERING -EMBEDDED SYSTEMS -REAL-TIME SIGNAL AND IMAGE PROCESSING -BENCHMARKING -SOFTWARE ARCHITECTURES -Ada 95 In addition to the paper presentations, the workshop will feature a Keynote Speech, a Panel Discussion, and an Invited Paper Session: KEYNOTE SPEECH: "Ada 95 for Real-Time, Distribution, and the World Wide Web," Speaker: Tucker Taft, Chief Scientist, Intermetrics, Inc.; Technical Director, Ada 9X Mapping/Revision Team PANEL DISCUSSION: "Benchmarking for Real-Time High Performance Computing," Moderator: Richard A. Games, MITRE INVITED PAPER SESSION: "New Paradigms for Parallel/Distributed Real-Time Computing," Organizers: Norman R. Howes, Institute for Defense Analyses, and Bo Sanden, George Mason University WPDRTS REGISTRATION: For complete registration details for IPPS '96 and WPDRTS, see the web site http://www.usc.edu/dept/ceng/prasanna/home.html Alternately, conference registration information can be obtained by calling (202) 728-0884. Hotel registration can be done by calling 1-800-782-9488, and reserving a room at the Sheraton Waikiki Hotel; be sure to ask for the CIEEE rate (for IPPS '96). PROGRAM CHAIRS: Dieter K. Hammer, Eindhoven Univ. of Technology, The Netherlands Heonshik Shin, Seoul National University, Korea Lonnie R. Welch, New Jersey Institute of Technology, USA PROGRAM VICE CHAIRS: Tadashi Ae, Hiroshima University, Japan Ricardo Bettati, Texas A&M University, USA D. Bhatt, Honeywell, USA Maarten Boasson, Hollands Signaal, The Netherlands Ray Clark, OSF, USA Loe Feijs, Philips Research, The Netherlands Borko Furht, Florida Atlantic University, USA Guenter Hommel, Technical University of Berlin, Germany Norman R. Howes, Institute for Defense Analyses, USA F. Jahanian, University of Michigan, USA Joerg Kaiser, GMD, Germany Yoshiaki Kakuda, Osaka University, Japan Arkday Kanevsky, MITRE, USA Bruce Lewis, Army MICOM, USA Michael W. Masters, Naval Surface Warfare Center, USA R. Rajkumar, CMU/SEI, USA P. Ramanathan, University of Wisconsin, USA Bo Sanden, George Mason University, USA Sang Son, University of Virginia, USA Kenji Toda, Electrotechnical Laboratory, Japan Mark Wilson, Naval Surface Warfare Center, USA Tomohiro Yoneda, Tokyo Institute of Technology, Japan ADVISORY COMMITTEE: Theodore Baker, Florida State University, USA Alok Choudhary, Syracuse University, USA Harry Crisp, NSWC, USA Flaviu Cristian, University of California, USA Wolfgang Halang, University of Hagen, Germany Robert D. Harrison, NSWC, USA Mathai Joseph, University of Warwick, U.K. Jan van Katwijk, Technical University of Delft, The Netherlands Gerard LeLann, INRIA, France Jane Liu, University of Illinois, USA Miroslav Malek, Humboldt University, Germany AL Mok, University of Texas at Austin, USA Jose L. Munoz, ARPA, USA Viktor K. Prasanna, University of Southern California, USA Mike G. Rodd, University of Wales Swansea, U.K. Karsten Schwan, Georgia Inst. of Tech., USA Kang G. Shin, University of Michigan, USA Behrooz Shirazi, University of Texas at Arlington, USA John A. Stankovic, University of Massachusetts, USA Mario Tokoro, Keio University, Japan Richard Volz, Texas A&M University, USA Stephanie White, Northrop/Grumman, USA Wei Zhao, Texas A&M University, USA Steve Zeigler, Rational Corp., USA PUBLICATION and PUBLICITY CHAIRS: David L. Andrews, University of Arkansas, USA Michael R. Olsem, Air Force Software Tech. Support Ctr., USA Antonio L. Samuel, Naval Surface Warfare Center, USA Bradley R. Swim, King Saud University, Saudi Arabia Jack Verhoosel, Telematic Research Center, The Netherlands ------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------ PROGRAM OVERVIEW ------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------ MONDAY APRIL 15, 1996 ------------------------------------------------------------------------------------------ 8:15-8:30 OPENING REMARKS ------------------------------------------------------------------------------------------ 8:30-9:30 KEYNOTE SPEECH: "Ada 95 for Real-Time, Distribution, and the World Wide Web," Tucker Taft, Chief Scientist, Intermetrics, Inc.; Technical Director, Ada 9X Mapping/Revision Team ------------------------------------------------------------------------------------------ 9:30-9:45 Break ------------------------------------------------------------------------------------------ 9:45-12:15 NEW PARADIGMS FOR PARALLEL AND DISTRIBUTED REAL-TIME SYSTEMS ------------------------------------------------------------------------------------------ 12:15-1:30 Lunch ------------------------------------------------------------------------------------------ 1:30-3:30 OPERATING SYSTEMS and ENVIRONMENTS ------------------------------------------------------------------------------------------ 3:30-4:00 Break ------------------------------------------------------------------------------------------ 4:00-5:20 SCHEDULING ------------------------------------------------------------------------------------------ 5:20-6:45 REAL-TIME DATABASES ------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------ TUESDAY APRIL 16, 1996 ------------------------------------------------------------------------------------------ 8:00-9:25 APPLICATIONS ------------------------------------------------------------------------------------------ 9:25-9:45 Break ------------------------------------------------------------------------------------------ 9:45-12:00 COMMUNICATION AND NETWORKING ------------------------------------------------------------------------------------------ 12:00-1:30 Lunch ------------------------------------------------------------------------------------------ 1:30-3:30 PANEL DISCUSSION: BENCHMARKING FOR REAL-TIME HIGH PERFORMANCE COMPUTING ------------------------------------------------------------------------------------------ 3:30-4:00 Break ------------------------------------------------------------------------------------------ 4:00-5:10 SPECIFICATION ------------------------------------------------------------------------------------------ 5:20-6:40 ANALYSIS AND VERIFICATION ------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------ DETAILED PROGRAM ------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------ Note: Each long paper is alloted 25 minutes in the schedule, and each short paper is alloted 15 minutes. ------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------ MONDAY APRIL 15, 1996 ------------------------------------------------------------------------------------------ 8:15-8:30 OPENING REMARKS ------------------------------------------------------------------------------------------ 8:30-9:30 KEYNOTE SPEECH "Ada 95 for Real-Time, Distribution, and the World Wide Web," Tucker Taft, Chief Scientist, Intermetrics, Inc.; Technical Director, Ada 9X Mapping/Revision Team ------------------------------------------------------------------------------------------ 9:30-9:45 Break ------------------------------------------------------------------------------------------ 9:45-12:15 NEW PARADIGMS FOR PARALLEL AND DISTRIBUTED REAL-TIME SYSTEMS Session Chair: Norman R. Howes, Institute for Defense Analyses, USA Title: Use Case Maps: A New Paradigm for Attributing Behaviour to System Architecture Authors: Ray Buhr Affiliation: Carleton Univ., Ottawa, Ontario, CA Title: MODELING REAL-TIME DISTRIBUTED SOFTWARE SYSTEMS Authors: Bran Selic Affiliation: ObjectTime, Ontario, CA Title: The Integration of Realtime Applications into the Global Command and Control System Authors: Shawn Butler, Defense Information Systems Agency and Kathleen Jordan, Institute for Defense Analyses Affiliation: DISA Title: IMPLEMENTING DISTRIBUTED REAL-TIME CONTROL SYSTEMS IN A FUNCTIONAL PROGRAMMING LANGUAGE Authors: Bjarne Decker and Claes Wikstrom Ericsson, Sweden, Title: Simulation-based Reactive Systems Authors: Maarten Boasson Affiliation: Signaalapparaten, Netherlands Title: Entity-life modeling in a distributed environment Authors: Bo Sanden Affiliation: GMU, Fairfax, VA ------------------------------------------------------------------------------------------ 12:15-1:30 Lunch ------------------------------------------------------------------------------------------ 1:30-3:30 OPERATING SYSTEMS and ENVIRONMENTS Session Chair: Klaus H. Ecker, Clausthal University of Technology, Germany [LONG PAPERS] (1) Title: Reengineering a Single Thread Embedded Missile Application onto a Parallel Processing Platform using MetaH Authors: McConnel, Lewis, and Gray Affiliation: Coleman Research and US Army MICOM Email: dmcconnell or lewis @sed.redstone.army.mil [SHORT PAPERS] (6) Title: An Environment for Incremental Development of Distributed Extensible Asynchronous Real-Time Systems Authors: C. Ames, S. Burleigh, H. Briggs and B. Auernheimer Affiliation: Jet Propulsion Lab. And Cal. State Univ., Fresno Title: A platform for real-time visualization and interactive simulation of large multimedia networks Authors: M. Chan, Pacifici, and Stadler Affiliation: Columbia University Title: POSIX Standards for Fault Management in a Real-Time Environment Authors: H. Roth and A. Chandra Affiliation: NSWCDD and IBM Title: Development and Validation of Network Clock Measurement Techniques Authors: K. O'Donoghue and T. Plunkett Affiliation: Naval Surface Warfare Center title : Inter- and Intra-Processor Synchronizations in Multiprocessor Real-Time Kernel authors : Hiroaki Takada and Ken Sakamura address : Dept. of Information Science, Faculty of Science, University of Tokyo 7-3-1, Hongo, Bunkyo-ku, Tokyo 113, Japan Behavior Analysis of Parallel, Real-Time and Embedded Systems for Monitoring and Optimizing Industrial Processes Francisco J. Suarez, Javier Garcia, Daniel F. Garcia Universidad de Oviedo, Gijon, Spain ------------------------------------------------------------------------------------------ 3:30-4:00 Break ------------------------------------------------------------------------------------------ 4:00-5:20 SCHEDULING Session Chair: Tadashi Ae, Hiroshima Univ., Japan [LONG PAPERS] (2) Solving Hard Real-Time Scheduling Problems on Multiprocessors Under Consideration of Communication Delays Klaus H. Ecker Technische Universitaet, Clausthal ecker@zaphod.in.tu-clausthal.de Earliest Deadline Message Scheduling with Limited Priority Inversion Antonio Meschi, Marco Di Natale, Marco Spuri Scuola Superiore S. Anna - Pisa marco@pegasus.sssup.it [SHORT PAPERS] (2) title : Importance-based Scheduling for Predictable Real-Time Systems using MART authors : Naoko Kosugi(1), Atsushi Mitsuzawa(1) and Mario Tokoro(2) address : 1. NTT Information and Communication Systems Labs. 1-2356 Take, Yokosuka 238-03, Japan 2. Dept. of Computer Science, Keio University 3-14-1 Hiyoshi, Kohoku-ku, Yokohama 223, Japan e-mail) nao@isl.ntt.jp, mituzawa@isl.ntt.jp, mario@mt.cs.keio.ac.jp title : Scheduling Periodic Distributed Hard Real-Time Tasks authors : Ashok Khemka and R.K. Shyamasundar address : Computer Science Group, Tata Institute of Fundamental Research Bombay-400 005, India e-mail) shyam@turing.tifr.res.in ------------------------------------------------------------------------------------------ 5:30-6:45 REAL-TIME DATABASES Session Chair: Maarten Boasson, Hollands Signaal, Netherlands [SHORT PAPERS] (5) Title: Issues in Designing Open Distributed Real-Time Databases Authors: R. Ginis and V. Fay Wolfe Affiliation: Univ. of Rhode Island Email: ginis@cs.uri.edu or wolfe@cs.uri.edu Title: Cooperative Transactions for Real-Time Databases Authors: H.-C. Kuo and G. Ozsoyoglu Affiliation: Case Western Reserve Univ. Email: kuo@alpha.ces.cwru.edu The Response Time Distribution in a Multi-Processor Database with Single Queue Static Locking Maarten Bodlaender Technische Universiteit, Eindhoven maarten@win.tue.nl title : Distributed Real-time Optimistic Concurrency Control Protocol authors : Kwok-wa Lam, Victor C.S.Lee, Kam-yiu Lam and Sheung-lun Hung address : Department of Computer Science, City University of Hong Kong 83 Tat Chee Avenue, Kowloon Tong, Hong Kong e-mail) cskylam@cityu.edu.hk title : On the Relaxed Serializability based on Consistent States for Real-Time Database Applications authors : Lee, Kyuwoong and Park Seog address : Database Research Lab, Dept. of CS, Sogang Univ., Seoul, Korea e-mail) Qlee@dblab.sogang.ac.kr, spark@dblab.sogang.ac.kr ------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------ TUESDAY APRIL 16, 1996 ------------------------------------------------------------------------------------------ 8:00-9:25 APPLICATIONS Session Chair: Mark Wilson, Naval Surface Warfare Center, USA [SHORT PAPERS] (4) Title: An embedded real-time SIMD processor array for image processing Authors: D. Andrews Affiliation: U. of Arkansas Email: dla@engr.uark.edu Title: Heterogeneous Parallel Architecture for Improving Signal Processing Performance in Doppler Blood Flow Instrumentation Authors: D. F. Garcia Nocetti, J. Martinez Flores, and J. Solano Gonzalez Affiliation: Univ. Nacional Autonoma de Mexico Email: fabian@uxdea1.iimas.unam.mx Title: Real-Time Multi-Processing Fuzzy Logic Adaptive Control Gas Tungsten Arc Welding System Authors: M. A. Austin Affiliation: United Technologies Corp. Pratt and Whitney Email: austinma@ehpw.com Title: PARSYNTH: A Case Study on Implementing a Real-Time Digital Audio Synthesizer Authors: B. Jeff and K. Schwan Affiliation: Clark Atlanta Univ. and Georgia Institute of Technology Email: byron@cc.gatech.edu or schwan@cc.gatech.edu [LONG PAPERS] (1) Title: Issues in Developing Real-Time Multimedia Applications for a Multiprocessor System Authors: P. A. Subrahmanyam and A. Sharma Affiliation: AT&T Bell Laboratories Research Email: subra@research.att.com ------------------------------------------------------------------------------------------ 9:25-9:45 Break ------------------------------------------------------------------------------------------ 9:45-12:00 COMMUNICATION AND NETWORKING Session Chair: Kenji Toda, Electrotechnical Laboratory, Japan [LONG PAPERS] (3) Title: Real-Time Interprocessor Communication for Point-to-Point Networks using Wormhole Routing Authors: S. Hary and F. Ozguner Affiliation: The Ohio State Univ. Email: hary@ee.eng.ohio-state.edu or ozguner@ee.eng.ohio-state.edu Title: Methodologies and Metrics for Evaluating Commercial Components for Real-Time Distributed Communications Authors: P. M. Irey IV and D. T. Marlow Affiliation: NSWCDD Email: pirey@relay.nswc.navy.mil title : User-level Real-Time Network System on Real-Time Mach authors : Tatsuo Nakajima(1), Hideyuki Tokuda(2) address : 1. JAIST 15 Asahidai, Tatsunokichi, Ishikawa, 923-12, JAPAN 2. Faculty of Environmental Information, Keio University e-mail) tatsuo@jaist.ac.jp, hxt@sfc.keio.ac.jp [SHORT PAPERS] (4) Title: Communication Issues in Heterogeneous Embedded Systems Authors: Liu, Kostis, and Prasanna Affiliation: Univ. of S. California Email: prasanna@halcyon.usc.edu Title: Using Asynchronous mode of FDDI to Support Real-Time Multimedia Communication Authors: Z. Wang, S. Davari, G. Collins and W. Zhao Affiliation: Univ. of Houston - Clear Lake and Texas A&M Univ. Email: Davari@CL.UH.EDU title : Timed Reachability Analysis Method for Communication Protocols with Time Intervals authors : Shin'ichi Nagano, Yoshiaki Kakuda and Tohru Kikuno address : Dept. of Information and Computer Sciences Faculty of Engineering Science, Osaka University Toyonaka-shi, Osaka 560, Japan e-mail) {s-nagano, kakuda, kikuno}@ics.es.osaka-u.ac.jp The time characteristics of cyclic service in Profibus M.Li, L. Stoeckli Swiss Federal Institute of Technology, Lausanne ming@litsun.epfl.ch ------------------------------------------------------------------------------------------ 12:00-1:30 Lunch ------------------------------------------------------------------------------------------ 1:30-3:30 PANEL DISCUSSION: BENCHMARKING FOR REAL-TIME HIGH PERFORMANCE COMPUTING Moderator: Richard A. Games, MITRE Panelists: Arlan L. Pool, Mercury Computer Systems John Drummond, NRaD Nick Kamenoff, Monmouth University Richard Metzger, Rome Laboratory Marc Campbell, Northrup-Grumman Corporation TBD, Concurrent Computer Corporation ------------------------------------------------------------------------------------------ 3:30-4:00 Break ------------------------------------------------------------------------------------------ 4:00-5:10 SPECIFICATION Session Chair: Yoshiaki Kakuda, Osaka University, Japan [LONG PAPERS] (2) Title: Viewcharts: A Behavioral Specification Language for Complex Systems Authors: A. Isazadeh, D. A. Lamb, and G. MacEwen Affiliation: Queen's Univ., Canada Specifying Parallel and Distributed Real-Time Systems in Z Peter Baumann and Karl Lermer Institut fuer Informatik der Universitaet Zuerich, Zuerich [SHORT PAPERS] (2) Title: Semantics for an Actor-Based Real-Time Language Authors: B. Nielsen and G. Agha Affiliation: Univ. of Illinois title : Modeling and Simulation of Distributed Real-Time Control Systems for Performance Evaluation authors : Young Cheol Cho(1), Nae Hyuk Chang(1), Sang Hwan Park(1), Wook Hyun Kwon(1) and Choo Young Yeol(2) address : 1. Dept. of Control and Instrumentation Enginerring, Seoul Nat'l Univ., Kwanak-gu, Seoul, 151-742, Korea 2. Technical Research Laboratories, Pohang Iron & Steel Company, PoHang, KyungBuk, Korea ------------------------------------------------------------------------------------------ 5:20-6:40 ANALYSIS AND VERIFICATION Session Chair: Guenter Hommel, Institut fuer Technische Informatik, Berlin University of Technology, Germany [LONG PAPERS] (2) Title: Monitoring and Assertion-Checking of Real Time Specifications in Modechart Authors: Brockmeyer, Jahanian, Heitmeyer and Labaw Affiliation: Univ. of Michigan and Naval Research Lab. title : An Engineering Approach to Decomposing End-to-End Delays on a Distributed Real-Time System authors : Manas Saksena(1) and Seongsoo Hong(2) address : 1. Dept. of Computer Science, Concordia University, 1455 De Maisonneuve Blvd, West Montreal Quebec H3G 1M8, Canada 2. School of Electrical Engineering, Seoul National University San 56-1 Shinlim-Dong, Kwanak-Ku, Seoul 151-742, Korea e-mail) manas@cs.concordia.ca, sshong@dandelion.snu.ac.kr [SHORT PAPERS] (2) Rare Event Simulation with an Adaptive "RESTART" Method in a Petri Net Modeling Environment Christian Kelling and Guenter Hommel Technische Universitaet, Berlin title : Automatic verification system based on automaton theory authors : Satoshi Yamane address : Shimane University, Nishikawatu 1060, Matue city, Japan e-mail) yamane@cis.shimane-u.ac.jp ------------------------------------------------------------------------------ From Frits.Vaandrager@cs.kun.nl Mon Mar 4 13:47:48 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA12501; Mon, 04 Mar 96 06:48:27 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 4 Mar 1996 12:47:50 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id MAA15793 (8.6.10/2.2); Mon, 4 Mar 1996 12:47:49 +0100 Received: by daphnis.cs.kun.nl id MAA00751 (8.6.10/2.1); Mon, 4 Mar 1996 12:47:48 +0100 Date: Mon, 4 Mar 1996 12:47:48 +0100 Message-Id: <199603041147.MAA00751@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: FMPPTA96: Call for Participation From: "Dominique Mery (Guest)" >>>>> >>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>> >>>>>>> CALL FOR PARTICIPATION First International Workshop on Formal methods for parallel programming: theory and applications FMPPTA'96 Preliminary Programme} ============= 15 April 1996 ============= to be held in conjunction with 10th International Parallel Processing Symposium IPPS'96 April 15-19, 1996 Sheraton Waikiki Hotel Honolulu, Hawaii Sponsored by IEEE Technical Computer Society Technical Committee on Parallel Processing Organization ============ Monday, 15. april 1996 8h30 - 9 h 00 Opening Address 10 h 00 - 12 h 00 Session 1 : Models of concurrency: new perspectives on formal methods A. Dekdouk and A. Schaff: Syntactic Refinement in a Timed Process Description Language (40 mn) J.-P. Bodeveix and M. Filali: Towards the Automatic Verification of Memory Protocols (40 mn) G. Utard and D. Cachera: Proving Data Parallel Programs: an Unifying Approach (40 mn) 1 h 30 - 3 h 30 Session 2 Distributed computing: specialized requirements and tools D. Ambroise and B. Rozoy: Marrella: A Tool for the Efficient Analysis of States Graphs (40 mn) M. Debbabi: From CML to a Model-based Concurrent Specification Language (40 mn) 4 h 00 - 6 h 00 Session 3: Panel session Industrial application of formal methods: tools and methodologies Chair: Catalin Roman Participants are currently contacted and the list will be given later. Topics ====== Formal methods are widely investigated in academic institutions and, more recently, used in industrial applications. By using mathematical notations, systems and their properties are precisely described, and therefore formal methods offer a way to achieve high level assurance of system quality. Formal methods combine methodological aspects in a formal framework. Although they appear to be difficult to apply, they are the only means of ensuring that an implementation is correct with respect to a given specification. The development of an algorithmic solution from a (formal) specification is carried out with the help of mathematical techniques and tools. The objectives of the workshop is to gather together people, both from academia and industry, who use and/or develop formal methods for parallel programming. There are potentially many different approaches to improving the environment for parallel programming. The (proof) tools and their user interface are fundamental to formalisation of the parallel programming process. Papers are invited in areas such as (but not limited to) the following: o methodological and theoretical aspects of parallel programming with respect to the development of parallel programs: specification, verification, refinement, compositionality, correctness, abstract interpretation, transformation, translation... o case studies developed with formal methods, particularly those with industrial background. o tools that support formal development of parallel programs, with emphasis on re-use and modularisation. o Examples of existing formal languages (for example, RAISE, UNITY, B, VDM, Z, SWARM, GAMMA, PVS, TLA, TLP, ISABELLE ...) and their application to parallel program problems. o Comparative studies of existing formal methods for parallel programming Suggested case studies for FMPPTA'96 ==================================== According to the initial proposal, we suggest two case studies to illustrate the use of formal methods for parallel programming: the Dirichlet problem and the Hopfield neural network. These two case studies were choosen because they are very different in placement policies and interconnection pattern. -The grid problem or the Dirichlet problem The Dirichlet problem, following Chandy and Taylor, deals with a cellular space. The state of each cell is represented by a floating-point number. The neighbors of a cell are those cells whose coordinates differ by at most one. The state of a cell varies over time and successive states are related by the transition function: o Boundary cells have constant states. o For non-boundary cells, the state at the current time t is the average of that of the neighbors at time t-1. -The development of Hopfield neural networks The Hopfield neural network example was inspired by M. M\"uller. A Hopfield network consists of N neurons, which are fully interconnected (each neuron is connected to all other neurons). Every neuron i has an activity value $a_i$, which is $-1$ or $+1$ in the discrete version. The state of the network is given by the vector $a = (a_1 \ldots a_N)$. Associated with each pair of neurons $(i,j)$, there is a fixed synaptic weight $w_{i,j} \in {\sf Real}$. The matrix $W = (w_{i,j})$ of synaptic weights is symmetric and has nonnegative diagonal elements, i.e, ($\forall i, j : w_{i,j} = w_{j,i} \wedge w_{i,i} > 0$). Each neuron $i$ has a fixed threshold value $s_i \in {\sf Real}$. At any given moment the activity value of any neuron $i$ may change, depending upon the state of the network. Namely, $a_i$ may change to $1$ if $\sum_{j=1}^{j=N} w_{i,j} a_j \geq s_i$, and to $-1$, otherwise. We assume that only one neuron state changes at a time and that if one or more neurons are able to change the activity value under this rule then one of them will eventually do so. General informations ==================== There is no special registration and the participants are invited to register for the conference IPPS'96. The proceedings will be available at the conference and authors who will be invited to submit their paper to the Parallel Programming Languages Journal. Any information can be obtained from: Dominique MERY Institut Universitaire de France ESIAL, Universit\'e Henri Poincar\'e - Nancy 1 CRIN URA 262 du CNRS BP 239 - 54506 VANDOEUVRE-LES-NANCY - FRANCE email: mery@loria.fr phone: (33) 83 59 20 14 fax: (33) 83 41 30 79 URL:http://www.loria.fr/~mery From Frits.Vaandrager@cs.kun.nl Wed Mar 6 21:42:20 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA02576; Wed, 06 Mar 96 14:43:11 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Wed, 6 Mar 1996 20:42:22 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id UAA05813 (8.6.10/2.2); Wed, 6 Mar 1996 20:42:20 +0100 Received: by daphnis.cs.kun.nl id UAA05077 (8.6.10/2.1); Wed, 6 Mar 1996 20:42:20 +0100 Date: Wed, 6 Mar 1996 20:42:20 +0100 Message-Id: <199603061942.UAA05077@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: new software verification e-mail list From: "Paul E. Black" This is to announce a new software verification e-mail list. I and a number of people I have met are interested in formal verification of software, but I have not found any newsgroups or e-mail lists devoted exclusively to it. To help, I created a mailing list where people can discuss issues related to proving programs. To join the list, send e-mail to majordomo@lal.cs.byu.edu The subject doesn't matter. The body must contain the line subscribe softverf You should get an automatic response within about an hour. Soon I will create some World Wide Web pages with references and resources related to software verification. -paul- Paul E. Black (p.black@ieee.org) Laboratory for Applied Logic, 3325 TMCB black@cs.byu.edu Brigham Young University voice: +1 801 378 8113 Provo, Utah 84602-6576 KC7PKT Web: http://lal.cs.byu.edu/people/black/black.html From Frits.Vaandrager@cs.kun.nl Wed Mar 6 21:43:50 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA02597; Wed, 06 Mar 96 14:44:28 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Wed, 6 Mar 1996 20:43:51 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id UAA05837 (8.6.10/2.2); Wed, 6 Mar 1996 20:43:51 +0100 Received: by daphnis.cs.kun.nl id UAA05083 (8.6.10/2.1); Wed, 6 Mar 1996 20:43:50 +0100 Date: Wed, 6 Mar 1996 20:43:50 +0100 Message-Id: <199603061943.UAA05083@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: New proof of completeness of Kozen's modal mu-calculus From: Dear Colleagues We would like to draw your attention to the existence of a simple proof of the completeness theorem for the finitary system of Kozen's mu-calculus by means of modal duality theory. This was an open problem for some time until it was solved by Walukiewicz (LICS 95). The following papers have bearing on the result: [1] S. Ambler, M. Kwiatkowska and N. Measor, Duality and the completeness of the modal mu-calculus, TCS vol 151 no 1, 3-27, November 1995. [2] M. Bonsangue and M. Kwiatkowska, Re-interpreting the modal mu-calculus, in: Modal Logic and Process Algebra, A. Ponse and M. van Rijke and Y. Venema (eds), CSLI Lecture Notes, 65-83, August 1995. [3] C. Hartonas, Stone duality for modal mu-logics, submitted. In [1] a completeness theorem for Kozen's calculus is stated for a larger class of models using non-standard interpretation. The result follows through a construction of a canonical model (a descriptive modal frame in the sense of Goldblatt). In [2] it is shown that the standard and non-standard interpretations coincide on the descriptive modal frames. Completeness for Kozen's calculus in the standard interpretation could have been deduced in [2] using the completeness result of [1]. In [3] the same observation as in [2] is independently made and it is clearly pointed out that this is sufficient to yield a new and strikingly simple completeness proof in the standard interpretation. Furthermore, [3] formulates a duality theory for a negation-free modal mu-calculus, expanding and improving on the construction in [1]. From the duality in [3] a completeness theorem for the negation-free calculus is also derived, explicitly stated and proven. Best wishes Marcello Bonsangue (marcello@cs.vu.nl), Chrysafis Hartonas (hartonas@cs.man.ac.uk), and Marta Kwiatkowska (M.Z.Kwiatkowska@cs.bham.ac.uk) From Frits.Vaandrager@cs.kun.nl Wed Mar 6 21:45:09 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA02635; Wed, 06 Mar 96 14:45:46 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Wed, 6 Mar 1996 20:45:11 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id UAA05891 (8.6.10/2.2); Wed, 6 Mar 1996 20:45:10 +0100 Received: by daphnis.cs.kun.nl id UAA05088 (8.6.10/2.1); Wed, 6 Mar 1996 20:45:09 +0100 Date: Wed, 6 Mar 1996 20:45:09 +0100 Message-Id: <199603061945.UAA05088@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: 2-nested simulation relation From: Sandeep Kumar Shukla Does any one know of any algorithm for deciding 2-nested simulation relation (defined by Groote and Vaandrager) between finite state processes? I have an algorithm that has time complexity quadratic in the size of the transition relations of the transition systems. I would appreciate if some one could point out to any other algorithm for this. I need to refer this to a survey I am writing now. Please email me at sandeep@cs.albany.edu Thanks in advance Sandeep K. Shukla From Frits.Vaandrager@cs.kun.nl Wed Mar 6 21:48:16 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA02676; Wed, 06 Mar 96 14:48:52 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Wed, 6 Mar 1996 20:48:18 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id UAA05971 (8.6.10/2.2); Wed, 6 Mar 1996 20:48:17 +0100 Received: by daphnis.cs.kun.nl id UAA05103 (8.6.10/2.1); Wed, 6 Mar 1996 20:48:16 +0100 Date: Wed, 6 Mar 1996 20:48:16 +0100 Message-Id: <199603061948.UAA05103@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: ERCIM Workshop From: d.latella@cnuce.cnr.it (Diego Latella) The first workshop of the ERCIM Working Group on Formal Methods for Industrial Critical Systems will be held in Oxford on March, 19th 1996 as a satellite meeting of the FME96 Symposium. Further information on the workshop is available at http://fdt.cnuce.cnr.it:8080/Home/fm-ercim/workshop.html on the working group is available at http://fdt.cnuce.cnr.it:8080/Home/fm-ercim/WgDescription.html Diego Latella ==================================================================== C.N.R. Istituto CNUCE - MODELS & METHODS FOR SW SYSTEMS group Via S. Maria 36 56126 Pisa - ITALY phone : +39 50 593230 fax : +39 50 (904051 - 904052) email : d.latella@cnuce.cnr.it or latella@sting.cnuce.cnr.it ;-) ;-) ;-) ;-) ;-) ;-) ;-) ;-) ;-) ;-) ;-) ;-) ;-) ;-) ;-) ;-) ;-) The difference between a thing that can break and a thing that can't is that when a thing that can't break breaks then it can't be fixed. Hitchhiker Guide to the Galaxy Book V From Frits.Vaandrager@cs.kun.nl Thu Mar 7 10:10:54 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA13552; Thu, 07 Mar 96 03:12:00 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Thu, 7 Mar 1996 09:10:58 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id JAA15585 (8.6.10/2.2); Thu, 7 Mar 1996 09:10:56 +0100 Received: by daphnis.cs.kun.nl id JAA06068 (8.6.10/2.1); Thu, 7 Mar 1996 09:10:54 +0100 Date: Thu, 7 Mar 1996 09:10:54 +0100 Message-Id: <199603070810.JAA06068@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: new book available From: god@graceland.ih.att.com I am pleased to announce that a revised version of my PhD thesis Partial-Order Methods for the Verification of Concurrent Systems -- An Approach to the State-Explosion Problem -- is now available as volume 1032 of Lecture Notes in Computer Science, Springer-Verlag, January 1996, ISBN 3-540-60761-7 (foreword by Pierre Wolper). Best Regards, Patrice Godefroid Bell Laboratories Lucent Technologies (formerly AT&T Bell Laboratories) Email: god@research.att.com Home Page: http://www.research.att.com/orgs/ssr/people/god From Frits.Vaandrager@cs.kun.nl Fri Mar 8 00:44:06 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA28039; Thu, 07 Mar 96 17:44:43 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Thu, 7 Mar 1996 23:44:08 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id XAA10802 (8.6.10/2.2); Thu, 7 Mar 1996 23:44:07 +0100 Received: by daphnis.cs.kun.nl id XAA07508 (8.6.10/2.1); Thu, 7 Mar 1996 23:44:06 +0100 Date: Thu, 7 Mar 1996 23:44:06 +0100 Message-Id: <199603072244.XAA07508@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Visiting Research Position From: Hans Hansson The Hard Real Time Systems research group at the Department of Computer Systems, University of Uppsala, Sweden, offers a position as VISITING RESEARCHER in REAL-TIME SYSTEMS The position is intended for two years. We seek applicants with a PhD, a research record and interest in one or several of the following areas: o Real-Time Scheduling (theory and practical applications) o Real-Time Networking o Execution Time Analysis o Methods for Real-Time System Software Development o Distributed Real-Time Systems o Real-Time System Analysis and Verification Additional information is available at http://www.docs.uu.se/docs/hrts/visres96.html Interested? Please send CV and state your interests and requirements by e-mail, fax or physical mail to Hans Hansson. ========================================================================== Hans Hansson E-mail: hansh@docs.uu.se tel@DoCS +46 18 183155 Dept. of Computer Systems (DoCS) switchb. +46 18 182500 P.O. Box 325 tel@home +46 18 429974 S-751 05 Uppsala fax@DoCS +46 18 550225 Sweden mobile +46 70 7527785 -------------------------------------------------------------------------- From Frits.Vaandrager@cs.kun.nl Mon Mar 11 10:00:54 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA21715; Mon, 11 Mar 96 03:01:37 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 11 Mar 1996 09:00:56 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id JAA28030 (8.6.10/2.2); Mon, 11 Mar 1996 09:00:55 +0100 Received: by daphnis.cs.kun.nl id JAA12991 (8.6.10/2.1); Mon, 11 Mar 1996 09:00:54 +0100 Date: Mon, 11 Mar 1996 09:00:54 +0100 Message-Id: <199603110800.JAA12991@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Re:New proof of completeness of Kozen's modal mu-calculus From: Chrysafis Hartonas In response to a request I have now made the paper (submitted) STONE DUALITY FOR MODAL MU-LOGICS (C. Hartonas) available by ftp ftp ftp.cs.man.ac.uk/pub/hartonas/sdmu.ps.gz The abstract of the paper is copied below. best wishes C. Hartonas (hartonas@cs.man.ac.uk) ***************************ABSTRACT*********************************** The modal $\mu$-calculi are extensions of propositional modal logics with least and greatest fixpoint operators. They have significant expressive power, being capable to encode properly temporal notions alien to standard modal systems. We focus here on Kozen's [1] $\mu$-calculi, both finitary and infinitary. Based on an extension of the classical modal duality to the case of positive modal algebras that we present, we prove a Stone-type duality for {\em positive} modal $\mu$-calculi which specializes to a duality for the Boolean modal $\mu$-logics. Thus we extend while also improving on results recently published by S. Ambler et al [2]. The main improvements are: (1) extension to the negation-free case, (2) a presentation of the algebraic models of the logics in a syntax-free manner, (3) an explicit duality for the case of the finitary $\mu$-calculus, missing in [2], and (4) a completeness result for the (negation-free or not) finitary modal $\mu$-calculus in the standard semantics outlined by Kozen. This has been an open problem for quite a while. Walukiewicz [3] reported a completeness theorem for this case but our proof is different and quite simpler, having also the advantage to work for the negation-free case as well. The duality presented here seems to be closer to Abramsky's duality theory as it is based on a more general duality for distributive lattices. And it has the potential to extensions for modal $\mu$-calculi on a non-classical (intuitionistic, relevant) propositional basis, yielding appropriate completeness theorems in the standard semantics. Completeness for the Kozen's finitary, Boolean modal $\mu$-calculus could have been obtained in [4] (in fact already in [2]) but this was not perceived. [1] D. Kozen, "Results on the Propositional $\mu$-calculus", TCS 27 (1988). [2] S. Ambler, M.Z.Kwiatkowska and N. Measor, "Duality and the completeness of the modal $\mu$-calculus", TCS 151 (1995). [3] I. Walukievicz, "Completeness of Kozen's Axiomatization of the Propositional $\mu$-calculus" LICS 1995. [4] M. Bonsangue and M.Z. Kwiatkowska, "Re-interpreting the modal $\mu$-calculus", in Modal Logic and Process Algebra, A.Ponse, M. de Rijke and Y.Venema (eds), CSLI Lecture Notes, 65-83, August 1995. From Frits.Vaandrager@cs.kun.nl Mon Mar 11 10:01:53 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA21736; Mon, 11 Mar 96 03:02:32 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 11 Mar 1996 09:01:56 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id JAA28066 (8.6.10/2.2); Mon, 11 Mar 1996 09:01:54 +0100 Received: by daphnis.cs.kun.nl id JAA12996 (8.6.10/2.1); Mon, 11 Mar 1996 09:01:53 +0100 Date: Mon, 11 Mar 1996 09:01:53 +0100 Message-Id: <199603110801.JAA12996@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Work-Shop From: Jean-Paul BAHSOUN \documentstyle{article} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% Call for Contributions %% %% ECOOP'96 workshop %% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \def\head{ {\bf CALL FOR CONTRIBUTIONS }\\[3mm] {\bf ECOOP'96 Workshop on }\\[4mm] {\Large \bf Proof Theory of Concurrent Object-Oriented Programming} \\ ~\\ {\bf Linz (Austria)}\\ Monday 8th July, 1996 } \def\body{ A one day workshop on {\em Proof Theory of Concurrent Object-Oriented Programming} is planned in the framework of the 10th European Conference on Object-Oriented Programming (ECOOP'96, Linz, Austria, 8-12 July 1996). \\ ~\\ There exists various approaches to model concurrent programming based-on logic. In this way, the use of logic for system development concerns the specification step but also the study of the operational aspects (through proof analysis and construction) of such development. In this context, we have to consider different logical systems for different uses of logic. Moreover, we can also consider concurrency from the both point of views: we want to reason and to specify systems where some concurrency aspects are involved and also to have some operational interpretations of concurrency into logic (focusing on the concept of proof). It seems clear that we have to identify and to study, in one hand, the role and the treatment of objects (representation, inheritance, modularity, communication, etc...) in this context, and in another hand, the interaction of work on proofs and concurrency with the Object-Oriented Programming paradigm. \sect{ TOPICS } This workshop aims to establish the state of art in the use of logic in interaction with concurrency and the use of objects. The objective is to provide an integrated forum for the presentation of research and the exchange of ideas and experiences in the topics concerned with proofs, concurrency and object-oriented programming (specification, proof development, etc...). \\ ~\\ Topics of interest, in this context, include (but are not restricted to): \items{ \item proof-theoretical foundations \item formalisms and logics to model concurrent systems and objects \item proofs and concurrency: modularity, composition, communication interaction and synchronization \item role and use of objects for concurrent programming and proving \item verification and reuse \item implementations and case studies } The scientific program will include invited talks, presentations of the accepted papers and discussion. \sect{ SUBMISSIONS } Authors are invited to send one copy of an extended abstract (in postscript format) ({\bf 8 pages}) to Jean-Paul Bahsoun ({\bf bahsoun@irit.fr}). Papers will be reviewed by peers, typically members of the program committee. The cover page should include a return mailing address and, if possible, an electronic mail address and a fax number. If at all possible, at the earliest possible moment a message containing the title of the paper, authors, abstract, keywords, and the address information outlined above should be sent by email to the corresponding address. } % PRACTICAL INFORMATION \def\pract{ \inform{ PTCOOP'96 }{ \names{ Organizing-Program Committee: } ~\\ Jean-Paul Bahsoun \\ \hspace*{15mm} (IRIT-CNRS, Toulouse) \\ ~\\ Jose Luis Fiadero \\ \hspace*{15mm} (University of Lisboa) \\ ~\\ Didier Galmiche \\ \hspace*{15mm} (CRIN-CNRS, Nancy) \\ ~\\ Akinori Yonezawa \\ \hspace*{15mm} (University of Tokyo) \\ } ~\\ ~\\ ~\\ \inform{ INFORMATION }{\cent{ \info {by email:} {bahsoun@irit.fr} ~\\ \info {or surface mail:} {Jean Paul Bahsoun \\ PTCOOP'96 \\ IRIT-CNRS, Universit\'e Paul Sabatier \\ 118, route de Narbonne \\ 31062 Toulouse Cedex, France \\ Phone: +33 61 55 82 11 \\ Fax: +33 61 55 83 25 } }} ~\\ ~\\ ~\\ \inform{ IMPORTANT DATES }{\cent{ \info {Deadline for submissions:} {April 29, 1996} \info {Notification of acceptance/rejection:}{May 20, 1996} \info {Workshop handouts ready} {June 24, 1996} \info {Workshop date} {July 8, 1996} }} } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % The text below will format this announcement with LaTeX % in a style designed by Jeroen Fokker, Utrecht University (jeroen@cs.ruu.nl), % which has been adapted for our purposes \pagestyle{empty} \topmargin-10mm \oddsidemargin-20mm \textwidth190mm \textheight26cm \newcommand{\ELP}{{\bf ELP}} \newcommand{\cent}[1]{\begin{center}#1\end{center}} \newcommand{\names}[1]{{\bf #1}\\[0.5mm]} \newcommand{\info}[2]{{\em #1}\\ ~\\ {\bf #2}\\[2mm]} \newcommand{\sect}[1]{\vspace{7mm}\par\centerline{{\bf #1}}\vspace{4mm}\par} \newcommand{\items}[1]{\vspace{3mm}\begin{itz} #1 \end{itz}\vspace{3mm}\par} \newcommand{\inform}[2]{ \fbox{\begin{minipage}[t]{51mm} \vspace{2mm}\par \centerline{#1}\footnotesize\vspace{1mm}\par#2 \end{minipage}}\vspace{3mm} } \newenvironment{itz}{ \begin{list}{$\bullet$}{ \parsep=0pt\parskip=0pt\topsep=0pt\itemsep=0pt\leftmargin=1em }}{\end{list}} \begin{document} \nopagebreak \begin{minipage}[t]{55mm} \vspace*{46mm} \pract \end{minipage} \hfill \begin{minipage}[t]{128mm} {\large\sl\cent{\head}} \body \end{minipage} \end{document} From Frits.Vaandrager@cs.kun.nl Mon Mar 11 10:04:33 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA21779; Mon, 11 Mar 96 03:05:17 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 11 Mar 1996 09:04:35 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id JAA28146 (8.6.10/2.2); Mon, 11 Mar 1996 09:04:34 +0100 Received: by daphnis.cs.kun.nl id JAA13008 (8.6.10/2.1); Mon, 11 Mar 1996 09:04:33 +0100 Date: Mon, 11 Mar 1996 09:04:33 +0100 Message-Id: <199603110804.JAA13008@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: TempEst v1.2 From: cpg@cs.utexas.edu (Carlos Puchol) (Apologies if you receive multiple copies of this announcement.) The TempEst Program Verification Toolset Version 1.2, March 11, 1996 =============================== WHAT =============================== This is the second public release of the TempEst verification package. A toolset for the formal verification of safety properties of the text of programs written in the Esterel programming language. The safety properties are expressed in temporal logic (propositional linear time temporal logic). ============================ WHAT'S NEW ============================ Major new features for this version: Support for bounded-fairness properties - properties that involve the use of one-shot system timers (i.e. real-time alarms, operating system alarms, ...). You can now check Esterel programs that contain real-time alarms. Proper support for the newer file versions of automata that the Esterel compiler generates, with enhanced error trace reporting and better handling of large automata. ============================== WHERE =============================== The URL for the homepage of the toolset is at http://www.cs.utexas.edu/users/cpg/TempEst ============================= COPYRIGHT ============================== (C) Bell Laboratories and University of Texas Check the file LICENSE in the distribution for details. ====================================================================== Enjoy! Comments/gripes welcome. -- Carlos Puchol -- cpg@cs.utexas.edu From Frits.Vaandrager@cs.kun.nl Mon Mar 11 10:03:28 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA21762; Mon, 11 Mar 96 03:04:10 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 11 Mar 1996 09:03:31 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id JAA28116 (8.6.10/2.2); Mon, 11 Mar 1996 09:03:29 +0100 Received: by daphnis.cs.kun.nl id JAA13003 (8.6.10/2.1); Mon, 11 Mar 1996 09:03:28 +0100 Date: Mon, 11 Mar 1996 09:03:28 +0100 Message-Id: <199603110803.JAA13003@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: ESSLLI97 - Call for Proposals From: "Bill Keller" CALL FOR COURSE, WORKSHOP AND SYMPOSIUM PROPOSALS ESSLLI'97 European Summer School in Logic, Language and Information - Aix-en-Provence, August 11-22, 1997 - The ESSLLI'97 Programme Committee invites proposals for courses, workshops and symposia for the 9th annual Summer School, to be held in Aix-en-Provence, from August 11th to 22nd, 1997. ESSLLI'97 is organised under the auspices of the European Association for Logic, Language and Information (FoLLI). Previous summer schools have been highly successful, attracting around 500 students from Europe and elsewhere. The school has developed into an important meeting place and forum for discussion for researchers and students interested in the interdisciplinary study of Logic, Language and Information. Proposals are sought for courses, workshops and symposia on a wide range of topics in the following fields: Language Language & Logic Logic Logic & Computation Computation Language & Computation. The Programme Committee for ESSLLI'97 comprises: Language & Computation: Bill Keller, CHAIR (Sussex) billk@cogs.susx.ac.uk Language: Daniele Godard (Paris) Daniele.Godard@linguist.jussieu.fr Language & Logic: Dag Westerstahl (Stockholm) dag.westerstahl@philosophy.su.se Logic: Sergei Artemov (Moscow) artemov@math.cornell.edu Logic & Computation: Georg Gottlob (Vienna) gottlob@dbai.tuwien.ac.at Computation: Gert Smolka (Saarbrueken) smolka@dfki.uni-sb.de If you are interested in lecturing, or organising a workshop or symposium at the summer school, please read the following information carefully. COURSES Courses at the ESSLLI schools are offered at either introductory or advanced level. Introductory courses are central to the activities of the Summer School. They are intended to provide students and young researchers with a solid grounding in a field's key concepts and techniques, and to foster interdisciplinary links by allowing more experienced researchers to acquire competence in neighbouring disciplines. In the three core fields (i.e. Language, Logic and Computation) introductory courses should be aimed at non-specialists. For example, an introductory course on logic should address linguists and computer scientists, not logicians. Introductory courses in the interdisciplinary fields (i.e. Language & Logic, Logic & Computation and Language & Computation) on the other hand, may build on knowledge of the relevant sub-fields. Thus, an introductory course in computational linguistics may assume familiarity with the basics of both linguistics and computation. In view of the importance placed on introductory courses, the number of such courses that will be offered at ESSLLI'97 has been increased. For this reason, the Programme Committee is particularly keen to attract proposals for introductory courses. Advanced courses assume a higher level of background knowledge than introductory courses. Indeed they may well be of a highly specialised nature, especially within the three core fields. As a rough guide, prospective lecturers should assume that advanced courses address PhD students actively working towards mastery of the field in question. Courses are taught by 1 or (maximally) 2 lecturers. They consist of five sessions (a one-week course) or ten sessions (a two-week course). A session lasts either 45 or 90 minutes. The most common formats are ten 45-minute sessions or five 90-minute sessions; the two other combinations are less usual, but not impossible. WORKSHOPS The aim of the workshops is to provide a forum for PhD students and other young researchers to present and discuss their work, both with colleagues and with senior researchers. Typically, over 75% of the workshop speakers should be Ph.D students or other your researchers. A workshop has a theme and one organiser. The organiser should be a specialist in the theme of the workshop and give a general introduction in the first session. The organizer is also responsible for the programme of the workshop (i.e. for finding speakers). A workshop consists of five sessions (a one-week workshop) or ten sessions (a two-week workshop) where each session lasts 45 or 90 minutes. SYMPOSIA Symposia should provide specialists in a given field with a forum for in-depth discussion. A symposium has one organiser, who should be a senior researcher in the relevant field, and who is responsible for the programme. Symposia have a maximum of 5 sessions (no two-week symposia!) and each session lasts 45 or 90 minutes. Please note that in order to keep down costs, the organisers of symposia are kindly requested to recruit speakers, as far as possible, from the ESSLLI teaching staff, or to provide a supplementary budget from sources other than ESSLLI. This means that symposium organisers will have to work closely with both the program committee and the organising committee. FORMAT FOR PROPOSALS Please submit your proposal in the following format: Name: --- Name(s) of proposed lecturer(s)/organiser. Address: --- Contact addresses of proposed lecturer(s)/organiser. Where possible, please include phone and fax numbers. Title: --- Title of proposed course/workshop/symposium. Type: --- State whether this is a workshop, a symposium, an introductory course, or an advanced course. Section: --- Which of the six sections (Language, Logic, Computation, Logic & Computation, Language & Computation or Language & Logic) does the proposal belong to? While it may be difficult in some cases to decide which section is the most appropriate, please just name one. Description: --- A description of the proposed contents. Not more than 150 words. SUBMISSION OF PROPOSALS Please email your proposal to the Programme Chair and the member of the Committee responsible for the section named in your proposal, by May 13th 1996. Notification of acceptance of submitted proposals will be given by September 1st 1996. When you email your proposal, please use the following subject line: ESSLLI97 PROPOSAL FINANCIAL ASPECTS Prospective lecturers and workshop/symposium organisers should be aware that all teaching and organising at the summer schools is done on a voluntary basis in order to keep the participants' fees as low as possible. Lecturers and organisers are not paid for their contribution, but are reimbursed for travel and accommodation. (However please note that the organisers appreciate it if, whenever possible, lecturers and organisers find alternative funding to cover travel and accommodation expenses.) Workshop organisers get a maximum amount of money to be used for the expenses of the speakers in their workshops (typically about 500 ECU). Please note that workshop speakers do not get free registration at the School, but will be entitled to a discount on the registration fee. As most workshop speakers are expected to be Ph.D students or other young researchers, they have a lot to gain from attending. The organiser of a workshop provides the Summer School organiser with a budget (before the Summer School) and with a statement of accounts afterwards. Symposia should as far as possible be self-financing (for instance through sponsorship by projects or research groups). The organiser is responsible for coming up with a budget, in collaboration with the Organising Committee. Finally, it should be stressed that while proposals from all over the world are welcomed, the Summer School can only afford the travel costs for a small number of lecturers/organisers from outside Europe. PUBLICATIONS Lecturers and organizers of workshops and symposia are encouraged to think about publications arising from their lectures or events. Workshop and symposium organizers are especially encouraged to do so, as this may help in raising funds for their speakers. FoLLi has its own book series, Studies in Logic, Language and Information, which is published by CSLI Publications, Stanford. Lecturers and orgainizers are invited to contact the editorial board if they have publication plans. (See the FoLLI Home Page at http://www.fwi.uva.nl/research/folli/ for addresses). FURTHER BACKGROUND INFORMATION Prospective lecturers unfamiliar with the ESSLLI schools should consider consulting the program of the 8th Summer School, which is being held in Prague from August 12th to 23rd, 1996. Information about the Prague school can be obtained from the ESSLLI'96 Website (http://ufal.ms.mff.cuni.cz) or from ESSLLI'96, UFAL MFF UK, Malostranske' na'm. 25, 118 00 Praha 1, Czech Republic Fax: +42-2-2191-4-309 Phone: +42-2-2191-4-255 E-mail: esslli@ufal.mff.cuni.cz From Frits.Vaandrager@cs.kun.nl Mon Mar 11 10:04:33 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA11887; Wed, 13 Mar 96 04:19:11 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 11 Mar 1996 09:04:35 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id JAA28146 (8.6.10/2.2); Mon, 11 Mar 1996 09:04:34 +0100 Received: by daphnis.cs.kun.nl id JAA13008 (8.6.10/2.1); Mon, 11 Mar 1996 09:04:33 +0100 Date: Mon, 11 Mar 1996 09:04:33 +0100 Message-Id: <199603110804.JAA13008@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: TempEst v1.2 From: cpg@cs.utexas.edu (Carlos Puchol) (Apologies if you receive multiple copies of this announcement.) The TempEst Program Verification Toolset Version 1.2, March 11, 1996 =============================== WHAT =============================== This is the second public release of the TempEst verification package. A toolset for the formal verification of safety properties of the text of programs written in the Esterel programming language. The safety properties are expressed in temporal logic (propositional linear time temporal logic). ============================ WHAT'S NEW ============================ Major new features for this version: Support for bounded-fairness properties - properties that involve the use of one-shot system timers (i.e. real-time alarms, operating system alarms, ...). You can now check Esterel programs that contain real-time alarms. Proper support for the newer file versions of automata that the Esterel compiler generates, with enhanced error trace reporting and better handling of large automata. ============================== WHERE =============================== The URL for the homepage of the toolset is at http://www.cs.utexas.edu/users/cpg/TempEst ============================= COPYRIGHT ============================== (C) Bell Laboratories and University of Texas Check the file LICENSE in the distribution for details. ====================================================================== Enjoy! Comments/gripes welcome. -- Carlos Puchol -- cpg@cs.utexas.edu From Frits.Vaandrager@cs.kun.nl Mon Mar 11 10:03:28 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA11908; Wed, 13 Mar 96 04:20:10 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 11 Mar 1996 09:03:31 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id JAA28116 (8.6.10/2.2); Mon, 11 Mar 1996 09:03:29 +0100 Received: by daphnis.cs.kun.nl id JAA13003 (8.6.10/2.1); Mon, 11 Mar 1996 09:03:28 +0100 Date: Mon, 11 Mar 1996 09:03:28 +0100 Message-Id: <199603110803.JAA13003@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: ESSLLI97 - Call for Proposals From: "Bill Keller" CALL FOR COURSE, WORKSHOP AND SYMPOSIUM PROPOSALS ESSLLI'97 European Summer School in Logic, Language and Information - Aix-en-Provence, August 11-22, 1997 - The ESSLLI'97 Programme Committee invites proposals for courses, workshops and symposia for the 9th annual Summer School, to be held in Aix-en-Provence, from August 11th to 22nd, 1997. ESSLLI'97 is organised under the auspices of the European Association for Logic, Language and Information (FoLLI). Previous summer schools have been highly successful, attracting around 500 students from Europe and elsewhere. The school has developed into an important meeting place and forum for discussion for researchers and students interested in the interdisciplinary study of Logic, Language and Information. Proposals are sought for courses, workshops and symposia on a wide range of topics in the following fields: Language Language & Logic Logic Logic & Computation Computation Language & Computation. The Programme Committee for ESSLLI'97 comprises: Language & Computation: Bill Keller, CHAIR (Sussex) billk@cogs.susx.ac.uk Language: Daniele Godard (Paris) Daniele.Godard@linguist.jussieu.fr Language & Logic: Dag Westerstahl (Stockholm) dag.westerstahl@philosophy.su.se Logic: Sergei Artemov (Moscow) artemov@math.cornell.edu Logic & Computation: Georg Gottlob (Vienna) gottlob@dbai.tuwien.ac.at Computation: Gert Smolka (Saarbrueken) smolka@dfki.uni-sb.de If you are interested in lecturing, or organising a workshop or symposium at the summer school, please read the following information carefully. COURSES Courses at the ESSLLI schools are offered at either introductory or advanced level. Introductory courses are central to the activities of the Summer School. They are intended to provide students and young researchers with a solid grounding in a field's key concepts and techniques, and to foster interdisciplinary links by allowing more experienced researchers to acquire competence in neighbouring disciplines. In the three core fields (i.e. Language, Logic and Computation) introductory courses should be aimed at non-specialists. For example, an introductory course on logic should address linguists and computer scientists, not logicians. Introductory courses in the interdisciplinary fields (i.e. Language & Logic, Logic & Computation and Language & Computation) on the other hand, may build on knowledge of the relevant sub-fields. Thus, an introductory course in computational linguistics may assume familiarity with the basics of both linguistics and computation. In view of the importance placed on introductory courses, the number of such courses that will be offered at ESSLLI'97 has been increased. For this reason, the Programme Committee is particularly keen to attract proposals for introductory courses. Advanced courses assume a higher level of background knowledge than introductory courses. Indeed they may well be of a highly specialised nature, especially within the three core fields. As a rough guide, prospective lecturers should assume that advanced courses address PhD students actively working towards mastery of the field in question. Courses are taught by 1 or (maximally) 2 lecturers. They consist of five sessions (a one-week course) or ten sessions (a two-week course). A session lasts either 45 or 90 minutes. The most common formats are ten 45-minute sessions or five 90-minute sessions; the two other combinations are less usual, but not impossible. WORKSHOPS The aim of the workshops is to provide a forum for PhD students and other young researchers to present and discuss their work, both with colleagues and with senior researchers. Typically, over 75% of the workshop speakers should be Ph.D students or other your researchers. A workshop has a theme and one organiser. The organiser should be a specialist in the theme of the workshop and give a general introduction in the first session. The organizer is also responsible for the programme of the workshop (i.e. for finding speakers). A workshop consists of five sessions (a one-week workshop) or ten sessions (a two-week workshop) where each session lasts 45 or 90 minutes. SYMPOSIA Symposia should provide specialists in a given field with a forum for in-depth discussion. A symposium has one organiser, who should be a senior researcher in the relevant field, and who is responsible for the programme. Symposia have a maximum of 5 sessions (no two-week symposia!) and each session lasts 45 or 90 minutes. Please note that in order to keep down costs, the organisers of symposia are kindly requested to recruit speakers, as far as possible, from the ESSLLI teaching staff, or to provide a supplementary budget from sources other than ESSLLI. This means that symposium organisers will have to work closely with both the program committee and the organising committee. FORMAT FOR PROPOSALS Please submit your proposal in the following format: Name: --- Name(s) of proposed lecturer(s)/organiser. Address: --- Contact addresses of proposed lecturer(s)/organiser. Where possible, please include phone and fax numbers. Title: --- Title of proposed course/workshop/symposium. Type: --- State whether this is a workshop, a symposium, an introductory course, or an advanced course. Section: --- Which of the six sections (Language, Logic, Computation, Logic & Computation, Language & Computation or Language & Logic) does the proposal belong to? While it may be difficult in some cases to decide which section is the most appropriate, please just name one. Description: --- A description of the proposed contents. Not more than 150 words. SUBMISSION OF PROPOSALS Please email your proposal to the Programme Chair and the member of the Committee responsible for the section named in your proposal, by May 13th 1996. Notification of acceptance of submitted proposals will be given by September 1st 1996. When you email your proposal, please use the following subject line: ESSLLI97 PROPOSAL FINANCIAL ASPECTS Prospective lecturers and workshop/symposium organisers should be aware that all teaching and organising at the summer schools is done on a voluntary basis in order to keep the participants' fees as low as possible. Lecturers and organisers are not paid for their contribution, but are reimbursed for travel and accommodation. (However please note that the organisers appreciate it if, whenever possible, lecturers and organisers find alternative funding to cover travel and accommodation expenses.) Workshop organisers get a maximum amount of money to be used for the expenses of the speakers in their workshops (typically about 500 ECU). Please note that workshop speakers do not get free registration at the School, but will be entitled to a discount on the registration fee. As most workshop speakers are expected to be Ph.D students or other younFrom Frits.Vaandrager@cs.kun.nl Mon Mar 11 10:00:54 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA11894; Wed, 13 Mar 96 04:19:23 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 11 Mar 1996 09:00:56 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id JAA28030 (8.6.10/2.2); Mon, 11 Mar 1996 09:00:55 +0100 Received: by daphnis.cs.kun.nl id JAA12991 (8.6.10/2.1); Mon, 11 Mar 1996 09:00:54 +0100 Date: Mon, 11 Mar 1996 09:00:54 +0100 Message-Id: <199603110800.JAA12991@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Re:New proof of completeness of Kozen's modal mu-calculus From: Chrysafis Hartonas In response to a request I have now made the paper (submitted) STONE DUALITY FOR MODAL MU-LOGICS (C. Hartonas) available by ftp ftp ftp.cs.man.ac.uk/pub/hartonas/sdmu.ps.gz The abstract of the paper is copied below. best wishes C. Hartonas (hartonas@cs.man.ac.uk) ***************************ABSTRACT*********************************** The modal $\mu$-calculi are extensions of propositional modal logics with least and greatest fixpoint operators. They have significant expressive power, being capable to encode properly temporal notions alien to standard modal systems. We focus here on Kozen's [1] $\mu$-calculi, both finitary and infinitary. Based on an extension of the classical modal duality to the case of positive modal algebras that we present, we prove a Stone-type duality for {\em positive} modal $\mu$-calculi which specializes to a duality for the Boolean modal $\mu$-logics. Thus we extend while alFrom Frits.Vaandrager@cs.kun.nl Mon Mar 11 10:01:53 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA11902; Wed, 13 Mar 96 04:20:02 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 11 Mar 1996 09:01:56 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id JAA28066 (8.6.10/2.2); Mon, 11 Mar 1996 09:01:54 +0100 Received: by daphnis.cs.kun.nl id JAA12996 (8.6.10/2.1); Mon, 11 Mar 1996 09:01:53 +0100 Date: Mon, 11 Mar 1996 09:01:53 +0100 Message-Id: <199603110801.JAA12996@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Work-Shop From: Jean-Paul BAHSOUN \documentstyle{article} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% Call for Contributions %% %% ECOOP'96 workshop %% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \def\head{ {\bf CALL FOR CONTRIBUTIONS }\\[3mm] {\bf ECOOP'96 Workshop on }\\[4mm] {\Large \bf Proof Theory of Concurrent Object-Oriented Programming} \\ ~\\ {\bf Linz (Austria)}\\ Monday 8th July, 1996 } \def\body{ A one day workshop on {\em Proof Theory of Concurrent Object-Oriented Programming} is planned in the framework of the 10th European Conference on Object-Oriented Programming (ECOOP'96, Linz, Austria, 8-12 July 1996). \\ ~\\ There exists various approaches to model concurrent programming based-on logic. In this way, the use of logic for system development concerns the specification step but also the study of the operational aspects (through proof analysis and construction) of such development. In this context, we have to consider different logical systems for different uses of logic. Moreover, we can also consider concurrency from the both point of views: we want to reason and to specify systems where some concurrency aspects are involved and also to have some operational interpretations of concurrency into logic (focusing on the concept of proof). It seems clear that we have to identify and to study, in one hand, the role and the treatment of objects (representation, inheritance, modularity, communication, etc...) in this context, and in another hand, the interaction of work on proofs and concurrency with the Object-Oriented Programming paradigm. \sect{ TOPICS } This workshop aims to establish the state of art in the use of logic in interaction with concurrency and the use of objects. The objective is to provide an integrated forum for the presentation of research and the exchange of ideas and experiences in the topics concerned with proofs, concurrency and object-oriented programming (specification, proof development, etc...). \\ ~\\ Topics of interest, in this context, include (but are not restricted to): \items{ \item proof-theoretical foundations \item formalisms and logics to model concurrent systems and objects \item proofs and concurrency: modularity, composition, communication interaction and synchronization \item role and use of objects for concurrent programming and proving \item verification and reuse \item implementations and case studies } The scientific program will include invited talks, presentations of the accepted papers and discussion. \sect{ SUBMISSIONS } Authors are invited to send one copy of an extended abstract (in postscript format) ({\bf 8 pages}) to Jean-Paul Bahsoun ({\bf bahsoun@irit.fr}). Papers will be reviewed by peers, typically members of the program committee. The cover page should include a return mailing address and, if possible, an electronic mail address and a fax number. If at all possible, at the earliest possible moment a message containing the title of the paper, authors, abstract, keywords, and the address information outlined above should be sent by email to the corresponding address. } % PRACTICAL INFORMATION \def\pract{ \inform{ PTCOOP'96 }{ \names{ Organizing-Program Committee: } ~\\ Jean-Paul Bahsoun \\ \hspace*{15mm} (IRIT-CNRS, Toulouse) \\ ~\\ Jose Luis Fiadero \\ \hspace*{15mm} (University of Lisboa) \\ ~\\ Didier Galmiche \\ \hspace*{15mm} (CRIN-CNRS, Nancy) \\ ~\\ Akinori Yonezawa \\ \hspace*{15mm} (University of Tokyo) \\ } ~\\ ~\\ ~\\ \inform{ INFORMATION }{\cent{ \info {by email:} {bahsoun@irit.fr} ~\\ \info {or surface mail:} {Jean Paul Bahsoun \\ PTCOOP'96 \\ IRIT-CNRS, Universit\'e Paul Sabatier \\ 118, route de Narbonne \\ 31062 Toulouse Cedex, France \\ Phone: +33 61 55 82 11 \\ Fax: +33 61 55 83 25 } }} ~\\ ~\\ ~\\ \inform{ IMPORTANT DATES }{\cent{ \info {Deadline for submissions:} {April 29, 1996} \info {Notification of acceptance/rejection:}{May 20, 1996} \info {Workshop handouts ready} {June 24, 1996} \info {Workshop date} {July 8, 1996} }} } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % The text below will format this announcement with LaTeX % in a style designed by Jeroen Fokker, Utrecht University (jeroen@cs.ruu.nl), % which has been adapted for our purposes \pagestyle{empty} \topmargin-10mm \oddsidemargin-20mm \textwidth190mm \textheight26cm \newcommand{\ELP}{{\bf ELP}} \newcommand{\cent}[1]{\begin{center}#1\end{center}} \newcommand{\names}[1]{{\bf #1}\\[0.5mm]} \newcommand{\info}[2]{{\em #1}\\ ~\\ {\bf #2}\\[2mm]} \newcommand{\sect}[1]{\vspace{7mm}\par\centerline{{\bf #1}}\vspace{4mm}\par} \newcommand{\items}[1]{\vspace{3mm}\begin{itz} #1 \end{itz}\vspace{3mm}\par} \newcommand{\inform}[2]{ \fbox{\begin{minipage}[t]{51mm} \vspace{2mm}\par \centerline{#1}\footnotesize\vspace{1mm}\par#2 \end{minipage}}\vspace{3mm} } \newenvironment{itz}{ \begin{list}{$\bullet$}{ \parsep=0pt\parskip=0pt\topsep=0pt\itemsep=0pt\leftmargin=1em }}{\end{list}} \begin{document} \nopagebreak \begin{minipage}[t]{55mm} \vspace*{46mm} \pract \end{minipage} \hfill \begin{minipage}[t]{128mm} {\large\sl\cent{\head}} \body \end{minipage} \end{document} From Frits.Vaandrager@cs.kun.nl Thu Mar 14 14:47:14 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA04609; Thu, 14 Mar 96 07:48:03 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Thu, 14 Mar 1996 13:47:17 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id NAA25336 (8.6.10/2.2); Thu, 14 Mar 1996 13:47:15 +0100 Received: by daphnis.cs.kun.nl id NAA19071 (8.6.10/2.1); Thu, 14 Mar 1996 13:47:14 +0100 Date: Thu, 14 Mar 1996 13:47:14 +0100 Message-Id: <199603141247.NAA19071@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: COORDINATION'96 call for participation From: Nadia Busi !!!!!! CALL FOR PARTICIPATION !!!!!! * * * * * * * * * * COORDINATION '96 * * * * First International Conference on * Coordination Models, Languages and Applications * * * * * April 15 - 17, 1996 * * Cesena, ITALY * * * * * * * * Final program, registration forms and local information on how to reach Cesena are available per www under http://www.radio.alma.unibo.it/coordination96/index.html EXTENDED DEADLINE for EARLY REGISTRATION: March 20th, 1996 . NEW!!!!!!!! The tutorial "A cup of Java", by a person from Sun Microsystems, has been added to the program. DEMOS: the provisional program for demos will soon be available; a few extra slots for demos have been made available. To announce new demos, please send an e-mail to the local organizer Mauro Gaspari (gaspari@cs.unibo.it). Deadline: March 20th. From Frits.Vaandrager@cs.kun.nl Wed Mar 20 11:22:07 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA20895; Wed, 20 Mar 96 04:22:43 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Wed, 20 Mar 1996 10:22:09 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id KAA21177 (8.6.10/2.2); Wed, 20 Mar 1996 10:22:08 +0100 Received: by daphnis.cs.kun.nl id KAA29406 (8.6.10/2.1); Wed, 20 Mar 1996 10:22:07 +0100 Date: Wed, 20 Mar 1996 10:22:07 +0100 Message-Id: <199603200922.KAA29406@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: JUCS special issue on Evolving Algebras From: Egon Boerger CALL FOR PAPERS Journal of Universal Computer Science (JUCS): Special Issue on EVOLVING ALGEBRAS Articles are solicited for a Special Issue of JUCS on EVOLVING ALGEBRAS. JUCS is Springer's new electronic journal available world-wide through the internet and setting up a new standard for electronic publishing. For further information on JUCS, including the format, see http://www.iicm.tu-graz.ac.at/jucs or send an empty email to JUCS@iicm.tu-graz.ac.at with the following subject: info,format The volume is going to appear in the Spring of 1997. Following the well established JUCS policy, there will be both an electronic (www accessible) edition of the special issue and a paper edition appearing at the end of the year. The issue is open to advanced and innovative applications as well as theoretical achievements. Research contributions with cross-disciplinary or research-to-practice content are particularly welcome, including industrial applications, challenging case studies and reports on mature implementations. The area of the submitted paper may belong to any field of computer science or engineering. Papers must be submitted in 5 hard copies to arrive not later than Dec 1, 1996 at the following address: Egon Boerger Dipartimento di Informatica Universita di Pisa Corso Italia 40 I - 56 125 PISA/ Italy The cover page must contain an abstract and the full electronic and ordinary mail address of the corresponding author. An electronic copy in ps-format should be available and be sent in case of specific request. Each submission will be refereed; the referee reports should be ready at the beginning of February, 1997. In case a paper is accepted under the condition of a revision, there will be a second round of refereeing. The final version, in JUCS format, is due on April 17, 1997 in JUCS format. For further information contact: boerger@di.unipi.it From Frits.Vaandrager@cs.kun.nl Wed Mar 20 11:20:23 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA20883; Wed, 20 Mar 96 04:21:24 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Wed, 20 Mar 1996 10:20:33 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id KAA21107 (8.6.10/2.2); Wed, 20 Mar 1996 10:20:30 +0100 Received: by daphnis.cs.kun.nl id KAA29400 (8.6.10/2.1); Wed, 20 Mar 1996 10:20:23 +0100 Date: Wed, 20 Mar 1996 10:20:23 +0100 Message-Id: <199603200920.KAA29400@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: 2nd CfP: ESSLLI'96 Workshop on Logic and Computation From: Maarten de Rijke Please post - Please post - Please post - Please post - Please post SECOND CALL FOR PAPERS ESSLLI'96 Workshop on Logic and Computation Observational Equivalence and Logical Equivalence Prague, Czech Republic August 12 - 16, 1996 GENERAL The section on Logic and Computation of the eighth European Summer School on Logic Language and Information (ESSLLI'96) will include a workshop on Observational Equivalence and Logical Equivalence. The main focus of ESSLLI'96 is the interface between logic, linguistics, and computation, particularly where it concerns the modeling of human language and cognitive abilities. The program includes courses, workshops and symposia on topics in six areas of interest: Logic, Language, Computation, Logic and Computation, Computation and Language, and Language and Logic. ESSLLI'96 workshops are especially aimed at providing PhD students and other young researchers with an opportunity to present their work and gain informed feedback and useful contacts. ABOUT THE WORKSHOP Transition systems are often used as models of concurrent programs. By themselves they are too concrete for determining when one program is computationally equivalent to, or could approximate, another. Both computational and logical solutions are available. Numerous notions of observational (behavioral, computational) equivalence have been introduced, and logical language have been devised whose semantics are described on transition systems. Two programs are logically equivalent if they satisfy the same properties expressible in the logical language. And for both practical and theoretical purposes it is desirable to obtain logical characterizations of observational equivalences. The workshop will report on recent developments in the area, with a special focus on the interaction between Logic and Computer Science, and addressing both practical issues. Areas of interest include (but are not limited to): o Algebraic process theory o Bisimulations and (finite) model theory o Computing observational equivalence o Logical characterizations of observational equivalence o Tools PARTICIPATION Participation in the workshop is open to all registered participants of ESSLLI'96. PhD students and other young researchers wishing to present their work during the workshop are invited submit an abstract as described below. Please note that ALL participants to the workshop (including speakers) should register for ESSLLI'96. SUBMISSION of PAPERS Authors are invited to submit a detailed abstract of full paper of at most 10 pages. All submissions must be in English. Electronic submissions (PostScript) are STRONGLY preferred. Submissions should be sent to mdr@dcs.warwick.ac.uk Maarten de Rijke Dept. of Computer Science University of Warwick Coventry CV4 7AL England using `ESSLLI'96 Submission' as the subject line. The accepted papers will be made available on the World-Wide Web. If sufficiently many high-quality papers are submitted, these will be published as a special journal issue or edited volume. WORKSHOP FORMAT The workshop will consist of presentations of approximately 40 minutes followed by discussions. There will be an introductory session outlining the main themes and goals of the workshop. IMPORTANT DATES Deadline for submissions: 15 May 1996 Notification of authors: 15 June 1996 Final versions due: To be announced Workshop dates: 12 - 16 August 1996 FURTHER INFORMATION The workshop is part of the section on Logic and Computation that also includes introductory courses on Extensions of First-Order Logic, and on Tableau Methods for Modal and Temporal Logics; as well as advanced courses on Integrated Program Development in Type Theory, Logical Frameworks and Philosophical Logics, Dynamic Logic and Information Flow, Conceptual Spaces and Cognitive Semantics, Principles of Nonmonotonic Reasoning, and Logic Programming and Non-Monotonicity; there will also be a symposium on Logic, Computers and Education. Further information on ESSLLI'96 is available at http://ufal.ms.mff.cuni.cz/ Information for the Workshop is available at http://www.dcs.warwick.ac.uk/~mdr/ESSLLI96-Workshop.html/ Please post - Please post - Please post - Please post - Please post =o=o=o=o=o=o=o=o=o=o=o=o=o=o=o=o=o=o=o=o=o=o=o=o=o=o=o=o=o=o=o=o=o=o From Frits.Vaandrager@cs.kun.nl Wed Mar 20 11:27:49 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA20929; Wed, 20 Mar 96 04:28:26 EST Received: from zeus.cs.kun.nl by hera.cwi.nl with SMTP id ; Wed, 20 Mar 1996 10:27:50 +0100 Received: from daphnis.cs.kun.nl by zeus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id KAA21399 (8.6.10/2.2); Wed, 20 Mar 1996 10:27:49 +0100 Received: by daphnis.cs.kun.nl id KAA29416 (8.6.10/2.1); Wed, 20 Mar 1996 10:27:49 +0100 Date: Wed, 20 Mar 1996 10:27:49 +0100 Message-Id: <199603200927.KAA29416@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: new technical report From: bernardo@cs.unibo.it (Marco Bernardo) The following technical report is now available via anonymous ftp from the area ftp.cs.unibo.it:/pub/TR/UBLCS and via WWW at URL http://www.cs.unibo.it AUTHORS: Marco Bernardo, Lorenzo Donatiello, Roberto Gorrieri TITLE: Integrating Performance and Functional Analysis of Concurrent Systems with EMPA NUMBER: UBLCS-95-14 (September 1995, revised March 1996) ABSTRACT: An approach is proposed for modeling and analyzing concurrent systems that integrates different views (abstract vs. concrete) as well as different aspects (functional vs. performance) of their behavior. The approach is based on a stochastic process algebra, a formalism for specifying and studying concurrent systems that is characterized by the property of compositionality. The approach is instantiated to the case of Extended Markovian Process Algebra (EMPA), introduced together with the collection of its four semantics and the notion of equivalence that are required in order to implement the approach. Finally, the case study of the alternating bit protocol is presented to illustrate the approach. From Frits.Vaandrager@cs.kun.nl Fri Mar 22 21:32:19 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA10876; Fri, 22 Mar 96 14:32:25 EST Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Fri, 22 Mar 1996 20:32:20 +0100 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id UAA23938 (8.6.10/2.1); Fri, 22 Mar 1996 20:32:20 +0100 Received: by daphnis.cs.kun.nl id UAA04404 (8.6.10/2.1); Fri, 22 Mar 1996 20:32:19 +0100 Date: Fri, 22 Mar 1996 20:32:19 +0100 Message-Id: <199603221932.UAA04404@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: CFP: ASP DAC'97 From: wakaba@sbl.cl.nec.co.jp (Wakabayashi Kazutoshi) Dear Colleague, Below is the CFP for the 1997 ASP DAC with EDA exhibition. which is sponsored in part by IEICE,IPSJ,ACM and IEEE. For more information, please see our WWW home page at: http://www.ieice.or.jp/callforpapers/ASPDAC/ Please pass along this "call for papers" to your collagues. Thanks, Kazutoshi WAKABAYASHI C&C Res. Labs. NEC Corporation Tel +81-44-856-2134 (dial in) Fax +81-44-856-2235 E-mail: wakaba@sbl.cl.nec.co.jp ---------------------------------------------------------------------- Call for Papers ASP-DAC '97 Asia and South Pacific Design Automation Conference 1997 with EDA TechnoFair '97 Jan.28 -- 31, 1997 Makuhari Messe, Chiba, JAPAN Aims of the Conference: The goal of the meeting of ASP-DAC '97 is to provide a forum for presentation, discussion, and observation of the state-of-the-art of Design Automation(DA) and Design Methodology of electric systems. The format of the meetings intends to cultivate and promote an instructive and productive interchange among not only DA researchers and developers; system and circuit designers, but also a variety of those scientists, engineers, and students who are interested in theoretical issues on DA. Areas of Interest: Original Papers on, but not limited to, the following areas are invited. [A] Design Issues---Practice/Experience with DA Tools: 1) Design experience using DA tools, 2) High performance/Low power/Deep submicron design, 3) Rapid prototyping and emulation, 4) Design flows for DSP/Communication/Multi-media systems, 5) CAD for new Devices [B] Foundations of CAD Technology: 1) Theory of optimization, 2) Fundamental theory of physical design, 3) Logic function and switching theory, 4) Foundation of verification, 5) Formal semantics of HDL's, 6) New theories for CAD [C] Physical Design: 1) Partitioning, 2) Floorplanning and placement, 3) Global and detailed routing, 4) Module generation, 5) High-speed and microwave DA, 6) Layout verification, 7) PCB design, 8) Packaging CAD, 9) Interaction between logic and layout design [D] Synthesis: 1) Combinational synthesis, 2) Sequential synthesis, 3) High-level synthesis, 4) HW/SW codesign and system synthesis, 5) Synthesis for high performance/low power systems, 6) Asynchronous synthesis, 7) Mapping and technology dependent optimization [E] Test: 1) Fault modeling and simulation, 2) Test pattern generation, 3) Design-for-testability, 4) Fault Tolerant methods, 5) Test design issues [F] Design Verification and Simulation: 1) Functional verification, 2) System design verification, 3) Timing verification, 4) Performance analysis 5) Circuit and timing simulation 6) Logic and functinal simulation 7) System-level simulation [G] Technology CAD: 1) Device simulation 2) Process simulation 3) Device design optimization 4) CAD tools for new devices [H] Analog Design: 1) Circuit analysis, 2) Analog synthesis, 3) Process and device modeling, 4) Memory cell design [I] Design Methods and Environments: 1) Design scheme, HDL/diagram/chart-based design, 2) Frameworks and databases, 3) Libraries and tools for ASICs, 4) Integration of design tools for ULSI design, 5) Human factors in DA, 6) HW accelerator for DA [J] Manufacturing: 1) DA for IC fabrication, 2) Computer-aided manufacturing, 3) Multi-chip module: design and manufacturing [K] Education and Training: 1) Education of VLSI design, 2) Education of CAD technologies, 3) Training course for CAD tools Submission of papers: Deadline for submission: July 20, 1996 Notification of Acceptance: Oct. 18, 1996 Deadline for Final Version: Nov. 5, 1996 Prospective authors are invited to submit to the Conference Secretariat 10 copies of a complete paper in English, which satisfies the following: The cover page should specify [i] title of paper, [ii] authors and affiliation, [iii] speaker, [iv] mailing address, phone No., FAX No., and e-mail address of the contact author, [v] brief abstract describing the work, [vi] list of area numbers (e.g. A-2), ordered by relevancy, most clearly matching the content of the paper. The paper is of A4 or 8.5" X 11" size and should not exceed 20 pages and 5,000 words including figures, tables, andreferences. Double-spaced format is recommended. The technical expositions should be directed to a specialist and should include an introduction for a nonspecialist that describes the problem and the achieved results, focusing on the important ideas and their significance. Any paper that deviates significantly from these guidances, or is not received by the dead line, risks rejection without consideration of its merits. It is mandatory that the accepted papers should be presented at the conference. All the speakers of the regular papers are required to make advance registration and those papers with no pre-registered speakers are treated as being withdrawn. Exhibition: An exhibition, EDA TechnoFair '97, sponsored by Electronics Industries Association of Japan, will be opened free of charge to all attendees. Over 50 exhibitors are expected to participate with specializing CAD/DA/CAE systems, hardware platform related products, publications and services. Panels and Tutorials: Suggestions and proposals are welcome and have to be addressed to the Conference Secretariat no later than March 20, 1996. Conference Secretariat: ASPDAC'97 Secretariat c/o CONVEX Inc. Ichijoji Bldg. 2-3-22 Azabudai, Minato-ku, Tokyo 106 JAPAN Tokyo 106 JAPAN Phone: +81-3-3589-3355, Fax: +81-3-3589-3974 Email: convex@po.iijnet.or.jp Chairs and Representatives: General Chair: Isao Shirakawa (Osaka Univ.) Steering Committee Chair: Tatsuo Ohtsuki (Waseda Univ.) Program Committee Chair: Takeshi Yoshimura (NEC) Vice Prog. Committee Chair: Hiroto Yasuura (Kyushu Univ.) Region Representatives: Australia: David Skellern (Macquarie Univ.) China: Xian-Long Hong (Tsinghua Univ.) Hong-Kong: Omar Wing (The Chinese Univ. of H.K.) India: Sunil D. Sherlekar (IIT, Bombay) Korea: Chong-Min Kyung (KAIST) Taiwan: Youn-Long Steve Lin (Tsing Hua Univ.) Sponsored by: IEICE (Institute of Electronics, Information and Communication Engineers) IPSJ (Information Processing Society of Japan) ACM SIGDA IEEE Circuits and Systems Society Supported by: EIAJ (Electronics Industries Association of Japan) Information on ASPDAC'97 is available on WWW. http://www.ieice.or.jp/callforpapers/ASPDAC/ From Frits.Vaandrager@cs.kun.nl Mon Apr 1 13:35:56 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA12626; Mon, 01 Apr 96 04:36:01 EST Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 1 Apr 1996 11:35:57 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id LAA20936 (8.6.10/2.1); Mon, 1 Apr 1996 11:35:57 +0200 Received: by daphnis.cs.kun.nl id LAA08138 (8.6.10/2.1); Mon, 1 Apr 1996 11:35:56 +0200 Date: Mon, 1 Apr 1996 11:35:56 +0200 Message-Id: <199604010935.LAA08138@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: announcement From: lynch@theory.lcs.mit.edu (Nancy Lynch) My new book on "Distributed Algorithms" is now available from Morgan Kaufmann publishers. If you're interested, you can contact the publisher at mkp@mkp.com. You can see the table of contents at http://theory.lcs.mit.edu/tds/distalgs.html. Nancy Lynch From Frits.Vaandrager@cs.kun.nl Mon Apr 1 13:37:23 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA12637; Mon, 01 Apr 96 04:37:30 EST Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 1 Apr 1996 11:37:25 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id LAA20978 (8.6.10/2.1); Mon, 1 Apr 1996 11:37:24 +0200 Received: by daphnis.cs.kun.nl id LAA08144 (8.6.10/2.1); Mon, 1 Apr 1996 11:37:23 +0200 Date: Mon, 1 Apr 1996 11:37:23 +0200 Message-Id: <199604010937.LAA08144@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: AMAST'96: Call for Participation From: Bernhard Reus [With apologies if you get this announcement more than once. B. Reus] -------------------------------------------------------------------- A word-wide-web page containing information about the conference is reachable by URL: http://www.pst.informatik.uni-muenchen.de/amast96 . e-mail: amast96-info@informatik.uni-muenchen.de -------------------------------------------------------------------- ********************************************* ******************************************* FIFTH INTERNATIONAL CONFERENCE ON ALGEBRAIC METHODOLOGY AND SOFTWARE TECHNOLOGY AMAST '96 ******************************************* ********************************************* July 1-5, 1996 Munich, Germany Sponsored by Deutsche Forschungsgemeinschaft M"unchener Universit"atsgesellschaft s d & m Siemens Organized by Ludwig-Maximilians-Universit"at M"unchen FINAL PROGRAMME, REGISTRATION, ACCOMMODATION, and TRAVEL INFORMATION ********************************************************* FINAL PROGRAMME ********************************************************* ---------------------- EDUCATION DAY ---------------------- MONDAY, JULY 1st, 1996 09.00-10.00 Registration 10.00-10.15 Opening 10.15-11.45 Invited Talks Industrial Trials of Formal Specification John Fitzgerald University Newcastle upon Tyne, UK Industrial Applications of ASF+SDF Arie van Deursen CWI Amsterdam, The Netherlands An Experience with MEC in a Real Industrial Project Andre Arnold Univ. Bordeaux, France 11.45-12.15 Discussion 12.15-13.45 Lunch 13.45-15.15 Invited Talks Applying Research Results in the Industrial Environment: The Case of the TRIO Specification Language Dino Mandrioli Politecnico di Milano, Italy Using Heterogeneous Formal Methods in Distributed Software Engineering Education Bernd Kr"amer Fern-Universit"at Hagen, Germany Introducing Formal Methods to Software Engineers Through OMG's CORBA Environment and Interface Definition Language Sriram Sankar Sun Microsystems Laboratories, USA 15.15-15.45 Discussion ------------------------- CONFERENCE SCHEDULE ------------------------- TUESDAY, JULY 2nd, 1996 08.00-8.45 Registration 08.45-9.00 Opening 09:00-10:00 Invited Talk Classification Approach to Design Douglas Smith Kestrel Institute, Palo Alto, USA 10:00-10:15 Discussion 10:15-10:45 Coffee Break 10:45-12:15 Session 1: Theorem Proving Semantic Foundations for Embedding HOL in Nuprl D. J. Howe AT&T Bell Laboratories, Murray Hill Free Variable Tableaux for a Many Sorted Logic with Preorders A. Gavilanes, J. Leach, S. Nieva Univ. Complutense Madrid Automating Induction over Mutually Recursive Functions D. Kapur and M. Subramaniam Univ. at Albany, New York 12:15-13:45 Lunch 13:45-15:15 Session 2: Algebraic Specification Pushouts of Order-Sorted Algebraic Specifications A. E. Haxthausen and F. Nickl Techn. Univ. of Denmark and sd&m, M"unchen A Formal Framework for Modules with State D. Ancona and E. Zucca Univ. di Genova Object-Oriented Implementation of Abstract Data Type Specifications R. Hennicker and C. Schmitz LMU M"unchen and Univ. T"ubingen 15:15-15:30 Coffee Break 15:30-16:30 System Demo Presentations SPECWARE: An Advanced Environment for the Formal Development of Complex Software Systems R. Juellig, Y. Srinivas, J. Liu Kestrel Institute, Palo Alto ASSPEGIQUE: An Integrated Specification Environment Providing Inter-Operability of Tools M. Bidoit*, C. Choppy**, F. Voisin*** LIENS, Paris*, IRIN, Univ. de Nantes**, LRI, Univ. de Paris-Sud*** Towards Integrating Algebraic Specification and Functional Programming: the Opal System K. Didrich, C. Gerke, W. Grieskamp, C. Maeder, P. Pepper Techn. Univ. Berlin InterACT: An Interactive Theorem Prover for Algebraic Specifications R. Geisler, M. Klar, F. Cornelius Techn. Univ. Berlin A new Proof-Manager and Graphic Interface for the Larch Prover F. Voisin LRI, Univ. de Paris-Sud TERSE: A Visual Environment for Supporting Analysis, Verification and Transformation of Term Rewriting Systems N. Kawaguchi, T. Sakabe, Y. Inagaki Nagoya Univ. 16:30-16:45 Coffee Break 16:45-18:15 Session 3: Concurrent and Reactive Systems On the Completeness of the Equations for the Kleene Star in Bisimulation Wan Fokkink Utrecht Univ. An Equational Axiomatization of Observation Congruence for Prefix Iteration L. Aceto and A. Ingolfsdottir Alborg Univ. Finite Axiom Systems for Testing Preorder and De Simone Process Languages I. Ulidowski Kyoto Univ. 19:00 Reception WEDNESDAY, JULY 3rd, 1996 08:30-09:30 Invited Talk Constructive Semantics of Esterel: From Theory to Practice Gerard Berry Centre de Math. Appl., Sophia Antipolis, France 09:30-09:45 Discussion 09:45-10:15 Coffee Break 10.15-12:15 Session 4: Program Verification Using Ghost Variables to Prove Refinement M. Marcus and A. Pnueli Weizmann Institute of Science, Rehovot Tracing the Origins of Verification Conditions R. Fraer INRIA, Sophia Antipolis Preprocessing for Invariant Validation E. P. Gribomont Univ. of Lie`ge Formal Verification of SIGNAL Programs: Application to a Power Transformer Station Controller M. Le Borgne*, H. Marchand*, E. Rutten*, M. Samaan** IRISA/INRIA, Rennes*, EDF/DER, Chatou** 12:15-13:45 Lunch 13:45-14:45 Invited Talk The Discrete Time Toolbus J.A. Bergstra and P. Klint CWI Amsterdam, The Netherlands 14:45-15:00 Discussion 15:00-15:15 Coffee Break 15:15-16:15 System Demo Presentations The TOOLBUS Coordination Architecture P. Klint Univ. Amsterdam A Demonstration of ASD: The Action Semantic Description Tools A. van Deursen and P. D. Mosses CWI Amsterdam and Aarhus Univ. Using Occurrence and Evolving Algebras for the Specification of Language-Based Programming Tools Arnd Poetzsch-Heffter Techn. Univ. M"unchen ECHIDNA: A System for Manipulating Explicit Choice Higher Dimensional Automata R. Buckland and M. Johnson Macquarie Univ. Verification using PEP S. Melzer, S. Romer, J. Esparza Techn. Univ. M"unchen The FC2TOOLS Set A. Bouali, A. Ressouche, V. Roy, R. de Simone INRIA, Sophia-Antipolis & Ecole des Mines de Paris 16:15-16:30 Coffee Break 16:30-18:00 Session 5: Concurrent and Reactive Systems A Study on the Specification and Verification of Performance Properties Xiao Jun Chen*, F. Corradini**, R. Gorrieri*** Univ. "La Sapienza", Roma*, Univ. of Sussex**, Univ. di Bologna*** Symbolic Bisimulation for Timed Processes M. Boreale Istituto per L'Elaborazione dell'Informazione, Pisa Approximative Analysis by Process Algebra with Graded Spatial Actions Y. Isobe, Y. Sato, K. Ohmaki Electrotechnical Laboratory, Tsukuba THURSDAY, JULY 4th, 1996 08:30-09:30 Invited Talk Boolean Formalism and Explanations Eric C. R. Hehner University of Toronto, Canada 09:30-09:45 Discussion 09:45-10:15 Coffee Break 10.15-11:45 Session 6: Logic Programming and Term Rewriting Proving Existential Termination of Normal Logic Programs M. Marchiori Univ. Padova Programming in Lygon: An Overview J. Harland*, D. Pym**, M. Winikoff*** Royal Melbourne Institute of Technology*, Univ. of London**, Univ. of Melbourne*** Some Characteristics of Strong Innermost Normalization M. R. K. Krishna Rao Max-Planck-Institut f"ur Informatik, Saarbr"ucken 11.45-12.15 System Demo Presentations Programming in Lygon: A System Demonstration J. Harland*, D. Pym**, M. Winikoff*** Royal Melbourne Institute of Technology*, Univ. of London**, Univ. of Melbourne*** CtCoq: A System Presentation J. Bertot and Y. Bertot INRIA, Sophia-Antipolis The TYPELAB Specification and Verification Environment F. W. von Henke, M. Luther, M. Strecker, M. Wagner Univ. Ulm 12:15-13:45 Lunch 13:45-14:45 Invited Talk On the Emergence of Properties in Component-Based Systems J. L. Fiadeiro University of Lisbon, Portugal 14:45-15:00 Discussion 15:00-15:15 Coffee Break 15:15-16:15 System Demo Presentations Incremental Formalization B. Steffen, T. Margaria, A. Classen, V. Braun Univ. Passau PROPLANE: A Specification Development Environment J. Souquieres and N. Levy Univ. de Nancy A Logic-Based Technology to Mechanize Software Components Reuse P. Parot INRIA, Le Chesnay TkGofer: A Functional GUI Library W. Schulte, T. Schwinn, T. Vullinghs Univ. Ulm ALPHA - A Class Library for a Metamodel based on Algebraic Graph Theory S. Erdmann and I. Classen Techn. Univ. Berlin 16:15-16:30 Coffee Break 16:30-18:00 Session 7: Algebraic and Logical Foundations Algebraic View Specification B. Paech Techn. Univ. M"unchen Towards Heterogeneous Formal Specifications G. Bernot, S. Coudert, P. Le Gall Univ. d'Evry A Categorical Characterization of Consistency Results C. Baier and M. Majster-Cederbaum Univ. Mannheim 20:00 Conference Dinner FRIDAY, JULY 5th, 1996 08:30-09:30 Invited Talk Algebraic Specification of Reactive Systems Manfred Broy Technische Universit"at M"unchen, Germany 09:30-09:45 Discussion 09:45-10:15 Coffee Break 10.15-11:45 Session 8: Concurrent and Reactive Systems A Model for Mobile Point-To-Point Data-Flow Networks without Channel Sharing R. Grosu and K.Stolen Techn. Univ. M"unchen Coalgebraic Specifications and Models of Deterministic Hybrid Systems B. Jacobs CWI Amsterdam A Bounded Retransmission Protocol for Large Data Packets J.F. Groote and J. van de Pol Utrecht Univ. 11.45-12.15 System Demo Presentations Resolution of Goals with the Functional and Logic Programming Language LPG: Impact of Abstract Interpretation D. Bert, K. Adi, R. Echahed IMAG-LSR, Grenoble Combining Reductions and Computations in ReDuX R. B"undgen and W. Lauterbach Univ. T"ubingen Conditional Directed Narrowing S. Limet and P. Rety LIFO-Univ. d'Orleans 12:15-12.30 Closing ********************************************************* REGISTRATION ********************************************************* REGISTRATION FEES ================== Before May 15: 400 DM ^ After May 15: 450 DM ^ Education Day only: 150 DM * ^ includes a copy of the proceedings, all coffee breaks and lunches, reception and banquet, * includes coffee breaks and lunch on July 1st. Extra Banquet Ticket : 100 DM Extra Reception Ticket : 30 DM. Payment must be in German currency, and can be made by cheque payable to "Prof. Martin Wirsing" or by bank transfer to: Bank: Bayerische Vereinsbank M"unchen Bank code: 70 020 270 Account no: 41 936 290 Account holder: Prof. Martin Wirsing Intended use: AMAST96 Bank transfers must specify registrant's name. Please ask your bank to arrange the transfer free of charges to the beneficiary. (No credit cards can be accepted!) REGISTRATION FORM: ================== Please type or print: ***************** AMAST'96 Registration form ******************** Last Name: First Name: Title: Affiliation: Street Address: City: Country: Phone: Fax: E-mail: Arrival date : Departure date: Payment is made by cheques: yes/no bank transfer: yes/no Total amount: Includes extra tickets for: ***************************************************************** Mail completed form either by e-mail to: hennicke@informatik.uni-muenchen.de or by surface mail to: Prof. Martin Wirsing AMAST'96 Institut f"ur Informatik Ludwig-Maximilians-Universit"at M"unchen Before April 15th: Leopoldstr. 11B, D-80802 M"unchen, After April 15th: Oettingenstr. 67, D-80538 M"unchen ********************************************************* ACCOMMODATION ********************************************************* Below you find a list of appropriate hotels in several price categories. PLEASE BOOK THE REQUIRED ROOMS YOURSELF (AS EARLY AS POSSIBLE!) ********** GUEST HOUSES ***************** All prices inclusive breakfast. Excelsior Kaulbachstr. 85 (1st floor) Tel. +89/34 82 13 Prices: Single: >= 65 DM Double: 114 DM (all rooms without WC and without bath) Location: Munich-Schwabing, 10-15 min walk to the conference building across the English Garden. Steinberg Ohmstr. 9 (1st floor) Tel. +89/33 10 11 Fax +89/33 10 11 Prices: Single: >= 69 DM Double: 100 DM (rooms with WC and bath available) Location: Munich-Schwabing, 10-15 min walk to the conference building across the English Garden. Note: If you are interested in this guest house then please contact first Rolf Hennicker (hennicke@informatik.uni-muenchen.de) since a special price may be possible. **************** HOTELS ********************* All prices inclusive breakfast (if not stated otherwise) and all rooms with WC and shower/bath. Lettl Amalienstr. 53 Tel. +89/286 69 70 Fax +89/28 66 97 97 Prices: Single: >= 110 DM Double: >= 175 DM Location: A small hotel in the University area, between Schwabing and the center. 25 min walk to the conference building, mainly through the English Garden. Cosmopolitan Hohenzollernstr. 5 Tel. +89/38 38 10 Fax +89/38 38 11 11 Prices: Single: 145 DM Double: 185 DM Location: A modern hotel in the middle of Schwabing. 20 min walk to the conference building, mainly through the English Garden. You can also take the bus no. 54 (direction "Ostbahnhof", stop "Tivolistrasse") or bus no. 154 (direction "Bruno-Walter-Ring", stop "Tivolistrasse"). Ariston Uns"oldstr. 10 Tel. +89/22 26 91 Fax 291 35 95 Prices: Single: 145 DM Double: 200 DM SPECIAL PRICE IF BOOKED BEFORE May 28: Single: 90 DM Double: 140 DM (The code word for the special price is AMAST; if there are any problems ask for Mrs. Griessner) Location: A hotel of the sixties, in Munich-Lehel, close to the center. 20 min walk to the conference building. You can also take the tramway no. 17 (direction "Effnerplatz", stop "Tivolistrasse"). M"unchen Park Hilton Am Tucherpark 7 Tel. +89/38 450 Prices: Single: 299 DM Double: 370 DM (both exclusive breakfast) Location: A comfortable hotel at the border of the English Garden. 5-10 min walk to the conference building. ********************************************************* TRAVEL INFORMATION ********************************************************* Munich offers good access by air, rail, and road. The new Munich International Airport has frequent flights to and from most major cities. By rail, the city offers easy access to the major European centers. The area of Munich is well served by the "S-Bahn" and the city by underground. There are single tickets (to be bought for each trip) or stripe cards ("Streifenkarte") which are relatively cheaper when used for several trips. Using a stripe card one has to cancel two stripes for any trip within Munich-City and eight stripes for one trip from Munich airport to the city (or conversely). HOW TO REACH THE CONFERENCE SITE AND THE HOTELS: If you arrive at the airport then take the S-Bahn no. 8 to Munich-City. If you arrive at the central station then take an arbitrary S-Bahn that goes into the direction of "Marienplatz-Ostbahnhof". Then, in any case, proceed as follows: To the conference building: Leave the S-Bahn at "Isartor"; Change to tramway no. 17 (direction "Effnerplatz"); Get out at "Tivolistrasse"; Then the conference building (Oettingenstrasse 67) is on the other side of the street; Conference room = no. 114. Note: The conference building is known to many people in Munich as the previous "Radio Free Europe" building. This may be helpful if you have any trouble. To guest houses Excelsior and Steinberg and to Hotel Cosmopolitan: Leave the S-Bahn at "Marienplatz"; Change to the underground no. U3 or no. U6 (direction "M"unchner Freiheit"); Get out at "Giselastrasse". To Hotel Lettl: Leave the S-Bahn at "Marienplatz"; Change to the underground no. U3 or U6 (direction "M"unchner Freiheit"); Get out at "Universit"at", exit "Schellingstrasse". To Hotel Ariston: Leave the S-Bahn at "Isartor"; Change to tramway no. 17 (direction "Effnerplatz"); Get out at "Nationalmuseum/Haus der Kunst"; (If you are arrived at the central station then it's better to choose directly the underground no. U4 (direction "Arabellapark") or U5 (direction "Neuperlach S"ud"). Leave the underground at "Lehel".) To M"unchen Park Hilton: It's the best to choose a Taxi at some place in Munich-City. Alternatively, you can first to go to the conference building and then walk to the hotel (5-10 min.). From Frits.Vaandrager@cs.kun.nl Mon Apr 1 13:39:03 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA12657; Mon, 01 Apr 96 04:39:07 EST Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 1 Apr 1996 11:39:04 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id LAA21007 (8.6.10/2.1); Mon, 1 Apr 1996 11:39:03 +0200 Received: by daphnis.cs.kun.nl id LAA08155 (8.6.10/2.1); Mon, 1 Apr 1996 11:39:03 +0200 Date: Mon, 1 Apr 1996 11:39:03 +0200 Message-Id: <199604010939.LAA08155@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Open positions in Computing Science at Uppsala University From: Jonas Barklund [The usual apologies for any multiple arrivals of this message. I hope it gets delivered properly this time.] The Faculty of Science and Technology at Uppsala University has opened two Senior Lecturerships in Computing Science. The positions are permanent. The closing date for applications is 15 April 1996. Further information is available through URL http://www.csd.uu.se/datalogi/Positions96/ The formal announcement can also be obtained from Ms Christina Lindberg, Office of the Faculty of Science and Technology Uppsala University Box 256 S-751 05 Uppsala Sweden Phone +46 18 181867, fax +46 18 181999, email Christina.Lindberg@uadm.uu.se. Information about the position can be obtained from Dr Jonas Barklund Computing Science Department Uppsala University Box 311 S-751 05 Uppsala Sweden Phone +46 18 181050, fax +46 18 511530, email jonas@csd.uu.se; or from Dr Hekan Millroth, address as above, phone +46 18 181056, fax +46 18 511925, email hakanm@csd.uu.se. Please note that applications should be directed to the Vice Chancellor, Uppsala University, Box 256, S-751 05 Uppsala, Sweden. For applications sent by fax to +46 18 182000, the original should follow by mail asap. -- Jonas Barklund From Frits.Vaandrager@cs.kun.nl Mon Apr 1 13:41:52 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA12677; Mon, 01 Apr 96 04:41:58 EST Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 1 Apr 1996 11:41:53 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id LAA21062 (8.6.10/2.1); Mon, 1 Apr 1996 11:41:53 +0200 Received: by daphnis.cs.kun.nl id LAA08169 (8.6.10/2.1); Mon, 1 Apr 1996 11:41:52 +0200 Date: Mon, 1 Apr 1996 11:41:52 +0200 Message-Id: <199604010941.LAA08169@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: PhD thesis available From: segala@cs.unibo.it (Roberto Segala) My PhD thesis is now available from MIT as technical report number MIT/LCS/TR-676. Ftp instructions follow after the abstract. Modeling and Verification of Randomized Distributed Real-Time Systems. Abstract: Randomization is an exceptional tool for the design of distributed algorithms, sometimes yielding efficient solutions to problems that are inherently complex, or even unsolvable, in the setting of deterministic algorithms. However, this tool has a price: even simple randomized algorithms can be extremely hard to verify and analyze. This thesis addresses the problem of verification of randomized distributed algorithms. We consider the problem both from the theoretical and the practical perspective. Our theoretical work builds a new mathematical model of randomized distributed computation; our practical work develops techniques to be used for the actual verification of randomized systems. Our analysis involves both untimed and timed systems, so that real-time properties can be investigated. Our model for randomized distributed computation is an extension of labeled transition systems. A probabilistic automaton is a state machine with transitions, where, unlike for labeled transition systems, a transition from a state leads to a discrete probability distribution over pairs consisting of a label and a state, rather than to a single label and a single state. A probabilistic automaton contains pure nondeterministic behavior since from each state there can be several transitions, and probabilistic behavior since once a transition is chosen the label that occurs and the state that is reached are determined by a probability distribution. The resolution of pure nondeterminism leads to probabilistic executions, which are Markov chain like structures. Once the pure nondeterminism is resolved, the probabilistic behavior of a probabilistic automaton can be studied. The properties of a randomized algorithm are stated in terms of satisfying some other property with a minimal or maximal probability no matter how the nondeterminism is resolved. In stating the properties of an algorithm we also account for the possibility of imposing restrictions on the ways in which the nondeterminism is resolved (e.g., fair scheduling, oblivious scheduling,...). We develop techniques to prove the correctness of some property by reducing the problem to the verification of properties of non-randomized systems. One technique is based on coin lemmas, which state lower bounds on the probability that some chosen random draws give some chosen outcomes no matter how the nondeterminism is resolved. We identify a collection of progress statements which can be used to prove upper bounds to the expected running time of an algorithm. The methods are applied to prove that the randomized dining philosophers algorithm of Lehmann and Rabin guarantees progress in expected constant time and that the randomized algorithm for agreement of Ben-Or guarantees agreement in expected exponential time. To ensure that our new model has strong mathematical foundations, we extend some of the common semantics for labeled transition systems to the probabilistic framework. We define a compositional trace semantics where a trace is replaced by a probability distribution over traces, called a trace distribution, and we extend the classical bisimulation and simulation relations in both their strong and weak version. Furthermore, we define probabilistic forward simulations, where a state is related to a probability distribution over states. All the simulation relations are shown to be sound for the trace distribution semantics. In summary, we obtain a framework that accounts for the classical theoretical results of concurrent systems and that at the same time proves to be suitable for the actual verification of randomized distributed real-time systems. This double feature should lead eventually to the easy extension of several verification techniques that are currently available for non-randomized distributed systems, thus rendering the analysis of randomized systems easier and more reliable. ------------------------ It is possible to obtain a copy of the thesis either from Bologna or from MIT, depending on which node is closer, by reading one of my URL addresses cs.unibo.it/~segala theory.lcs.mit.edu/~segala >From my URL addresses it is possible as well to get just the table of contents. Alternatively, it is possible to ftp the thesis as follows. >From Bologna: ftp cs.unibo.it login: anonymous password: [email address] cd pub/segala binary get phd.tar bye >From MIT: ftp theory.lcs.mit.edu login: anonymous password: [email address] cd pub/tds binary get TR-676.tar.gz bye The tar file contains 4 poscript files, three of which are the actual thesis. The fourth file is tha table of contents. Each file is less than 1Mb in size. From Frits.Vaandrager@cs.kun.nl Mon Apr 1 13:43:01 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA12689; Mon, 01 Apr 96 04:43:07 EST Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 1 Apr 1996 11:43:03 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id LAA21078 (8.6.10/2.1); Mon, 1 Apr 1996 11:43:02 +0200 Received: by daphnis.cs.kun.nl id LAA08174 (8.6.10/2.1); Mon, 1 Apr 1996 11:43:01 +0200 Date: Mon, 1 Apr 1996 11:43:01 +0200 Message-Id: <199604010943.LAA08174@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Position in Hybrid Computing at Xerox PARC From: saraswat@parc.xerox.com (Vijay Saraswat) [Apologies if you receive this message more than once...] We are looking for an outstanding recent PhD in Hybrid Computing to join our research group on Machine Control in the Scientific and Engineering Reasoning Area at the Xerox Palo Alto Research Center. Hybrid computing is a newly emerging, very active area at the boundary of control theory, model-based reasoning and computer science (concurrency, formal systems, languages, real-time systems). Its central concern is representing, designing, reasoning with, and controlling hybrid systems -- systems best thought of as consisting of both discretely and continuously varying components. The goal of the Machine Control project is to develop model-based techniques for the generation of adaptable and reusable software, particularly in the area of computationally-controlled electro-mechanical systems, such as photo-copiers. We co-develop these techniques in partnership with the community of practice around machine control software within Xerox. Our insights derive both from our understanding of the underlying mathematical foundations for such systems, and from collaborating with engineers who are working on these problems. More information about our project may be found at http://www.parc.xerox.com/mbc Concretely, a cornerstone of our work has been the development of a logic-based modeling notation for hybrid systems (HCC, Hybrid concurrent constraint programming), with its attendant mathematical foundations. The new recruit will help us to push the frontiers of our understanding about modeling hybrid systems in HCC, and reasoning with them, help us design concrete modeling notations to be used by engineers, and implement them via compilers and reasoning systems. He/She would work on the task of developing the physics-based compositional component models for electro-mechanical machines, enabling us to develop richly detailed, fully-working models of various real designs. This will enable us to develop actual techniques for adaptive control which work in this setting. An important part of this role is developing collaborative relationships with researchers and engineers in control-centered design within Xerox and outside. We want a researcher who can integrate well with the current team, but can take the lead in different aspects of the project. We will evaluate candidates in terms of their potential for working across the spectrum of activities --- theoretical, applied, implementational --- and their willingness to dive deeply into crucial details of actual example systems. We would like someone who has a very strong theoretical background in computer science (and, preferably with exposure to control theory), is comfortable working both with people who are primarily theoreticians, and people who are primarily implementors. The recruit should have a research philosophy that meshes smoothly with our vision of pioneering research grounded in practical problems. Interested people should send *plain text* e-mail resumes (including names of references) to: dolcourt@parc.xerox.com *Please do not send USMail*. We will process applications as they arrive, and will accept applications through May 1st. Xerox is an Affirmative Action and Equal Opportunity Employer. Vijay Saraswat and Markus Fromherz From Frits.Vaandrager@cs.kun.nl Mon Apr 1 13:35:56 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA13935; Mon, 01 Apr 96 07:44:03 EST Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 1 Apr 1996 11:35:57 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id LAA20936 (8.6.10/2.1); Mon, 1 Apr 1996 11:35:57 +0200 Received: by daphnis.cs.kun.nl id LAA08138 (8.6.10/2.1); Mon, 1 Apr 1996 11:35:56 +0200 Date: Mon, 1 Apr 1996 11:35:56 +0200 Message-Id: <199604010935.LAA08138@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: announcement From: lynch@theory.lcs.mit.edu (Nancy Lynch) My new book on "Distributed Algorithms" is now available from Morgan Kaufmann publishers. If you're interested, you can contact the publisher at mkp@mkp.com. You can see the table of contents at http://theory.lcs.mit.edu/tds/distalgs.html. Nancy Lynch From Frits.Vaandrager@cs.kun.nl Mon Apr 1 13:39:03 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA13984; Mon, 01 Apr 96 07:51:42 EST Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 1 Apr 1996 11:39:04 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id LAA21007 (8.6.10/2.1); Mon, 1 Apr 1996 11:39:03 +0200 Received: by daphnis.cs.kun.nl id LAA08155 (8.6.10/2.1); Mon, 1 Apr 1996 11:39:03 +0200 Date: Mon, 1 Apr 1996 11:39:03 +0200 Message-Id: <199604010939.LAA08155@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Open positions in Computing Science at Uppsala University From: Jonas Barklund [The usual apologies for any multiple arrivals of this message. I hope it gets delivered properly this time.] The Faculty of Science and Technology at Uppsala University has opened two Senior Lecturerships in Computing Science. The positions are permanent. The closing date for applications is 15 April 1996. Further information is available through URL http://www.csd.uu.se/datalogi/Positions96/ The formal announcement can also be obtained from Ms Christina Lindberg, Office of the Faculty of Science and Technology Uppsala University Box 256 S-751 05 Uppsala Sweden Phone +46 18 181867, fax +46 18 181999, email Christina.Lindberg@uadm.uu.se. Information about the position can be obtained from Dr Jonas Barklund Computing Science Department Uppsala University Box 311 S-751 05 Uppsala Sweden Phone +46 18 181050, fax +46 18 511530, email jonas@csd.uu.se; or from Dr Hekan Millroth, address as above, phone +46 18 181056, fax +46 18 511925, email hakanm@csd.uu.se. Please note that applications should be directed to the Vice Chancellor, Uppsala University, Box 256, S-751 05 Uppsala, Sweden. For applications sent by fax to +46 18 182000, the original should follow by mail asap. -- Jonas Barklund From Frits.Vaandrager@cs.kun.nl Mon Apr 1 13:43:01 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA14003; Mon, 01 Apr 96 07:55:24 EST Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 1 Apr 1996 11:43:03 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id LAA21078 (8.6.10/2.1); Mon, 1 Apr 1996 11:43:02 +0200 Received: by daphnis.cs.kun.nl id LAA08174 (8.6.10/2.1); Mon, 1 Apr 1996 11:43:01 +0200 Date: Mon, 1 Apr 1996 11:43:01 +0200 Message-Id: <199604010943.LAA08174@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Position in Hybrid Computing at Xerox PARC From: saraswat@parc.xerox.com (Vijay Saraswat) [Apologies if you receive this message more than once...] We are looking for an outstanding recent PhD in Hybrid Computing to join our research group on Machine Control in the Scientific and Engineering Reasoning Area at the Xerox Palo Alto Research Center. Hybrid computing is a newly emerging, very active area at the boundary of control theory, model-based reasoning and computer science (concurrency, formal systems, languages, real-time systems). Its central concern is representing, designing, reasoning with, and controlling hybrid systems -- systems best thought of as consisting of both discretely and continuously varying components. The goal of the Machine Control project is to develop model-based techniques for the generation of adaptable and reusable software, particularly in the area of computationally-controlled electro-mechanical systems, such as photo-copiers. We co-develop these techniques in partnership with the community of practice around machine control software within Xerox. Our insights derive both from our understanding of the underlying mathematical foundations for such systems, and from collaborating with engineers who are working on these problems. More information about our project may be found at http://www.parc.xerox.com/mbc Concretely, a cornerstone of our work has been the development of a logic-based modeling notation for hybrid systems (HCC, Hybrid concurrent constraint programming), with its attendant mathematical foundations. The new recruit will help us to push the frontiers of our understanding about modeling hybrid systems in HCC, and reasoning with them, help us design concrete modeling notations to be used by engineers, and implement them via compilers and reasoning systems. He/She would work on the task of developing the physics-based compositional component models for electro-mechanical machines, enabling us to develop richly detailed, fully-working models of various real designs. This will enable us to develop actual techniques for adaptive control which work in this setting. An important part of this role is developing collaborative relationships with researchers and engineers in control-centered design within Xerox and outside. We want a researcher who can integrate well with the current team, but can take the lead in different aspects of the project. We will evaluate candidates in terms of their potential for working across the spectrum of activities --- theoretical, applied, implementational --- and their willingness to dive deeply into crucial details of actual example systems. We would like someone who has a very strong theoretical background in computer science (and, preferably with exposure to control theory), is comfortable working both with people who are primarily theoreticians, and people who are primarily implementors. The recruit should have a research philosophy that meshes smoothly with our vision of pioneering research grounded in practical problems. Interested people should send *plain text* e-mail resumes (including names of references) to: dolcourt@parc.xerox.com *Please do not send USMail*. We will process applications as they arrive, and will accept applications through May 1st. Xerox is an Affirmative Action and Equal Opportunity Employer. Vijay Saraswat and Markus Fromherz From Frits.Vaandrager@cs.kun.nl Mon Apr 1 13:41:52 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA14089; Mon, 01 Apr 96 08:13:20 EST Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 1 Apr 1996 11:41:53 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id LAA21062 (8.6.10/2.1); Mon, 1 Apr 1996 11:41:53 +0200 Received: by daphnis.cs.kun.nl id LAA08169 (8.6.10/2.1); Mon, 1 Apr 1996 11:41:52 +0200 Date: Mon, 1 Apr 1996 11:41:52 +0200 Message-Id: <199604010941.LAA08169@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: PhD thesis available From: segala@cs.unibo.it (Roberto Segala) My PhD thesis is now available from MIT as technical report number MIT/LCS/TR-676. Ftp instructions follow after the abstract. Modeling and Verification of Randomized Distributed Real-Time Systems. Abstract: Randomization is an exceptional tool for the design of distributed algorithms, sometimes yielding efficient solutions to problems that are inherently complex, or even unsolvable, in the setting of deterministic algorithms. However, this tool has a price: even simple randomized algorithms can be extremely hard to verify and analyze. This thesis addresses the problem of verification of randomized distributed algorithms. We consider the problem both from the theoretical and the practical perspective. Our theoretical work builds a new mathematical model of randomized distributed computation; our practical work develops techniques to be used for the actual verification of randomized systems. Our analysis involves both untimed and timed systems, so that real-time properties can be investigated. Our model for randomized distributed computation is an extension of labeled transition systems. A probabilistic automaton is a state machine with transitions, where, unlike for labeled transition systems, a transition from a state leads to a discrete probability distribution over pairs consisting of a label and a state, rather than to a single label and a single state. A probabilistic automaton contains pure nondeterministic behavior since from each state there can be several transitions, and probabilistic behavior since once a transition is chosen the label that occurs and the state that is reached are determined by a probability distribution. The resolution of pure nondeterminism leads to probabilistic executions, which are Markov chain like structures. Once the pure nondeterminism is resolved, the probabilistic behavior of a probabilistic automaton can be studied. The properties of a randomized algorithm are stated in terms of satisfying some other property with a minimal or maximal probability no matter how the nondeterminism is resolved. In stating the properties of an algorithm we also account for the possibility of imposing restrictions on the ways in which the nondeterminism is resolved (e.g., fair scheduling, oblivious scheduling,...). We develop techniques to prove the correctness of some property by reducing the problem to the verification of properties of non-randomized systems. One technique is based on coin lemmas, which state lower bounds on the probability that some chosen random draws give some chosen outcomes no matter how the nondeterminism is resolved. We identify a collection of progress statements which can be used to prove upper bounds to the expected running time of an algorithm. The methods are applied to prove that the randomized dining philosophers algorithm of Lehmann and Rabin guarantees progress in expected constant time and that the randomized algorithm for agreement of Ben-Or guarantees agreement in expected exponential time. To ensure that our new model has strong mathematical foundations, we extend some of the common semantics for labeled transition systems to the probabilistic framework. We define a compositional trace semantics where a trace is replaced by a probability distribution over traces, called a trace distribution, and we extend the classical bisimulation and simulation relations in both their strong and weak version. Furthermore, we define probabilistic forward simulations, where a state is related to a probability distribution over states. All the simulation relations are shown to be sound for the trace distribution semantics. In summary, we obtain a framework that accounts for the classical theoretical results of concurrent systems and that at the same time proves to be suitable for the actual verification of randomized distributed real-time systems. This double feature should lead eventually to the easy extension of several verification techniques that are currently available for non-randomized distributed systems, thus rendering the analysis of randomized systems easier and more reliable. ------------------------ It is possible to obtain a copy of the thesis either from Bologna or from MIT, depending on which node is closer, by reading one of my URL addresses cs.unibo.it/~segala theory.lcs.mit.edu/~segala >From my URL addresses it is possible as well to get just the table of contents. Alternatively, it is possible to ftp the thesis as follows. >From Bologna: ftp cs.unibo.it login: anonymous password: [email address] cd pub/segala binary get phd.tar bye >From MIT: ftp theory.lcs.mit.edu login: anonymous password: [email address] cd pub/tds binary get TR-676.tar.gz bye The tar file contains 4 poscript files, three of which are the actual thesis. The fourth file is tha table of contents. Each file is less than 1Mb in size. From Frits.Vaandrager@cs.kun.nl Mon Apr 1 13:37:23 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA14203; Mon, 01 Apr 96 08:17:04 EST Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 1 Apr 1996 11:37:25 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id LAA20978 (8.6.10/2.1); Mon, 1 Apr 1996 11:37:24 +0200 Received: by daphnis.cs.kun.nl id LAA08144 (8.6.10/2.1); Mon, 1 Apr 1996 11:37:23 +0200 Date: Mon, 1 Apr 1996 11:37:23 +0200 Message-Id: <199604010937.LAA08144@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: AMAST'96: Call for Participation From: Bernhard Reus [With apologies if you get this announcement more than once. B. Reus] -------------------------------------------------------------------- A word-wide-web page containing information about the conference is reachable by URL: http://www.pst.informatik.uni-muenchen.de/amast96 . e-mail: amast96-info@informatik.uni-muenchen.de -------------------------------------------------------------------- ********************************************* ******************************************* FIFTH INTERNATIONAL CONFERENCE ON ALGEBRAIC METHODOLOGY AND SOFTWARE TECHNOLOGY AMAST '96 ******************************************* ********************************************* July 1-5, 1996 Munich, Germany Sponsored by Deutsche Forschungsgemeinschaft M"unchener Universit"atsgesellschaft s d & m Siemens Organized by Ludwig-Maximilians-Universit"at M"unchen FINAL PROGRAMME, REGISTRATION, ACCOMMODATION, and TRAVEL INFORMATION ********************************************************* FINAL PROGRAMME ********************************************************* ---------------------- EDUCATION DAY ---------------------- MONDAY, JULY 1st, 1996 09.00-10.00 Registration 10.00-10.15 Opening 10.15-11.45 Invited Talks Industrial Trials of Formal Specification John Fitzgerald University Newcastle upon Tyne, UK Industrial Applications of ASF+SDF Arie van Deursen CWI Amsterdam, The Netherlands An Experience with MEC in a Real Industrial Project Andre Arnold Univ. Bordeaux, France 11.45-12.15 Discussion 12.15-13.45 Lunch 13.45-15.15 Invited Talks Applying Research Results in the Industrial Environment: The Case of the TRIO Specification Language Dino Mandrioli Politecnico di Milano, Italy Using Heterogeneous Formal Methods in Distributed Software Engineering Education Bernd Kr"amer Fern-Universit"at Hagen, Germany Introducing Formal Methods to Software Engineers Through OMG's CORBA Environment and Interface Definition Language Sriram Sankar Sun Microsystems Laboratories, USA 15.15-15.45 Discussion ------------------------- CONFERENCE SCHEDULE ------------------------- TUESDAY, JULY 2nd, 1996 08.00-8.45 Registration 08.45-9.00 Opening 09:00-10:00 Invited Talk Classification Approach to Design Douglas Smith Kestrel Institute, Palo Alto, USA 10:00-10:15 Discussion 10:15-10:45 Coffee Break 10:45-12:15 Session 1: Theorem Proving Semantic Foundations for Embedding HOL in Nuprl D. J. Howe AT&T Bell Laboratories, Murray Hill Free Variable Tableaux for a Many Sorted Logic with Preorders A. Gavilanes, J. Leach, S. Nieva Univ. Complutense Madrid Automating Induction over Mutually Recursive Functions D. Kapur and M. Subramaniam Univ. at Albany, New York 12:15-13:45 Lunch 13:45-15:15 Session 2: Algebraic Specification Pushouts of Order-Sorted Algebraic Specifications A. E. Haxthausen and F. Nickl Techn. Univ. of Denmark and sd&m, M"unchen A Formal Framework for Modules with State D. Ancona and E. Zucca Univ. di Genova Object-Oriented Implementation of Abstract Data Type Specifications R. Hennicker and C. Schmitz LMU M"unchen and Univ. T"ubingen 15:15-15:30 Coffee Break 15:30-16:30 System Demo Presentations SPECWARE: An Advanced Environment for the Formal Development of Complex Software Systems R. Juellig, Y. Srinivas, J. Liu Kestrel Institute, Palo Alto ASSPEGIQUE: An Integrated Specification Environment Providing Inter-Operability of Tools M. Bidoit*, C. Choppy**, F. Voisin*** LIENS, Paris*, IRIN, Univ. de Nantes**, LRI, Univ. de Paris-Sud*** Towards Integrating Algebraic Specification and Functional Programming: the Opal System K. Didrich, C. Gerke, W. Grieskamp, C. Maeder, P. Pepper Techn. Univ. Berlin InterACT: An Interactive Theorem Prover for Algebraic Specifications R. Geisler, M. Klar, F. Cornelius Techn. Univ. Berlin A new Proof-Manager and Graphic Interface for the Larch Prover F. Voisin LRI, Univ. de Paris-Sud TERSE: A Visual Environment for Supporting Analysis, Verification and Transformation of Term Rewriting Systems N. Kawaguchi, T. Sakabe, Y. Inagaki Nagoya Univ. 16:30-16:45 Coffee Break 16:45-18:15 Session 3: Concurrent and Reactive Systems On the Completeness of the Equations for the Kleene Star in Bisimulation Wan Fokkink Utrecht Univ. An Equational Axiomatization of Observation Congruence for Prefix Iteration L. Aceto and A. Ingolfsdottir Alborg Univ. Finite Axiom Systems for Testing Preorder and De Simone Process Languages I. Ulidowski Kyoto Univ. 19:00 Reception WEDNESDAY, JULY 3rd, 1996 08:30-09:30 Invited Talk Constructive Semantics of Esterel: From Theory to Practice Gerard Berry Centre de Math. Appl., Sophia Antipolis, France 09:30-09:45 Discussion 09:45-10:15 Coffee Break 10.15-12:15 Session 4: Program Verification Using Ghost Variables to Prove Refinement M. Marcus and A. Pnueli Weizmann Institute of Science, Rehovot Tracing the Origins of Verification Conditions R. Fraer INRIA, Sophia Antipolis Preprocessing for Invariant Validation E. P. Gribomont Univ. of Lie`ge Formal Verification of SIGNAL Programs: Application to a Power Transformer Station Controller M. Le Borgne*, H. Marchand*, E. Rutten*, M. Samaan** IRISA/INRIA, Rennes*, EDF/DER, Chatou** 12:15-13:45 Lunch 13:45-14:45 Invited Talk The Discrete Time Toolbus J.A. Bergstra and P. Klint CWI Amsterdam, The Netherlands 14:45-15:00 Discussion 15:00-15:15 Coffee Break 15:15-16:15 System Demo Presentations The TOOLBUS Coordination Architecture P. Klint Univ. Amsterdam A Demonstration of ASD: The Action Semantic Description Tools A. van Deursen and P. D. Mosses CWI Amsterdam and Aarhus Univ. Using Occurrence and Evolving Algebras for the Specification of Language-Based Programming Tools Arnd Poetzsch-Heffter Techn. Univ. M"unchen ECHIDNA: A System for Manipulating Explicit Choice Higher Dimensional Automata R. Buckland and M. Johnson Macquarie Univ. Verification using PEP S. Melzer, S. Romer, J. Esparza Techn. Univ. M"unchen The FC2TOOLS Set A. Bouali, A. Ressouche, V. Roy, R. de Simone INRIA, Sophia-Antipolis & Ecole des Mines de Paris 16:15-16:30 Coffee Break 16:30-18:00 Session 5: Concurrent and Reactive Systems A Study on the Specification and Verification of Performance Properties Xiao Jun Chen*, F. Corradini**, R. Gorrieri*** Univ. "La Sapienza", Roma*, Univ. of Sussex**, Univ. di Bologna*** Symbolic Bisimulation for Timed Processes M. Boreale Istituto per L'Elaborazione dell'Informazione, Pisa Approximative Analysis by Process Algebra with Graded Spatial Actions Y. Isobe, Y. Sato, K. Ohmaki Electrotechnical Laboratory, Tsukuba THURSDAY, JULY 4th, 1996 08:30-09:30 Invited Talk Boolean Formalism and Explanations Eric C. R. Hehner University of Toronto, Canada 09:30-09:45 Discussion 09:45-10:15 Coffee Break 10.15-11:45 Session 6: Logic Programming and Term Rewriting Proving Existential Termination of Normal Logic Programs M. Marchiori Univ. Padova Programming in Lygon: An Overview J. Harland*, D. Pym**, M. Winikoff*** Royal Melbourne Institute of Technology*, Univ. of London**, Univ. of Melbourne*** Some Characteristics of Strong Innermost Normalization M. R. K. Krishna Rao Max-Planck-Institut f"ur Informatik, Saarbr"ucken 11.45-12.15 System Demo Presentations Programming in Lygon: A System Demonstration J. Harland*, D. Pym**, M. Winikoff*** Royal Melbourne Institute of Technology*, Univ. of London**, Univ. of Melbourne*** CtCoq: A System Presentation J. Bertot and Y. Bertot INRIA, Sophia-Antipolis The TYPELAB Specification and Verification Environment F. W. von Henke, M. Luther, M. Strecker, M. Wagner Univ. Ulm 12:15-13:45 Lunch 13:45-14:45 Invited Talk On the Emergence of Properties in Component-Based Systems J. L. Fiadeiro University of Lisbon, Portugal 14:45-15:00 Discussion 15:00-15:15 Coffee Break 15:15-16:15 System Demo Presentations Incremental Formalization B. Steffen, T. Margaria, A. Classen, V. Braun Univ. Passau PROPLANE: A Specification Development Environment J. Souquieres and N. Levy Univ. de Nancy A Logic-Based Technology to Mechanize Software Components Reuse P. Parot INRIA, Le Chesnay TkGofer: A Functional GUI Library W. Schulte, T. Schwinn, T. Vullinghs Univ. Ulm ALPHA - A Class Library for a Metamodel based on Algebraic Graph Theory S. Erdmann and I. Classen Techn. Univ. Berlin 16:15-16:30 Coffee Break 16:30-18:00 Session 7: Algebraic and Logical Foundations Algebraic View Specification B. Paech Techn. Univ. M"unchen Towards Heterogeneous Formal Specifications G. Bernot, S. Coudert, P. Le Gall Univ. d'Evry A Categorical Characterization of Consistency Results C. Baier and M. Majster-Cederbaum Univ. Mannheim 20:00 Conference Dinner FRIDAY, JULY 5th, 1996 08:30-09:30 Invited Talk Algebraic Specification of Reactive Systems Manfred Broy Technische Universit"at M"unchen, Germany 09:30-09:45 Discussion 09:45-10:15 Coffee Break 10.15-11:45 Session 8: Concurrent and Reactive Systems A Model for Mobile Point-To-Point Data-Flow Networks without Channel Sharing R. Grosu and K.Stolen Techn. Univ. M"unchen Coalgebraic Specifications and Models of Deterministic Hybrid Systems B. Jacobs CWI Amsterdam A Bounded Retransmission Protocol for Large Data Packets J.F. Groote and J. van de Pol Utrecht Univ. 11.45-12.15 System Demo Presentations Resolution of Goals with the Functional and Logic Programming Language LPG: Impact of Abstract Interpretation D. Bert, K. Adi, R. Echahed IMAG-LSR, Grenoble Combining Reductions and Computations in ReDuX R. B"undgen and W. Lauterbach Univ. T"ubingen Conditional Directed Narrowing S. Limet and P. Rety LIFO-Univ. d'Orleans 12:15-12.30 Closing ********************************************************* REGISTRATION ********************************************************* REGISTRATION FEES ================== Before May 15: 400 DM ^ After May 15: 450 DM ^ Education Day only: 150 DM * ^ includes a copy of the proceedings, all coffee breaks and lunches, reception and banquet, * includes coffee breaks and lunch on July 1st. Extra Banquet Ticket : 100 DM Extra Reception Ticket : 30 DM. Payment must be in German currency, and can be made by cheque payable to "Prof. Martin Wirsing" or by bank transfer to: Bank: Bayerische Vereinsbank M"unchen Bank code: 70 020 270 Account no: 41 936 290 Account holder: Prof. Martin Wirsing Intended use: AMAST96 Bank transfers must specify registrant's name. Please ask your bank to arrange the transfer free of charges to the beneficiary. (No credit cards can be accepted!) REGISTRATION FORM: ================== Please type or print: ***************** AMAST'96 Registration form ******************** Last Name: First Name: Title: Affiliation: Street Address: City: Country: Phone: Fax: E-mail: Arrival date : Departure date: Payment is made by cheques: yes/no bank transfer: yes/no Total amount: Includes extra tickets for: ***************************************************************** Mail completed form either by e-mail to: hennicke@informatik.uni-muenchen.de or by surface mail to: Prof. Martin Wirsing AMAST'96 Institut f"ur Informatik Ludwig-Maximilians-Universit"at M"unchen Before April 15th: Leopoldstr. 11B, D-80802 M"unchen, After April 15th: Oettingenstr. 67, D-80538 M"unchen ********************************************************* ACCOMMODATION ********************************************************* Below you find a list of appropriate hotels in several price categories. PLEASE BOOK THE REQUIRED ROOMS YOURSELF (AS EARLY AS POSSIBLE!) ********** GUEST HOUSES ***************** All prices inclusive breakfast. Excelsior Kaulbachstr. 85 (1st floor) Tel. +89/34 82 13 Prices: Single: >= 65 DM Double: 114 DM (all rooms without WC and without bath) Location: Munich-Schwabing, 10-15 min walk to the conference building across the English Garden. Steinberg Ohmstr. 9 (1st floor) Tel. +89/33 10 11 Fax +89/33 10 11 Prices: Single: >= 69 DM Double: 100 DM (rooms with WC and bath available) Location: Munich-Schwabing, 10-15 min walk to the conference building across the English Garden. Note: If you are interested in this guest house then please contact first Rolf Hennicker (hennicke@informatik.uni-muenchen.de) since a special price may be possible. **************** HOTELS ********************* All prices inclusive breakfast (if not stated otherwise) and all rooms with WC and shower/bath. Lettl Amalienstr. 53 Tel. +89/286 69 70 Fax +89/28 66 97 97 Prices: Single: >= 110 DM Double: >= 175 DM Location: A small hotel in the University area, between Schwabing and the center. 25 min walk to the conference building, mainly through the English Garden. Cosmopolitan Hohenzollernstr. 5 Tel. +89/38 38 10 Fax +89/38 38 11 11 Prices: Single: 145 DM Double: 185 DM Location: A modern hotel in the middle of Schwabing. 20 min walk to the conference building, mainly through the English Garden. You can also take the bus no. 54 (direction "Ostbahnhof", stop "Tivolistrasse") or bus no. 154 (direction "Bruno-Walter-Ring", stop "Tivolistrasse"). Ariston Uns"oldstr. 10 Tel. +89/22 26 91 Fax 291 35 95 Prices: Single: 145 DM Double: 200 DM SPECIAL PRICE IF BOOKED BEFORE May 28: Single: 90 DM Double: 140 DM (The code word for the special price is AMAST; if there are any problems ask for Mrs. Griessner) Location: A hotel of the sixties, in Munich-Lehel, close to the center. 20 min walk to the conference building. You can also take the tramway no. 17 (direction "Effnerplatz", stop "Tivolistrasse"). M"unchen Park Hilton Am Tucherpark 7 Tel. +89/38 450 Prices: Single: 299 DM Double: 370 DM (both exclusive breakfast) Location: A comfortable hotel at the border of the English Garden. 5-10 min walk to the conference building. ********************************************************* TRAVEL INFORMATION ********************************************************* Munich offers good access by air, rail, and road. The new Munich International Airport has frequent flights to and from most major cities. By rail, the city offers easy access to the major European centers. The area of Munich is well served by the "S-Bahn" and the city by underground. There are single tickets (to be bought for each trip) or stripe cards ("Streifenkarte") which are relatively cheaper when used for several trips. Using a stripe card one has to cancel two stripes for any trip within Munich-City and eight stripes for one trip from Munich airport to the city (or conversely). HOW TO REACH THE CONFERENCE SITE AND THE HOTELS: If you arrive at the airport then take the S-Bahn no. 8 to Munich-City. If you arrive at the central station then take an arbitrary S-Bahn that goes into the direction of "Marienplatz-Ostbahnhof". Then, in any case, proceed as follows: To the conference building: Leave the S-Bahn at "Isartor"; Change to tramway no. 17 (direction "Effnerplatz"); Get out at "Tivolistrasse"; Then the conference building (Oettingenstrasse 67) is on the other side of the street; Conference room = no. 114. Note: The conference building is known to many people in Munich as the previous "Radio Free Europe" building. This may be helpful if you have any trouble. To guest houses Excelsior and Steinberg and to Hotel Cosmopolitan: Leave the S-Bahn at "Marienplatz"; Change to the underground no. U3 or no. U6 (direction "M"unchner Freiheit"); Get out at "Giselastrasse". To Hotel Lettl: Leave the S-Bahn at "Marienplatz"; Change to the underground no. U3 or U6 (direction "M"unchner Freiheit"); Get out at "Universit"at", exit "Schellingstrasse". To Hotel Ariston: Leave the S-Bahn at "Isartor"; Change to tramway no. 17 (direction "Effnerplatz"); Get out at "Nationalmuseum/Haus der Kunst"; (If you are arrived at the central station then it's better to choose directly the underground no. U4 (direction "Arabellapark") or U5 (direction "Neuperlach S"ud"). Leave the underground at "Lehel".) To M"unchen Park Hilton: It's the best to choose a Taxi at some place in Munich-City. Alternatively, you can first to go to the conference building and then walk to the hotel (5-10 min.). From Frits.Vaandrager@cs.kun.nl Tue Apr 2 12:35:32 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA09710; Tue, 02 Apr 96 03:37:05 EST Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Tue, 2 Apr 1996 10:35:33 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id KAA02660 (8.6.10/2.1); Tue, 2 Apr 1996 10:35:33 +0200 Received: by daphnis.cs.kun.nl id KAA10872 (8.6.10/2.1); Tue, 2 Apr 1996 10:35:32 +0200 Date: Tue, 2 Apr 1996 10:35:32 +0200 Message-Id: <199604020835.KAA10872@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: FOOL Workshop paper submission problem From: kim@bull.cs.williams.edu (Kim Bruce) We had a fairly catastrophic failure of e-mail this morning and may have lost some submisions for FOOL 3, The Third International Workshop on Foundations of Object-Oriented Languages. If you submitted a paper and have not received an acknowledgement from me, please resubmit your paper to fool-submit@cs.williams.edu with a note to the effect that it is a resubmission. For added safety send a separate note to fool-info as we have also been experiencing some difficulty with some mail host machines choking on long postscript files. I apologize for the inconvenience. Kim Bruce, FOOL(ish) program chair P.S. This all comes from having a paper deadline on April Fool's day (U.S. - and perhaps world - holiday in which people play tricks on each other). I guess computers can get involved too! From Frits.Vaandrager@cs.kun.nl Tue Apr 2 12:34:26 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA09703; Tue, 02 Apr 96 03:36:59 EST Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Tue, 2 Apr 1996 10:34:27 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id KAA02639 (8.6.10/2.1); Tue, 2 Apr 1996 10:34:27 +0200 Received: by daphnis.cs.kun.nl id KAA10865 (8.6.10/2.1); Tue, 2 Apr 1996 10:34:26 +0200 Date: Tue, 2 Apr 1996 10:34:26 +0200 Message-Id: <199604020834.KAA10865@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Paper-Announcement: Decoding Choice Encodings From: Uwe Nestmann We are pleased to announce the availablity of our technical report (48p) on the formal analysis of choice encodings: Decoding Choice Encodings Uwe Nestmann (Univ Erlangen, D) Benjamin C. Pierce (Univ Cambridge, UK) Univ Erlangen, Interner Bericht IMMD VII-01/96 Univ Cambridge, Technical Report (to appear) We study two encodings of the \emph{asynchronous pi-calculus} with \emph{input-guarded choice} into its choice-free fragment. One encoding is divergence-free, but refines the atomic commitment of choice into gradual commitment. The other preserves atomicity, but introduces divergence. The divergent encoding is fully abstract with respect to weak bisimulation, but the more natural divergence-free encoding is not. Instead, we show that it is fully abstract with respect to \emph{coupled simulation}, a slightly coarser --- but still coinductively defined --- equivalence that does not require bisimilarity of internal branching decisions. The correctness proofs for the two choice encodings exploit the properties of \emph{decodings} from translations to source terms. Available (gzip-ed) as "Decoding.Choice.Encodings.dvi.gz" (99k) "Decoding.Choice.Encodings.ps.gz" (226k) from: ftp//ftp.informatik.uni-erlangen.de/local/inf7/papers/Nestmann/ or via email (send request message to "uwe@cma.fr"). Uwe Nestmann & Benjamin Pierce http://www7.informatik.uni-erlangen.de/~nestmann/ http://www.cl.cam.ac.uk/users/bcp1000/ From Frits.Vaandrager@cs.kun.nl Tue Apr 9 11:06:20 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA18259; Tue, 09 Apr 96 03:08:11 EDT Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Tue, 9 Apr 1996 09:07:25 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id JAA07532 (8.6.10/2.1); Tue, 9 Apr 1996 09:06:21 +0200 Received: by daphnis.cs.kun.nl id JAA28358 (8.6.10/2.1); Tue, 9 Apr 1996 09:06:20 +0200 Date: Tue, 9 Apr 1996 09:06:20 +0200 Message-Id: <199604090706.JAA28358@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: ETH Zurich - ASSISTANT PROFESSOR IN COMPUTER SCIENCE From: Christian Cachin The Swiss Federal Institute of Technology in Zurich (ETH Zurich) invites applications for the position of an ASSISTANT PROFESSOR IN COMPUTER SCIENCE in the Department of Computer Science (Informatics). Duties of the new professor include research and teaching in representative areas of computer science where theory provides direct support for applications. Examples of such areas of interest to our Department are: concurrency theory (distributed systems), logic and logic programming (formal specification, theorem proving, expert systems, information systems), computer algebra. An assistant professor has the opportunity for responsible scientific work in an attractive environment and with assistants. Appointments at the Assistant Professor level are for three years, and can be extend once by another three years, for a maximum of six years. The assistant professor should participate in the teaching duties of the Department and be able to work in a team. Candidates are expected to have completed a Ph.D. in Computer Science and some years of additional professional experience. They should have achieved significant research results in connections with successful applications, and some teaching experience. Please submit your application, together with a curriculum vitae, the list of your five most important publications, three referees, and a brief description of your research interests not later than 31 May 1996, to the President of ETH Zurich, Prof. J. Nuesch, ETH Zentrum, CH-8092 Zurich. In view of the current composition of its faculty, the ETH Zurich specifically encourages female candidates to apply. For further information please contact Prof. C.A. Zehnder, Head, Departement Informatik, CH-8092 Zurich (e-mail: zehnder@inf.ethz.ch). From Frits.Vaandrager@cs.kun.nl Thu Apr 11 18:02:48 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA10356; Thu, 11 Apr 96 10:02:52 EDT Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Thu, 11 Apr 1996 16:02:54 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id QAA15197 (8.6.10/2.1); Thu, 11 Apr 1996 16:02:49 +0200 Received: by daphnis.cs.kun.nl id QAA04474 (8.6.10/2.1); Thu, 11 Apr 1996 16:02:48 +0200 Date: Thu, 11 Apr 1996 16:02:48 +0200 Message-Id: <199604111402.QAA04474@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: FMCAD'96 From: srivas +-------------------------------------------------------+ | | | CALL FOR PAPERS | | | | The International Conference on | | | | Formal Methods in Computer-Aided Design: | | (FMCAD -- Successor to TPCD) | | | | Palo Alto, CA, USA | | 6 - 8. November 1996 | | | | In Cooperation with IFIP WG 10.5 | | CO-SPONSORED BY | | Texas Instruments, Hewlett-Packard Company, | | Cadence Berkeley Labs, Synopsys Inc., and | | LSI Logic Corporation | | | +-------------------------------------------------------+ FOCUS AND OBJECTIVES ==================== International Conference on Formal Methods in Computer-Aided Design '96 (FMCAD '96) is a forum for presenting state-of-the-art tools and techniques based on formal methods for computer-aided design of hardware. The location and the industrial sponsorship of the conference provide a unique opportunity for researchers in the field to interact with engineers from the Silicon Valley semiconductor and CAD companies. The objective is to cover all relevant formal aspects of work in computer-aided system design including verification, synthesis and testing. A special focus of this conference will be on the integration of complementary techniques and tools. The conference, will cover original research in this area, as well as case studies, technology transfer, and other practical experiments. It is intended to publish the Proceedings in time for distribution at the conference in the Springer LNCS series. Specific technical areas of FMCAD '96 include, but are not limited to: * New hardware verification techniques based on theorem proving, state exploration, model-checking, and BDDs * Correct by construction approaches to hardware design, such as synthesis and transformation * Hybrid approaches that integrate synthesis and verification or different verification techniques * Integration of formal methods with CAD tools, such as synthesis, simulation, and design exploration * Formal verification techniques for hardware description languages, such as VHDL, Verilog * Case studies and application of formal methods in industry This conference is a sequel in a series of IFIP WG 10.2/10.5 sponsored conferences with similar themes that have been most recently held in 1992 and 1994 under the banner ``Theorem Provers In Circuit Design.'' The intended audience includes workers in the field of hardware verification and synthesis as well as practising digital designers with an interest in formal methods. The conference will include contributed research papers, invited talks, tutorials, and tool demonstrations. INVITED SPEAKERS ================ (1) David Dill, Stanford University, USA (2) Kurt Keutzer, Synopsys Inc., USA (3) J S. Moore, Computational Logic Inc., USA PAPERS: 15 page, 11-point limit with abstract, containing original research in sufficient detail to assess its merits and relevance. Simultaneous submission to other conferences or journals and submission of previously published material are not allowed. TUTORIALS: 4 page abstract, 15 page, 11-point for final. We encourage presentations of tools on a suitable set of completely worked out examples. Submit in electronically self-contained Postscript to: fmcad96@csl.sri.com. Email submission is strongly encouraged for speeding up the reviewing process. When this is not possible, send seven hard-copies to: PAPERS TUTORIALS -------------- -------------- Mandayam Srivas Albert Camilleri Re: FMCAD '96 Re: FMCAD '96 SRI International (EL-262) HEWLETT-PACKARD COMPANY M/S 5596 333 Ravenswood Avenue 8000 FOOTHILLS BOULEVARD Menlo Park, CA 94025, USA ROSEVILLE CA 95747-5596, USA Email: srivas@csl.sri.com Email: ac@hprpcd.rose.hp.com Tel: +1 415-859-6136 Tel : +1 916 785 8488 Fax: +1 415-859-2844 Fax : +1 916 785 3096 Please direct all paper and program inquiries to fmcad96@csl.sri.com. Registration questions may be directed to vijay@lsil.com. For more information see our World Wide Web home page at http://www.csl.sri.com/FMCAD96. IMPORTANT DATES: Submission deadline: April 15, 1996 Notification of acceptance: June 17, 1996 Proceedings version of accepted papers due: July 15, 1996 ORGANIZERS: Program Chair: Mandayam Srivas, SRI International, USA Tutorials Chair: Albert Camilleri, Hewlett Packard Company, USA Registration Chair: Vijay Nagasamy, LSI Logic Inc., USA PROGRAM COMMITTEE: D. Borrione (TIMA, France) R. Brayton (University of California, Berkeley, USA) R. Bryant (CMU, USA) R. Camposano (Synopsys Inc., USA) L. Claesen (IMEC, Belgium) E. Clarke (CMU, USA) C. Delgado Kloos (Universidad Politecnica de Madrid, Spain) M. Fujita (Fujitsu Labs, USA) S. German (IBM, Yorktown Heights, USA) M. Gordon (University of Cambridge, UK) O. Grumberg (Technion, Haifa, Israel) W. Hunt (Computational Logic, Inc., USA) S. Johnson (University of Indiana, USA) R. Kumar (FZI, Karlsruhe, Germany) M. Leeser (Northeastern University, USA) P. Loewenstein (Sun Microsystems, USA) K. McMillan (Cadence Berkeley Lab, USA) C. Seger (Intel, Oregon, USA) J. Staunstrup (Technical University, Denmark) V. Stavridou (Queen Mary and Westfield College, UK) P.A. Subrahmanyam (AT&T, USA) J. Van Tassel (Texas Instruments, USA) From Frits.Vaandrager@cs.kun.nl Thu Apr 11 18:00:47 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA10321; Thu, 11 Apr 96 10:00:51 EDT Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Thu, 11 Apr 1996 16:00:53 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id QAA15156 (8.6.10/2.1); Thu, 11 Apr 1996 16:00:48 +0200 Received: by daphnis.cs.kun.nl id QAA04462 (8.6.10/2.1); Thu, 11 Apr 1996 16:00:47 +0200 Date: Thu, 11 Apr 1996 16:00:47 +0200 Message-Id: <199604111400.QAA04462@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Re: Paper-Announcement: Decoding Choice Encodings From: Uwe Nestmann I am sorry for an URL-mistake in my previous message: It should be ftp://ftp.informatik.uni-erlangen.de/local/inf7/papers/Nestmann/ ^^^ Uwe Nestmann From Frits.Vaandrager@cs.kun.nl Thu Apr 11 17:59:36 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA10301; Thu, 11 Apr 96 09:59:41 EDT Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Thu, 11 Apr 1996 15:59:41 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id PAA15141 (8.6.10/2.1); Thu, 11 Apr 1996 15:59:36 +0200 Received: by daphnis.cs.kun.nl id PAA04455 (8.6.10/2.1); Thu, 11 Apr 1996 15:59:36 +0200 Date: Thu, 11 Apr 1996 15:59:36 +0200 Message-Id: <199604111359.PAA04455@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Final CfP: FORTE/PSTV'96 From: "FORTE-PSTV'96" Submission deadline: April 19, 1996 ! Update: - CHAPMAN & HALL has agreed to publish the final proceedings. - Author's guidelines for paper formatting are available at URL http://www.chaphall.com/chaphall/macros.html or by request to the conference organization chair. Since the final proceedings will be available at the conference, authors should be prepared that deadlines will be handled strictly. ------------------------------------------------------------------------ _____ ___ ____ _____ _____ ______ ____ _______ ___ ___ __ | ___/ _ \| _ \_ _| ____| / / _ \/ ___|_ _\ \ / ( ) _ \ / /_ | |_ | | | | |_) || | | _| / /| |_) \___ \ | | \ \ / /|/ (_) | '_ \ | _|| |_| | _ < | | | |___ / / | __/ ___) || | \ V / \__, | (_) | |_| \___/|_| \_\|_| |_____/_/ |_| |____/ |_| \_/ /_/ \___/ Final Call for Papers IFIP TC6/WG6.1 Joint International Conference on FORMAL DESCRIPTION TECHNIQUES for Distributed Systems and Communication Protocols, and PROTOCOL SPECIFICATION, TESTING, AND VERIFICATION Kaiserslautern, Germany, 8-11 October 1996 URL: http://www.informatik.uni-kl.de/aggotz/forte.pstv96 FORTE/PSTV'96 will address Formal Description Techniques (FDTs) applicable to Communication Protocols and Distributed Systems (such as Estelle, Lotos, SDL, ASN.1, TTCN, Z, Automata, Process Algebras, Logics). The conference will be a forum for presentation of the state of the art in theory, application, tools and industrialization of FDTs, and will provide an excellent orientation for newcomers. For the first time, the hitherto separate conferences FORTE and PSTV will be combined into a joint edition. FORTE/PSTV'96 will be sponsored by IFIP. The final proceedings will be published by Chapman & Hall. Research papers and industrial usage reports as well as proposals for tutorials (advanced technology seminars), poster displays and tool demonstrations are solicited, particularly in the following areas: - FDT-based system and protocol - Extensions of FDTs engineering - Semantical foundations - Practical experience and case - Real-time and probability aspects studies - Protocol testing - FDT-application to distributed - Conformance testing, test selection systems, highspeed protocols, and test coverage multimedia protocols, mobile - Performance modeling and analysis communication, Intelligent - Quality of Service modeling and Networks, network management, analysis network security - Verification and validation - FDT-based implementation - Protocol synthesis - Corporate strategic and financial - Tools and tool support consequences of FDT use FORTE/PSTV'96 will start with one day of tutorials and advanced technology seminars, and will continue with three days of technical presentations. Tool presentations and poster displays will be possible throughout the conference. The conference will be held at the Dorint Hotel Kaiserslautern. Conference Chairperson: Reinhard Gotzhein (University of Kaiserslautern, D) Conference Organization Chairperson: Jan Bredereke (University of Kaiserslautern, D) Important dates: April 19, 1996 Submission deadline (for more details, see below) June 24, 1996 Notification of acceptance July 19, 1996 Camera-ready copy for final proceedings due Program committee: G. v. Bochmann (Univ. of Montreal, Canada), T. Bolognesi (CNUCE, Italy), H. Bowman (Univ. of Kent at Canterbury, UK), J. Bredereke (Univ. of Kaiserslautern, Germany), E. Brinksma (Univ. of Twente, Netherlands), S. Budkowski (INT, France), A. Cavalli (INT, France), S. T. Chanson (Univ. of Science and Technology, Hong Kong), J. P. Courtiat (LAAS-CNRS, France), P. Dembinski (Academy of Science, Poland), W. Effelsberg (Univ. of Mannheim, Germany), U. Herzog (Univ. of Erlangen, Germany), T. Higashino (Univ. of Osaka, Japan), D. Hogrefe (Univ. of Berne, Switzerland), G. Holzmann (AT&T, USA), S. P. Iyer (NC State Univ., USA), J. Kroon (PTT Research, Netherlands), P. Ladkin (Univ. of Bielefeld, Germany), G. Leduc (Univ. of Liege, Belgium), S. Leue (Univ. of Waterloo, Canada), L. Logrippo (Univ. of Ottawa, Canada), J. de Meer (GMD FOKUS, Germany), E. Najm (ENST, France), J. Quemada (Technical Univ. of Madrid, Spain), H. Rudin (IBM, Switzerland), R. Tenney (Univ. of Massachusetts, Boston, USA), K. Turner (Univ. of Stirling, UK), S. T. Vuong (Univ. of British Columbia, Canada) 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/PSTV'96 Organization Committee or by World-Wide Web as described below. A cover letter naming a contact author (including postal and E-mail address) and indicating the preferred category (research paper or industrial 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 another conference or by a journal; furthermore it should state that, in case of acceptance, one of the authors will attend FORTE/PSTV'96 and present the paper. Authors may propose a list of Program Committee members whom they consider to be particularly qualified to review their submission. Chapman & Hall has agreed to publish the final proceedings, which will be available at the conference. For that reason, authors should be prepared that deadlines will be handled strictly. - Proposals for tool demonstrations (including hard- and software requirements) and poster displays. - Proposals for tutorials and advanced technology seminars. All submissions should be sent to Jan Bredereke. For further information: Jan Bredereke, University of Kaiserslautern, P.O. Box 3049, D-67653 Kaiserslautern, Germany, (street address: room 12/407, Erwin-Schroedinger-Str., D-67663 Kaiserslautern, Germany), Tel.: +49 631 205-3426 (Reinhard Gotzhein), -3287 (Jan Bredereke), -2640 (Fax), E-mail: forte.pstv96@informatik.uni-kl.de To obtain additional information (Postscript copy of the Call for Papers, keyword list, etc.), you may also browse our World-Wide Web pages, the URL is http://www.informatik.uni-kl.de/aggotz/forte.pstv96 Expression of interest in FORTE/PSTV'96: If you are interested in FORTE/PSTV'96, please return the following information to the Conference Organization Chairperson (preferably by E-mail to forte.pstv96@informatik.uni-kl.de): Name (including title): ............................................... Affiliation: .......................................................... Address: .............................................................. Tel: ................ Fax: ............. Email: ....................... o I would like to receive further information about FORTE/PSTV'96 by MAIL or ELECTRONIC MAIL (please indicate), please put me on your mailing lists. o I intend to submit to FORTE/PSTV'96 a research paper / an industrial usage report / a proposal for a tool demonstration / a proposal 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: ........................................................... From Frits.Vaandrager@cs.kun.nl Mon Apr 15 11:15:25 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA14009; Mon, 15 Apr 96 03:15:32 EDT Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 15 Apr 1996 09:15:31 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id JAA07701 (8.6.10/2.1); Mon, 15 Apr 1996 09:15:25 +0200 Received: by daphnis.cs.kun.nl id JAA14131 (8.6.10/2.1); Mon, 15 Apr 1996 09:15:25 +0200 Date: Mon, 15 Apr 1996 09:15:25 +0200 Message-Id: <199604150715.JAA14131@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Finite Model Theory Tutorial From: "Roy L. Crole" FINITE MODEL THEORY Problems, Methods and Applications - A Tutorial - Second Announcement. University of Wales Swansea, 7--9 July, 1996. Finite model theory has emerged in recent years as a very active area of research, on the frontier of logic, combinatorics and computer science. The two-day tutorial to be held in Swansea will present an in-depth introduction to the field aimed at postgraduate students and postdoctoral researchers (though open to all). Topics covered will include the central problems and methods of finite model theory, as well as applications in complexity theory, databases and computer aided verification. The detailed programme and a registration form are attached. The cost of registration is 380 GBP. A limited number of subsidised places are available for postgraduate students at 340 GBP. These will be awarded on a first come first served basis, so early registration is recommended. Registration includes: - Accommodation for the nights of Sunday, 7 July and Monday, 8 July. - Reception on Sunday evening. - Breakfast and lunch on Monday and Tuesday, as well as dinner on Monday evening. - Coffee and Tea breaks. - A copy of all course materials. The meeting is supported by a grant from the London Mathematical Society through the MathFit programme. For further information contact: Anuj Dawar Department of Computer Science Univeristy of Wales Swansea Swansea SA2 8PP. e-mail: a.dawar@swansea.ac.uk Tel.: +44 (0)1792 205678 ext.4805 Fax.: +44 (0)1792 295708. --------------------------------------------------------------------------- PROGRAMME Sunday, 7 July 1996 18:00--22:00 Registration and Welcome Reception. Monday, 8 July 1996 8:45 Opening Remarks 9:00 Capturing Complexity Classes. Iain A. Stewart, University of Leicester. 10:30 Coffee break. 11:00 Model Theory on Finite Structures. Anuj Dawar, University of Wales Swansea. 12:30 Lunch break. 14:00 Logical Reductions. Iain A. Stewart 15:30 Tea break. 16:00 Finite Variable Logics. Anuj Dawar 18:30 Dinner followed by informal social. Tuesday, 9 July 1996 9:00 Finite Model Theory and Databases. Stephane Grumbach, INRIA, Rocquencourt. 10:30 Coffee break. 11:00 Logics and Complexity in Finite Model Theory. Ian Hodkinson, Imperial College, London. 12:30 Lunch break. 14:00 Playing Ehrenfeucht Games. Clemens Lautemann, Universitaet Mainz. 15:30 Tea break. 16:00 Model Checking Games and Other Games. Colin Stirling, Edinburgh University. ------------------------------------------------------------------------- Finite Model Theory Tutorial Swansea 7--9 July 1996 Registration Form Name: Affiliation: Address: e-mail: Telephone: Please specify any dietary restrictions: Indicate amount enclosed (tick one): Student 340 GBP [] Other 380 GBP [] Return this registration form with the appropriate payment to: Anuj Dawar Department of Computer Science Univeristy of Wales Swansea Swansea SA2 8PP United Kingdom. e-mail: a.dawar@swansea.ac.uk Tel.: 01792 205678 ext.4805 Fax.: 01792 295708. (Cheques should be made payable to the University of Wales Swansea) From Frits.Vaandrager@cs.kun.nl Fri Apr 19 17:59:32 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA11396; Fri, 19 Apr 96 09:59:35 EDT Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Fri, 19 Apr 1996 15:59:41 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id PAA18867 (8.6.10/2.1); Fri, 19 Apr 1996 15:59:33 +0200 Received: by daphnis.cs.kun.nl id PAA25506 (8.6.10/2.1); Fri, 19 Apr 1996 15:59:32 +0200 Date: Fri, 19 Apr 1996 15:59:32 +0200 Message-Id: <199604191359.PAA25506@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: New technical report From: Mads Dam The following SICS technical report is now available as ftp://sics.se/pub/fdt/mfd/tmttpc.ps.Z. It should also eventually make its way to the SICS web site http://www.sics.se/ It is also available in by post by writing to Preben Hansen SICS Box 1263 S-164 28 Kista Sweden TOWARD A MODAL THEORY OF TYPES FOR THE PI-CALCULUS R. Amadio and Mads Dam We study the problem of specifying and verifying properties of pi-calculus processes while relying on a bisimulation semantics. As our property specification language we use a version of the modal mu-calculus adapted to the pi-calculus. We show that the logical language is sufficiently expressive to characterize by means of a finite formula a process up to any approximation of the bisimulation relation. We consider the problem of checking that a process of the pi-calculus satisfies a specification expressed in this modal mu-calculus. We develop an algorithm which is sound in general, and complete for processes having a finite reachability property. Finally, we present a proof system which can be applied to prove non-recursive properties of arbitrary processes. We show that the system is complete on the non-recursive fragment of the logical language. From Frits.Vaandrager@cs.kun.nl Fri Apr 19 17:58:31 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA11383; Fri, 19 Apr 96 09:58:41 EDT Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Fri, 19 Apr 1996 15:58:40 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id PAA18852 (8.6.10/2.1); Fri, 19 Apr 1996 15:58:31 +0200 Received: by daphnis.cs.kun.nl id PAA25501 (8.6.10/2.1); Fri, 19 Apr 1996 15:58:31 +0200 Date: Fri, 19 Apr 1996 15:58:31 +0200 Message-Id: <199604191358.PAA25501@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: 3rd WoLLIC'96 - Programme From: Ruy de Queiroz Re: 3rd Workshop on Logic, Language, Information and Computation (WoLLIC'96) May 8-10 1996 Salvador (Bahia), Brazil Sponsored by FoLLI, ASL, SBC Financial support by CNPq, CAPES, FINEP We are happy to present the programme of the 3rd WoLLIC'96, together with general information and registration form. If you are planning to participate, please fill in the registration form and send it to the e-mail address wollic96@di.ufpe.br (There is no need to send money now.) The Workshop is the third of a series started in 1994, and is held under the auspices of the European Association for Logic, Language and Information (FoLLI) and the Interest Group in Pure and Applied Logics (IGPL). As from the 1996 version, it is an Association for Symbolic Logic (ASL) sponsored meeting. It has also the institutional sponsorship of Sociedade Brasileira de Computacao (SBC). The next installment (4th WoLLIC'97) will most probably be held in Fortaleza (Ceara') from the 30th of July to the 1st of August 1997. (The First Call for Contributions will soon be released.) ******************************************************************************** 3rd Workshop on Logic, Language, Information and Computation (WoLLIC'96) May 8-10, 1996 Salvador (Bahia), Brazil Sponsored by FoLLI, ASL, SBC Financial support by CNPq, CAPES, FINEP ******************************************************************************** *********** May 8, 1996 *********** Morning: Model Theory and Games 08:30-09:30 (Invited talk) Semantic Games of Imperfect Information Wilfrid Hodges School of Mathematical Sci., Queen Mary and Westfield College, UK 09:30-10:30 (Invited talk, XI EBL'96) The Logic of Uncertain Information Daniele Mundici Department of Computer Science, University of Milan, Italy 10:30-10:40 Coffee/Tea break 10:40-11:00 Games and Abstract Machines for Classical Logic H. Herbelin INRIA, France 11:00-11:20 Paraconsistent Model Theory N. C. A. da Costa, J.-Y. Beziau, O. Bueno Department of Philosophy, University of Sao Paulo, Brazil 11:20-11:30 Coffee/Tea break 11:30-12:30 (Invited talk) Some Semantical Aspects of Linear Logic Andreas Blass Mathematics Department, University of Michigan, USA Afternoon: Program Logic 14:00-15:00 (Invited talk) Verifying Timed and Hybrid Systems Amir Pnueli Department of Computer Science, Weizmann Inst. of Science, Israel 15:00-15:10 Coffee/Tea break 15:10-15:30 An Instance of the CLP(X) Scheme which allows to deal with Temporal Reasoning Problems F. Ibanez, R. Forradellas, L. Rueda Universidad Nacional de San Juan, Argentina 15:30-15:50 Operational Semantics of Extended Statecharts (XCHART) F. Lucena, M. Harada, H. Liesenberg Department of Computer Science, State Univ. of Campinas, Brazil 15:50-16:10 Handling Uncertainty and Resources: Petri Nets, Fuzzy and Linear Logic J. Cardoso, R. Valette, B. Pradin-Chezalviel Federal University of Santa Catarina, Brazil and LAAS, Toulouse, France 16:10-16:30 A Machine-assisted Proof of the Subject Reduction Property for a Small Typed Functional Language A. Bove, A. Tasistro Instituto de Computaci\'on, Univ. de la Rep\'ublica, Uruguay, and Chalmers University, Gothenburg, Sweden 16:30-16:40 Coffee/Tea break 16:40-17:40 (Invited talk) Trees, Ordinals and Termination Nachum Dershowitz Dept. Computer Science, Univ. of Illinois at Urbana-Champaign, USA *********** May 9, 1996 *********** Morning: Semantics of Computation 08:30-09:30 (Invited talk) Topological Relational Structures Michael Smyth Department of Computing, Imperial College, UK 09:30-09:40 Coffee/Tea break 09:40-10:00 Denotational Semantics in Synthetic Domain Theory B. Reus Informatik, Ludwig Maximilians Universit\"at, Munich, Germany 10:00-10:20 A Categorical Logic for Information Systems M. Johnson School of Mathematics and Computing, Macquarie Univ., Australia 10:20-10:40 Vernacular Rules for General Recursion M. Henson Department of Computer Science, University of Essex, UK 10:40-11:00 Interface in Linear Logic: A Finite System of Generators D. Bechet CRIN-CNRS & INRIA-Lorraine, France 11:00-11:10 Coffee/Tea break 11:10-12:10 (Invited talk) `Logical' Relations between Syntax and Semantics Andrew Pitts Computer Laboratory, Cambridge University, UK Afternoon: Proof Theory 14:00-15:00 (Invited talk) Proof Theory and Semantics for Structurally-Free Logics J. Michael Dunn Depts of Computer Science and Philosophy, Indiana University, USA 15:00-15:10 Coffee/Tea break 15:10-15:30 Labelled Resolution for Classical and Non-Classical Logics D. Gabbay, U. Reyle Department of Computing, Imperial College, UK and Inst. f. Maschinelle Sprachverarbeitung, Stuttgart Univ., Germany 15:30-15:50 LDS - Natural Deduction for Substructural Logics K. Broda, M. Finger, A. Russo Department of Computing, Imperial College, UK Inst. of Mathematics and Statistics, Univ. of Sao Paulo, Brazil 15:50-16:10 Automated Deduction and Labelling: Case Studies in Categorial Logics S. Luz Filho Center for Cognitive Sciences, Edinburgh University, UK 16:10-16:30 Relational Proof Theory for FL, Linear and other Substructural Logics W. MacCaull Dept of Maths & Computing Sciences, St.Francis Xavier Univ., Canada 16:30-16:40 Coffee/Tea break 16:40-17:00 Universal Quantifiers in Logic Programs A. Bowers, P. M. Hill, F. Ibanez Department of Computer Science, University of Bristol, UK, School of Computer Studies, University of Leeds, UK, and Universidad Nacional de San Juan, Argentina 17:00-17:20 Decision Procedures and Model Building in Equational Clause Logic C. G. Ferm{\"u}ller, A. Leitsch CSLI, Stanford University, USA, and Technische Universit\"at Wien, Austria 17:20-17:40 Prolog and Automatic Language Implementation Systems M. Mernik, V. Zumer Fac. of Electrical Eng. & Computer Sci., Univ. of Maribor, Slovenia 17:40-18:00 Belief Revision View of Logic Programming J. C. P. da Silva, S. R. M. Veloso COPPE/Sistemas, Federal University of Rio de Janeiro, Brazil ************ May 10, 1996 ************ Morning: Knowledge Representation and Discourse Representation 08:30-09:30 (Invited talk) Three Levels of Knowledge Representation Peter G\"ardenfors Cognitive Science, Lund University, Sweden 09:30-09:40 Coffee/Tea break 09:40-10:00 Explanation Inference F. Pirri Dip. di Informatica e Sistemistica, Univ. Roma La Sapienza, Italy 10:00-10:20 On Dynamics of Full and Restricted First-Order Theories: Expressivity versus Tractability O. J. Lemon Department of Computer Science, University of Manchester, UK 10:20-10:40 Some Characteristics of the Inconsistent Default Logic Reasoning Style A. T. de C. Martins, T. H. C. Pequeno Department of Computer Science, Federal Univ. of Ceara', Brazil 10:40-11:00 A Logic for Careful Nonmonotonic Reasoning A. Buchsbaum, T. H. C. Pequeno Department of Computer Science, Federal Univ. of Ceara', Brazil 11:00-11:10 Coffee/Tea break 11:10-12:10 (Invited talk) Update Semantics meets Discourse Jeroen Groenendijk Inst. Logic, Lang. & Computation, Univ. Amsterdam, The Netherlands Afternoon: Algebraic Logic 14:00-15:00 (Invited talk) Sequential Algebra Roger Maddux Department of Mathematics, Iowa State University, USA 15:00-15:10 Coffee/Tea break 15:10-15:30 Fork Algebraic Datatypes P. E. Mart\'{\i}nez Lopez, G. A. Baum Depto. de Inform\'atica, Univ. Nacional de La Plata, Argentina 15:30-15:50 A Computational Meta Logic for the Horn Fragment of LF C. Sch\"urmann Department of Computer Science, Carnegie-Mellon University, USA 15:50-16:10 Implementing Martin-L\"of's Theory of Types in a Higher-Order Logic Programming Language G. Calder\'on Instituto de Computaci\'on, Universidad de la Rep\'ublica, Uruguay 16:10-16:30 Additive Linear Logic with Analytic Cut J.-Y. Marion Universit\'e Nancy 2 & CRIN-CNRS, France 16:30-16:40 Coffee/Tea break 16:40-17:00 Parsing Natural Language using LDS: A Prototype M. Finger, R. Kibble, R. Kempson Inst. of Mathematics and Statistics, Univ. of Sao Paulo, Brazil and Dept. Linguistics, School of Oriental and African Studies, UK 17:00-17:20 An Extended Lambek Calculus Approach to Spanish Possessives D. Wonsever Instituto de Computaci\'on, Universidad de la Rep\'ublica, Uruguay 17:20-17:40 Second Document Ranking Using a Keyfact Concept M.-S. Jun, S.-Y. Park System Software Dept., Electronics and Telecomm. Res. Inst., Korea 17:40-18:00 A Logic with Strong Negation and Variable Domains for Situation Theory X. Wang, P. Mott School of Computer Studies, University of Leeds, UK 18:00-18:10 Coffee/Tea break 18:10-19:10 (Invited talk, XI EBL'96) The Interaction between Logic and Specification Theory Paulo Veloso Department of Informatics, Pontificial Catholic Univ., Rio, Brazil 19:10 CLOSING ----------------- GETTING TO SALVADOR (BAHIA). There are various regular flights from Europe and USA to Salvador's `4 de Julho International Airport'. The airport is located at some 30Km from the city (out of inner city boundaries), and is under one hour by car to center of town. Besides the Brazilian airlines VARIG and VASP, one European airline has at least two direct flights to Salvador per week: TAP Air Portugal, from Lisbon. If you get to Brazil via Rio, you will able to choose from various domestic flights, some direct, from Rio to Salvador. (This is not exactly high season, but beginning of May is likely to be a fairly difficult time of the year to find seats in domestic flights, so please be safe by booking in advance.) There are five main domestic airlines in Brazil: VARIG, RIO-SUL, VASP, TRANSBRASIL and TAM. APPROXIMATE COST OF A TAXI RIDE FROM THE AIRPORT TO "SOL VITORIA MARINA HOTEL": R$45.00 (forty five reals). DIAL-A-CAB COMPANIES. Chame taxi - (+55 71) 241-2266 Radio taxi - (+55 71) 243-4333 Teletaxi - (+55 71) 321-9988 Ligue taxi - (+55 71) 358-0733 CURRENCY. Brazil's currency called `Real' (pronounce it (almost) like in French), abbrev. `R$', and R$1.00 is worth approx. US$1.00 (to be more precise, US$1=R$0.99 today). Banknotes: R$1, R$5, R$10, R$50, R$100. Coins: R$1, R$0.50, R$0.25, R$0.10, R$0.05, R$0.01. GENERAL TOURIST INFORMATION ABOUT SALVADOR AND BAHIA. Please take a look at the web pages: http://www.got.net/~rgosula/bahia.html and http://www.ufba.br/~promocpd/versao2/promo3.html (general business info) Or contact the travel agent: Visao Turismo Rua dos Algibebes 96 Comercio 40015-060 Salvador, Bahia BRAZIL Tel. (+55 71) 241-6877 Fax (+55 71) 242-0928 Quote `3rd WoLLIC96/SEMINFO/UFBA' to get special prices. THE LOCATION. Salvador, Capital of the Bahia state, the first European settlement of Portuguese America and the first Capital of Brazil, is where all the most important colonial buildings were constructed: churches, convents, palaces, forts and many other monuments. Part of the city historical center has been safekept by UNESCO since 1985. Five hundred years of blending Native American, Portuguese, and African influences have left a rich culture to its people, which can be felt on its music, food, and mysticism. Salvador is located on the northeastern coast of Brazil and the sun shines year round with the average temperature of 25 degrees Celsius. It is surrounded by palm trees and beaches with warm water. City population is around 2.5 million and life style is quite relaxed. It is generally agreed that Salvador is Brazil's tourism industry best asset after Rio. With the recent restauration of its historic center, a visit to Salvador is a rather unique experience, not just for its natural beauty but also because it is quite simply THE place to see the best of Afro-Brazilian culture. THE WEATHER. Beginning of May in Salvador is usually fresh and rather windy (i.e. breezy, since it is by the sea), with temperatures around 22-24 degrees Celsius. Being the end of the rainy season an occasional shower may still fall during the first weeks of May. Usually, though, it is dry and a prelude to pleasant June. THE VENUE. The 3rd WoLLIC'96 is part of a larger event being held in the "Ondina" Campus of the Federal University of Bahia (UFBA). The lectures will be at the Main Library ("Biblioteca Central") at the Ondina Campus. Full address: Pavilhao de Aulas da Federacao (PAF) Instituto de Matematica / Centro de Processamento de Dados (CPD) Universidade Federal da Bahia (UFBA) Av. Adhemar de Barros, s/n Ondina Salvador, BA 40170-110 Brazil Tel.: +55 71 245 0899 Fax: +55 71 247 9907 E-mail: wollic96@di.ufpe.br http://www.di.ufpe.br/simposios/wollic http://www.ufba.br//seminfo96 During the workshop, transportation will be available Hotel-University-Hotel leaving every day from the `Sol Vitoria Marina Hotel' at 8:00 in the morning. It will leave the Campus in the afternoon at around 6:00pm, to take the participants back to the Hotel. RECEPTION DESK. There will be a reception desk in the Entrance Hall of the Main Library. The campus will be signposted with posters of `3rd WoLLIC 96' (in purple and yellow colours). WELCOME EVENING. There will be a social gathering in the evening of Wednesday 8th May, 8pm, near the main entrance to the "PAF". (To be confirmed) PUBLICATION OF THE PAPERS. Remember that the authors of contributions will be invited to submit full papers for publication (after the usual refereeing procedures) in a Special Issue of the `Journal of the Interest Group in Pure and Applied Logics'(ISSN 0945-9103). (A draft copy of the Special Issue with the papers selected from WoLLIC'95 will be available during this year's event.) -------------------------------------------------------------------------------- ACOMMODATION ------------ MAIN HOTEL Sol Victoria Marina Hotel (Apart hotel 4 stars) Price: Double room - R$50,00 + 5% Tax (Valid between the 6th and the 10th of May 1996) For Reservations Contact: Veronica Mestanza Dept. of Events - tel +55 71 336-7736 (voice & facsimile) (Extension 3329) Address: Av. Sete de Setembro, 2068 Vitoria 40.080-001 Salvador, Bahia BRAZIL MORE ECONOMICAL ALTERNATIVES: Ondina Plaza Hotel (3 stars) Price : Double room - R$36,00 (Valid between the 6th and the 10th of May 1996) Location : Ondina (close to the campus of UFBA) Tel. +55 71 245-8188 Pousada Por do Sol e Pousada dos Orixas (Block booking made for: 6th to 10th May 1996) Lodging with 04 beds per room, price includes beddings. Price: with breakfast: R$15,00 per person without breakfast: R$13,00 per person Meals: R$13,00 For Reservations Contact: Ms. Jovelina Address: Ladeira dos Aflitos, 45 Centro Salvador, Bahia BRAZIL Tel.: +55 71 321-6257 YOUTH HOSTELS The hostels below do NOT require YHA membership for GROUPS OF MORE THAN 10. Prices for group booking may be negotiated. 1. Albergue da Juventude Price: R$12,00 with breakfast Location: Pituba (not too far from the campus of UFBA) Tel: +55 71 248-0527 Vacancies: 50 2. Albergue da Juventude do Pelo Price: R$12,00 with breakfast Location: Pelourinho (Old part of Salvador) Tel: +55 71 242-8061 Vacancies: 60 3. Albergue das Laranjeiras (Well recommended) Price: R$11,50 with breakfast Location: Pelourinho (Old part of Salvador) Tel.: +55 71 321-1366 Vacancies: 57 4. Albergue do Passo Pousada e Turismo Tel +55 71 326-1951 5. Albergue da Juventude Dois de Julho Tel +55 71 243-9513 NB.: Further information and reservations must be made directly with the hotels/hostels via the telephone numbers given above. The quotes given are based on "promotional prices" especially arranged for the events, and are valid until the 15th of April. -------------------------------------------------------------------------------- -------------------------------------------------------------------------------- 3rd WoLLIC'96 3rd Workshop on Logic, Language, Information and Computation 1996 Salvador (Bahia), May 8-10 1996 Sponsored by FoLLI, ASL, SBC REGISTRATION FORM Name: Affiliation: Postal Address: Tel.: Fax: E-mail: Arrival date: Departure date: Category: [ ] Regular R$110.00 [ ] Member of IGPL R$66.00 (*) [ ] Student R$33.00 (please specify name and e-mail address of supervisor) Title of the paper to be presented (if appropriate): (*) If you wish to join the `Interest Group in Pure and Applied Logics' (the clearing house of The European Association of Logic, Language and Information - FoLLI) send a submission request to R.deQueiroz@doc.ic.ac.uk with full name, postal address, e-mail, tel, fax, and research interests. PLEASE DO NOT SEND MONEY NOW. Pay here at the reception desk. Fill in the form and send it to: ***** wollic96@di.ufpe.br ***** -------------------------------------------------------------------------------- -------------------------------------------------------------------------------- ****************** FOR SPEAKERS ONLY: ****************** PUBLICATION OF THE PAPERS. Remember that the authors of contributions will be invited to submit full papers for publication (after the usual refereeing procedures) in a Special Issue of the `Journal of the Interest Group in Pure and Applied Logics' (ISSN 0945-9103). (A draft copy of the Special Issue with the papers selected from the 2nd WoLLIC'95 will be available during this year's event.) Looking forward to welcoming you in Salvador, With much appreciation for your interest and attention, Best regards, Ruy de Queiroz --- ._, Ruy J. G. B. de Queiroz ,_| |._/\ Departamento de Informatica | |o/^^~-._ Universidade Federal de Pernambuco (UFPE) em Recife /-' | ~ Av. Prof. Luis Freire, s/n \__/|_ /' Cidade Universitaria \__ | . Recife, PE 50740-540 | __/' BRASIL > /' tel. +55 81 271 8430 /' /' fax: +55 81 271 8438 ~~^\/' e-mail: ruy@di.ufpe.br From Frits.Vaandrager@cs.kun.nl Fri Apr 19 19:23:30 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA13023; Fri, 19 Apr 96 11:23:35 EDT Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Fri, 19 Apr 1996 17:23:38 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id RAA19763 (8.6.10/2.1); Fri, 19 Apr 1996 17:23:31 +0200 Received: by daphnis.cs.kun.nl id RAA25703 (8.6.10/2.1); Fri, 19 Apr 1996 17:23:30 +0200 Date: Fri, 19 Apr 1996 17:23:30 +0200 Message-Id: <199604191523.RAA25703@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: BRICS Autumn School in Verification From: Allan Cheng ************************************************************* This message is being forwarded on several mailing lists. Please excuse receipt of multiple copies and please forward to any colleagues whom it might interest. ************************************************************* Preliminary Announcement BRICS Autumn School in Verification October 28 -- November 2, 1996 Aarhus, Denmark Description =========== BRICS, centre for Basic Research In Computer Science, was founded in 1994 by the Danish National Research Foundation at University of Aarhus and University of Aalborg; the director is Professor Glynn Winskel. Each year, BRICS focusses on a selected theme in the area of Algorithms and Complexity Theory, Logic, and Semantics. This year's BRICS theme is Verification. The activities will cover verification of computing systems in a broad sense. More specifically, we intend to investigate specification formalisms, proof principles, and technology of automated tools for verification. Events will take place during the autumn of '96. As a special activity, the autumn school will cover the topics "Theorem Proving and Model Checking" with special focus on "Combining deductive methods with model checking techniques" The contents of the autumn school will be the presentation of a selected set of tools and principles (theorem provers, model checkers and combinations) focussing on ``Cutting-Edge Applications-Oriented Techniques''. Lectures and presentation of the application of the tools will be weighted somewhat equally. The aim of the autumn school is that the participants leave with: * an understanding of theorem proving and model checking and their status, based on our choices of concrete tools * (hands-on) experience with (state of the art) applications of the tools * a feeling for the advantages and disadvantages of theorem proving vs. model checking * ideas of possibilities of combining theorem proving and model checking * possible research projects (short and long term) Participants ============ The autumn school is intended to attract Ph.D. students and other researchers. A working knowledge of English is assumed. We anticipate approximately 30 participants. Participants will be selected on the basis of their applications (see below). There is no registration fee, lunch will be provided free, and BRICS grants covering lodging expenses for attending students will be available. Participants are expected to pay for their own travel. Program ======= The invited speakers are David Basin, Max-Planck-Institut f|r Informatik Ed Clarke, CMU Tom Henzinger, University of California at Berkeley Gerard Holzmann, Bell Laboratories, USA Tom Melham, Glasgow Randy Pollack (likely), Chalmers Mandayam Srivas, SRI They intend to cover topics including: * (automata theoretic) decision procedures * symbolic model checking (abstraction, compositional reasoning, and symmetry) * theorem proving * proof checking * type theory for representing mathematics * applications to hardware, real time and hybrid systems In addition, tools will be presented (including HOL, HyTech, LEGO, Mona, PVS, SMV, and SPIN) and a panel-discussion among the invited speakers will be held at the end of the autumn school. Local arrangements ================= Lectures will take place at the Department of Computer Science, University of Aarhus. Lodging will be offered close to campus and the city centre. The city features an attractive old part with cafis, bars, and restaurants. Forests, museums, and other attractions are within easy reach by public transport. An excursion is planned. Organisers ========== David Basin, Allan Cheng, Kim Guldstrand Larsen, Tom Melham, and Mogens Nielsen. Application =========== An application should consist of a Curriculum Vitae, at least one letter of recommendation, and a description---less than a page---of research interests and accomplishments. The application should be mailed to the address below. Participants will be selected on basis of their research interests and qualifications in the area. Deadlines ========= Applications must be received by June 1, 1996. Answers will be mailed out soon after. Address ======= att. Autumn School BRICS Department of Computer Science University of Aarhus Ny Munkegade, Bldg. 540 DK-8000 Aarhus C Denmark Information will also be available on the WWW-page http://www.brics.dk/Activities/96/Verification/index.html From Frits.Vaandrager@cs.kun.nl Mon Apr 22 09:53:24 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA24952; Mon, 22 Apr 96 01:53:28 EDT Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 22 Apr 1996 07:53:34 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id HAA01997 (8.6.10/2.1); Mon, 22 Apr 1996 07:53:25 +0200 Received: by daphnis.cs.kun.nl id HAA02415 (8.6.10/2.1); Mon, 22 Apr 1996 07:53:24 +0200 Date: Mon, 22 Apr 1996 07:53:24 +0200 Message-Id: <199604220553.HAA02415@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: FLoC'96 Advance Program From: howe@research.att.com (Doug Howe) Call for Participation 1996 FEDERATED LOGIC CONFERENCE FLoC'96 July 27 - August 3, 1996, Rutgers University, New Jersey, USA FLoC is modelled after the Federated Computer Research Conference (FCRC), and brings together synergetic conferences that explore connections between logic and computer science. The following conferences will be part of FLoC. CADE: 13th International Conference on July 30 - August 3 Automated Deduction CAV: 8th International Conference on July 31 - August 3 Computer-Aided Verification LICS: 11th Annual IEEE Symposium on July 27 - July 30 Logic in Computer Science RTA: 7th International Conference on July 27 - July 30 Rewriting Techniques and Applications DIMACS, an NSF Science and Technology Center located at Rutgers University, will host FLoC as part of its Special Year on Logic and Algorithms and has provided significant support for reduced student fees. FLoC is also supported by generous contributions from AT&T Laboratories, Bell Labs-Lucent Technologies, DIMACS, IBM Almaden Research, IEEE Computer Society and the Max-Planck Institute. +------------------------------------------------+ | | | *ADVANCE PROGRAM AND REGISTRATION INFORMATION* | | | | http://www.research.att.com/lics/floc/ | | ftp://ftp.research.att.com/dist/floc/ | | | +------------------------------------------------+ FURTHER INFORMATION: For e-mail enquiries regarding the participating meetings, use cade13@cisr.anu.edu.au, cav96@research.att.com, lics96@cs.cmu.edu or rta96@mpi-sb.mpg.de. For other enquiries about FLoC, write to lics-request@research.att.com. PROGRAM/CONFERENCE CHAIRS: Michael McRobbie and John Slaney (CADE); Rajeev Alur and Thomas A. Henzinger (CAV); Edmund M. Clarke (LICS); Harald Ganzinger (RTA). LOCAL ARRANGEMENTS: Amy Felty (CADE), Rajeev Alur (CAV), Jon G. Riecke (LICS, FLoC committee chair), Leo Bachmair (RTA). FLOC STEERING COMMITTEE: Stephen Mahaney, Moshe Vardi (chair). FLOC PUBLICITY CHAIR: Douglas J. Howe. Tel: +1 (908) 582-3837. Fax: +1 (908) 582-7550. From Frits.Vaandrager@cs.kun.nl Mon Apr 22 09:51:05 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA24940; Mon, 22 Apr 96 01:51:18 EDT Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 22 Apr 1996 07:51:15 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id HAA01985 (8.6.10/2.1); Mon, 22 Apr 1996 07:51:05 +0200 Received: by daphnis.cs.kun.nl id HAA02409 (8.6.10/2.1); Mon, 22 Apr 1996 07:51:05 +0200 Date: Mon, 22 Apr 1996 07:51:05 +0200 Message-Id: <199604220551.HAA02409@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Call for Papers CHDL'97 From: Carlos Delgado Kloos Dear colleagues, please find attached the Call for Papers for CHDL'97. Kind regards, Carlos Delgado Kloos PS: Please excuse if you receive this mail more then once. This might be because you are in several mailing lists. ---------------------------------------------------------------------------- Call for Papers CHDL '97 XIII IFIP WG 10.5 Conference on Computer Hardware Description Languages and Their Applications 1997 Silver Jubilee Hotel Beatriz . Toledo, Spain . 20-25 April 1997 ---------------------------------------------------------------------------- CHDL has been held every other year since 1973, rotating between locations in Europe, North America and Asia. The conference originated under IEEE/ACM sponsorship and since 1981 has been organized by IFIP Working Group 10.2 (now WG 10.5). The topic has had a significant history with over 100 HDLs published in the 1970s. Since the mid-1980s, HDLs have become commonplace in system design and VLSI. This can be attributed to many factors including: * the advancing complexity of digital electronics, leading to more sophisticated modeling, simulation, and verification tools. * the migration of VLSI design to high-level synthesis based on HDLs * advances in microelectronics CAD toward support of system-level design * the increasing prevalence of generic and programmable components, of software-hardware and mixed digital-analog hybrid designs. Presently, we are in a consolidation phase, in which languages and standards are increasingly being used, at the same time as the scope is being broadened to additional application areas (such as analog, microwave or system-level design). CHDL'97 will present the latest developments in the area in the form of tutorials, invited talks, panel sessions and reviewed papers. In 1997, CHDL will be celebrating its Silver Jubilee, and this will be a very special occasion to learn from the past and look forward to what we might expect from the future. CHDL'97 will be held in conjunction with other workshops on closely related areas: * the Spring '97 Working Conference of the VHDL Forum for CAD in Europe * the Esprit NADA workshop (about New Hardware Design Methods). * the Workshop on Libraries, Component Modelling and Quality Assurance An exhibition will be held in parallel to these events. ---------------------------------------------------------------------------- Topics The topics of CHDL include several emerging design methods and technologies based on HDLs, including * Hardware Description Languages, Standards * Formal Methods * Verification and Validation * Design Analysis and Test * System-Level Specification and Design * High-Level Synthesis * Design Systems and Tools * New Application Areas ---------------------------------------------------------------------------- Submission of Papers Contributions on these or related topics are solicited. Papers on original research, experiences, reviews, and tutorial articles are welcome. Proposals for special sessions are also invited (please contact the Program Chair). Accepted papers will appear in proceedings published by Chapman & Hall. A best-paper award will be given. Papers (6 copies) should be submitted by 1 October 1996 to the Program Chair. A cover page should specify 1. title; 2. authors and affiliation; 3. mailing address, phone and fax numbers, and e-mail address of the primary author; 4. a brief abstract; and 5. one or two topics from the list to which the paper belongs. Submissions should use A4 or 8.5"\times 11" paper and be at most 20 pages in length (minimum line spacing 1 1/2). Submission by e-mail to the Program Chair of PostScript files is preferred, but since there may be printing or transmission problems, it is suggested that paper copies be also sent by regular mail. Important dates: * Submission deadline: 1 October 1996 * Notification of acceptance/rejection: 29 November 1996 * Camera-ready version: 22 December 1996 * Conference: 20-25 April 1997 ---------------------------------------------------------------------------- Toledo Toledo is without doubt one of the cities with the greatest density of monuments in the world. Nearly all the different stages of Spanish art are represented in Toledo, which has Moorish-Mudejar-Jewish buildings, such as the Tr'ansito and Santa Mar'ia la Blanca Synagogues; Gothic structures, such as the splendid cathedral; and Renaissance buildings. In the 16th century, the city became home to El Greco, and Toledo has many of his paintings, among which is "The Burial of the Count of Orgaz", his masterpiece, which is housed in the Mudejar Church of Santo Tom'e. Among its many museums, of special note is the one located in the old Santa Cruz Hospital. ---------------------------------------------------------------------------- General Chair Prof. Dr. Carlos Delgado Kloos Universidad Polit'ecnica de Madrid ETSI Telecomunicaci'on Ciudad Universitaria E-28040 Madrid (Spain) Tel: (+34-1) 5495700 ext 438 Fax: (+34-1) 3367333 E-mail: cdk@dit.upm.es Program Chair Prof. Dr. Eduard Cerny Dept. IRO Universit'e de Montr'eal C.P. 6128, Succ. Centre-Ville Montr'eal (Qu'ebec) Canada H3C 3J7 Tel: (+1-514) 343-7472 Fax: (+1-514) 343-5834 E-mail: cerny@iro.umontreal.ca Exhibition Chair Dr. Seraf'in Olcoz Yanguas TGI - Tecnolog'ia y Gesti'on de la Innovaci'on C/Vel'azquez, 134 bis E-28006 Madrid (Spain) Tel: (+34-1) 396-4925 Fax: (+34-1) 396-4841 E-mail: sera@www.tgi.es Local Arrangements Natividad Mart'inez Madrid Ingenier'ia Telem'atica Universidad Carlos III de Madrid C/Butarque, 15 E-28911 Legan'es/Madrid (Spain) Tel: (+34-1) 624-9903 Fax: (+34-1) 624-9430 E-mail: nmadrid@ing.uc3m.es Asia-Pacific Representative Prof. Masaharu Imai Department of Information and Computer Sciences Toyohashi University of Technology Toyohashi 441 (Japan) Tel: (+81-532) 42-0111, ext 509 Fax: (+81-532) 48--9079 E-mail: imai@tutics.tut.ac.jp Program Committee * David Agnew, Canada * Fran\c{c}ois Anceau, France * Przemyslaw Bakowski, France * Mario R Barbacci, USA * Howard Barringer, UK * Graham Birtwistle, UK * Dominique Borrione, France * Raul Camposano, USA * Eduard Cerny, Canada * Luc Claesen, Belgium * Edmund M Clarke, USA * Francisco Corella, USA * Werner Damm, Germany * Carlos Delgado Kloos, Spain * Nikil D Dutt, USA * Hans Eveking, Germany * Norbert Fristacky, Slovakia * Masahiro Fujita, Japan * Ganesh Gopalakrishnan, USA * Werner Grass, Germany * Rainer Hartenstein, Germany * Graham Hellestrand, Australia * Masaharu Imai, Japan * Steven D Johnson, USA * Thomas Kropf, Germany * David C Luckham, USA * Paul Menchini, USA * Jean Mermet, France * Wolfgang Nebel, Germany * Adam Pawlak, Germany * Robert Piloty, Germany * Paolo Prinetto, Italy * Franz Rammig, Germany * Peter Schwarz, Germany * J\orgen Staunstrup, Denmark * P A Subrahmanyam, USA * Flavio Wagner, Brazil * Ronald Waxman, USA * Akihiko Yamada, Japan * Michael Yoeli, Isreal ---------------------------------------------------------------------------- On-line information: http://www.dit.upm.es/~cdk/org/ifip/wg10.5/chdl97/index.html From Frits.Vaandrager@cs.kun.nl Mon Apr 22 18:55:24 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA03354; Mon, 22 Apr 96 10:55:30 EDT Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Mon, 22 Apr 1996 16:55:34 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id QAA07227 (8.6.10/2.1); Mon, 22 Apr 1996 16:55:24 +0200 Received: by daphnis.cs.kun.nl id QAA03639 (8.6.10/2.1); Mon, 22 Apr 1996 16:55:24 +0200 Date: Mon, 22 Apr 1996 16:55:24 +0200 Message-Id: <199604221455.QAA03639@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: PhD thesis available From: Joost-Pieter Katoen The following PhD thesis is currently available as a compressed Postscript file on my homepage (see URL below): Quantitative and Qualitative Extensions of Event Structures by Joost-Pieter Katoen A summary and list of content of this document (320 pp.) is also available on the same homepage. Hard copies of the dissertation can be requested by contacting the author at the address below. ___ __/ \__________ Joost-Pieter Katoen | \___/ | University of Twente fax. +31 53 4893247 |___ __ ___ | Dept. of Computing Science tel. +31 53 4893703 | | | / \ (__ | Tele-Informatics & Open Systems | | | \__/____) | P.O. Box 217 NL-7500 AE Enschede The Netherlands |_________________| http://wwwtios.cs.utwente.nl/~katoen/ From Frits.Vaandrager@cs.kun.nl Tue Apr 23 10:14:04 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA18419; Tue, 23 Apr 96 02:14:10 EDT Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Tue, 23 Apr 1996 08:14:13 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id IAA12084 (8.6.10/2.1); Tue, 23 Apr 1996 08:14:04 +0200 Received: by daphnis.cs.kun.nl id IAA05316 (8.6.10/2.1); Tue, 23 Apr 1996 08:14:04 +0200 Date: Tue, 23 Apr 1996 08:14:04 +0200 Message-Id: <199604230614.IAA05316@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Reminder Infinity Workshop From: Bernhard Steffen Dear Colleagues, Please do not forget the forthcoming deadline for the INFINITY workshop, which is held as a satellite of CONCUR'96. The call for papers is appended below. Looking forward to receiving your abstract! Best regards Bernhard Steffen ***************************** * * * Infinity * * * ***************************** Verification of Infinite State Systems (A Satellite Workshop of CONCUR'96) August 30, 1996 Pisa, Italy The aim of this workshop, which will take place immediately following the CONCUR'96 conference (cf.: http://www.di.unipi.it/ugo/CONCUR96.html), is to provide a forum for researchers interested in the development of mathematical techniques for the analysis of infinite state systems, a topic which has received a concerted effort within the Concurrency Theory community over the past few years. The basis of this effort has been the realization that an understanding of infinite state systems is necessary in order to have a complete picture of general process algebras, Petri nets, or other formalisms incorporating value-passing, real-time, hybrid, and/or probabilistic aspects. Its importance has grown however by the further realization that techniques which are developed for infinite state systems--- particularly structural techniques---can potentially provide elegant solutions to the state-space explosion problem in the analysis of finite state systems, as well as to classical problems in language theory. Possible topics for inclusion are: decidablility issues for equivalence and model checking over various classes of infinite state systems; complexity results for decidability results; connections and applications to questions in classical automata and formal language theory; and tools and case studies involving nontrivial applications of methods for the analysis of infinite state systems. SUBMISSIONS: ~~~~~~~~~~~ Potential participants are invited to submit an extended abstract (not to exceed five pages) outlining ongoing work. The submission should be emailed in postscript format to each of the four workshop committee members (email addresses listed below) BEFORE 30 April, 1996. The committee will select the most appropriate abstracts for presentation during the workshop and make their decisions known by 1 June. For technical questions please contact Bernhard Steffen, Universit\"at Passau, 94030 Passau. PROCEEDINGS: ~~~~~~~~~~~ The selected abstracts will be compiled in an informal proceedings in the form of a Passau University research report for distribution at the workshop and as electronic notes in TCS. PROGRAM COMMITTEE: ~~~~~~~~~~~~~~~~~~ Julian Bradfield, Edinburgh (GB) Didier Caucal, Rennes (F) Faron Moller, Stockholm (S) Bernhard Steffen, Passau (D, chair) LOCAL ORGANIZATION: As CONCUR'96: ~~~~~~~~~~~~~~~~~~~ Pierpaolo Degano (chair, Pisa), Roberto Gorrieri (Bologna), Stefania Gnesi (IEI-CNR), Corrado Priami (Pisa), Vladimiro Sassone (Pisa). Please send your requests to: concur96@di.unipi.it WORLD WIDE WEB: ~~~~~~~~~~~~~~~ http://www.uni-passau.de/fmi/lehrstuehle/steffen/cfp/infinity.html From Frits.Vaandrager@cs.kun.nl Wed Apr 24 10:38:56 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA10980; Wed, 24 Apr 96 02:39:00 EDT Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Wed, 24 Apr 1996 08:39:07 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id IAA00971 (8.6.10/2.1); Wed, 24 Apr 1996 08:38:56 +0200 Received: by daphnis.cs.kun.nl id IAA07954 (8.6.10/2.1); Wed, 24 Apr 1996 08:38:56 +0200 Date: Wed, 24 Apr 1996 08:38:56 +0200 Message-Id: <199604240638.IAA07954@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: SIROCCO'96 (Text): Program and Registration From: santoro@scs.carleton.ca (Nicola Santoro) ____________________________________________________________________ SIROCCO '96 ____________________________________________________________________ 3rd INTERNATIONAL COLLOQUIUM ON STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY ____________________________________________________________________ Certosa di Pontignano, Siena, Italy June 6-8, 1996 ____________________________________________________________________ PRELIMINARY PROGRAM ____________________________________________________________________ Thursday, June 6 ---------------- Morning Session INVITED TALK "Symmetry and Computability in Anonymous Networks" E. Kranakis (Carleton) CONTRIBUTIONS "Optimal Distributed Algorithms in Unlabelled Tori and Chordal Rings" B. Mans (James Cook - Townsville) "Computing on Anonymous Networks with Sense of Direction" P. Flocchini, A. Roncato (Carleton) ---- coffee break ----- "Good Fibrations and Other Constructions Which Preserve Sense of Direction" P. Boldi, S. Vigna (Milano) "Fault-Tolerant and Self-Stabilizing Ring Orientation" J. Beauquier, O. Debas, S. Kekkonen (Paris Sud) DISCUSSION, OPEN PROBLEMS, RESEARCH DIRECTIONS Afternoon Session CONTRIBUTIONS "Characterization of Networks Supporting Shortest-Path Interval Labeling Schemes" L. Narayanan (Concordia), S. Shende (Nebraska-Lincoln) "Lower Bounds for Shortest Path Interval Routing" C. Gavoille, S. Perennes (ENS - Lyon) "Interval Routing on k-trees" L. Narayanan (Concordia), N. Nishimura (Waterloo) ---- coffee break ----- "Boolean Routing on Cayley Networks" E. Kranakis, D. Krizanc (Carleton) "Boolean Routing on Cube Networks" M. Kant-Antonescu (Moncton) "A Routing Algorithm for Networks Based on Distance-Hereditary Topologies" G. di Stefano (L'Aquila) DISCUSSION, OPEN PROBLEMS, RUMP SESSION Friday, June 7 -------------- Morning Session INVITED TALK "Majority Voting, Coalitions and Monopolies in Graphs" D Peleg (Weizmann) CONTRIBUTIONS "Tight Bounds on the Size of 2-Monopolies" J-C. Bermond, J. Bond (Nice), D. Peleg (Weizmann), S. Perennes (Nice) "Spanners of Underlying Graphs of Iterated Line Digraphs" R. Harbane, C. Padro (Paris Sud) ---- coffee break ----- Exact Bandwith of Parallel-Processor Networks" P. de la Torre (New Hampshire), C.P. Kruskal (Maryland) "Full Access Networks of Small Size" E. Hotzel (GMD) DISCUSSION, OPEN PROBLEMS, RESEARCH DIRECTIONS Afternoon Session CONTRIBUTIONS "Distributed Computation and Incremental Maintainance of 3-Edge-Connected Components" E. Jennings (Lulea), L. Motyckova (Masarik) "Emulating Networks by Bus Networks: Application to Trees and Hypermeshes" D. Barth, A. Germa, M-C. Heydemann, D. Sotteau (Paris Sud) ---- coffee break ----- "Necklace-based Factorization of de Bruijn Digraphs" P. Tvrdik (Czech Technical University) "Virtual Path Layout for Some Bounded Degree Networks" L. Stacho, I. Vrt'o (Slovak Academy of Sciences) Saturday, June 8 ---------------- Morning Session INVITED TALK "Do you mean communication in networks ?" P. Fraigniaud (Lyon) CONTRIBUTIONS "Systolic Gossip in Complete Trees." A. Roncato (Carleton), W. Unger (Paderborn) "Efficient fault location with small risk" A. Pelc (U. Quebec - Hull) ---- coffee break ----- "On the Power of Local Information in Scheduling in Synchronous Networks" D.H. Ngok (Hong Kong), S. Zaks (Technion) "Distributed Anonymous Mobile Robots" I. Suzuki (Wisconsin), M. Yamashita (Hiroshima) DISCUSSION, OPEN PROBLEMS, RUMP SESSION End of Colloquium ____________________________________________________________________ CALLS ____________________________________________________________________ CALL FOR RUMP SESSION CONTRIBUTIONS The rump sessions are intended for presentation of unpolished recent results, description of current research efforts, informal exposition of published or submitted results. If interested in contributing, notify the PC chairs at the Colloquium. CALL FOR OPEN PROBLEMS You are invited to submit open problems for presentation at the Colloquium. Poss ibly, your submission should contain a statement of the problem, background information, known partial results, and any other relevant information. All contributed open problems will appear in the final proceedings with the name of the contributor. Submit directly at the Colloquium. ____________________________________________________________________ REGISTRATION ____________________________________________________________________ The registration fee is USD 450 or Lit. 700.000 (students: USD 350 or Lit. 550.000). The fee includes all expenses (room and board; all colloquium events; and the volume of the proceedings). Pre-proceedings containing a copy of all accepted papers will be available at the Colloquium. The final proceedings will be published by Carleton University Press and mailed to all participants after the colloquium. Payment can only be made in the form of a check (or Eurocheque) payable to UNIVERSITA' DI SIENA and mailed (with the enclosed Registration Form) to Servizio Congressi Universita' di Siena Via Banchi di Sotto, 46 53100 Siena, Italia Phone: +39 577 298132 Fax : +39 577 298134 The Registration Form (with the cheque) and the Student certification (if applicable) must be returned before MAY 20. ____________________________________________________________________ REGISTRATION FORM ____________________________________________________________________ (Please print clearly) Surname: ______________________________________________________ Name: ________________________________________________________ Affiliation: __________________________________________________ Address: ______________________________________________________ ______________________________________________________ Postal/Zip Code: ______________________________________________ City: _________________________________________________________ Country: ______________________________________________________ Phone: _________________________________________________________ Fax: _________________________________________________________ Email: _________________________________________________________ Registration Fee ____ Participant Lit. 700.000 (VAT included) USD 450 ____ Student Lit. 550.000 (VAT included) USD 350 Cheque no. _________________________________________________________ Bank ___________________________________________________________ Cheque must be made payable to UNIVERSITY OF SIENA. Date of Arrival: _____________________________________________________ Date of Departure: ___________________________________________________ I would like to share a room with _________________________________________________________ STUDENT CERTIFICATION Please have this filled and signed by a faculty member of your university or institute. I certify that ______________________________ is a full time student at _____________________________________________________________________ Name (Please Print): ___________________________________________________ Position: _____________________________________________________________ Signature: ________________________________________________________ ____________________________________________________________________ GENERAL INFORMATION ____________________________________________________________________ LOCATION: The colloquium will take place at the Certosa di Pontignano, located close to the city of Siena. GETTING THERE: 1. How to reach Siena In Siena there is no airport; the closest airports are in Rome, Pisa and Florence. From all three cities, you can reach Siena by train; from Florence the bus is also a viable alternative. a-Rome The airport is connected by train to Termini (Rome's main rail station). From Termini, to reach Siena you take the train for Florence and change train in Chiusi; total travel time: 2 + 1/2 hours. b-Pisa In the airport there is a railway station; to reach Siena, you take the train for Florence and change train in Empoli; total travel time: 2 hours. c-Florence The airport is connected by bus to Santa Maria Novella (Florence's main rail station); bus tickets are sold at the airport cafeteria; buses leave every hour. From the rail station, you can take a bus (SITA) or a train to Siena. The travel time will be the same both by bus and by train (time 1 and 1/2 hour).In Siena, the bus will stop in Piazza S. Domenico close to Piazza della Lizza. 2. How to reach Certosa di Pontignano from Siena a-By bus. Buses to Certosa di Pontignano leave from Piazza della Lizza (tickets are available in a kiosk in Piazza della Lizza; buses leave about every hour, and the last bus leaves at 19.00). From the rail station take a bus (numbers 2,3,9,10,15; tickets are available at the station, buses leave every 10 minutes) to Piazza della Lizza (or Piazza delle Poste); there you can board the bus to Certosa di Pontignano. b-Take a taxi (cost approximatly Lit.24.000) 3. If you are coming by car ... once in Siena, reach the railway station (if arriving from north or south, take the "Siena Nord" exit; follow the road and you will reach the railway station). There, follow the indications for Rome (green signs); at the second traffic lights (you have made a left turn and crossed a small bridge) follow the indications to "Gaiole in Chianti" (right at the end of the bridge). Once you reach "Ponte a Bozzone" (after around 6 Km.), you will find the indications for Certosa di Pontignano: turn left and you will be there after 1km. CLIMATE: At the beginning of June, the weather in Siena is usually sunny and pleasantly warm. From Frits.Vaandrager@cs.kun.nl Wed Apr 24 10:37:37 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA10767; Wed, 24 Apr 96 02:37:44 EDT Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Wed, 24 Apr 1996 08:37:48 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id IAA00962 (8.6.10/2.1); Wed, 24 Apr 1996 08:37:38 +0200 Received: by daphnis.cs.kun.nl id IAA07948 (8.6.10/2.1); Wed, 24 Apr 1996 08:37:37 +0200 Date: Wed, 24 Apr 1996 08:37:37 +0200 Message-Id: <199604240637.IAA07948@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Sirocco'96 (Latex): Program and Registration From: santoro@scs.carleton.ca (Nicola Santoro) %% SORRY IF YOU RECEIVE THIS MESSAGE MORE THAN ONCE %% % The next few lines define commands to format the % list of talks, authors and affiliations. \newcommand{\talk}[2]{\item[\bf #1]{\it #2\/}} \newcommand{\talknotitle}[1]{\item[\bf #1]} \newcommand{\by}[2]{#1, {\it #2\/}} \newenvironment{chairedsession}[2]{ \vspace{2mm} {\centerline{\bf #1}} {\centerline{Chair: #2}} \begin{list}{$\circ$} { \setlength{\parsep}{0mm} \setlength{\itemsep}{.2mm} \setlength{\leftmargin}{1cm} \setlength{\labelwidth}{1cm} \setlength{\parskip}{0mm} \setlength{\topsep}{0mm} \setlength{\labelsep}{2mm} }}{\end{list}} \newenvironment{plenary}[3]{ \vspace{2mm} {\centerline{\bf #1}} {\centerline{Chair: #3}} {\centerline{\bf #2}} \begin{list}{$\circ$} { \setlength{\parsep}{0mm} \setlength{\itemsep}{.2mm} \setlength{\leftmargin}{1cm} \setlength{\labelwidth}{1cm} \setlength{\parskip}{0mm} \setlength{\topsep}{0mm} \setlength{\labelsep}{2mm} }}{\end{list}\vspace{2mm}} \newenvironment{session}[1]{ \vspace{2mm} {\centerline{\bf #1}} \begin{list}{$\circ$} { \setlength{\parsep}{0mm} \setlength{\itemsep}{.2mm} \setlength{\leftmargin}{1cm} \setlength{\labelwidth}{1cm} \setlength{\parskip}{0mm} \setlength{\topsep}{0mm} \setlength{\labelsep}{1mm} }}{\end{list}} \newenvironment{social}[1]{ % \vspace{3mm} \begin{center} {\bf #1} \end{center}}{ % \vspace{1mm} } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% {\centerline{\normalsize\bf WENDNESDAY, JUNE 5}} \begin{social} {20:00-22:00, Welcome Reception} \end{social} \vspace{2mm} {\centerline{\normalsize\bf THURSDAY, JUNE 6 }} \begin{session} {Session 1: 09:00 \,--\, 9:50} \talk{09:00}{{\em Invited Talk:} Symmetry and Computability in Anonymous Netwo rks} \by{ E. Kranakis}{Carleton} \end{session} \begin{social} {Break} \end{social} %\vspace{-0.5cm} \begin{session} {Session 2: 10:00 \,--\, 10:50} \talk{10:00}{Optimal Distributed Algorithms in Unlabelled Tori and Chordal Ring s} \by{B. Mans}{James Cook - Townsville} \talk{10:25}{Computing on Anonymous Networks with Sense of Direction} \by{P. Flocchini, A. Roncato}{Carleton} \end{session} \begin{social} {Coffee Break} \end{social} \begin{session} {Session 3: 11:10 \,--\, 12:30} \talk{11:10}{Good Fibrations and Other Construction Which Preserve Sense of Di rection} \by{P. Boldi, S. Vigna}{Milano} \talk{11:35}{Fault-Tolerant and Self-Stabilizing Ring Orientation} \by{J. Beauquier, O. Debas, S. Kekkonen}{Paris Sud} \talk{12:00}{Open Problems \& Research Directions} \end{session} \begin{social} {Lunch Break } \end{social} \begin{session} {Session 4: 15:00 \,--\,16:15 } \talk{15:00}{Characterization of Networks Supporting Shortest-Path Interval Labeling Schemes} \by{L. Narayanan, S. Shende}{Concordia,Nebraska-Lincoln} \talk{15:25}{Lower Bounds for Shortest Path Interval Routing} \by{ C. Gavoille, S. Perennes}{ENS - Lyon} \talk{15:50}{Interval Routing on $k$-trees} \by{L. Narayanan, N. Nishimura}{Concordia,Waterloo} \end{session} \begin{social} {Coffee Break } \end{social} \begin{session} {Session 5: 16:30 \,--\, 18:30 } \talk{16:30}{Boolean Routing on Cayley Networks} \by{E. Kranakis, D. Krizanc}{Carleton} \talk{16:55} {Boolean Routing on Cube Networks} \by{M. Kant-Antonescu} {Moncton} \talk{17:20}{A Routing Algorithm for Networks Based on Distance-Hereditary T opologies} \by{G. di Stefano}{L'Aquila} \talk{17:55}{Open Problems \& Rump Session} \end{session} \begin{social} {Dinner } \end{social} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \vspace{2mm} {\centerline{\normalsize\bf FRIDAY, JUNE 7}} \begin{session} {Session 1: 09:00 \,--\, 9:50} \talk{09:00}{{\em Invited Talk:} Majority Voting, Coalitions and Monopolies in Graphs} \by{D. Peleg}{Weizmann} \end{session} \begin{social} { Break } \end{social} %\vspace{-0.5cm} \begin{session} {Session 2: 10:00 \,--\, 10:50} \talk{10:00}{Tight Bounds on the Size of 2-Monopolies} \by{ J-C. Bermond, J. Bond, D. Peleg, S. Perennes}{Nice, Nice, Weizmann, Nic e} \talk{10:25}{Spanners of Underlying Graphs of Iterated Line Digraphs} \by{R. Harbane, C. Padro} {Paris Sud, Catalunya} \end{session} \begin{social} {Coffee Break} \end{social} \begin{session} {Session 3: 11:10 \,--\, 12:30} \talk{11:10}{ Exact Bandwith of Parallel-Processor Networks} \by{P. de la Torre, C.P. Kruskal}{New Hampshire, Maryland} \talk{11:35}{Full Access Networks of Small Size} \by{E. Hotzel}{GMD} \talk{12:00}{Open Problems \& Research Directions} \end{session} \begin{social} {Lunch Break} \end{social} \begin{session} {Session 4: 15:00 \,--\,15:50 } \talk{15:00}{Distributed Computation and Incremental Maintainance of 3-Edge-Connected Components} \by{ E. Jennings, L. Motyckova} {Lulea, Masarik} \talk{15:25} {Emulating Networks by Bus Networks: Application to Trees and Hyp ermeshes} \by{ D. Barth, A. Germa, M-C. Heydemann, D. Sotteau}{Paris Sud} \end{session} \begin{social} {Coffee Break} \end{social} \begin{session} {Session 5: 16:05 \,--\, 16:55 } \talk{16:05} {Necklace-based Factorization of de Bruijn Digraphs} \by{P. Tvrdik}{Czech Technical University} \talk{16:30}{Virtual Path Layout for Some Bounded Degree Networks} \by{ L. Stacho, I. Vrt'o}{Slovak Academy of Sciences} \end{session} \begin{social} {Gitarella alle cantine } \end{social} \begin{social} {Conference Dinner} \end{social} \vspace{2mm} {\centerline{\normalsize\bf SATURDAY, JUNE 8}} \begin{session} {Session 1: 09:00 \,--\, 9:50} \talk{09:00}{{\em Invited Talk:} Do you mean communication in networks ? } \by{P. Fraigniaud}{ENS-Lyon} \end{session} \begin{social} { Break} \end{social} \begin{session} {Session 2: 10:00 \,--\, 10:50} \talk{10:00}{Systolic Gossip in Complete Trees} \by{A. Roncato, W. Unger}{Carleton, Paderborn} \talk{10:25}{Efficient fault location with small risk} \by{A. Pelc}{U. Quebec - Hull} \end{session} \begin{social} {Coffee Break} \end{social} \begin{session} {Session 3: 11:10 \,--\, 12:30} \talk{11:10}{On the Power of Local Information in Scheduling in Synchronous Netw orks} \by{D.H. Ngok, S. Zaks}{Hong Kong, Technion} \talk{11:35}{Distributed Anonymous Mobile Robots} \by{I. Suzuki, M. Yamashita}{Wisconsin, Hiroshima} \talk{12:00}{Open Problems \& Rump Session} \end{session} \begin{social} {Lunch \& End of the Colloquium} \end{social} \newcommand{\titre}[1]{\vfill\vspace{1mm}{\bf #1:}\par\nopagebreak} \vspace{2mm} \titre{Call for Rump Session Contributions} The rump sessions are intended for presentation of unpolished recent results, description of current research efforts, informal exposition of published or submitted results. If interested in contributing, notify the PC chairs at the Colloquium. \titre{Call for Open Problems} You are invited to submit open problems for presentation at the Colloquium. Poss ibly, your submission should contain a statement of the problem, background information, known partial results, and any other relevant information. All contributed open problems will appear in the final proceedings with the name of the contributors. Submit directly at the Colloquium. \newpage %%%%%%%%%%%% Travel Information %%%%%%%%%%%% {\centerline{\Large\bf General Information}} %\vspace{2mm} \begin{center} {\bf Location} \end{center} The colloquium will take place at the Certosa di Pontignano, located close to the city of Siena. \vspace{2mm} \centerline {\bf Getting There} %\looseness=-1 \vspace{-2mm} \paragraph{\bf 1. How to reach Siena} In Siena there is no airport; the closest airports are in Rome, Pisa and Florence. From all three cities, you can reach Siena by train; from Florence the bus is also a viable alternative. \vspace{-2mm} \paragraph{ \em a) Rome} The airport is connected by train to Termini (Rome's main rail station). From Termini, to reach Siena you take the train for Florence and change train in Chiusi; total travel time: 2 + 1/2 hours. \vspace{-2mm} \paragraph{ \em b) Pisa} In the airport there is a railway station; to reach Siena you take the train for Florence and change train in Empoli; total travel time: 2 hours. \vspace{-2mm} \paragraph{ \em c) Florence} The airport is connected by bus to Santa Maria Novella (Florence's main rail station); bus tickets are sold at the airport cafeteria; buses lea ve every hour. From the rail station you can take a bus (SITA) or a train to Siena; the bus will stop in Piazza S. Domenico close to Piazza della Lizza. (time 1 and 1/2 hour) \vspace{-2mm} \paragraph{\bf 2. How to reach Certosa di Pontignano from Siena.} You can take a {\em taxi} (cost approximatly Lit.24.000). Buses to Certosa di Pontignano leave from Piazza della Lizza (tickets are available in a kiosk in Piazza della Lizza; buses leave about every hour, and the last bus leaves at 19.00). From the rail station take a bus (numbers 2,3,9,10,15; tickets are available at the station, buses leave every 10 minutes) to Piazza della Lizza (or Piazza delle Poste); there you can board the bus to Certosa di Pontignano. \vspace{-2mm} \paragraph{\bf 3. If you are coming by car.} Once in Siena, reach the railway station (if arriving from north or south, take the ``Siena Nord" exit; follow the road and you will reach the railway station). There, follow the indications for Rome (green signs); at the second traffic lights (you have made a left turn and crossed a small bridge) follow the indications to {\em Gaiole in Chianti} (right at the end of the bridge). Once you reach {\em Ponte a Bozzone} (after about 6 Km.), you will find the indications for Certosa di Pontignano: turn left and you will be there after 1km. \begin{center} {\bf Climate} \end{center} At the beginning of June, the weather in Siena is usually sunny and pleasantly warm. \newpage { \onecolumn %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % \begin{center} \begin{tabular}{|llllll|}\hline \spazietto & \hspace*{3cm} & \hspace*{3cm} & \hspace*{3cm} & \hspace*{3cm} & \spazietto \\ \spazietto & \multicolumn{4}{c}{{\large\bf\em SIROCCO `96}}& \spazietto \\ \spazietto & \multicolumn{4}{c}{Certosa di Pontignano} & \spazietto \\ \spazietto & \multicolumn{4}{c}{6 -- 8 June 1996} & \spazietto \\ \spazietto & \multicolumn{4}{c}{}& \spazietto \\ \spazietto & \multicolumn{4}{c}{{\large\bf Registration Form}} & \spazietto \\ \spazietto & \multicolumn{4}{c}{}& \spazietto \\ \spazietto & \multicolumn{4}{c}{(Please print clearly)} & \spazietto \\ \spazietto & \multicolumn{4}{c}{}& \spazietto \\ \spazietto & \multicolumn{4}{l}{{\bf Surname:} \hrulefill} & \spazietto \\ \spazietto & \multicolumn{4}{l}{}& \spazietto \\ \spazietto & \multicolumn{4}{l}{{\bf Name:} \hrulefill} & \spazietto \\ \spazietto & \multicolumn{4}{l}{}& \spazietto \\ \spazietto & \multicolumn{4}{l}{{\bf Affiliation:} \hrulefill} & \spazietto \\ \spazietto & \multicolumn{4}{l}{}& \spazietto \\ \spazietto & \multicolumn{4}{l}{{\bf Address:} \hrulefill} & \spazietto \\ \spazietto & \multicolumn{4}{l}{}& \spazietto \\ \spazietto & \multicolumn{4}{l}{ \hrulefill} & \spazietto \\ \spazietto & \multicolumn{4}{l}{}& \spazietto \\ \spazietto & \multicolumn{4}{l}{{\bf Postal/Zip Code:} \hrulefill} & \spazietto \\ \spazietto & \multicolumn{4}{l}{}& \spazietto \\ \spazietto & \multicolumn{4}{l}{{\bf City:} \hrulefill} & \spazietto \\ \spazietto & \multicolumn{4}{l}{}& \spazietto \\ \spazietto & \multicolumn{4}{l}{{\bf Country:} \hrulefill} & \spazietto \\ \spazietto & \multicolumn{4}{l}{}& \spazietto \\ %---- Phone ---------------------- \spazietto & \multicolumn{4}{l}{{\bf Phone:} \hrulefill} & \spazietto \\ \spazietto & \multicolumn{4}{l}{}& \spazietto \\ \spazietto & \multicolumn{4}{l}{{\bf Fax:} \hrulefill} & \spazietto \\ \spazietto & \multicolumn{4}{l}{}& \spazietto \\ \spazietto & \multicolumn{4}{l}{{\bf Email:} \hrulefill} & \spazietto \\ \spazietto & \multicolumn{4}{l}{}& \spazietto \\ \spazietto & \multicolumn{4}{c}{Registration Fee}& \spazietto \\ \spazietto & \multicolumn{4}{c}{}& \spazietto \\ \spazietto & {\large $\Box$} Partecipants & \multicolumn{2}{l}{Lit. 700.000 (VAT included)} & USD 450 & \spazietto \\ \spazietto & {\large $\Box$} Students & \multicolumn{2}{l}{Lit. 550.000 (VAT included)} & USD 350 & \spazietto \\ \spazietto & \multicolumn{4}{c}{}& \spazietto \\ \spazietto & \multicolumn{4}{l}{cheque/Eurocheque no. \hrulefill} & \spazietto \\ \spazietto & \multicolumn{4}{c}{}& \spazietto \\ \spazietto & \multicolumn{4}{l}{Bank \hrulefill}& \spazietto \\ \spazietto & \multicolumn{4}{c}{}& \spazietto \\ \spazietto & \multicolumn{4}{l}{Cheque must be made payable to UNIVERSITY OF SI ENA } & \spazietto \\ \spazietto & \multicolumn{4}{c}{}& \spazietto \\ %----- Arrival/Departure ----------------- \spazietto & \multicolumn{4}{l}{Date of Arrival: \hrulefill}& \spazietto \\ \spazietto & \multicolumn{4}{c}{}& \spazietto \\ \spazietto & \multicolumn{4}{l}{Date of Departure: \hrulefill}& \spazietto \\ \spazietto & \multicolumn{4}{c}{}& \spazietto \\ \spazietto & \multicolumn{4}{c}{}& \spazietto \\ \spazietto & \multicolumn{4}{l}{I would like to share a room with: \hrulefill}& \spazietto \\ \spazietto & \multicolumn{4}{c}{}& \spazietto \\ \spazietto & \multicolumn{4}{l}{} & \spazietto \\ \hline \end{tabular} % \end{center} % \begin{center} \begin{tabular}{|llllll|}\hline \spazietto & \hspace*{3cm} & \hspace*{3cm} & \hspace*{3cm} & \hspace*{3cm} & \spazietto \\ \spazietto & \multicolumn{4}{c}{}& \spazietto \\ \spazietto & \multicolumn{4}{c}{{\large\bf\em SIROCCO `96}}& \spazietto \\ \spazietto & \multicolumn{4}{c}{Certosa di Pontignano} & \spazietto \\ \spazietto & \multicolumn{4}{c}{6 -- 8 June 1996} & \spazietto \\ \spazietto & \multicolumn{4}{c}{}& \spazietto \\ \spazietto & \multicolumn{4}{c}{}& \spazietto \\ \spazietto & \multicolumn{4}{c}{STUDENT CERTIFICATION} & \spazietto \\ \spazietto & \multicolumn{4}{c}{}& \spazietto \\ \spazietto & \multicolumn{4}{l}{Please have this filled and signed by a faculty member of your university or institute. } & \spazietto \\ \spazietto & \multicolumn{4}{c}{}& \spazietto \\ \spazietto & \multicolumn{4}{l}{{I certify that} \hrulefill} & \spazietto \\ \spazietto & \multicolumn{4}{l}{}& \spazietto \\ \spazietto & \multicolumn{4}{l}{{is a full time student at} \hrulefill} & \spazi etto \\ \spazietto & \multicolumn{4}{l}{}& \spazietto \\ \spazietto & \multicolumn{4}{l}{ \hrulefill} & \spazietto \\ \spazietto & \multicolumn{4}{l}{}& \spazietto \\ \spazietto & \multicolumn{4}{l}{{Name (Please print):} \hrulefill} & \spazietto \\ \spazietto & \multicolumn{4}{l}{}& \spazietto \\ \spazietto & \multicolumn{4}{l}{{Position:} \hrulefill} & \spazietto \\ \spazietto & \multicolumn{4}{l}{}& \spazietto \\ \spazietto & \multicolumn{4}{l}{{Signature:} \hrulefill} & \spazietto \\ \spazietto & \multicolumn{4}{l}{}& \spazietto \\ \spazietto & \multicolumn{4}{l}{} & \spazietto \\ \hline \end{tabular} % \end{center} \vspace{1cm} The Registration Form (with the cheque) and the student certification (if applicable) must be returned\\ before MAY 20 to: \begin{center} Servizio Congressi\\ Universit\'a di Siena\\ Via Banchi di Sotto, 46\\ 53100 Siena, Italia \\ Phone: +39 577 298132\\ Fax : +39 577 298134 \end{center} \vspace{1cm} For additional information, contact lodi@di.unipi.it } \end{document} From Frits.Vaandrager@cs.kun.nl Wed Apr 24 10:43:07 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA11082; Wed, 24 Apr 96 02:43:12 EDT Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Wed, 24 Apr 1996 08:43:19 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id IAA00984 (8.6.10/2.1); Wed, 24 Apr 1996 08:43:08 +0200 Received: by daphnis.cs.kun.nl id IAA07970 (8.6.10/2.1); Wed, 24 Apr 1996 08:43:07 +0200 Date: Wed, 24 Apr 1996 08:43:07 +0200 Message-Id: <199604240643.IAA07970@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: ECOOP'96 Workshop From: Jean-Paul BAHSOUN -------------------------------------------------------------- Please find enclosed the ascii and latex files of the last call for contributions concerning the ECOOP'96 Workshop on Proof Theory of Concurrent Object-Oriented Programming, Linz (Austria), Monday 8th July, 1996. ------------------------------------------------------------------------- LAST CALL FOR CONTRIBUTIONS ECOOP'96 Workshop on Proof Theory of Concurrent Object-Oriented Programming Linz (Austria), Monday 8th July, 1996 EXTENDED DEADLINE: May 6, 1996. ----------------- A one day workshop on Proof Theory of Concurrent Object-Oriented Programming is planned in the framework of the 10th European Conference on Object-Oriented Programming (ECOOP'96, Linz, Austria, 8-12 July 1996). There exists various approaches to model concurrent programming based-on logic. In this way, the use of logic for system development concerns the specification step but also the study of the operational aspects (through proof analysis and construction) of such development. In this context, we have to consider different logical systems for different uses of logic. Moreover, we can also consider concurrency from the both point of views: we want to reason and to specify systems where some concurrency aspects are involved and also to have some operational interpretations of concurrency into logic (focusing on the concept of proof). It seems clear that we have to identify and to study, in one hand, the role and the treatment of objects (representation, inheritance, modularity, communication, etc...) in this context, and in another hand, the interaction of work on proofs and concurrency with the Object-Oriented Programming paradigm. TOPICS This workshop aims to establish the state of art in the use of logic in interaction with concurrency and the use of objects. The objective is to provide an integrated forum for the presentation of research and the exchange of ideas and experiences in the topics concerned with proofs, concurrency and object-oriented programming (specification, proof development, etc...). Topics of interest, in this context, include (but are not restricted to): - proof-theoretical foundations - formalisms and logics to model concurrent systems and objects - proofs and concurrency: modularity, composition, communication interaction and synchronization - role and use of objects for concurrent programming and proving - verification and reuse - implementations and case studies The scientific program will include invited talks, presentations of the accepted papers and discussion. SUBMISSIONS Authors are invited to send one copy of an extended abstract (in postscript format) ({\bf 6-8 pages}) to Jean-Paul Bahsoun (bahsoun@irit.fr). Papers will be reviewed by peers, typically members of the program committee. The cover page should include a return mailing address and, if possible, an electronic mail address and a fax number. If at all possible, at the earliest possible moment a message containing the title of the paper, authors, abstract, keywords, and the address information outlined above should be sent by email to the corresponding address. The accepted abstracts will be published by the conference organization but a special issue of the journal "Mathematical Structures of Computer Science" on the topics of the workshop is expected. It will consist of some selected journal-length papers submitted by participants after the meeting. These complete papers will be refereed to the usual high standards of MSCS. Organizing-Program Committee: Jean-Paul Bahsoun (IRIT-CNRS, Toulouse) Jose Luis Fiadeiro (University of Lisboa) Didier Galmiche (CRIN-CNRS, Nancy) Akinori Yonezawa (University of Tokyo) INFORMATION by email: bahsoun@irit.fr by surface mail: Jean Paul Bahsoun IRIT-CNRS, Universit\'e Paul Sabatier 118, route de Narbonne 31062 Toulouse Cedex, France Phone: +33 61 55 82 11 Fax: +33 61 55 83 25 IMPORTANT DATES Deadline for submissions: May 6, 1996 Notification of acceptance: May 25, 1996 Workshop handouts ready: June 24, 1996 Workshop date: July 8, 1996 -------------LATEX FILE---------------------------------------- \documentstyle{article} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% Call for Contributions %% %% ECOOP'96 workshop %% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \def\head{ {\bf LAST CALL FOR CONTRIBUTIONS }\\[3mm] {\bf ECOOP'96 Workshop on }\\[4mm] {\Large \bf Proof Theory of Concurrent Object-Oriented Programming} \\ ~\\ {\bf Linz (Austria)}\\ Monday 8th July, 1996 \\ ~\\ EXTENDED DEADLINE : May 6, 1996 } \def\body{ A one day workshop on {\em Proof Theory of Concurrent Object-Oriented Programming} is planned in the framework of the 10th European Conference on Object-Oriented Programming (ECOOP'96, Linz, Austria, 8-12 July 1996). \\ ~\\ There exists various approaches to model concurrent programming based-on logic. In this way, the use of logic for system development concerns the specification step but also the study of the operational aspects (through proof analysis and construction) of such development. In this context, we have to consider different logical systems for different uses of logic. Moreover, we can also consider concurrency from the both point of views: we want to reason and to specify systems where some concurrency aspects are involved and also to have some operational interpretations of concurrency into logic (focusing on the concept of proof). It seems clear that we have to identify and to study, in one hand, the role and the treatment of objects (representation, inheritance, modularity, communication, etc...) in this context, and in another hand, the interaction of work on proofs and concurrency with the Object-Oriented Programming paradigm. \sect{ TOPICS } This workshop aims to establish the state of art in the use of logic in interaction with concurrency and the use of objects. The objective is to provide an integrated forum for the presentation of research and the exchange of ideas and experiences in the topics concerned with proofs, concurrency and object-oriented programming (specification, proof development, etc...). \\ ~\\ Topics of interest, in this context, include (but are not restricted to): \items{ \item proof-theoretical foundations \item formalisms and logics to model concurrent systems and objects \item proofs and concurrency: modularity, composition, communication interaction and synchronization \item role and use of objects for concurrent programming and proving \item verification and reuse \item implementations and case studies } \sect{ SUBMISSIONS } Authors are invited to send one copy of an extended abstract (in postscript format) ({\bf 6-8 pages}) to Jean-Paul Bahsoun ({\bf bahsoun@irit.fr}). Papers will be reviewed by peers, typically members of the program committee. The cover page should include a return mailing address and, if possible, an electronic mail address and a fax number.\\ The accepted abstracts will be published by the conference organization but a special issue of the journal "Mathematical Structures of Computer Science" on the topics of the workshop is expected. It will consist of some selected journal-length papers submitted by participants after the meeting. These complete papers will be refereed to the usual high standards of MSCS. } % PRACTICAL INFORMATION \def\pract{ \inform{ PTCOOP'96 }{ \names{ Organizing-Program Committee: } ~\\ Jean-Paul Bahsoun \\ \hspace*{15mm} (IRIT-CNRS, Toulouse) \\ ~\\ Jose Luis Fiadeiro \\ \hspace*{15mm} (University of Lisboa) \\ ~\\ Didier Galmiche \\ \hspace*{15mm} (CRIN-CNRS, Nancy) \\ ~\\ Akinori Yonezawa \\ \hspace*{15mm} (University of Tokyo) \\ } ~\\ ~\\ ~\\ \inform{ INFORMATION }{\cent{ \info {by email:} {bahsoun@irit.fr} ~\\ \info {or surface mail:} {Jean Paul Bahsoun \\ PTCOOP'96 \\ IRIT-CNRS, Universit\'e Paul Sabatier \\ 118, route de Narbonne \\ 31062 Toulouse Cedex, France \\ Phone: +33 61 55 82 11 \\ Fax: +33 61 55 83 25 } }} ~\\ ~\\ ~\\ \inform{ IMPORTANT DATES }{\cent{ \info {Deadline for submissions:} {May 6, 1996} \info {Notification of acceptance/rejection:}{May 25, 1996} \info {Workshop handouts ready} {June 24, 1996} \info {Workshop date} {July 8, 1996} }} } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % The text below will format this announcement with LaTeX % in a style designed by Jeroen Fokker, Utrecht University (jeroen@cs.ruu.nl), % which has been adapted for our purposes \pagestyle{empty} \topmargin-10mm \oddsidemargin-20mm \textwidth190mm \textheight26cm \newcommand{\cent}[1]{\begin{center}#1\end{center}} \newcommand{\names}[1]{{\bf #1}\\[0.5mm]} \newcommand{\info}[2]{{\em #1}\\ ~\\ {\bf #2}\\[2mm]} \newcommand{\sect}[1]{\vspace{7mm}\par\centerline{{\bf #1}}\vspace{4mm}\par} \newcommand{\items}[1]{\vspace{3mm}\begin{itz} #1 \end{itz}\vspace{3mm}\par} \newcommand{\inform}[2]{ \fbox{\begin{minipage}[t]{51mm} \vspace{2mm}\par \centerline{#1}\footnotesize\vspace{1mm}\par#2 \end{minipage}}\vspace{3mm} } \newenvironment{itz}{ \begin{list}{$\bullet$}{ \parsep=0pt\parskip=0pt\topsep=0pt\itemsep=0pt\leftmargin=1em }}{\end{list}} \begin{document} \nopagebreak \begin{minipage}[t]{55mm} \vspace*{46mm} \pract \end{minipage} \hfill \begin{minipage}[t]{128mm} {\large\sl\cent{\head}} \body \end{minipage} \end{document} From Frits.Vaandrager@cs.kun.nl Thu Apr 25 15:43:13 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA07014; Thu, 25 Apr 96 07:43:26 EDT Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Thu, 25 Apr 1996 13:43:24 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id NAA15655 (8.6.10/2.1); Thu, 25 Apr 1996 13:43:14 +0200 Received: by daphnis.cs.kun.nl id NAA11161 (8.6.10/2.1); Thu, 25 Apr 1996 13:43:13 +0200 Date: Thu, 25 Apr 1996 13:43:13 +0200 Message-Id: <199604251143.NAA11161@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: paper on finite delay and fairness From: Chrysafis Hartonas The following paper A FIXPOINT APPROACH TO FINITE DELAY AND FAIRNESS (C. Hartonas) is available by anonymous ftp at the site ftp cs.man.ac.uk/pub/hartonas/fccs.ps.gz *************************** A B S T R A C T ***************************** We introduce a language SCCS$_\sigma$ (fair SCCS) with a restriction operation on recursion. This involves a relativization of processes to formal environments which can be seen as a typing of processes. The fragment SCCS$_{\mu\nu}$ of SCCS$_\sigma$ drops explicit typing by introducing both least and greatest fixpoint operators. SCCS$_{\mu\nu}$ is expressive enough so that both SCCS and the Finite Delay Calculus of Milner [1] can be regarded as subcalculi. The delay operators can be defined by $\eps P:=\mu x.1x+P$ and $\delta P:=\nu x.1x+P$ Syntactic full abstractness results are proven for fortification and fair bisimilarity. We propose a collection of algebraic laws and induction rules (which imply Milner's fixpoint rule in [1]) and prove the theory sound for fair bisimilarity and fortification. The theory is strong enough so that it can prove all the laws for the delay operators taken as axioms in the Finite Delay Calculus of Milner. Finally, we sketch a final coalgebra semantics for SCCS$_\sigma$ that is fully abstract for fair bisimilarity and fortification. References __________ [1] R. Milner, A Finite Delay Calculus, Technical Report *************************************************************************** C. Hartonas Honorary Fellow Department of Computer Science University of Manchester, UK From Frits.Vaandrager@cs.kun.nl Fri May 3 18:05:41 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA20695; Fri, 03 May 96 10:05:46 EDT Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Fri, 3 May 1996 16:05:56 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id QAA06876 (8.6.10/2.1); Fri, 3 May 1996 16:05:42 +0200 Received: by daphnis.cs.kun.nl id QAA02430 (8.6.10/2.1); Fri, 3 May 1996 16:05:41 +0200 Date: Fri, 3 May 1996 16:05:41 +0200 Message-Id: <199605031405.QAA02430@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: semantics for finite delay From: Chrysafis Hartonas The following paper SEMANTICS FOR FINITE DELAY (C. Hartonas) is available by ftp from the site ftp cs.man.ac.uk/pub/hartonas/sfd.ps.gz The paper will appear in TCS but as this will not be, most likely, until next year perhaps you would be interested to have a look at this time. ********* ABSTRACT ********** We produce a fully abstract model for a notion of process equivalence taking into account issues of fairness, called by Milner {\em fair bisimilarity}. The model uses Aczel's anti-foundation axiom and it is constructed along the lines of the anti-founded model for SCCS given by Aczel. We revisit Aczel's semantics for SCCS where we prove a unique fixpoint theorem under the assumption of guarded recursion. Then we consider Milner's extension of SCCS to include a finite delay operator $\epsilon$. Working with fair bisimilarity we construct a fully abstract model, a final coalgebra for the class functor Pow(Act x - ) x Pow(Act^w). We show that the model is also fully abstract for {\em fortification}. We discuss the solution of recursive equations in the model, establishing appropriate induction rules. ***************************** Takis Hartonas (from May 15, 1996) COGS, University of Sussex at Brighton From Frits.Vaandrager@cs.kun.nl Fri May 3 18:10:56 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA20773; Fri, 03 May 96 10:11:03 EDT Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Fri, 3 May 1996 16:11:11 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id QAA06928 (8.6.10/2.1); Fri, 3 May 1996 16:10:57 +0200 Received: by daphnis.cs.kun.nl id QAA02445 (8.6.10/2.1); Fri, 3 May 1996 16:10:56 +0200 Date: Fri, 3 May 1996 16:10:56 +0200 Message-Id: <199605031410.QAA02445@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: Call for Papers FST&TCS-16 (Text Version) From: "Foundations of Software Tech. and Theor.Comp.Sci" CALL FOR PAPERS Sixteenth Conference on the FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE December 18-20, 1996 Hyderabad, India The 16th Annual FST & TCS Conference will take place in Hyderabad. This year's conference is being organized by the University of Hyderabad. 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; Finite Model Theory; Logical Aspects of Computational Complexity (including Proof Theoretic Approaches and Complexity of Formal Proof Systems); Constructive Mathematics; Linear Logic; 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. Electronic submissions will be possible and detailed instructions will be posted on the conference homepage on WWW shortly. However, as this electronic submission facility is being tried for the first time, we strongly encourage authors to also submit atleast one hard copy. Papers should be limited to 4500 words (about 12 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 referees. 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 1996 Notification to Authors : 1 August 1996 Final Version of Accepted Papers due on : 8 September 1996 ADDRESS: Send papers (hard copies) to: Vijay Chandru E-mail : chandru@csa.iisc.ernet.in FST & TCS 16 fsttcs@csa.iisc.ernet.in Computer Science & Automation Fax : +91-80-334 1683 Indian Institute of Science Bangalore 560 012, INDIA Electronic Submissions: http://www.csa.iisc.ernet.in/fsttcs For local arrangements concerning the conference, please write to: Arun K. Pujari E-mail : akpcs@uohyd.ernet.in Computer & Information Sciences Fax : +91-40-258125/258145 University of Hyderabad Hyderabad 500 046, INDIA PROGRAMME COMMITTEE: V. Arvind (IMSc, Madras) D. Bjorner (UNU/IIST, Macau) V. Chandru (IISc, Bangalore) (CHAIR) S. Chaudhuri (MPI, Saarbrucken) S-W. Cheng (HKUST, Hongkong) T.K. Dey (IIT, Kharagpur) H. Edelsbrunner (UIUC, Urbana-Champaign) J.J.M. Hooman (EindhovenU, Eindhoven) P. Jalote (IIT, Kanpur) S. Kannan (UPenn, Philadelphia) D. Kapur (SUNY, Albany) M. Nielsen (BRICS, Aarhus) S. Prasad (IIT, Delhi) A.K. Pujari (UHyd, Hyderabad) V. Raman (IMSc, Madras) R.K. Shyamasundar (TIFR, Bombay) G. Sivakumar (IIT, Bombay) M. Sohoni (IIT, Bombay) P.S. Thiagarajan (SPIC Sci. Found., Madras) H. Venkateswaran (GaTech, Atlanta) V. Vinay (IISc, Bangalore) ORGANIZING COMMITTEE: R.K. Bagga (DRDO, Hyderabad) B.L. Deekshatulu (NRSA, Hyderabad) H. Mohanty (UHyd, Hyderabad) A.K. Pujari (UHyd, Hyderabad) (CHAIR) P.S. Rao (UHyd, Hyderabad) A. Sharma (TCS, Hyderabad) A.K. Shiny (UHyd, Hyderabad) From Frits.Vaandrager@cs.kun.nl Fri May 3 18:04:51 1996 Return-Path: Received: from hera.cwi.nl by theory.lcs.mit.edu (5.65c/TOC-1.2S) id AA20687; Fri, 03 May 96 10:05:17 EDT Received: from sisyphus.cs.kun.nl by hera.cwi.nl with SMTP id ; Fri, 3 May 1996 16:05:07 +0200 Received: from daphnis.cs.kun.nl by sisyphus.cs.kun.nl via daphnis.cs.kun.nl [131.174.33.43] with ESMTP id QAA06862 (8.6.10/2.1); Fri, 3 May 1996 16:04:52 +0200 Received: by daphnis.cs.kun.nl id QAA02423 (8.6.10/2.1); Fri, 3 May 1996 16:04:51 +0200 Date: Fri, 3 May 1996 16:04:51 +0200 Message-Id: <199605031404.QAA02423@daphnis.cs.kun.nl> To: concurrency@cwi.nl Subject: LICS'96 Advance Program + Registration Information From: howe@research.att.com (Doug Howe) [This announcement is a plain-text summary of the LICS-related parts of the FLoC'96 advance program. The full program is available on the web at http://www.research.att.com/lics/floc/, and via anonymous ftp from ftp.research.att.com, directory /dist/floc.] Call for Participation 11TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE July 27-30, 1996 Rutgers University, New Jersey, USA Hosted by DIMACS Sponsored by IEEE COMPUTER SOCIETY with support from AT&T Laboratories Lucent Technologies Bell Laboratories IBM Almaden Research Center The LICS Symposium aims to attract original papers of high quality on theoretical and practical topics in computer science that relate to logic in a broad sense, including algebraic, categorical and topological approaches. The symposium draws papers from a wide range of areas: abstract data types, automated deduction, categorical models, concurrency, constraint programming, constructive mathematics, database theory, domain theory, finite model theory, hybrid systems, logics of knowledge, lambda and combinatory calculi, linear logic, logical aspects of computational complexity, logics in artificial intelligence, logic programming, modal and temporal logics, model checking, program logic and semantics, rewriting, logical aspects of symbolic computing, software specification, type systems, and verification. Program Chair: E. Clarke (CMU) Program Committee: S. Buss (UC San Diego), A. Emerson (UT Austin), S. German (IBM Watson), G. Gottlob (TU Vienna), O. Grumberg (Technion), D. Howe (Bell Labs), C. Kirchner (INRIA & CRIN), K. Kunen (Wisconsin), P. Lincoln (SRI), J. Mitchell (Stanford), U. Montanari (Univ. Pisa), P. Panangaden (McGill), F. Pfenning (CMU), J. Rushby (SRI), C. Stirling (Edinburgh), A. Stolboushkin (UCLA), G. Winskel (Aarhus). Conference Chair: J.G. Riecke (Bell Labs). Publicity: A. Felty (Bell Labs), D. Howe (Bell Labs). General Chair: M.Y. Vardi (Rice University) Organizing Committee: M. Abadi, S. Abramsky, S. Artemov, E. Boerger, A. Borodin, W. Brauer, A. Bundy, S. Buss, E. Clarke, R. Constable, A. Felty, U. Goltz, D. Howe, G. Huet, J.-P. Jouannaud, D. Kapur, C. Kirchner, P. Kolaitis, D. Kozen, T. Leighton, D. Leivant, A.R. Meyer, D. Miller, J. Mitchell, Y. Moschovakis, M. Okada, P. Panangaden, J. Remmel, J. Riecke, S. Ronchi della Rocca, A. Scedrov, D. Scott, J. Tiuryn, M.Y. Vardi. Email: lics96@cs.cmu.edu WWW: http://www.research.att.com/lics/ +---------------------------------------------------------+ | DEADLINES | | | | Early Registration 21 Jun 1996 | | On-Campus Housing Reservation 21 Jun 1996 | | Hotel Reservation 28 Jun 1996 | +---------------------------------------------------------+ TRAVEL ADVISORY =============== The 1996 Summer Olympics will take place in Atlanta from 19 July to 3 August, 1996. Travel to the East Coast will be especially heavy during these times. It is strongly recommended that you make airline reservations as early as poss