From concurrency.cwi.nl Tue Dec 28 00:00:00 1999 From: Purandar Bhaduri To: concurrency@cwi.nl (moderated) Subject: New FTRTFT Dates There is a correction in the dates for the FTRTFT School and Symposium. The final dates are School 18-19 September 2000 Symposium 20-22 September 2000 Please note the change if you have already received an earlier announcement either by email or in hard copy. We apologize for the inconvenience caused. Please also refer to our web page at http://www.pune.tcs.co.in/ftrtft/ for further announcements. Best wishes for the Year 2000! FTRTFT Organizing Committee P.S. The Call for Papers with the revised dates can be found below: Call for Papers FTRTFT 2000 Formal Techniques in Real-Time and Fault-Tolerant Systems 6th International School and Symposium School: 18-19 September; Symposium: 20-22 September 2000 Pune, India OBJECTIVES Computer systems are increasingly being used in real-time and mission-critical applications. These systems are complex and have critical timing and reliability requirements. Formal techniques provide a foundation for the systematic design of complex systems. They have been used effectively throughout the software engineering process, from the capture of requirements to the definition and verification of system specifications, the design, coding and implementation of a system and down to the hardware, which embeds the system into its environment. The FTRTFT 2000 School and Symposium will focus on problems and solutions in the design of safe and reliable systems and will examine how well the use of formal methods serves practical realities. This is the sixth in a series of International Schools and Symposia started in Warwick in 1988, with succeeding meetings at Nijmegen (1992), L?beck (1994), Uppsala (1996) and Lyngby (1998). Proceedings of the Symposia are published as volumes 331, 571, 863, 1135 and 1486 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 embedded systems, covering all stages from requirements analysis to hardware and software implementation. In addition to the general topics, special themes of this symposium will be: * Verification tools and algorithms for real-time and fault-tolerant systems * Tools and algorithms supporting formal methods * Scheduling and timing constraints in real-time systems * Fault-tolerance in real-time systems * Use of formal methods for building real-time and fault-tolerant systems * Hybrid systems * Case studies and applications of formal methods Submissions are limited to 20 double spaced standard pages, accompanied by a one-page abstract. Authors are encouraged to submit their papers electronically by mailing self-contained Postscript versions to ftrtft@pune.tcs.co.in. In addition, the following information in ASCII format should be sent to this address in a separate e-mail: Title, Authors; Communicating Author's Name, Postal Address, E-Mail Address and Fax Number if available; Abstract of Paper. If electronic submission is not possible, authors may send six (6) hard-copies of the paper by post to the address below. Important Dates. Deadline for Submission 31 March, 2000 Notification to Authors 31 May 2000 Final Version of Accepted Papers due 14 July 2000 TOOLS DEMONSTRATION Demonstrations of software tools that support formal approaches to the development of real-time, fault-tolerant and embedded systems are invited for the School and Symposium. Proposers should contact the Tools Demonstration Chair at ftrtft@pune.tcs.co.in. VENUE The School will be held at the Tata Research Development and Design Centre, Pune. The Symposium will be held in Pune. FOR MORE INFORMATION Consult our page at: http://www.pune.tcs.co.in/ftrtft PROGRAM COMMITTEE ORGANIZING COMMITTEE R. ALUR (U Penn) P. Bhaduri A. ARORA (Ohio State U) M. Joseph H. HANSSON (M?lardalen U) A.V. Nori I. HAYES (U Queensland) K.V. Nori Lin HUIMIN (IOS Beijing) R. Venkatesh He JIFENG (IIST Macau) M. JOSEPH (TRDDC) -- Chair Z. LIU (U Leicester) A. MOK (U Texas) K.V. NORI (TRDDC) P. PANDYA (TIFR) A. PNUELI (Weizmann Inst.) K. RAMAMRITHAM (IIT Mumbai) S. RAMESH (IIT Mumbai) STEERING COMMITTED A.P. RAVN (Aalborg U) W.-P. de ROEVER (KAU Kiel) M. Joseph N. SHANKAR (SRI) A. Pnueli J. VYTOPIL (KU Nijmegen) W.-P. de Roever S. YOVINE (IMAG Grenoble) J. Vytopil ADDRESS FOR CORRESPONDENCE FTRTFT Tata Research Development & Design Centre 54B Hadapsar Industrial Estate Pune 411 013 INDIA E-mail: ftrtft@pune.tcs.co.in URL : http://www.pune.tcs.co.in/ftrtft Tel: +91 20 6877 186 Fax: +91 20 6812 225 / 6810 921 From concurrency.cwi.nl Wed Jan 5 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: Announcement: EXTENDED DEADLINE FOR CMCS'2000 From: Jan Rutten EXTENDED DEADLINE FOR CMCS'2000: Due to the Y2K bug scare the deadline for submissions to CMCS'2000 is extended to 17 January 2000!!!!! The other dates of the following CFP do not change: **************************************************************************** ****** C A L L F O R P A P E R S for the WORKSHOP ON COALGEBRAIC METHODS IN COMPUTER SCIENCE (CMCS'2000) Scope State-based dynamical systems as found throughout computing science are traditionally described as transition systems or certain kinds ofautomata. During the last decade, it has become increasingly clear that such systems can be captured uniformly as so-called ``coalgebras'' (which are the formal dual of algebras). Coalgebra is beginning to develop into a field of its own, with its own proof-methods (involving bisimulations and invariants). This workshop will be devoted to both an introduction to basic coalgebraic notions and techniques, and also to some recent advances in the theory of coalgebras. We are looking for participants and contributed talks to this informal workshop on both the theory and the use of coalgebras in computer science. The workshop will consist of two days, preceding the ETAPS conference (25-26 March, 2000) at the Technical University of Berlin. More information regarding submissions is given below. The scope of the meeting includes the following themes: - the theory of coalgebras (including set theoretic and categorical approaches); - coalgebras as computational and semantical models (for programming languages, dynamic systems, etc.); - coalgebras in (functional, object-oriented, concurrent) programming; - coalgebras and data types; - (coinductive) definition and proof principles for coalgebras (with bisimulations or invariants); - coalgebras and (hidden-sorted) algebras; - coalgebraic specification and verification; - coalgebras and (modal) logic Organization: Bart Jacobs (Nijmegen), Horst Reichel(Dresden), Jan Rutten (CWI, Amsterdam) and Larry Moss (Bloomington, IN). Program Committee: H. Peter Gumm (Marburg), Bart Jacobs (Nijmegen), Ugo Montanari (Pisa), Larry Moss (Bloomington, IN), Ataru T. Nakagawa (Tokyo), John Power (Edinburgh), Horst Reichel (Dresden), Jan Rutten (CWI, Amsterdam). Submissions The following dates are important for submission to the ENTCS volume. - 3 January 2000: deadline for submissions. - 11 February 2000: notification of acceptance. - 3 March 2000: final version. - 25-26 March 2000: workshop, where a printed version of the ENTCS issue will be available for participants. - (25 March - 2 April, 2000: ETAPS conference). The ideal submission is not longer than 20 pages, and gives a clear exposition of the relevant ideas. It can be sent by email to: Horst Reichel, or by ordinary mail to: Horst Reichel TU Dresden, Faculty of Computer Science Institute: Theoretical Computer Science D-01062 Dresden Germany The informations will be actualized on the following web page: http://wwwtcs.inf.tu-dresden.de/~reichel/cmcs.html From concurrency.cwi.nl Mon Jan 3 00:00:00 2000 From: roman@swarm.cs.wustl.edu (Catalin Roman) To: concurrency@cwi.nl (moderated) Subject: COORDINATION 2000 (First Call for Papers) Call for Papers COORDINATION 2000 Fourth International Conference on Coordination Models and Languages Limassol, Cyprus 11-13 September 2000 http://www-gloc.di.fct.unl.pt/coord00/ The need for increased programmer productivity and rapid development of complex systems provide the pragmatic motivation for the development of coordination languages and models. The intellectual excitement associated with such endeavors is rooted in the decades-old desire to leverage off increasingly higher levels of abstractions. Coordination-based methods provide a clean separation between individual software components and their interaction within the overall software organization. This separation makes large applications more tractable, supports global analysis, and enhances reuse of software. Building on the success of the last three COORDINATION conferences, whose proceedings were published by Springer in the LNCS series, this conference provides a forum for the growing community of researchers interested in models, languages, and implementation techniques for coordination. Topics of interest include (but are not limited to): * Theoretical models and foundations for coordination: component composition, concurrency, mobility, dynamic aspects of coordination. * Specification, refinement, and analysis of software architectures: patterns and styles, verification of functional and non-functional properties. * Coordination, architectural, and interface definition languages: implementation, interoperability, heterogeneity. * Agent-oriented languages: formal models for interacting agents. * Dynamic software architectures: mobile agents, configuration, reconfiguration. * Tools and environments for the development of coordinated applications: integration within the development process. * Industrial relevance of coordination and software architectures: programming in the large, domain-specific software architectures and coordination models, case studies. Proceedings The conference proceedings will be published by Springer, in the LNCS (Lecture Notes in Computer Science) series. Submission Instructions Authors are invited to submit full papers (in English, up to 6000 words) electronically. Details on paper submission will be available on the conference web page http://www-gloc.di.fct.unl.pt/coord00/. The authors' instructions provided by Springer should be followed. They can be obtained from http://www.springer.de/comp/lncs/authors.html. Full papers must be received no later than 14 April 2000. Simultaneous or similar submissions to other conferences or journals are not allowed. An abstract of no more than 250 words must be received by 7 April 2000. Details on abstract submission will be available on the conference web page http://www-gloc.di.fct.unl.pt/coord00/. Submissions should explicitly state their contribution and their relevance to the theme of the conference. Other criteria for selection will be originality, significance, correctness, and clarity. Conference Location The conference will be held in Limassol, the most popular and lively city of Cyprus, which is located on the southern coast of the island. The conference venue will be a five-star hotel on the coast. IMPORTANT DATES Pre-submission abstracts: 7 Apr 2000 Full paper submissions: 14 Apr 2000 Notification of acceptance: 14 Jun 2000 Camera-ready version: 7 Jul 2000 Program co-chairs: Antonio Porto New University of Lisbon, Portugal ap@di.fct.unl.pt http://www-gloc.di.fct.unl.pt/~ap Gruia-Catalin Roman Washington University in St. Louis, USA roman@cs.wustl.edu http://www.cs.wustl.edu/~roman Organizing Chair: George A. Papadopoulos University of Cyprus george@cs.ucy.ac.cy http://www.cs.ucy.ac.cy/papadopo.html Program Committee (partial list): Farhad Arbab CWI, The Netherlands Farhad.Arbab@cwi.nl GianLuigi Ferrari U. Pisa, Italy giangi@di.unipi.it Jose Luiz Fiadeiro U. Lisbon, Portugal llf@di.fc.ul.pt Roberto Gorrieri U. Bologna, Italy gorrieri@cs.unibo.it Paola Inverardi U. l'Aquila, Italy inverard@univaq.it Jean-Marie Jacquet U. Namur, Belgium jmj@info.fundp.ac.be Edwin de Jong Signaal, The Netherlands edejong@signaal.nl Joost Kok U. Leiden, The Netherlands joost@wi.leidenuniv.nl Jose Meseguer SRI, USA meseguer@csl.sri.com Naftaly Minsky Rutgers U., USA minsky@cs.rutgers.edu Antonio Natali U. Bologna, Italy anatali@deis.unibo.it Rocco De Nicola U. Firenze, Italy denicola@dsi.unifi.it George Papadopoulos U. Cyprus, Cyprus george@cs.ucy.ac.cy Rick Schlichting U. Arizona, USA rick@cs.arizona.edu Robert Tolksdorf T.U. Berlin, Germany tolk@cs.tu-berlin.de Alan Wood U. York, UK wood@cs.york.ac.uk Sponsorship: This conference is officially sponsored by the Esprit Working Group 24512 "Coordina" (see http://www-gloc.di.fct.unl.pt/activity/coordina/). From concurrency.cwi.nl Mon Jan 3 00:00:00 2000 From: roman@swarm.cs.wustl.edu (Catalin Roman) To: concurrency@cwi.nl (concurrency@cwi.nl) Subject: Faculty Positions at Washington University Washington University in Saint Louis Department of Computer Science Applications are invited for tenure-track faculty positions at the Assistant, Associate and Full Professor levels. Applicants should hold a doctorate in Computer Science or a closely related field, have a record of accomplishment in research, and demonstrate a strong commitment to teaching. Washington University is a leading private national university recognized for its world class intellectual contributions (20 Nobel Prize Laureates have been associated with the University), its exceptional resources (an endowment of $2.8 billion, among the largest in the nation), and its location in the midst of a delightful residential community which places much value on education and culture. With annual external research funding of $6.3 million, Computer Science is emerging as one of the preeminent departments in the University and the School of Engineering and Applied Science. The Department plans to expand its size from 16 to 20 regular faculty. This aggressive growth pattern will be accompanied by commensurate increases in departmental resources. The Department seeks outstanding candidates likely to develop synergistic relationships with existing areas of excellence within the department: networking and communications; distributed computing and object-oriented software technologies; graphics, visualization, and human interfaces; electronic commerce, artificial intelligence; computer architecture and engineering; theoretical computer science, algorithms, and programming languages; and computational science with emphasis on biomedical applications. Candidates with a strong background in electronic commerce, embedded systems design, graphics and visualization, and distributed databases will receive special consideration. With the strong backing of the University and the School, the Department is committed to making significant investments in promising new areas of study and to providing the kind of resources and environment that will enable new faculty members to flourish intellectually. Academic couples seeking to co-locate are strongly encouraged to apply. Research groups in search of a highly supportive institutional environment may also want to consider relocating to Washington University. For more information on our department, see our World Wide Web page at http://www.cs.wustl.edu. Qualified applicants should send a curriculum vita and the names and addresses of at least three references to Dr. Catalin Roman, Chairman, Department of Computer Science, Campus Box 1045, Washington University, One Brookings Drive, St. Louis, MO 63130-4899. Applications will be considered as they are received. Those received after February 1, 2000, may not receive full consideration. Washington University is an equal opportunity/affirmative action employer. From concurrency.cwi.nl Fri Jan 7 00:00:00 2000 From: POWELL Olivier Subject: Reminder: ICALP call for paper To: concurrency@cwi.nl (moderated) Call for Papers ICALP'2000 27-th International Colloquium on Automata, Languages and Programming July 9-15, 2000, Geneva, Switzerland The 27-th annual meeting of the European Association of Theoretical Computer Science will be held in Geneva, Switzerland. As is the case of the two tracks of the journal Theoretical Computer Science, the scientific program of the Colloquium is split into two parts: Track A of the meeting will correspond to Algorithms, Automata, Complexity, and Games, while Track B will correspond to Logic, Semantics and Theory of Programming. Original contributions to theory of computer science, to be presented either in Track A or in Track B, are being sought. Authors are invited to submit extended abstracts of their papers, not exceeding 12 pages in the standard Springer Verlag LNCS style. Instructions for paper submissions can be found at the conference web page. Authors from countries where access to Internet is difficult may mail a single copy of their paper directly to the address of the conference chairman. Submissions should consist of: a cover page, with the author's full name, address, fax number, e-mail address, a 100-word abstract, keywords, and to which track (A or B) the paper is being submitted and an extended abstract describing original research in no more than 12 pages. It is expected that accepted papers will be presented at the conference. Simultaneous submission to other conferences with published proceedings is not allowed. Conference Chair: Jose D. P. Rolim Centre Universitaire d'Informatique University of Geneva 24 rue du General Dufour 1211 Geneva 4 Switzerland mailto:icalp@cui.unige.ch ICALP'2000 Program Committee Track A: Emo Welzl, Chair, ETH Zuerich Harry Buhrman, CWI Amsterdam Peter Bro Miltersen, Univ. Aarhus Martin Dietzfelbinger, Techn Univ Ilmenau Afonso Ferreira, CNRS-I3S-INRIA Sophia Antipolis Marcos Kiwi, Univ. de Chile Jens Lagergren, KTH Stockholm Gheorghe Paun, Romanian Acad. Guenter Rote, Techn. Univ. Graz Ronitt Rubinfeld, Cornell Univ. Amin Shokrollahi, Bell Labs Luca Trevisan, Columbia Univ. Serge Vaudenay, ENS Paris Uri Zwick, Tel Aviv Univ. Track B: Ugo Montanari, Chair, Univ. of Pisa Rajeev Alur, Univ. Pennsylvania, Philadelphia Rance Cleaveland, SUNY at Stony Brook Pierpaolo Degano, Univ. of Pisa Jose Fiadeiro, Univ. of Lisbon Andy Gordon, Microsoft Research, Cambridge, Orna Grumberg, Technion, Haifa Claude Kirchner, Inria, Nancy Mogens Nielsen, Univ. of Aarhus Catuscia Palamidessi, Penn. State Univ, Univ. Park Joachim Parrow, KTH, Stockholm Edmund Robinson, QMW, London Jan Rutten, CWI, Amsterdam Jan Vitek, Univ. of Geneva Martin Wirsing, Ludwig-Maximilians-University, Munich Pierre Wolper, Univ. of Liege. Special Award Richard Karp, Berkeley Invited Speakers Track A: Andrei Broder, Altavista Oded Goldreich, MIT and Weizman Inst. Johan Haastad, KTH Stockholm Kurt Mehlhorn, Max Plank Institute Track B: Samsom Abramsky, Edinburgh U. Gregor Engels, Paderborn U. Roberto Gorrieri, U. Bologna Zohar Manna, Stanford U. Satellite Workshops * Workshop on Randomization and Approximation in CS. (RANDOM'2000) * Workshop on Algorithms for Communication Networks (ARACNE) * Workshop on Boolean Functions and Applications * Workshop on Intersection Types and Related Systems (ITRS '00) * Workshop on Graph Transformation and Visual Modeling Techniques * Workshop on Process Algebra and Performance Models (PAPM 2000) * Workshop on Theor. Found. of Security Analysis and Design (IFIP WG 1.7) General Information Geneva is situated along the banks of Lac Leman and Le Rhone. The lake showcases the plumed fountain Jet d'Eau, and various districts of Geneva are connected by bridges across the waterways. The University of Geneva where ICALP '00 will convene is located on the `Left Bank' off Place Neuve and along the Promenade des Bastions near the Old Town section of Geneva. Geneva is a city of water parks and gardens and welcoming walkways which encourage exploration of the historical sites, museums, and international business and shopping districts. The University of Geneva is located near `Old Town' an area dotted with sidewalk cafes, student life, and building antiquities dating back to the 5th century. Geneva is a crossroads situated in the heart of Europe and linked to the world by a vast network of motorways, airlines and railways. For those planning to attend ICALP '00 in Geneva, it is an excellent opportunity to organize short trips into the countryside of charming villages and vineyards. Tours to please all ages and interests are available including afternoon train excursions, shopping cruises on Lake Geneva and The Rhone, and bus and cablecar trips in the Alps. For some, the most inviting attraction will be mouintain climbing. Mont Blanc, one of the highest points in Europe and the city of Chamonix are less than an hour away. Accomodations at a very special ICALP rate have been reserved in a couple of hotels and very inexpensive rooms will be available at the Student Housing. Lunch will be served daily on campus and there will be morning and afternoon refreshment breaks. Note that the specially priced hotel accommodations reserved for ICALP participants are located only a 5-10 minute walk to the campus. Important Dates Workshop Proposals: November 10,1999 Submissions: January 17, 2000 Notification: March 21, 2000 Final Copies: April 18, 2000 Further Information Further information related to ICALP'00, with instructions for paper submissions and conference registration, as well as with details on conference site, registration fee, accommodation, social program, and payments, will appear at the conference webpage at http://cuiwww.unige.ch/~icalp and in forthcoming issues of EATCS Bulletin. The conference is organized by the Centre Universitaire d'Informatique of the University of Geneva. From concurrency.cwi.nl Thu Jan 6 00:00:00 2000 From: Luis Caires To: concurrency@cwi.nl (moderated) Subject: Dissertation available Dear all, I would like to announce the availability of a Phd thesis entitled "A Model for Declarative Programming and Specification with Concurrency and Mobility" The main contributions are the introduction and study of the core programming language Lpi, and of the DOL specification logic for mobile processes. Background topics : pi-calculi, logic programming, specification logics Abstract + links to ps files at: http://ctp.di.fct.unl.pt/~lcaires/tese/ Best regards, Luis Caires Departamento de Informatica Faculdade de Ciencias e Tecnologia Universidade Nova de Lisboa From concurrency.cwi.nl Thu Jan 6 00:00:00 100 Subject: AMAST'2000 - revised dates To: concurrency@cwi.nl (moderated) From: "C Rattray" CALL FOR PAPERS 8-th International Conference on Algebraic Methodology And Software Technology AMAST '2000, 20 May to 27 May 2000, Iowa City, Iowa, USA Invited Speakers: Egidio Astesiano, University of Genoa Yuri Gurevich, Microsoft and University of Michigan Michael Healy, Boeing and University of Washington Oege de Moor, Oxford University Computing Laboratory David Lorge Parnas, McMaster University Jeannette Wing, Carnegie Mellon University Martin Wirsing, Ludwig-Maximilian University. Goals: The major goal of the AMAST Conferences is to promote research that may lead to the setting of software technology on a firm, mathematical basis. This goal is achieved by a large international cooperation with contributions from both academia and industry. The virtues of a software technology developed on mathematical basis have been envisioned as being capable of providing software that is (a) correct, and the correctness can be proved mathematically, (b) safe, so that it can be used in the implementation of critical systems, (c) portable, i.e., independent of computing platforms and language generations, and (d) evolutionary, i.e., it is self-adaptable and evolves with the problem domain. All previous editions of the AMAST Conference, which were held at The University of Iowa (1989,1991), University of Twente (1993), Concordia University, Montreal (1995), Ludwig-Maximilian University, Munich (1996), Macquarie University, Sydney, Australia, (1997), and Catholic University of Rio De Janeiro, Brazil (1999), made contributions to the AMAST goals by reporting and disseminating academic and industrial achievements within the AMAST area of interest. During these meetings, AMAST attracted an international following among researchers and practitioners interested in software technology, programming methodology and their algebraic and logical foundations. In addition, starting with the 1993 edition, the first day of each conference was dedicated to Mathematics Education for Software Engineers. AMAST'2000 is meant as an anniversary where achievements of the first ten years of the AMAST movement will be celebrated, current trends in using formal methods for software developments will be examined, and the opportunity for adapting AMAST goals to the problems raised by the new developments in software technology will be considered. This will accelerate the accomplishment of the AMAST goals and will strengthen the international cooperative research initiated by the AMAST movement. Submissions: As in previous years, we invite papers reporting original research on setting software technology on a firm mathematical basis. We expect two kinds of submissions for this conference: technical papers and system demonstrations. Of particular interest is research on using algebraic, logic, and other formalisms suitable as foundations for software technology, as well as software technologies developed by means of logic and algebraic methodologies. Submissions should not have been published and should not be under consideration for publication elsewhere. Topics of interest include, but are not limited to, the following: SOFTWARE TECHNOLOGY: systems software technology application software technology concurrent and reactive systems formal methods in industrial software development formal techniques for software requirements, design. PROGRAMMING METHODOLOGY: logic programming, functional programming, object paradigms constraint programming and concurrency program verification and transformation programming calculi specification languages and tools formal specification and development case studies. ALGEBRAIC AND LOGICAL FOUNDATIONS: logic, category theory, relation algebra, computational algebra algebraic foundations for languages and systems theorem proving and logical frameworks for reasoning logics of programs. SYSTEMS AND TOOLS (for system demonstrations or ordinary papers): software development environments support for correct software development system support for reuse tools for prototyping component based software development tools validation and verification computer algebra systems theorem proving systems. We invite prospective authors to submit electronically previously unpublished papers of high quality. Papers should be between five and fifteen pages and should be prepared using LaTeX and the LNCS style file, llncs.sty, that can be downloaded from the URL: http://www.cs.uiowa.edu/amast2000. Papers longer than fifteen pages may be automatically rejected. Please send a fully self-contained postscript file to "amast2000@cs.uiowa.edu". If for any reason it is impossible to submit a paper electronically, authors should send six copies of their submission to the program chair at the address below. All papers will be refereed by the programme committee, and will be judged based on their significance, technical merit, and relevance to the conference. As in the past, the proceedings of the AMAST'2000 will be published by Springer-Verlag in the Lecture Notes in Computer Science Series. Papers should be received by First of December 1999. Address for non-electronic submissions and enquiries: Teodor Rus (Program Chair of AMAST'2000) Department of Computer Science The University of Iowa Iowa City, IA 52242, USA Phone: 319-335-0742 Fax: 319-335-3624 Email: rus@cs.uiowa.edu AMAST Steering Committee: Egidio Astesiano email: astes@disi.unige.it Robert Berwick email: berwick@ai.mit.edu Zohar Manna email: manna@cs.stanford.edu Michael Mislove email: mwm@math.tulane.edu Anton Nijholt email: anijholt@cs.utwente.nl Maurice Nivat email: tcsmn@litp.ibp.fr Jacques Printzs email: printz@cnam.fr Charles Rattray email: c.rattray@cs.stir.ac.uk Teodor Rus email: rus@cs.uiowa.edu Giuseppe Scollo email: scollo@cs.utwente.nl John Staples email: staples@svrc.uq.edu.au Jeannette Wing email: wing@cs.cmu.edu Martin Wirsing email: wirsing@pst.informatik.uni-muenchen.de Important Dates: Paper submissions 15 January 2000 Reviewing process starts as soon as a paper arrives System demonstrations submission 15 January 2000 PC meeting for paper selection 10 February 2000 Notification of pasper acceptance 15 February 2000 Camera ready papers in Iowa City 1 March 2000 Proceedings package sent to LNCS 15 March 2000 AMILP international workshop 20 - 22 May 2000 AMAST 2000 conference 23 - 27 May 2000s Program Committee: Andre Arnold, France Egidio Astesiano, Italy Gabriel Baum, Argentina Didier Begay, France Robert Berwick, USA Michel Bidoit,France Val Tannen, USA Gregor Bochmann, Canada Chris Brink, South Africa Manfred Broy, Germany Christian Calude, New Zealand Christine Choppy, France Philippe Darondeau, France Jim Davies, UK Rocco De Nicola, Italy Ruy de Queiroz, Brazil Arthur Fleck, USA Marcelo Frias, Argentina Kokichi Futatsugi, Japan Dov Gabbay, UK Harald Ganzinger, Germany Radu Grosu, USA Yuri Gurevich, USA Armando Haeberer, Brazil Nicolas Halbwachs, France Michael Healy, USA Peter Henderson, UK Yoshi Inagaki, Japan Paola Inverardi, Italy Dan Ionescu, Canada Ryszard Janicki, Canada Kari Jarkko, USA Michael Johnson, Australia Helene Kirchner, France Gary Leavens, USA Luigi Logrippo, Canada Thomas Maibaum, UK Zohar Manna, USA Chris Marlin, Australia Michael Mislove, USA Peter Mosses, Denmark George Nelson, USA Anton Nijholt, The Netherlands Maurice Nivat, France Michael O'Donnell, USA Fernando Orejas, Spain David Lorge Parnas, Canada Sriram Pemmaraju, India Don Pigozzi, USA Jacques Printz, France Charles Rattray, UK Teodor Rus, USA Giuseppe Scollo, The Netherlands Stephen Seidman, USA Roger Shultz, USA Ken Slonneger, USA Douglas Smith, USA John Staples, Australia Carolyn Talcott, USA Andrzej Tarlecki, Poland Alagar Vangalur, Canada Rob van Glabbeek, USA Paulo Veloso, Brazil Brian Warboys, UK Jeannette Wing, USA Martin Wirsing, Germany Hantao Zhang, USA Further information: For regularly updated details of the conference organization send email to "amast2000@cs.uiowa.edu" or visit http://www.cs.uiowa.edu/amast2000 From concurrency.cwi.nl Thu Jan 6 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: STACS 2000: Program and registration From: malonne.lifl.fr ************ STACS'2000 -- Call for Participation **************** * STACS'2000 is the 17th International Symposium on Theoretical * * Aspects of Computer Science. * * February 17-19, 2000 -- Lille, FRANCE * ****************************************************************** !!! THE EARLY REGISTRATION DEADLINE IS JANUARY 17 !!! ****************************************************************** We welcome you to participate in STACS'2000. http://www.lifl.fr/stacs2000 email : stacs2000@lifl.fr The registration fee is quite cheap. [ Registration ] Registration fee is 150 euros or 990 FF (80 euros or 525 FF for students) before January 17, and 195 euros or 1280 FF (110 euros or 720 FF for students) afterwards. The normal registration fee includes sessions attendance, lunches (February 17-19), morning and afternoon coffee breaks, local transport, conference dinner on February 17, and STACS'2000 Proceedings. Conference dinner is not included in students registration fees. Please visit the STACS'2000 home page for the registration form. ****************** PROGRAMME *************************************** February 17 th 8:55: Opening -------------------------------------------------------------------- 9:00-10h : Invited talk Codes, Graphs, and Algorithms (Amin Shokrollohai) -------------------------------------------------------------------- 10:05- 10:55 +Algorithms: On the many faces of block codes Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta, B.Sundar Rajan A New Algorithm for MAX-2-SAT Edward A. Hirsch +Complexity: Bias Invariance of Small Upper Spans Jack H. Lutz, Martin Strauss The complexity of planarity testing Eric Allender, Meena Bhaskar Mahajan ------------------------------------------------------------------- BREAK ------------------------------------------------------------------- 11:15-12:30 +Automata and formal languages: About Cube-Free Morphisms Gw\'ena\"el Richomme, Francis Wlazinski Linear Cellular Automata with Multiple State Variables Jarkko Kari Two variable word equations Lucian Ilie, Wojciech Plandowski +Complexity: Average-Case Quantum Query Complexity Andris Ambainis, Ronald de Wolf Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs Juraj Hromkovi\v{c}, Martin Sauerhoff The Boolean Hierarchy of NP-Partitions Sven Kosub, Klaus W. Wagner ------------------------------------------------------------------ LUNCH ------------------------------------------------------------------ 14:15-15:30 +Distributed Algorithms: Binary Exponential Backoff is Stable for High Arrival Rates Hesham Al-Ammal, Leslie Ann Goldberg, Phil MacKenzie The Data Broadcast Problem with Preemption Nicolas Schabanel An Approximate Lp-Difference Algorithm for Massive Data Streams Jessica H. Fong, Martin J. Strauss +Logic: Succinct representations of model based belief revision Paolo Penna Logics Capturing Local Properties Leonid Libkin The Complexity of Poor Man's Logic Edith Hemaspaandra ---------------------------------------------------------------- BREAK ---------------------------------------------------------------- 15:50-17:05 +Sorting algorithms: Fast Integer Sorting in Linear Space Yijie Han On the Performance of WEAK-HEAPSORT Stefan Edelkamp, Ingo Wegener +Logic: On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers Luca Aceto, Zoltan Esik, Anna Ingolfsdottir Real-time automata and the Kleene algebra of sets of real numbers C\u{a}t\u{a}lin Dima ------------------------------------------------------------------- FRIDAY February 18 th ------------------------------------------------------------------- 9:00-10 : Invited talk "A Classification of Symbolic Transition Systems" Tom Henzinger ------------------------------------------------------------------- 10:05- 10:55 +Verification: Small Progress Measures for Solving Parity Games Marcin Jurdzi{\'n}ski Multi-Linearity Self-Testing with Relative Error Fr\'ed\'eric Magniez +Complexity: Nondeterministic Instance Complexity and Hard-to-Prove Tautologies Vikraman Arvind, Johannes K\"obler, Martin Mundhenk, Jacobo Tor\'an Hard Instances of Hard Problems Jack H. Lutz, Vikram Mhetre, Sridhar Srinivasan ------------------------------------------------------------------- BREAK ------------------------------------------------------------------- 11:15-12:30 +Verification: Simulation and Bisimulation over One-Counter Processes Petr Jancar, Antonin Kucera, Faron Moller Decidability of reachability problems for classes of two counters automata Alain Finkel, Grégoire Sutre Hereditary History Preserving Bisimilarity Is Undecidable Marcin Jurdzi{\'n}ski, Mogens Nielsen +Approximation algorithms: The Hardness of Approximating Spanner Problems Michael Elkin, David Peleg An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality Hans-Joachim Böckenhauer, Juraj Hromkovi\v{c}, Ralf Klasing, Sebastian Seibert, Walter Unger $\lambda$-Coloring of Graphs Hans L. Bodlaender, Ton Kloks, Jan van Leeuwen, Richard B. Tan ----------------------------------------------------------------- LUNCH ----------------------------------------------------------------- 14:15-15:30 +Complexity: Optimal Proof Systems and Sparse Sets Harry Buhrman, Stephen Fenner, Lance Fortnow, Dieter van Melkebeek Almost Complete Sets Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan A. Terwijn Graph Isomorphism is Low for ZPP$^{\rm NP}$ and other Lowness results Vikraman Arvind, Johannes K\"obler +Algorithms: An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude K\"onig Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem Klaus Jansen, Maxim I. Sviridenko Controlled Conspiracy-2 Search Ulf Lorenz --------------------------------------------------------------------- BREAK --------------------------------------------------------------------- 15:50-16:40 +Complexity: The stability of saturated linear dynamical systems is undecidable Vincent Blondel, Olivier Bournez, Pascal Koiran, John Tsitsiklis Tilings: recursivity and regularity Bruno Durand, Julien Cervelle 15:50-17:05: +Graph Algorithms: Listing all potential maximal cliques of a graph Vincent Bouchitt\'e, Ioan Todinca Distance Labeling Schemes for Well-Separated Graph Classes Michal Katz, Nir A. Katz, David Peleg Pruning graphs with digital search trees. Application to distance-hereditary graphs. Jean Marc Lanlignel, Olivier Raynaud, Eric Thierry --------------------------------------------------------------------- SATURDAY February 19th --------------------------------------------------------------------- 9:00-10:15 +Automata and formal languages: Characterizing and Deciding MSO-definability of Macro Tree Transductions Joost Engelfriet, Sebastian Maneth Languages of Dot-Depth 3/2 Christian Gla{\ss}er, Heinz Schmitz Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures Alberto Bertoni, Massimiliano Goldwurm, Massimo Santini +On-line Algorithms: The CNN Problem and Other K-Server Variants Elias Koutsoupias, David Scot Taylor The Weighted 2-Server Problem Marek Chrobak, Jiri Sgall On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem Yair Bartal, Elias Koutsoupias ------------------------------------------------------------------- BREAK ------------------------------------------------------------------- 10:35-11:25 +Cryptography: Spectral Bounds on General Hard Core Predicates Mikael Goldmann, Alexander Russell Randomness in Visual Cryptography Annalisa De Bonis, Alfredo De Santis +Algorithms: Online Dial-a-Ride Problems: Minimizing the Completion Time Norbert Ascheuer, Sven Oliver Krumke, Jörg Rambau The Power Range Assignment Problem in Radio Networks on the Plane Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri ----------------------------------------------------------------- 11:30 Invited Talk (Pascal Koiran) -------------------------------------------------------------------- LUNCH -------------------------------------------------------------------- From concurrency.cwi.nl Mon Jan 10 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: Call for Registration EEF-Summerschool on Formal Methods and Performance Analysis (FMPA 2000) From: Joost-Pieter Katoen FMPA-2k--FMPA-2k--FMPA-2k--FMPA-2k--FMPA-2k--FMPA-2k--FMPA-2k--FMPA-2k--FMPA-2k FORMAL METHODS AND PERFORMANCE ANALYSIS The first EEF-Summerschool on Trends in Computer Science July 3-7 2000, Nijmegen, the Netherlands http://fmt.cs.utwente.nl/conferences/fmpa2k/ organised by the Formal Methods and Tools Group, University of Twente FMPA-2k--FMPA-2k--FMPA-2k--FMPA-2k--FMPA-2k--FMPA-2k--FMPA-2k--FMPA-2k--FMPA-2k Aim and Scope of the Summerschool ================================= The design and analysis of various types of systems, like embedded systems or communication protocols, require insight in not only the functional, but also in the real-time and performance aspects of applications involved. Various traditional techniques for modelling and analysis of these quantitative aspects are known and widely used in practice. Some prominent modelling techniques for which efficient analytic techniques exist, are Markov chains, Queueing Networks, and Stochastic Petri Nets. Traditionally, there has always been a clear separation between the functional and performance aspects of systems, and as a result different communities have constructed and analysed their own, largely unrelated models for the aspects under their responsibility. In modern systems, though, the difference between functional and performance features is getting blurred, and both features are becoming of comparable interest. Thus, it would be beneficial to be able to check how changes in functionality affect performance issues, and vice versa. In addition, one would like to have a better control over the relation between the models that are used for qualitative and quantitative analysis, and avoid the use of different models for different aspects that are mutually incompatible. A single framework where both aspects could be defined, would therefore be advantageous for several reasons. Research in formal methods has recognised the need for the additional support of quantitative aspects like probability and real-time, and various initiatives have been taken to accomplish this. On the one side, extensions of existing specification techniques like process algebras allow for the automatic generation of performance models, and support the hierarchical modelling of complex systems. On the other hand, quantitative extensions of efficient analytic techniques like model checking, allow for the automated derivation of performance and reliability measures. The main goal of the summer school is to report on the-state-of-the-art of the research and tool development aiming at the integrated modelling and analysis of qualitative and quantitative aspects of reactive systems, such as stochastic Petri nets, stochastic process algebras, discrete event systems etc. The school is intended in the first place for PhD students, but we do anticipate attendance by interested researchers from academia and industry. To provide the necessary background also lectures in basic models and methods from both the field of performance evaluation and that of formal methods will be included. Preliminary Program =================== 1. Motivation ------------- Formal methods for performance analysis (1.5 hs) Ulrich HERZOG, University of Erlangen-Nuremberg, Germany 2. Background Performance Evaluation ------------------------------------ Markov chain models and analysis (3 hs) Boudewijn HAVERKORT, RWTH Aachen, Germany Discrete event simulation (1.5 hs) Christos CASSANDRAS, University of Massachusetts at Amherst, USA Non-Markovian analysis (1.5hs) Reinhard GERMAN, Technical University of Berlin, Germany 3. Background Formal Methods ---------------------------- Process algebra (3 hs) Ed BRINKSMA, University of Twente, Netherlands Petri nets and stochastic Petri nets (1.5 hs) Gianfranco BALBO, University of Torino, Italy Model checking (3hs) Pierre WOLPER, University of Liege, Belgium 4. Formal Methods & Performance Analysis ---------------------------------------- Stochastic activity networks and their analysis (3 hs) Bill SANDERS, University of Illinois at Urbana-Champaign, USA Markovian process algebra (1.5 hs) Holger HERMANNS, University of Twente, Netherlands Non-Markovian process algebra (1.5 hs) Joost-Pieter KATOEN, University of Twente, Netherlands Compositional and decompositional analysis (1.5 hs) Jane HILLSTON, University of Edinburgh, UK Structured and distributed analysis (1.5 hs) Gianfranco CIARDO, University of William and Mary, USA Model checking probabilistic and Markovian models (1.5 hs) Christel BAIER, University of Bonn, Germany Verification of probabilistic distributed algorithms (1.5 hs) Roberto SEGALA, University of Bologna, Italy Registration ============ The cost for living expenses will be 397 Euro (covering breakfast, lunch, dinner, refreshments, and social event) and accommodation from July 3 until July 7. This arrangement is based on a single room. In case you want to share a double room the costs are 307 Euro. There is also the possibility to book a room for Sunday 2th July (all prices in Euro): single double --------------------------- budgetroom 48 not available standard room 64 78 luxurous room 91 105 The participation fee for the summerschool is 185 Euro. These costs include working material (handouts) and a copy of the final course notes that will be published as a volume in the series of Lecture Notes in Computer Science, Springer, after the summerschool. (Note: 1 Euro is about 1 US dollar). The deadline for registration is April 1, 2000 (firm). The summerschool can host up to 80 participants. In case the number of registrations is higher than 80 a first come first serve policy will be applied. Registration forms can be found on the web-page mentioned and send in electronically. Scholarships ============ A number of scholarships is available for participants. These grants are funded by the European Union's IHP program. According to EU regulations, young resear- chers (aged 35 years or under) on postgraduate or postdoctorate level who are nationals of EU member states or associated states (and work there) can apply for a grant. The size of the grants will depend on the number of qualified applicants, and the travel distance. In case you meet the aforementioned qualifications and want to apply for a scho- larship please send a letter that includes your motivation to attend the summer- school, together with a letter of recommendation by the home department or institution, and a brief cv to: Ms. J. Lammerink EEF Summerschool FMPA 2000 University of Twente Faculty of Computer Science P.O. Box 217 7500 AE Enschede The Netherlands The deadline for application is March 1, 2000 (firm). All applicants will be notified about their application as soon as possible afterwards (on March 15, 2000 at the latest). Venue ===== The summerschool will be held in the Golden Tulip Val-Monte, Berg en Dal, The Netherlands situated at a beautiful place close to the city of Nijmegen. Nijmegen is situated in the eastern part of the Netherlands and can be reached by train from Amsterdam Airport within 90 minutes. Important dates =============== Deadline for scholarships: March 1 Deadline for registration: April 1 Dates of summerschool: July 3-7 Further information =================== Further, updated information can be obtained via the summerschool web-page at http://fmt.cs.utwente.nl/conferences/fmpa2k/ or by sending email to fmpa2k@cs.utwente.nl. Organisation committee ====================== Ed Brinksma Holger Hermanns Joost-Pieter Katoen Joke Lammerink From concurrency.cwi.nl Sat Jan 8 00:00:00 2000 From: Marco Bernardo To: concurrency@cwi.nl (moderated) Subject: PAPM 2000: call for papers *************************************************************************** * * * PAPM 2000 * * * * 8th INTERNATIONAL WORKSHOP ON PROCESS ALGEBRA AND PERFORMANCE MODELLING * * * * 15th July 2000 - Geneva (Switzerland) * * * * Satellite Workshop of ICALP 2000 * * * * http://www.cs.unibo.it/~bravetti/papm2000/ * * * *************************************************************************** The aim of the workshop is to bring together researchers and practitioners interested in the development and application of process algebras to performance modeling and evaluation. Topics of the workshop include (but are not limited to): * Semantic theory of stochastically timed and probabilistic process algebras (equivalence, preorder, axiomatization, ...); * Efficient performance evaluation techniques (product form solution, distributed simulation, ...); * Probabilistic verification techniques (probabilistic model checking, ...); * Relationships with other formalisms for performance modeling and analysis (stochastic Petri nets, queueing networks, ...); * Tools and case studies (communication protocols, software systems, ...). Papers of at most 15 pages in A4 format should be submitted electronically by sending two separate e-mails to papm2000_sub@cs.unibo.it. The first e-mail should contain indication of authors, title, abstract, keywords, and contact author address. The second e-mail should contain the paper itself in .ps or .pdf format. For further information, please send an e-mail to papm2000_info@cs.unibo.it. PAPM 2000 proceedings will be published by Carleton Scientific (joint volume with all the other satellite workshops of ICALP 2000). The publication of a selection of papers as a special issue of a journal is under negotiation. Important dates: - 15th March 2000: paper submission; - 14th April 2000: notification of acceptance/rejection; - 7th May 2000: camera ready of accepted papers due. Invited Speakers: Rance Cleaveland (State Univ. of New York at Stony Brook) Boudewijn Haverkort (Univ. of Aachen) Program Committee: Marco Bernardo (Univ. of Torino) Luca de Alfaro (Univ. of California at Berkeley) Roberto Gorrieri - Chair (Univ. of Bologna) Peter Harrison (Imperial College) Holger Hermanns (Univ. of Twente) Ulrich Herzog (Univ. of Erlangen) Jane Hillston (Univ. of Edinburgh) Marta Kwiatkowska (Univ. of Birmingham) Kim Larsen (Univ. of Aalborg) Prakash Panangaden (McGill Univ.) Manuel Silva (Univ. of Zaragoza) Scott Smolka (State Univ. of New York at Stony Brook) Organizing Committee: Alessandro Aldini (Univ. of Bologna) Marco Bernardo - Chair (Univ. of Torino) Mario Bravetti (Univ. of Bologna) Steering Committee: Ed Brinksma (Univ. of Twente) Roberto Gorrieri (Univ. of Bologna) Ulrich Herzog (Univ. of Erlangen) Jane Hillston (Univ. of Edinburgh) From concurrency.cwi.nl Wed Jan 12 00:00:00 2000 From: ASA/MA 2000 To: concurrency@cwi.nl (moderated) Subject: 2nd CFP: Agent Systems / Mobile Agents (ASA/MA 2000) ********************************************************************* Second Call for Papers: SUBMISSION DEADLINE MARCH 3, 2000 ********************************************************************* -- ASA/MA 2000 -- Second International Symposium on Agent Systems and Applications Fourth International Symposium on Mobile Agents September 13-15, 2000 ETH Zurich, Switzerland http://www.inf.ethz.ch/ASA-MA/ AREAS OF INTEREST are: - agent applications - agent systems - multi-agent systems - mobile agents - mobile code POSSIBLE TOPICS include development tools, security, scalability, fault tolerance, communication, collaboration and coordination, languages, standards, design patterns, applications in mobile computing and wireless networks, applications in electronic markets and commerce, applications in active networks, market-based control, resource management, agent societies and ensembles, World-wide-web integration. GENERAL CHAIR: Friedemann Mattern, ETH Zurich, Switzerland PROGRAM CHAIR: David Kotz, Dartmouth College, USA PROGRAM COMMITTEE: Geoff Arnold (Sun Microsystems, USA), Jeff Bradshaw (The Boeing Company, USA), David Chess (IBM Research, USA), Dag Johansen (University of Tromso, Norway), Jeff Kephart (IBM Research, USA), David Kotz, Dartmouth College, USA), Danny Lange (General Magic, USA), Dejan S. Milojicic (HP Labs, USA), Moira Norrie (ETH Zurich, Switzerland), Gian Pietro Picco (Politecnico di Milano, Italy), Radu Popescu-Zeletin (Tech. University Berlin, Germany), Kurt Rothermel (Univ. Stuttgart, Germany), Christian Tschudin (Univ. Uppsala, Sweden), Giovanni Vigna (UC Santa Barbara, USA), Jan Vitek (Purdue University CS, USA), Mary Ellen Zurko (Iris Associates, USA) Important Dates: PAPER SUBMISSIONS DEADLINE: March 3, 2000 TUTORIALS PROPOSALS DUE: April 30, 2000 Proceedings will be published by Springer-Verlag in the LNCS series. Papers should not exceed 12 pages (approx. 6000 words) and should be sent according to the submission guidelines available at http://www.inf.ethz.ch/ASA-MA/submit.html For more information: http://www.inf.ethz.ch/ASA-MA/ or http://www.cs.dartmouth.edu/ASA-MA/ ------------------------------------------------------------------------------ This Call for Papers has been sent to several distribution lists. We apologize if you receive multiple copies of it From concurrency.cwi.nl Wed Jan 12 00:00:00 2000 From: George Angelos Papadopoulos To: concurrency@cwi.nl (moderated) Subject: Academic Positions - CS Dept - Univ of Cyprus DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF CYPRUS VISITING PROFESSORSHIPS The Department of Computer Science at the University of Cyprus has a number of vacancies for visiting professors at the ranks of Assistant, Associate, and Full Professor. ALL fields of study will be considered but preference will be given to applicants associated with one or more of the following ones: * Computer Architecture * Parallel and Distributed Processing * Programming Languages * Multimedia Information Systems * Data Communication Networks * Artificial Intelligence * Software Engineering * Database Systems A visiting appointment is usually for one semester (Spring semester: Jan-June; Winter semester: Sept-Dec), but it can be renewed for up to four semesters. Applicants should hold a Ph.D. in a relevant subject, have post Ph.D. experience, and be fluent in Greek. The annual salaries for these positions (including the 13th salary) are: Professor (Scale A15-A16) CYP 25.479 - 33.120 Associate Professor (Scale A14-A15) CYP 22.473 - 30.636 Assistant Professor (Scale A13-A14) CYP 20.966 - 28.288 Lecturer (Scale A12-A13) CYP 17.706 - 25.933 (At present CYP 1 = 1.1 sterling and CYP 1 = 1.80 U.S. dollars). Presently, the Department is seeking applications for the winter and spring semesters of the academic year 2000-2001. Anyone wishing to apply should send a full CV to the following address: The Chairperson Department of Computer Science University of Cyprus 75 Kallipoleos Street P.O. Box 20537, CY-1678 Nicosia, CYPRUS For more details and other information, interested individuals may contact the Chairperson of the Department of Computer Science: Associate Professor Antonis Kakas Tel: +357-2-892238, Fax: +357-2-339062, E-mail: antonis@ucy.ac.cy From concurrency.cwi.nl Wed Jan 12 00:00:00 2000 From: KOBAYASHI Naoki To: concurrency@cwi.nl (moderated) Subject: Paper announcement: Implicitly-Typed Deadlock-Free Process Calculus We would like to announce the availability of the technical report below, which is available at http://www.yl.is.s.u-tokyo.ac.jp/~koba/pub/deadlock-inference.ps.gz. Any comments are welcome. Naoki Kobayashi University of Tokyo ------- An Implicitly-Typed Deadlock-Free Process Calculus Naoki Kobayashi, Shin Saito, and Eijiro Sumii ABSTRACT: We extend Kobayashi and Sumii's type system for the deadlock-free Pi-calculus and develop a type reconstruction algorithm. Kobayashi and Sumii's type system is a generalization of Kobayashi, Pierce, and Turner's linear pi-calculus, and it helps high-level reasoning about concurrent programs by guaranteeing that communication on certain channels will eventually succeed. It can ensure, for example, that a process implementing a function really behaves like a function. However, because it lacked a type reconstruction algorithm and required rather complicated type annotations, it was impractical to apply it to real concurrent languages. We have therefore developed a type reconstruction algorithm for an extension of the type system. The key novelties that made it possible are generalization of the channel usage calculus (which was first introduced in Sumii and Kobayashi's previous type system) and a subusage relation. From concurrency.cwi.nl Mon Jan 10 00:00:00 2000 From: Diego Latella Subject: HASE 2000 cfp To: concurrency@cwi.nl (moderated) Call for Papers: Fifth IEEE International Symposium on High Assurance Systems Engineering November 15-17, 2000, Albuquerque New Mexico Theme: Providing Convincing Evidence of Safety High Consequence Systems are systems whose state spaces contain failure states that are associated with unacceptable consequences (e.g., loss of life, loss of national security, unacceptable financial losses, etc.). By definition, high consequence failures are failures that, if necessary, system developers are willing to spend a considerable amount of energy, effort, and resources in order to avoid. High Assurance Systems have demanding requirements either to ensure the safety of the users and environment or for economic survivability of the roduct. Requirements are typically in the form of safety, high reliability, permanent availability, real-time constraints, security, and fault-tolerance. Systems Engineering is a discipline that focuses on the processes, methods, and tools needed to design, implement, integrate, and test complete systems. It requires cross-disciplinary expertise, ranging from formal methods and software engineering to experimental validation and hardware design. Before a system, high consequence or otherwise, is fielded "suitable assurance" (e.g., high assurance) must be provided that the system will not experience failure - or failing that, that the probability of experiencing a failure is "acceptably low". In the high consequence realm, providing "suitable assurance" that a system failure will be "acceptably low" can be extremely difficult. Unless great care is taken, providing "suitable assurance" approaches and often exceeds what is possible given current state of the art techniques (e.g., formal methods or first principle system design), and the term "acceptably low" translates to reliability values that exceed the grasp of reliability techniques. A promising approach to overcoming these problems is to integrate specific system engineering practices with suitable (complimentary) techniques for providing the necessary assurance that the specific high consequence system under consideration satisfies its requirements. The HASE Symposium is a forum for discussion of systems engineering issues specifically relating to high consequence and high assurance systems. Examples of high assurance applications include large complex systems such as flight control systems, medical surgery equipment, unmanned air vehicles, military command and control, nuclear reactors, and secure telecommunication devices, as well as dedicated embedded systems such as vehicle braking, pacemakers, traffic-light control, MEMS, micro-robots, and satellites. In the past, experts from industry and government R&D labs represented close to half the attendees, while academicians represented the other half. Our goal is to maintain and improve this interaction between government, industry, and academia through a high-quality program of research papers, panel discussions, demonstrations, focussed workgroups, and presentations of case studies and experiences in systems engineering for high assurance embedded systems. Deadline for Submissions: May 31, 1999 Notification of Acceptance: July 31, 1999 Camera-ready copy due: August 31, 1999 For more information concerning submissions see http://www.computer.org/author/psguide.htm. Organizing Committee Chairs General Chair Wei-Tek Tsai Program Chair Victor L. Winter, Sandia National Laboratories Vice Program Chair Mario Dal Cin, University of Erlangen-Nuremberg IMMD Finance and Bojan Cukic, University of West Virginia Registration Chair Topics of interest include, but are not limited to: * Validation: * Validation of specifications * Fault-tolerant software design * Experimental and model-based evaluation * Assurance monitoring techniques * Real-time validation of existing systems * Verification: * Formal modeling * Transformation-based system development * Case studies of practical applications of formal methods * Model checking * Real-time analysis and verification of existing systems * Other: * Evolutionary design of complex systems * Hardware/software design tradeoffs * MEMS * Hardware architectures for high assurance systems * Software engineering for embedded systems * Security * Interoperability of secure systems Submission Categories Research Paper [max 15 pages], primary for academicians, describing original research results and prototype development. Experience Paper Abstracts [max 2 pages], primarily for practitioners to relay experiences in creating high assurance systems. The abstract must discuss both strengths and weaknesses of the methods used for systems that have been built and deployed. Authors of accepted abstracts will have the opportunity to include a full paper in the proceedings. Position Papers: [max 1 page]. Members who want to be considered for a panel session can submit a position paper that discusses their view of any issue pertaining to high-assurance systems. Persons with strong position papers will be selected to participate in a related panel session. Panel Session Proposal [max 2 page overview, plus a 1-page position paper from each proposed panel member]. The proposal overview should introduce controversial issues related to systems engineering of high assurance systems. The position papers should be from panelists representing both sides. Panels should have 3 to 5 members, plus the chair. At least half of the allotted time for the session should be for questions and answers. Thus, each member will be allotted approx. 5 minutes to summarize their views on the debated issue. For the remainder of the time, the floor will be open to questions. Special Track Proposal. [max 2 pages] An overview of the proposed track should include the authors and titles of papers that have been submitted to the symposium that the chair would like to include in this special track. If at least three of those papers are accepted, the special track will be granted, and the track chair will have the opportunity to ask one additional person to present an invited paper. Persons seeking these special tracks should try to encourage people in the area to submit papers, to provide them maximum choice and highest quality in selecting papers. Focussed Workgroup Proposal. [max 1 page] A focussed workgroup consists of discussion by up to 10 people working in closely related areas, discussing possible new research issues or areas. At the symposium, each registrant will have the opportunity to participate in one of the selected focussed workgroups. Diego Latella -- Consiglio Nazionale delle Ricerche - Istituto CNUCE Via Santa Maria 36 - I56126 - Pisa - ITALY phone: +39 050593230 - fax: +39 050904052 email: Diego.Latella@cnuce.cnr.it From concurrency.cwi.nl Sat Jan 15 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: TCS2000 -- Call For Papers -- From: Shinya MIYAKAWA call for papers IFIP International Conference on Theoretical Computer Science IFIP TCS2000 --- Exploring New Frontiers of Theoretical Informatics --- August 17 - 19, 2000 Tohoku University, Sendai, Japan IFIP TCS2000 is the first International Conference on Theoretical Computer Science organized by the IFIP TC1 on Foundations of Computer Science. Major topics of the conference are follows: Track (1): Algorithms, Complexity and Models of Computation analysis and design of algorithms --- algorithm experimentation --- continuous algorithms and complexity --- computational complexity --- descriptional complexity --- cellular automata and machines, automata and formal languages --- hardware algorithms and parallel algorithms --- computational learning theory --- algorithmic aspects in discovery science --- cryptography --- combinatorics --- probabilistic and randomized algorithms --- molecular computing and algorithmic aspects of bioinformatics --- quantum computing --- neural network computing --- evolutionary and genetic algorithms --- computational geometry --- computational and mathematical finance --- bridging complexity and semantics. Track (2): Logic, Semantics, Specification and Verification logic and semantics for programs and languages --- foundations of system specification --- term rewriting systems --- proofs and specifications in computer science --- types and category theory in computer science --- theoretical aspects of specification and verification of hardware and software --- theoretical aspects of software concepts --- concurrency theory --- theory of parallel and distributed systems --- theory of internet languages and systems --- constructive and non-standard logics in computer science --- foundations of security --- theoretical foundations of data bases --- logic, specification and verification of hybrid and real-time systems --- theoretical foundations of open systems --- bridging semantics and complexity. Submissions on the above topics and related topics are invited. Submitted papers should preferably be typeset in LaTeX2e using the Springer document class llncs for the LNCS format, see http://www.springer.de/comp/lncs/authors.html (the command \pagestyle{plain} turns on page numbering), and no longer than 14 pages. They should be sent in Postscript by email to one of the following addresses by January 28 (Friday), 2000: for Track (1), tcs2000-track1@is.s.u-tokyo.ac.jp; for Track (2), tcs2000-track2@is.s.u-tokyo.ac.jp. A submission should include the track name for the submission, the title of the paper, names and affiliations of authors, an abstract up to 300 words, and the contact author's name, address, phone number, fax number, and email address. The submission must be in English, and it should provide a summary of the main results and their details to allow the program committee to assess their merits and significance, including references and comparisons. The result of the paper must be unpublished and not submitted for publication elsewhere, including journals and the proceedings of other symposia or workshops. One author of each accepted paper should be able to present it at the conference. Important Dates: January 28, 2000: Deadline for submission of papers April 7, 2000: Notification of acceptance May 5, 2000: Final camera-ready text due See http://hagi.is.s.u-tokyo.ac.jp/tcs2000/ for further information about the submission procedure. The program will consist of: Plenary Invited Talks Mart\'in Abadi (Bell Labs, Lucent Technologies) Masami Hagiya (U. Tokyo) Madhu Sudan (MIT) Track (1) Invited Talks Ernst Mayr (TU Muenchen) Shu Tezuka (IBM Tokyo Research Lab) Mihalis Yannakakis (AT\&T Research) Track (2) Invited Talks Thomas Henzinger (UC Berkeley & MPI-Saarbrucken) Naoki Kobayashi (U. Tokyo) Gordon Plotkin (U. Edinburgh) Banquet Speech Michael O. Rabin (Harvard U.) as well as the selected contributed talks and a panel discussion. The Proceedings, published as a volume of Lecture Notes in Computer Science, Springer-Verlag, will be available at the conference. See http://tcs2000.ito.ecei.tohoku.ac.jp/tcs2000/ for general information about the IFIP TCS2000 Conference. Program Committee Co-Chairs Track (1): Algorithms, Complexity and Models of Computation Jan van Leeuwen (U. Utrecht) Osamu Watanabe (Tokyo Inst. of Technology) Track (2): Logic, Semantics, Specification, and Verification Masami Hagiya (U. Tokyo) Peter D. Mosses (U. Aarhus) Program Committee Track (1): Ricardo Baeza-Yates (U. Chile), Siu-Wing Cheng (Hong Kong UST), Felipe Cucker (City U. Hong Kong), Rosario Gennaro (IBM T.J. Watson Research), Alan Gibbons (U. Liverpool), Andrew V. Goldberg (InterTrust STAR Lab, USA), Ernst Mayr (TU Muenchen), Hiroshi Nagamochi (Kyoto U.), Kouichi Sakurai (Kyushu U.), Paul Vitanyi (CWI, Amsterdam), Jiri Wiedermann (Academy of Sciences, Prague), Takashi Yokomori (Waseda U.) Track (2): Samson Abramsky (U. Edinburgh), Egidio Astesiano (U. Genova), Luca Cardelli (Microsoft, Cambridge), Robert Constable (Cornell U.), Javier Esparza (TU Muenchen), Naoki Kobayashi (U. Tokyo), Jos\'e Meseguer (SRI, Menlo Park), Benjamin Pierce (U. Pennsylvania), Davide Sangiorgi (INRIA, Sophia Antipolis), John Staples (U. Queensland), Andrzej Tarlecki (Warsaw U.), P. S. Thiagarajan (Chennai Math. Inst., India), Kazunori Ueda (Waseda U.), Naoki Yonezaki (Tokyo Inst. Tech.) Conference Co-Chairs Giorgio Ausiello (IFIP TC1 Chair and U. Roma "La Sapienza") Takayasu Ito (Tohoku U.) Steering Committee Giorgio Ausiello (U. Roma) , Wilfried Brauer (TU Muenchen), Takayasu Ito (Tohoku U.), Michael O. Rabin (Harvard U.), John Staples (U. Queensland), Joseph Traub (Columbia U.) Organizing Committee Co-Chairs Setsuo Arikawa (Kyushu U.), Yasuyoshi Inagaki (Nagoya U.), Takayasu Ito (Tohoku U.) The IFIP TCS2000 conference is organized by the IFIP TC1 on Foundations of Computer Science in cooperation with Information Processing Society of Japan, Japan Society of Software Science and Technology, Institute of Electronics, Information and Communication Engineers in Japan*, European Association of Theoretical Computer Science, Association of Symbolic Logic, and Association for Computing Machinery-SIGACT. (* indicates "to be verified".) E-mail address for any inquiry: TCS2000@ito.ecei.tohoku.ac.jp From concurrency.cwi.nl Fri Jan 14 00:00:00 2000 From: Steve Schneider To: concurrency@cwi.nl (moderated) Subject: Book announcement The following book was recently published: -------------------------------------------------- Concurrent and Real-time Systems: the CSP approach Steve Schneider, Royal Holloway, University of London www.cs.rhbnc.ac.uk/books/concurrency The CSP approach has been widely used in the specification, analysis and verification of concurrent and real-time systems, and for understanding the particular issues that can arise when concurrency is present. It provides a language which enables specifications and designs to be clearly expressed and understood, together with a supporting theory which allows them to be analysed and shown to be correct. This book supports advanced level courses on concurrency covering timed and untimed CSP. The first half introduces the language of CSP, the primary semantic models (traces, failures, divergences and infinite traces), and their use in the modelling, analysis and verification of concurrent systems. The second half of the book introduces time into the language, brings in the timed sematic model (timed failures) and finally presents the theory of timewise refinement which links the two halves together. xv + 510 pages. Contents -------- Preface Part I: The language of CSP Chapter 1 Sequential processes Chapter 2 Concurrency Chapter 3 Abstraction and control flow Part II: Analyzing Processes Chapter 4 Traces Chapter 5 Specification and verification Chapter 6 Stable failures Chapter 7 Specification and verification Chapter 8 Failures, divergences, and infinite traces Part III: Introducing time Chapter 9 The timed language Chapter 10 Timed transition systems Part IV: Timed analysis Chapter 11 Semantics of Timed CSP Chapter 12 Specification and verification Chapter 13 Timewise refinement Appendix A Event-based time Appendix B Model-checking with FDR Notation Bibliography Index Index of Processes From concurrency.cwi.nl Sun Jan 23 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: 1 WEEK LEFT: Europar'2000 Workshop on OO Architectures, Tools, Applications From: Michael Philippsen CALL FOR PAPERS Euro-Par'2000 Workshop 15 on Object-Oriented Architectures, Tools and Applications 29 August to 1 September, 2000, Munich, Germany http://wwwipd.ira.uka.de/~phlipp/europar2k15.html http://www.in.tum.de/europar2k/ ---------------------------------------------------------------------- The Europar'2000 Workshop on Object-Oriented Architectures, Tools and Applications focuses on the use and support of object-oriented techniques for parallel and distributed applications; including engineering, scientific, and commercial applications, simulations, data-intensive applications, and other emerging application areas that exploit parallel and distributed computing or combine communication and computing. Authors are invited to submit manuscripts that demonstrate timely results, technologies, or experiences that are most likely to have impact on the use of object-oriented parallel or distributed systems. The workshop seeks to encompass a broad range of topics which address object-orientation in parallel and/or high-performance applications and systems. Suggested topics in the context of high-performance object-orientation include, but are not limited to: - Parallel or distributed object-oriented scientific, engineering, and commercial applications - Tools and techniques for development (programming, debugging, visualization, ...) of high-performance parallel or distributed object-oriented applications - Specific use of Java for parallel or distributed tools and applications - Fundamental aspects related to parallel or distributed object- oriented programming (langage design, specifications, static analysis, typing, semantics and verifications, ...) ---------------------------------------------------------------------- EUROPAR CONFERENCE SERIES Euro-Par is the annual European conference on parallel computing. It is dedicated to the promotion and advancement of all aspects of parallel computing. Euro-Par 2000 is  organized as a day  of tutorials, two half-day plenary sessions, and a number of parallel sessions. PAPER SUBMISSION Authors are strongly encouraged to follow Springer's LNCS formatting instructions; see http://www.springer.de/comp/lncs/authors.html for preparation of manuscripts. Papers should report new research and should not exceed 12 pages in the LNCS format. Authors are requested to use the electronic form on the web site to submit their paper to the topic they judge most appropriate. PROCEEDINGS All papers selected for this session by peer-review process will be published in the Euro-Par 2000 conference proceedings by Springer Verlag (LNCS series), Germany. Authors of accepted papers will be expected to sign a copyright release form. Official Address and Organization For any questions related to Euro-Par 2000 and for registration please refer to http://www.in.tum.de/europar2k/ or e-mail to: europar2k@in.tum.de WORKSHOP COMMITTEE Global Chair: Gul Agha University of Illionois at Urbana-Champaign Department of Computer Science 121 Digital Computer Lab 1304 W Springfield Ave Urbana, IL 61801 U.S.A. Tel: +1/(217)244-3087 Fax: +1/(217)244-6869 agha@cs.uiuc.edu http://yangtze.cs.uiuc.edu/~agha/ Vice-Chairs Francoise Baude INRIA 2004, route des Lucioles, B.P.93 F-06902 SophiaAntipolis Cedex France Tel: +33 (0)4 92 38 76 71 Fax: +33 (0)4 92 38 76 44 Francoise.Baude@sophia.inria.fr http://www-sop.inria.fr/oasis/Francoise.Baude/me.html Uwe Kastens Universitaet Paderborn Fachbereich 17 (Informatik) Fuerstenallee 11 D-33102 Paderborn Germany Tel: +49 (0)5251/60-6686 Fax: +49 (0)5251/60-6697 uwe@uni-paderborn.de http://www.uni-paderborn.de/cs/uwe.html Local Chair Michael Philippsen University of Karlsruhe Department of Computer Science Am Fasanengarten 5 D-76128 Karlsruhe Germany Tel: +49 (0)721/608-4067 Fax: +49 (0)721/608-7343 phlipp@ira.uka.de http://wwwipd.ira.uka.de/~phlipp/ IMPORTANT DATES - January 31st 2000 : Final Date for Submissions - May 1st 2000 : Acceptances Notified - June 1st 2000 : Final Copy and Author Registration due - June 30th 2000 : Early Registration Deadline - August 1st 2000 : Late Registration Deadline From concurrency.cwi.nl Fri Jan 21 00:00:00 2000 From: ig@liafa.jussieu.fr (Irene GUESSARIAN) To: concurrency@cwi.nl (moderated) Subject: Cfp: FICS 2000 FIXED POINTS IN COMPUTER SCIENCE (FICS 2000) July 22 and 23, 2000, Paris, France Call for Papers http://www.liafa.jussieu.fr/~ig/FICS.html * Fixed points play a fundamental role in several areas of computer science and logic by justifying induction and recursive definitions. The construction and properties of fixed points have been investigated in many different frameworks. The aim of the workshop is to provide a forum for researchers to present their results to those members of the computer science and logic communities who study or apply the fixed point operation in the different fields and formalisms. * Invited speakers: S. Bloom, B. Courcelle, H. Marandjian, J. Rutten, I. Walukiewicz. * PC chair: Irene Guessarian, e-mail: ig@liafa.jussieu.fr. * Proceedings: preliminary proceedings containing the abstracts of the talks will be available at the meeting. Publication of final proceedings as a special issue of Theoretical Informatics and Applications depends on the number and quality of the papers. * Paper submission: Authors are invited to send 3 copies of an abstract not exceeding 3 pages to the PC chair. Electronic submissions in the form of uuencoded postscript file are encouraged and can be sent to ig@liafa.jussieu.fr. Submissions are to be received before April 3, 2000. Authors will be notified of acceptance by June 1, 2000. * The workshop will be organised just before the Logic 2000 conference. or apply the fixed point operation in the different fields and formalisms. * Invited speakers: S. Bloom, B. Courcelle, H. Marandjian, J. Rutten, I. Walukiewicz. * PC chair: Irene Guessarian, e-mail: ig@liafa.jussieu.fr. * Proceedings: preliminary proceedings containing the abstracts of the talks will be available at the meeting. Publication of final proceedings as a special issue of Theoretical Informatics and Applications depends on the number and quality of the papers. * Paper submission: Authors are invited to send 3 copies of an abstract not exceeding 3 pages to the PC chair. Electronic submissions in the form of uuencoded postscript file are encouraged and can be sent to ig@liafa.jussieu.fr. Submissions are to be received before April 3, 2000. Authors will be notified of acceptance by June 1, 2000. * The workshop will be organised just before the Logic 2000 conference. fore April 3, 2000. Authors will be notified of acceptance by June 1, 2000. * The workshop will be organised just before the Logic 2000 conference. From concurrency.cwi.nl Fri Jan 21 00:00:00 2000 From: Computer Science Logic 2000 To: concurrency@cwi.nl (moderated) Subject: Final CFP: CSL 2000 Final CALL FOR PAPERS -- CSL 2000 Annual Conference of the European Association for Computer Science Logic Fischbachau/Munich, Germany, August 21-26, 2000 CSL is the annual conference of the European Association for Computer Science Logic (EACSL). The conference is intended for computer scientists whose research activities involve logic, as well as for logicians working on issues significant for computer science. Suggested, but not exclusive, topics of interest are: * automated deduction and interactive theorem proving * categorical logic and topological semantics * constructive mathematics and type theory * domain theory * equational logic and term rewriting * finite model theory, database theory * higher order logic * lambda and combinatory calculi * logical aspects of computational complexity * logical foundations of programming paradigms * logic programming, constraints * linear logic * modal and temporal logics * model checking * program extraction * program logics and semantics * program specification, transformation and verification GUREVICH SYMPOSIUM During the CSL 2000 a symposium to celebrate Yuri Gurevich's achievements in the intersection of Computer Science and Logic will take place. INVITED SPEAKERS Miklos Ajtai (Almaden), Paul Beame (Washington), Andreas Blass (Ann Arbor), Egon B"orger (Pisa), Yuri Gurevich (Seattle), Bruno Poizat (Lyon), Wolfram Schulte (Seattle), Saharon Shelah (Jerusalem), Colin Stirling (Edinburgh). PROGRAM COMMITTEE Edmund Clarke (Pittsburgh), Peter Clote (M"unchen), Kevin Compton (Ann Arbor), Laurent Fribourg (Cachan), Erich Gr"adel (Aachen), Gerhard J"ager (Bern), Klaus Keimel (Darmstadt), Jan Willem Klop (Amsterdam), Jan Krajicek (Praha), Daniel Leivant (Bloomington), Tobias Nipkow (M"unchen), Helmut Schwichtenberg (M"unchen), Moshe Vardi (Houston). SPONSORS Siemens AG, FAST e.V., M"unchener Universit"atsgesellschaft e.V., Deutsche Forschungsgemeinschaft PAPER SUBMISSIONS Submitted papers must describe original work not previously published. They must not be submitted concurrently to a journal or to another conference. Papers authored or coauthored by members of the Program Committee are not allowed. Submissions must not exceed 15 pages (in the usual format for Springer LNCS), including title page, figures and references. The title page must contain: title and authors; physical and e-mail addresses; telephone and (if available) fax number for each author; identification of corresponding author, if not the first author; an abstract of no more than 200 words; a list of keywords. Submissions must arrive by January 31, 2000. Notifications of acceptance will be sent by April 17, 2000, and final versions are due May 19, 2000. Authors are invited to send manuscripts by electronic mail to csl2000@informatik.uni-muenchen.de as uuencoded gzipped or attached postscript files and an ASCII file containing the abstract and the address of the corresponding author: * see the submission information page http://www.tcs.informatik.uni-muenchen.de/csl2000/submission.html * or send a message with subject "submission information" to csl2000-org@tcs.informatik.uni-muenchen.de Concerning further questions about the submission procedure please contact Helmut Schwichtenberg schwicht@rz.mathematik.uni-muenchen.de Phone +49 89 2394 4413 Fax +49 89 280 5248 or Peter Clote clote@tcs.informatik.uni-muenchen.de Phone +49 89 2178 2241 Fax +49 89 2178 2238 PUBLICATION Papers accepted by the Program Committee must be presented at the conference and will appear in a proceedings volume, to be published by Springer Verlag in the "Lecture Notes in Computer Science" series. Final versions of accepted papers will be due by May 19, 2000. The format for camera-ready manuscripts will be that of Springer LNCS; instructions can be found in the LNCS home page at: http://www.springer.de/comp/lncs/index.html GRANTS A limited amount of grants is available to all students and to researchers from Eastern Europe to partially fund travel and participation upon request. Grants will preferably be allocated to applicants who have successfully submitted a paper. For details see http://www.tcs.informatik.uni-muenchen.de/csl2000/grants.html IMPORTANT DATES Paper submissions January 31, 2000 Notifications of acceptance April 17, 2000 Final version due May 19, 2000 CSL 2000 conference August 21-26, 2000 ADDITIONAL INFORMATION CSL 2000 home page: http://www.tcs.informatik.uni-muenchen.de/csl2000/ CSL 2000 local organization: csl2000-org@tcs.informatik.uni-muenchen.de From concurrency.cwi.nl Wed Jan 19 00:00:00 2000 From: rbf@dai.ed.ac.uk To: concurrency@cwi.nl (moderated) Subject: PhD in Informatics (AI, CS, CogSci) at Edinburgh PhD degrees in the Division of Informatics at the University of Edinburgh In 1998, the University of Edinburgh established a Division of Informatics, to study the structure, behaviour and interactions of both natural and artificial computational systems. The Division reflects the University's vision of Informatics as a fundamental area of study, critical for the future developments in science, engineering, and society. The Division was formed from the former Departments of Artificial Intelligence, Cognitive Science and Computer Science. The Division has positions for new research degree students pursing either an MSc(Research) (one year), an MPhil (two years) or a PhD (three years) through investigation of open problems in Informatics. The Division now contains about 70 academic staff, 60 contract researchers and 150 research students, grouped primarily into these research institutes: Artificial Intelligence Applications Institute Institute for Adaptive and Neural Computation Institute for Communicating and Collaborative Systems Institute for Computing Systems Architecture Institute of Perception, Action and Behaviour Institute for Representation and Reasoning Laboratory for Foundations of Computer Science which reflect the main research themes in the Division: adaptive computing artificial intelligence automated and mathematical reasoning cognitive science computational complexity computational learning theory computational linguistics computational musicology computational neuroscience computer-assisted formal reasoning computer architectures and networking computer communication and protocols computer graphics and virtual reality computer science computer vision database systems design and analysis of dependable systems diagramatic understanding formal program specification functional, logic and object-oriented programming genetic/evolutionary algorithms human-computer interaction intelligent tutoring systems knowledge representation and reasoning knowledge-based systems machine learning medical informatics mobile and assembly robotics modular and component-based systems natural language processing neural modelling neural networks neuroinformatics parallel, distributed and concurrent systems planning and activity management probabilistic graphical models program logics programming languages qualitative and fuzzy reasoning semantics of programming languages software engineering speech understanding and generation system level design and integration theory of computation type theory The UK Engineering and Physical Science Research Council has awarded the Division about 8 full studentships that can be used by UK and EC students. Overseas students may be eligible for ORS awards, that pay approximately half of the total costs. In general, students should have a good BS/BSc degree (or equivalent) in an appropriate topic, plus other skills appropriate to the particular research area. More information can be found on the Division's PhD WWW page at: http://www.informatics.ed.ac.uk/prospectus/graduate/ For application forms and further information, contact: PhD Admissions Secretary Division of Informatics University of Edinburgh James Clerk Maxwell Building King's Buildings Mayfield Road Edinburgh EH9 3JZ Email: phd-admissions@inf.ed.ac.uk Fax: +44 131 667 7209 Telephone: +44 131 650 5156 Please contact us if you'd like to come for a visit. **************** ALSO: MSc Positions Available **************** We also have three thriving taught MSc courses in Artificial Intelligence, Cognitive Science and Computer Science. For more information, see: http://www.informatics.ed.ac.uk/prospectus/graduate/ From concurrency.cwi.nl Tue Jan 18 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: LICS Workshop on Chu Spaces and Applications 25th June 2000, CA From: Valeria Correa Vaz de Paiva CALL FOR PAPERS LICS'2000 Workshop on Chu Spaces: Theory and Applications Sunday, June 25, 2000, Santa Barbara, California http://www.cs.bham.ac.uk/~vdp/chu.html A Chu space is a related pair of complementary objects. Besides having intrinsic interest in their own right, Chu spaces have found applications to concurrent processes, information flow, linear logic, proof theory, and universal categories. The workshop is concerned with the theory and applications of Chu spaces, as well as related structures such as the Dialectica construction and double glueing. The workshop will bring together computer scientists, mathematicians, logicians, philosophers, and other interested parties to discuss the development of the subject with regard to its foundations, applications, prospects, and directions for future work. Work in the subject is currently fragmented across several areas: category theory, traditional model theory, concurrency, and the semantics of programming languages, and such a workshop can contribute to the coordination and possibly even some unification of these efforts. Suggested topics for presentation and discussion include but are by no means limited to new results about Chu spaces and related structures; their applications to various areas such as concurrency, games, proof theory, etc.; and their implications for foundations and philosophy of computation, mathematics, physics, and other disciplines. The workshop will be held on Sunday, June 25, 2000 at Santa Barbara, California, as an adjunct to the International Conference on Logic in Computer Science (LICS'2000), June 26-29 at the same location as per http://www.cs.bell-labs.com/who/libkin/lics/index.html. Papers within the scope of the workshop are solicited, and may be either work in progress or more mature work. Submission should be in the form of an extended abstract of at most 10 pages, in postscript format, mailed electronically to paiva@parc.xerox.com. Submissions will be evaluated by a committee selected by the organizers, and the full version of accepted papers will be printed in a proceedings available at the start of the workshop. Important dates: Extended abstract: April 25, 2000 Notification of acceptance: May 15, 2000 Proceedings version: June 9, 2000 The workshop will be one full day and is open to all interested researchers. Valeria de Paiva paiva@parc.xerox.com Vaughan Pratt pratt@cs.stanford.edu http://www.cs.bham.ac.uk/~vdp/chu.html From concurrency.cwi.nl Sun Jan 23 00:00:00 2000 From: Carolyn Talcott To: concurrency@cwi.nl (moderated) Subject: FMOODS'2000 cfp ============================================================================== Call for Papers FMOODS 2000 IFIP TC6/WG6.1 Fourth International Conference on Formal Methods for Open Object-Based Distributed Systems Stanford University , Stanford, California, USA September 6-8, 2000 ------------------------------------------------------------------------ Electronic Information * The conference home page is found at http://www.ics.uci.edu/~fmds2000 * Conference-related email should be addressed to fmoods2000@cs.stanford.edu * Information on the FMOODS series of conferences can be found at http://www.cs.ukc.ac.uk/research/netdist/fmoods ------------------------------------------------------------------------ Important Dates 1st March 2000 Submission deadline 30th April 2000Notification of acceptance 23rd May 2000 Camera ready copy for participants proceedings due ------------------------------------------------------------------------ Co-located with SPIN'2000, 7th International SPIN Workshop on Model Checking of Software, to be held at Stanford the previous week August 30-31, September 1. See: http://ase.arc.nasa.gov/spin2000 ------------------------------------------------------------------------ Objectives Object-based Distributed Computing is being established as the most pertinent basis for the support of large, heterogeneous computing and telecommunications systems. Indeed, several important international organisations, such as ITU, ISO, OMG, TINA-C, etc. are defining similar distributed object-based frameworks as a foundation for open distributed computing. The advent of Open Object-based Distributed Systems - OODS - brings new challenges and opportunities for the use and development of formal methods. New architectures and system models are emerging (e.g., the enterprise, information, computational and engineering viewpoints of the ITU-T/ISO/IEC ODP Reference Model) which require formal notational support. Usual design issues such as specification, verification, refinement, and testing need to take into account new dimensions introduced by distribution and openness, such as quality of service and dependability constraints, dynamic binding and reconfiguration, consistency between multiple models and viewpoints, etc. OODS is a challenging research context and a source of motivation for semantical models of object-based systems and notations, for the evolution of standardised formal description techniques, for the application and assessment of logic based approaches, for better understanding and information modeling of business requirements, and for the further development and use of Object Oriented methodologies and tools. The objective of FMOODS is to provide an integrated forum for the presentation of research in several related fields, and the exchange of ideas and experiences in the topics concerned with the formal methods support for Open Object-based Distributed Systems. Topics of interest include but are not limited to: * formal models for object-based distributed computing * semantics of object-based distributed systems and programming languages * formal techniques in object-based and object-oriented specification, analysis and design * refinement and transformation of specifications * types, service types and subtyping * interoperability and composability of distributed services * object-based coordination languages * object-based mobile languages * efficient analysis techniques of specifications * multiple viewpoint modelling and consistency between different models * formal techniques in distributed systems verification and testing * specification, verification and testing of quality of service constraints * formal methods and object life cycle * beyond IDL: semantics based specification patterns * formal models for measuring the quality of object-oriented requirement or design specifications * formal aspects of distributed real-time multimedia systems * applications to telecommunications and related areas ------------------------------------------------------------------------ Invited Speakers: Jose Meseguer, SRI International and others to be announced ------------------------------------------------------------------------ Conference Organizers Carolyn Talcott(Chair) Scott Smith(PC Chair) Tel: + 650 723-0936 Tel: + 410 516-5299 Fax: + 650 725-7411 Fax: + 410 516-6134 Stanford University The Johns Hopkins University Stanford, CA, USA Balimore, MD, USA clt@cs.stanford.edu scott@cs.jhu.edu Nalini Venkatasubramanian Sriram Sankar Tel: + 949 824-5898 Tel: + 510 796-0915 Fax: + 949 824-4056 Fax:+ 510 796-0916 University of California at Irvine Metamata Inc. Irvine, CA, USA Fremont, CA, USA nalini@ics.uci.edu sriram.sankar@metamata.com Program Committee * Gul Agha (U. of Illinois, USA) * Patrick Bellot (ENST, Paris, France) * Lynne Blair (U. Lancaster, UK) * Howard Bowman (UKC, Kent, UK) * Paolo Ciancarini (U. Bologna, Italy) * John Derrick (UKC, Kent, UK) * Michel Diaz (LAAS-CNRS, Toulouse, France) * Alessandro Fantechi (U. Firenze, Italy) * Kathleen Fisher (ATT Research Labs, USA) * Kokichi Futatsugi (Jaist, Ishikawa, Japan) * Joseph Goguen (UC San Diego, USA) * Roberto Gorrieri (U. Bologna, Italy) * Guy Leduc (U. of Liege, Belgium) * Luigi Logrippo (U of Ottawa, Canada) * David Luckham (Stanford University, USA) * Jan de Meer (GMD Fokus, Berlin, Germany) * Elie Najm (ENST, Paris, France) * Dusko Pavlovic (Kestrel Institute, USA) * Omar Rafiq (U. of Pau, France) * Arend Rensink (U. Twente, Netherlands) * Sriram Sankar (Metamata Inc., USA) * Gerd Schuermann (GMD Fokus, Berlin, Germany) * Scott Smith (Johns Hopkins University, USA) * Jean-Bernard Stefani (FT/CNET, Issy-les-Moulineaux, France) * Carolyn Talcott (Stanford University, USA) * Nalini Venkatasubramanian (UC Irvine, USA) Sponsors - IFIP ------------------------------------------------------------------------ Evaluation and Publication of Submitted Papers Submitted manuscripts will be evaluated and selected for presentation in the conference. The proceedings of FMOODS '00 will be published by Kluwer, the publishers of IFIP events. The proceedings will be made available at the conference. Instructions to the Authors Authors are invited to submit full original research papers, up to 16 pages (including bibliography), 12 point, single spaced, including an informative abstract, names and affiliations of all authors, and a list of keywords facilitating the assignment of papers to referees. Submission Paper submissions will be electronic via the web. Papers must be submitted as postscript documents that are interpretable by Ghostscript. Details on the submission process are to be found at http://www.ics.uci.edu/~fmds2000. The package for electronic submission of papers will be available approximately one month before the submission deadline. ------------------------------------------------------------------------ From concurrency.cwi.nl Tue Feb 1 00:00:00 2000 From: Faron Moller Subject: Senior Lecturer/Associate Professor Positions at Uppsala University To: concurrency@cwi.nl (moderated) The Computing Science Department at Uppsala University invites applications for Two Associate Professor/Senior Lecturer Positions in Computing Science (Ref.no. UFV-PA 2000/598 and 2000/599) Applicants who are, or later become, competent for a full professorship will be promoted to full professor after an evaluation procedure. DUTIES Teaching, research, and administration. The percentage of research depends on external funding. Our department has high scientific expectations, and it is our goal that all lecturers have 50% research time. Currently the department has a need for teachers for the following courses: introductory programming using ML; object-oriented programming; algorithms and data structures; software design and engineering; artificial intelligence; and data mining. ELIGIBILITY To be eligible for a lecturership, a candidate must hold a doctoral degree and possess documented pedagogical skill. Furthermore it is required that candidates have a documented ability of qualified teaching in more than one of the following fundamental areas of computing science: methods of programming, algorithms and data structures, compiler design, programming languages, database technology, software engineering, theory of computing, computer-aided verification, and artificial intelligence. CRITERIA FOR RANKING OF APPLICANTS The main criteria are scientific and pedagogical skills, with equal emphasis on both. A demonstrated ability to attract external funding is very important. Ability to teach in Swedish or English is a requirement. Those who cannot teach in Swedish are expected to learn this within three years after being appointed. Administrative ability will be taken into account, as well as ability to inform about research and development. In line with the Faculty's commitment to increasing the number of female senior lecturers, applications from women are especially invited. APPLICATION The applications should be directed to the Vice Chancellor, Uppsala University, Box 256, SE-751 05 UPPSALA, Sweden. Telefax +46 18 471 2000. Closing date: MARCH 1, 2000. If an application is sent by fax, the original should follow as soon as possible. The applicant is required to submit, in two copies, 1. a curriculum vitae and copies of degrees obtained and any other documents of relevance, all to be signed and witnessed; 2. a short account of her/his scientific and teaching experience; 3. an account of pedagogical merits. A form which could guide this account can be obtained from the office of the Faculty for Technology and Natural Sciences, Box 256, S-751 05 Uppsala, Sweden or via e-mail Margareta.Sollenberg@uadm.uu.se, tel +46 18 471 1869. 4. a list of scientific and pedagogical publications; 5. copies of publications according to the above list. For further information, please contact * The department web pages at http://www.csd.uu.se * Arne Andersson (head of the department), arnea@csd.uu.se, phone + 46 18 471 1022, fax +46 18 511925. * Roland Bol (head of undergraduate studies), rolandb@csd.uu.se, phone + 46 18 471 7606, fax +46 18 511925. From concurrency.cwi.nl Thu Jan 27 00:00:00 2000 From: Wang Yi To: concurrency@cwi.nl (moderated) Subject: research positions at Uppsala Research Positions Uppsala University Jan. 2000 ------------------------------------------------------------------------ The department of computer systems, Information Technology at Uppsala University offers the following research positions in real-time systems: *3-year research associate (for applicants with a Ph.D.) *4-year research assistant (for Ph.D. candidates) Successful applicants for the positions are expected to work on formal techniques and software tools for the development of real time embedded systems. Applicants should have a background and interests in some of the following areas: * semantics and verification * tools for modelling, verification and validation * design and implementation of real time systems * automated testing and test case generation * UML and object-oriented methods For further information on the positions, please contact Wang Yi (see below). Current research areas at the Department of Computer Systems include: computer architecture, computer networks and distributed systems, formal methods, neural networks and real time systems. Information on our department can be found at http://www.docs.uu.se/, http://www.docs.uu.se/docs/fm, http://www.docs.uu.se/docs/rtmv and http://www.uppaal.com/. The start date is flexible (but no later than 1 April 2000). Salary will be determined according to the qualifications of the applicant. Applications in the form of a CV (including your interests) should be sent before 1 Mar. 2000 (preferable by email) to: Wang Yi Uppsala University Box 325, Uppsala, Sweden Tel: +46 18 471 3110 Email: yi@docs.uu.se Uppsala is located 70 km north of Stockholm. The departments of computer systems, computing science, mathematics, numerical analysis, and automatic control, are located together on a newly renovated campus(http://www.mic.uu.se/). From concurrency.cwi.nl Thu Jan 27 00:00:00 2000 From: Application Asm To: concurrency@cwi.nl (moderated) Subject: call for participation: ASM2000, March 19th - March 24th ______________________________________________________________ _______ _______ _______ Call for Participation, Preliminary Program _______ _______ _______ _______ ASM2000 _______ _______ _______ _______ http://www.tik.ee.ethz.ch/~asm/2000 _______ _______ Monte Verita, Switzerland _______ _______ March 19th - 24th 2000 _______ ______________________________________________________________ In March 2000, an Abstract State Machine (ASM) Workshop will be held at Monte Verita, Switzerland. The aim of the workshop is to bring together domain-experts using ASMs as practical specification formalisms and theore- ticians using ASMs as formal starting point for their investi- gations, as well as people generally interested in ASMs. See http://www.eecs.umich.edu/gasm for more info on ASMs. The technical program consists of invited lectures, tutorials, presentations of refereed papers, and software demonstrations. A significant part of the time will be devoted to discussions. Arrival is on Sunday afternoon, June 19th, and the workshop program will end on Friday noon, June 24th. A limited number of grants covering registration and part of travel costs are available for undergraduate students. Applications shall include a short CV and resumee of scientific interests. ______________________________________________________________ _______ _______ _______ Important Dates _______ ______________________________________________________________ Grant applications deadline : February 15th Registration deadline : March 1st Earlier registrants get nicer rooms with view over lake and mountains! ASM2000 is just before ETAPS'2000 (Berlin, March 25-April 2,2000) so that attendance to both events can be suitably combined. ______________________________________________________________ _______ _______ _______ Location _______ ______________________________________________________________ Monte Verita served for over hundred year as a boiling meeting place for a variety of movements, ranging from naturalism, over anarchism, to various artistic tendencies. (see http://http://www.csf-mv.ethz.ch/Official/MonteVerita/History.html) The workshop takes place in the newly restored historic Bauhaus buildings, situated in a scenic park with a marvelous view onto the lake Lago Maggiore and the mountains. A 10 minutes walk away the participants can take advantage of Ascona, a picturesque medieval village on the shore of a splendid and sunny bay. (see http://www.ascona.ch/etale.htm) Ascona and the Monte Verita are situated in the heart of Europe, easily accessible from Milano, Italy and Zurich, Switzerland. For travel instructions see http://www.csf-mv.ethz.ch/Official/Additional/Additional.html _______________________________________________________________ _______ _______ _______ Registration Form _______ _______________________________________________________________ Please fill out the registration form below and send it until March 1st to Monica Fricker at the address on the form (regular mail only, no e-mail or fax) to register for the workshop. =============================================================== Send to: Monica Fricker (e-mail/fax not acceptable) Institut TIK ETH Zentrum Gloriastrasse 35 CH-8092 Zurich Switzerland ph: +41-1-632-7035 fax: +41-1-632-1035 EMail: fricker@tik.ee.ethz.ch Please Print or Type: Name:__________________________________________________________ Last/Family First MI Affiliation:___________________________________________________ Address:_______________________________________________________ _______________________________________________________ City:_________________________ State or Region:________________ Zip/Postal code:___________________ Country:___________________ Daytime Phone:_____________________ Fax Number:________________ Email:_________________________________________________________ Do you have any special needs?_________________________________ (special meals, access, etc.) Please circle appropriate fee * Workshop Registration, Accommodation, and Full Board: Student Regular Dollar $ 310 $ 510 Swiss Francs CHF 465 CHF 765 Charges: (please fill out) Total Enclosed: ________ (Swiss Francs (CHF)) PAYMENT MUST BE ENCLOSED: BANK-TO-BANK-TRANSFER (INTERNATIONAL MONEY ORDER) MUST BE DRAWN ON THE FOLLOWING BANK ACCOUNT: SCHWEIZERISCHE NATIONALBANK, BERN BC: 110 Acc.#: 1530-5-30-ETHZ Credit: ASM97 1-67-234-97 E_MAIL REGISTRATIONS CANNOT BE ACCEPTED BECAUSE WE NEED TO HAVE SIGNATURES ON FILE. CHECKS NOT ACCEPTED. Method of Payment ______ BANK-TO-BANK-TRANSFER ______ VISA ______ MASTERCARD ______ AMERICAN EXPRESS ______ DINERS CLUB Credit Card Number:____________________________________________ Exp. Date:____________________ Cardholder Name: ______________________________________________ Exactly as it is printed on the card Date:___________Signature:_____________________________________ We will have to bill no-show registered persons in full. Sorry, we cannot accept cancellations after March 1st, and refunds for cancellations before March 1st may take several months to process. _______________________________________________________________ _______ _______ _______ Program _______ _______________________________________________________________ Discussion sessions, ad hoc meetings, .... Invited Talks: -------------- Andreas Blass, Univ. of Michigan "Pure Mathematics and ASM's." Egon Börger, Univ. of Pisa "Composition and Structuring Principles for ASMs" Gerhard Goos, Univ. of Karlsruhe title to be anounced Martin Odersky, EPFL Lausanne "Functional Nets as a Composition Method for ASM's" Wolfgang Reisig, Humbold Univ. Berlin "Towards a Distributed ASM Thesis" Natarajan Shankar, SRI International "Symbolic Analysis of Transition Systems" Tutorials: ---------- Tutorials include tool-demonstrations and hands-on experience with the used tools. Infrastructure includes 12 SUN-workstations. Uwe Glaesser, Giuseppe del Castillo "Specifying Concurrent Systems with ASMs" The ASM-workbench is introduced and used for experiments with concurrent systems. Harald Ruess, ... , Natarajan Shankar "Verifying ASMs with PVS" The basic features of the PVS proof development system are introduced and demonstrated. Matthias Anlauff, Philipp Kutter, Alfonso Pierantonio "Developing Domain Specific Languages" The Gem-Mex system is used to prototype and visualize small domain specific languages with ASM semantics. Industrial Applications: ------------------------ Peter Paeppinghaus and Joachim Schmid, Siemens AG "Report about a practical application of ASMs in Software Design" Wolfram Schulte, Microsoft Research "ASM applications in industrial research and development" Presentations: -------------- M. Anlauff "Xasm - An Extensible, Component-Based Abstract State Machines Language" D. Beauquier and A. Slissenko "Verification of Timed Algorithms: Gurevich Abstract State Machines versus First Order Timed Logic" A. Blass, Y. Gurevich and J. Van den Bussche "Abstract state machines and computionally complete query languages" E. Boerger, A. Cavarra, and E. Riccobene "An ASM semantics for UML Activity Diagrams and UML State Machines" S.C. Cater and J.K. Huggins "An ASM Dynamic Semantics for Standard ML" J. Cohen and A. Slissenko "On Verification of Refinements of Timed Distributed Algorithms" R. Eschbach, U. Glaesser, R. Gotzhein, A. Prinz "The Semantics of Programming Languages: A transformational operational approach using Abstract State Machines" V.O. Di Iorio, R. da Silva Bigonha, and M. Maia "A Self-Applicable Partial Evaluator for ASM" A. Gargantini and E. Riccobene "Encoding Abstract State Machines in PVS" Y. Gurevich and D. Rosenzweig "Partially Ordered Runs: a Case Study" Y. Gurevich, W. Schulte, and C. Wallace "Investigating Java concurrency using Abstract State Machines" A. Heberle, W. Loewe, and W. Zimmermann "On Modular Definitions and Implementations of Programming Languages using Order-Sorted Partial Abstract State Machines" J.K. Huggins and W. Shen "The Static and Dynamic Semantics of C" B. Intrigila, G.D. Penna, and D. Ciccomartino "Extending Boerger's JVM Model to Compile Safe C++ Code: 1. The Pointers' Problem" J.W. Janneck and P.W. Kutter "Mapping Automaton - Simple Abstract State Machines" C. Pahl "Towards an Action Refinement Calculus for Abstract State Machines" H. Rust "Hybrid Abstract State Machines: Using the Hyperreals for Describing Continuous Changes in a Discrete Notation" J. Teich, P.W. Kutter, and R. Weper "Description and Simulation of Microprocessor Instruction Sets Using ASMs" K. Winter "Methodology for Model Checking ASM: Lessons learned from the FLASH Case Study" M. Spielmann "Model Checking Abstract State Machines and Beyond" A.V. Zamulin "Specifications In-the-large by Typed ASMs" A.V. Zamulin "Generic Facilities in Object-Oriented ASMs" _______________________________________________________________ _______ _______ _______ Organization _______ _______________________________________________________________ The workshop is sponsored by the Swiss Federal Institute of Technology, Microsoft Research, and BlueCapital. Organizers: Yuri Gurevich, Microsoft Research, Redmond, Washington Philipp W. Kutter, Federal Institute of Technology, Zürich Martin Odersky, Federal Institute of Technology, Lausanne Lothar Thiele, Federal Institute of Technology, Zürich From concurrency.cwi.nl Mon Jan 24 00:00:00 2000 To: concurrency@cwi.nl (moderated) From: Jud Wolfskill Subject: book announcement--Clarke Book announcement: Model Checking Edmund M. Clarke, Jr., Orna Grumberg, and Doron A. Peled Model checking is a technique for verifying finite state concurrent systems such as sequential circuit designs and communication protocols. It has a number of advantages over traditional approaches that are based on simulation, testing, and deductive reasoning. In particular, model checking is automatic and usually quite fast. Also, if the design contains an error, model checking will produce a counterexample that can be used to pinpoint the source of the error. The method, which was awarded the 1999 ACM Paris Kanellakis Award for Theory and Practice, has been used successfully in practice to verify real industrial designs, and companies are beginning to market commercial model checkers. The main challenge in model checking is dealing with the state space explosion problem. This problem occurs in systems with many components that can interact with each other or systems with data structures that can assume many different values. In such cases the number of global states can be enormous. Researchers have made considerable progress on this problem over the last ten years. This is the first comprehensive presentation of the theory and practice of model checking. The book, which includes basic as well as state-of-the-art techniques, algorithms, and tools, can be used both as an introduction to the subject and as a reference for researchers. Edmund M. Clarke, Jr., is the FORE Systems Professor of Computer Science and Professor of Electrical and Computer Engineering at Carnegie Mellon University. Orna Grumberg is Professor of Computer Science at the Technion, Haifa, Israel. Doron A. Peled is a Member of the Technical Staff at Bell Laboratories, Lucent Technologies. 7 x 9, 305 pp., 99 illus., cloth ISBN 0-262-03270-8 For more information please visit http://mitpress.mit.edu/promotions/books/CLAOHF99 From concurrency.cwi.nl Mon Jan 24 00:00:00 2000 From: Enrico To: concurrency@cwi.nl (moderated) Subject: Job Announcement: New Mexico State University New Mexico State University Department of Computer Science The New Mexico State University Department of Computer Science invites applications for one or two tenure-track assistant/associate professor position(s) in computer science beginning academic year 2000-2001. Strong commitment to both research and teaching required. Applications from women and members of minority groups invited. Qualifications include a Ph.D. in Computer Science or closely related discipline (in hand by date of hire) and evidence of strength in teaching and research. The Department has 12 tenure-track faculty positions, and offers B.S., M.S., and Ph.D. degrees. The Department collaborates with the Computing Research Laboratory (CRL), an independent research center at NMSU. Departmental facilities include a network of some 60 Sparc workstations, a 14-processor Sun Sparc, a 32-node Beowulf, and several other multiprocessors. The Department recently received $1.5m grant from NSF to upgrade its infrastructure. Arrange for vita, short research description, and at least three reference letters to be sent by postal mail directly to: Faculty Recruiting Committee, Department of Computer Science, NMSU MSC CS, PO Box 30001, Las Cruces, NM 88003-8001. Application review will begin January 31, 2000. NMSU is an EEO/AA employer. From concurrency.cwi.nl Wed Feb 2 00:00:00 2000 To: concurrency@cwi.nl (moderated) From: Mats Heimdahl Subject: Reminder CFP - Formal Methods in Software Practice FYI, We will accept abstracts for another week or so and we may be able to grant an extension on the February 15 paper deadline on a case by case basis. Call For Papers Workshop on Formal Methods in Software Practice Sponsored by ACM SIGSOFT Co-located with ISSTA Portland, Oregon, USA, August 23-25, 2000 http://www.ics.uci.edu/issta-fmsp http://www.cs.umn.edu/crisys/fmsp IMPORTANT DATES Abstract Submission: February 1, 2000 Deadline for all Submissions: February 15, 2000 Notification of Acceptance: April 17, 2000 Camera-ready Copy Due: May 12, 2000 FMSP aims to bring together researchers and practitioners from around the world to work on the problems of the practical use of formal techniques. Based on the feedback from the hugely successful FMSP, the program for FMSP will include presentations of research and experience reports as well as directed discussion groups. Discussions will focus on the impact of formal methods on software and systems practice, as well as on strategies to further this impact in the future. This workshop is being co-located with ISSTA (International Symposium on Software Testing and Analysis) to encourage the cross-pollination of ideas between the formal methods and the testing communities. The format of the workshop will be presentations of accepted submissions, directed discussion groups, and possibly panel discussions and invited talks. Attendance is open to all. CONFERENCE SCOPE Authors are invited to submit research papers or experience reports. Submissions should focus on the application of formal methods to software practice. They should cover topics related to practical formal techniques, formal methods technology transition to industry, experience reports, the needs of industry, and visions for the future. Submissions are encouraged in the following categories: Research Paper primary for academicians and researchers, describing original research results and prototype development. Industry Reports primarily for practitioners to relay experiences in using formal methods in practice. Panel Proposals covering sessions on current formal methods topics. Tutorial Proposals half-day or full-day tutorials on current practical formal methods topics. SUBMISSION GUIDELINES Regular papers must not exceed 11 pages in camera-ready form, including figures and references. Industry reports must not exceed five pages in camera-ready form, including figures and references. For regular and industry papers, a separate, one-page abstract must be submitted via email to the program chair 2 weeks before the full paper. Panel proposals must include title, name and contact information of the organizer, names of panelists, and a one-page description of the topic. The panelists should have agreed to participate prior to submission of the proposal. Tutorial proposals must include title, name and contact information of the tutor, outline of the proposed tutorial, and a one-page description of the topic. Submissions must be original and should not have been published previously or be under consideration for publication while being evaluated for this workshop. All submissions must be in English and will be carried out electronically via the Web. Further instructions and guidelines are available from the conference web page. Authors of accepted papers will be required to sign an ACM copyright release form. General Chair: Debra J. Richardson, djr@ics.uci.edu Program Chair: Mats P.E. Heimdahl, heimdah@cs.umn.edu Program Committee: Perry Alexander , USA Mark Ardis, USA Egon B=F6rger, Italy Ricky Butler, USA Marsha Chechik, Canada Robert France, USA Patrice Godefroid, USA David Guaspari, USA Anthony Hall, UK Connie Heitmeyer, USA Randolph Johnson, USA Peter-Gorm Larsen, Denmark Nancy Leveson, USA John Penix, USA Harald Ruess, USA --------------------------------- Mats Heimdahl, McKnight Land-Grant Professor University of Minnesota, Twin Cities Phone: (612)-625-2068 Institute of Technology Dept.: (612)-625-4002 Department of Computer Science Fax : (612)-625-0572 4-192 EE/CS Bldg. 200 Union Street S.E. Minneapolis, MN 55455 From concurrency.cwi.nl Tue Feb 1 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: TPHOLs 2000 --- second call for papers From: John Harrison SECOND CALL FOR PAPERS: TPHOLs 2000 The 13th International Conference on Theorem Proving in Higher Order Logics Portland, Oregon, USA Monday 14 August - Friday 18 August 2000 *************************************** * http://www.cse.ogi.edu/tphols2000 * *************************************** The 2000 International Conference on Theorem Proving in Higher Order Logics will be the thirteenth in a series that dates back to 1988. The conference will be held Monday 14 August through Friday 18 August, 2000, at the DoubleTree Hotel, Portland, Oregon, USA. The first day of the conference will be devoted to tutorials, with the remaining 4 days covering the main conference program. TOPICS The program committee welcomes submissions on all aspects of theorem proving in higher order logics, and on related topics in theorem proving and verification. This includes, but is not limited to, the following topics: o Hardware and software verification, refinement and synthesis o Verification of security and communications protocols o Formal specification and requirements analysis of systems o Industrial applications of theorem provers o Advances in theorem prover technology o Comparisons of various approaches to theorem proving o Proof automation and decision procedures o Incorporation of theorem provers into larger systems o Combination of theorem provers with other provers and tools o User interfaces for theorem provers o Development and extension of higher order logics SUBMISSION Submissions are invited in the following categories: o Category A: Full research paper o Category B: Informal progress report Submissions under category A will be fully refereed, and accepted papers will be published as a volume of Springer-Verlag's Lecture Notes in Computer Science series ("http://www.springer.de/comp/lncs/index.html"), which will be available at the conference. Authors of accepted papers are expected to present their work at the conference. Submissions under category B will not be formally refereed, but their content and relevance will be reviewed. Those submissions accepted will be published in a technical report, which will be available at the conference. Authors of accepted papers are expected to present a brief outline of their work at the conference and to prepare a poster for display at the conference venue. Unless otherwise requested, submissions rejected under category A will also be considered for inclusion under category B. DEADLINES AND SUBMISSION PROCEDURE o Deadline for category A submissions: 25 Feb 2000 o Deadline for category B submissions: 17 Mar 2000 o Notification of acceptance: 3 Apr 2000 o Camera-ready copy for category A due (provisional): 5 May 2000 o Conference: 14-18 Aug 2000 Papers should be no more than 16 pages in length and should be written using LaTeX2e and the LNCS style file, which is available from "http://www.springer.de/comp/lncs/authors.html". Submissions should be sent electronically following the instructions on the TPHOLs web page, or emailed directly to the organizers using the email address "tphols2000@cse.ogi.edu". This email address can also be used for any inquiries concerning the conference. PROGRAM COMMITTEE Mark Aagaard (Intel) Bart Jacobs (Nijmegen) Flemming Andersen (IBM) Paul Jackson (Edinburgh) David Basin (Freiburg) Steve Johnson (Indiana) Richard Boulton (Edinburgh) Sara Kalvala (Warwick) Albert Camilleri (HP) Tom Melham (Glasgow) Gilles Dowek (INRIA) Paul Miner (NASA) Harald Ganzinger (Saarbrucken) Tobias Nipkow (Muenchen) Ganesh Gopalakrishnan (Utah) Sam Owre (SRI) Mike Gordon (Cambridge) Christine Paulin-Mohring (INRIA) Jim Grundy (ANU) Lawrence Paulson (Cambridge) Elsa Gunter (Bell Labs) Klaus Schneider (Karlsruhe) John Harrison (Intel) Sofiene Tahar (Concordia) Doug Howe (Bell Labs) Ranga Vemuri (Cincinnati) Warren Hunt (IBM) CONFERENCE ORGANIZATION The conference is being organized by Intel Corp. and the Oregon Graduate Institute (OGI). The organizing committee is as follows: Mark Aagaard (General Chair) John Harrison (Program Chair) Kelly Atkinson Naren Narasimhan Robert Beers Tom Schubert Nancy Day From concurrency.cwi.nl Thu Feb 10 00:00:00 2000 From: Stefan Leue To: concurrency@cwi.nl (moderated) Subject: PhD Postion / PostDoc / Assistant Professor at Freiburg The newly formed tele research group for computer networks and telecommunications in the Institute for Computer Science of the Unviersity of Freiburg has an opening for a fully funded PhD Research and Teaching Assistant position. The position may also be filled with a candidate posessing a doctoral degree, but priority is placed on hiring a PhD candidate. Area: telecommunications and/or formal methods. For more information please see: http://www.informatik.uni-freiburg.de/tele/opening.02-00.htm or contact me. Stefan Leue ----------------------------------------------------- Prof. Stefan Leue Institute for Computer Science Albert-Ludwigs-University Freiburg Am Flughafen 17, building 051, room 02-007 D-79110 Freiburg, Germany phone: +49 (0)761 203 8181 fax: +49 (0)761 203 8182 email: leue@uni-freiburg.de WWW: http://www.informatik.uni-freiburg.de/~leue/ From concurrency.cwi.nl Thu Feb 10 00:00:00 2000 From: farn@iis.sinica.edu.tw (Farn Wang) To: concurrency@cwi.nl (moderated) Subject: Verification tool announcement: RED v.1.0 ====================================== ANNOUNCEMENT OF NEW VERIFICATION TOOL. ====================================== RED Region-Encoding Diagram Verification Tool Version 1.0 http://www.iis.sinica.edu.tw/~farn/red --------------------------------------- Farn Wang Institute of Information Science, Academia Sinica Taipei, Taiwan 115, ROC RED is a fully symbolic verification tool with a new data-structure for the encoding of regions of timed automata. Unlike DBM-technology, RED records the ordering among fractional parts of clock readings with one auxiliary variable per clock. This new version 1.0 is for multiprocess real-time systems with unrestricted number of global clocks and local clocks. Version 1.0 also supports synchronizers among processes and more general assignment and literal syntax. You are most welcome to download the tool and relevant reports at http://www.iis.sinica.edu.tw/~farn/red All comments on the tool will be appreciated. Note that RED version 0.0 was announced around November 1999 with the name DDD (Data-Decision Diagram). We changed to the new name "RED" because two parties notified us that they had used the name before. Version 0.0 is for symmetric systems with single local clock per process and without synchronizers and global clocks. For such target systems, version 0.0 performs better. We plan to merge the two versions (0.0 and 1.0) into the upcoming version 1.1 shortly. From concurrency.cwi.nl Wed Feb 9 00:00:00 2000 From: Helmut Veith To: concurrency@cwi.nl (moderated) Subject: Formal Methods and Computer Security 2000 Call for Papers 2000 Workshop on Formal Methods and Computer Security July 20, 2000 Chicago, USA (CAV Workshop) Computer security protocols are notoriously difficult to get right. Surprisingly simple problems with some well known protocols have been found years after the original protocol was published and extensively analyzed. Our workshop goal is to bring together the formal methods and security communities. Security is a current hot topic in the formal methods community, and we hope that this workshop can help focus these energies. Topics of interest include descriptive techniques (specification languages, models, logics) and analysis techniques (model checking, theorem proving, and their combination), as applied to protocols for authentication, fair exchange, electronic commerce, and electronic auctions. However, this list is not exclusive. We particularly want to hear about new approaches, new problems, new security properties, and new protocol bugs. Reports on work in progress are welcome. The program of the workshop will include a keynote address by Doug Tygar, a number of technical sessions (with talks of about 15-20 minutes duration), and a panel discussion. Paper submission: An extended abstract (about 5-10 pages) explaining recent research results or work in progress should be mailed electronically to fmcs-2000@cs.cmu.edu, to be received by April 14, 2000. Submissions should be formatted as a PostScript file in USLetter or A4 size. Authors will be notified of acceptance or rejection by May 16, 2000. Final versions of accepted papers will be due by June 16, 2000. These papers will be collected and distributed in an informal proceedings to be made available at the workshop. DATES: Submissions: April 14, 2000. Notification: May 16, 2000. Final papers: June 16, 2000. Workshop: July 20, 2000. KEYNOTE SPEAKER: Doug Tygar, UC Berkeley WEBSITE: http://www.cs.cmu.edu/~veith/fmcs/ PROGRAM COMITTEE: Edmund Clarke, Carnegie Mellon University Nevin Heintze, Bell Laboratories Catherine Meadows, Naval Research Laboratory Jonathan Millen, SRI International John Mitchell, Stanford University Scott Stoller, Indiana University ORGANIZING COMITTEE: Edmund Clarke Nevin Heintze Helmut Veith From concurrency.cwi.nl Wed Feb 9 00:00:00 2000 From: Fmoods Mailbox To: concurrency@cwi.nl (moderated) Subject: FMOODS'2000 cfp - WITH SUBMISSION INSTRUCTIONS! ============================================================================== Call for Papers FMOODS 2000 IFIP TC6/WG6.1 Fourth International Conference on Formal Methods for Open Object-Based Distributed Systems Stanford University , Stanford, California, USA September 6-8, 2000 ------------------------------------------------------------------------ Electronic Information * The conference home page is found at http://www.ics.uci.edu/~fmoods2000 * Conference-related email should be addressed to fmoods2000@cs.stanford.edu * Submission information can be found at http://www-formal.stanford.edu/fmoods/FmoodsSys/subm/index.html * Information on the FMOODS series of conferences can be found at http://www.cs.ukc.ac.uk/research/netdist/fmoods ------------------------------------------------------------------------ Important Dates 1st March 2000 Submission deadline 30th April 2000Notification of acceptance 23rd May 2000 Camera ready copy for participants proceedings due ------------------------------------------------------------------------ NEW! NEW! NEW! NEW! Electronic Submission Electronic submission of papers is solicited. Instructions can be found at http://www-formal.stanford.edu/fmoods/FmoodsSys/subm/index.html or can be obtained by sending email with subject submission information to the address fmoods-subm@steam.stanford.edu. An ascii version of the form and instructions can also be found directly at the url above. There are two means for submission -- using the web form found at the above url, or by emailing the form with the ps file following the FILE: field marker. Please pay careful attention to filling out the short submission form as the parser expecting a fairly rigid format. NOTE that the web-form is only designed to work with Netscape. And the parser will be confused and reject your submission if you use a mailer the wraps the ps file with attachment info and/or encodes it. If you fail to meet the parsers requirements, please send the CAREFULLY filled out submission form with the ps file attached somehow to fmoods@steam.stanford.edu and someone will help. ------------------------------------------------------------------------ Co-located with SPIN'2000, 7th International SPIN Workshop on Model Checking of Software, to be held at Stanford the previous week August 30-31, September 1. See: http://ase.arc.nasa.gov/spin2000 ------------------------------------------------------------------------ Objectives Object-based Distributed Computing is being established as the most pertinent basis for the support of large, heterogeneous computing and telecommunications systems. Indeed, several important international organisations, such as ITU, ISO, OMG, TINA-C, etc. are defining similar distributed object-based frameworks as a foundation for open distributed computing. The advent of Open Object-based Distributed Systems - OODS - brings new challenges and opportunities for the use and development of formal methods. New architectures and system models are emerging (e.g., the enterprise, information, computational and engineering viewpoints of the ITU-T/ISO/IEC ODP Reference Model) which require formal notational support. Usual design issues such as specification, verification, refinement, and testing need to take into account new dimensions introduced by distribution and openness, such as quality of service and dependability constraints, dynamic binding and reconfiguration, consistency between multiple models and viewpoints, etc. OODS is a challenging research context and a source of motivation for semantical models of object-based systems and notations, for the evolution of standardised formal description techniques, for the application and assessment of logic based approaches, for better understanding and information modeling of business requirements, and for the further development and use of Object Oriented methodologies and tools. The objective of FMOODS is to provide an integrated forum for the presentation of research in several related fields, and the exchange of ideas and experiences in the topics concerned with the formal methods support for Open Object-based Distributed Systems. Topics of interest include but are not limited to: * formal models for object-based distributed computing * semantics of object-based distributed systems and programming languages * formal techniques in object-based and object-oriented specification, analysis and design * refinement and transformation of specifications * types, service types and subtyping * interoperability and composability of distributed services * object-based coordination languages * object-based mobile languages * efficient analysis techniques of specifications * multiple viewpoint modelling and consistency between different models * formal techniques in distributed systems verification and testing * specification, verification and testing of quality of service constraints * formal methods and object life cycle * beyond IDL: semantics based specification patterns * formal models for measuring the quality of object-oriented requirement or design specifications * formal aspects of distributed real-time multimedia systems * applications to telecommunications and related areas ------------------------------------------------------------------------ Invited Speakers * Jose Meseguer, SRI International * Roberto Gorrieri, U. Bologna, Italy * Jaydev Misra, U. Texas, Austin * Alan Karp, Open Systems Operation, Hewlett-Packard ------------------------------------------------------------------------ Conference Organizers Carolyn Talcott(Chair) Scott Smith(PC Chair) Tel: + 650 723-0936 Tel: + 410 516-5299 Fax: + 650 725-7411 Fax: + 410 516-6134 Stanford University The Johns Hopkins University Stanford, CA, USA Balimore, MD, USA clt@cs.stanford.edu scott@cs.jhu.edu Nalini Venkatasubramanian Sriram Sankar Tel: + 949 824-5898 Tel: + 510 796-0915 Fax: + 949 824-4056 Fax:+ 510 796-0916 University of California at Irvine Metamata Inc. Irvine, CA, USA Fremont, CA, USA nalini@ics.uci.edu sriram.sankar@metamata.com Program Committee * Gul Agha (U. of Illinois, USA) * Patrick Bellot (ENST, Paris, France) * Lynne Blair (U. Lancaster, UK) * Howard Bowman (UKC, Kent, UK) * Paolo Ciancarini (U. Bologna, Italy) * John Derrick (UKC, Kent, UK) * Michel Diaz (LAAS-CNRS, Toulouse, France) * Alessandro Fantechi (U. Firenze, Italy) * Kathleen Fisher (ATT Research Labs, USA) * Kokichi Futatsugi (Jaist, Ishikawa, Japan) * Joseph Goguen (UC San Diego, USA) * Roberto Gorrieri (U. Bologna, Italy) * Guy Leduc (U. of Liege, Belgium) * Luigi Logrippo (U of Ottawa, Canada) * David Luckham (Stanford University, USA) * Jan de Meer (GMD Fokus, Berlin, Germany) * Elie Najm (ENST, Paris, France) * Dusko Pavlovic (Kestrel Institute, USA) * Omar Rafiq (U. of Pau, France) * Arend Rensink (U. Twente, Netherlands) * Sriram Sankar (Metamata Inc., USA) * Gerd Schuermann (GMD Fokus, Berlin, Germany) * Scott Smith (Johns Hopkins University, USA) * Jean-Bernard Stefani (FT/CNET, Issy-les-Moulineaux, France) * Carolyn Talcott (Stanford University, USA) * Nalini Venkatasubramanian (UC Irvine, USA) Sponsors - IFIP ------------------------------------------------------------------------ Evaluation and Publication of Submitted Papers Submitted manuscripts will be evaluated and selected for presentation in the conference. The proceedings of FMOODS '00 will be published by Kluwer, the publishers of IFIP events. The proceedings will be made available at the conference. Instructions to the Authors Authors are invited to submit full original research papers, up to 16 pages (including bibliography), 12 point, single spaced, including an informative abstract, names and affiliations of all authors, and a list of keywords facilitating the assignment of papers to referees. Submission Paper submissions will be electronic via the web. Papers must be submitted as postscript documents that are interpretable by Ghostscript. Details on the submission process are to be found at http://www.ics.uci.edu/~fmds2000. The package for electronic submission of papers will be available approximately one month before the submission deadline. ------------------------------------------------------------------------ From concurrency.cwi.nl Mon Feb 7 00:00:00 2000 From: GOUBAULT Eric To: concurrency@cwi.nl (moderated) Subject: CFP for GETCO'00 _________________________________________________________________________ PRELIMINARY ANNOUNCEMENT AND CALL FOR PAPERS GETCO'00 2nd Workshop on Geometric and Topological Methods in Concurrency Theory http://www.dmi.ens.fr/~goubault/getco.html a satellite to CONCUR'00 PennState, 21st of August 2000 (to coincide with EXPRESS'00, another satellite) _________________________________________________________________________ (apologies for multiple copies) This workshop follows last year's "Geometric and Topological Methods in Concurrency Theory" meeting held at Aalborg University. The aim is to bring together researchers that apply geometric, topological and algebraic topological methods to formalize and analyze dynamical, concurrent and distributed systems. The spirit of the meeting will be informal and will focus on exchange of information and discussion. It will consist of a number of tutorials, invited talks, together with accepted papers. Abstracts and work in progress reports are encouraged. The submission deadline is the 19th of may. For more information please see URLs GETCO'00 http://www.dmi.ens.fr/~goubault/getco.html CONCUR'00 http://www.cse.psu.edu/concur2000/ EXPRESS'00 http://www.docs.uu.se/~victor/Express/express00.shtml GETCO'99 http://www.math.auc.dk/~raussen/admin/workshop/workshop.html _________________________________________________________________________ From concurrency.cwi.nl Mon Feb 7 00:00:00 2000 From: "K. V. S. Prasad" To: concurrency@cwi.nl (moderated) Subject: New PhD positions at Chalmers New PhD Positions (DEADLINE 1 March 2000! See "How to apply" below.) Department of Computing Science, Chalmers University of Technology and Göteborgs University, Sweden The Department has about 60 researchers, half being faculty members and half PhD students. Our focus is on programming logic and type theory, functional programming, formal methods, distributed and concurrent systems, security, algorithms, and computational linguistics, but research is not restricted to these topics. For more information, see www.cs.chalmers.se/Cs/Research. PhD positions are for 5 years. There is no tuition fee. A PhD position is a regular job with social benefits; the salary amounts to 16200 SEK per month in the first year (the exact amount depends on teaching duties, usually 20% of your time), which offers a higher standard of living than for most PhD students elsewhere. Knowledge of Swedish is not a prerequisite for application. English is our working language for research. Both Swedish and English are used in undergraduate courses. Half of our researchers are native Swedes; the rest come from more than 20 different countries. Applicants must have an undergraduate degree in Computing Science or in a related subject with a strong Computing Science component. You may also apply if you expect to have such a degree by September 2000. The School especially welcomes female applicants. How to apply ------------ First, immediately register your intention to apply using the electronic application form on the WWW at http://www.md.chalmers.se/Jobs/PhD/phd-00-en.thtml The full application should give 1 name, age, gender, nationality, post and email address, tel/fax no. 2 transcripts of grades from your undergraduate degree(s); 3 a statement of research interests; 4 some letters of recommendation from your teachers or employers; 5 copies of any scientific papers you have written. Send it (paper mail) to Section for Mathematics and Computer Science Chalmers University of Technology 412 96 Gothenburg Sweden to arrive by 1 March 2000. You will know the result of your application by 1 June 2000. Formal papers might take time. Meanwhile, e-mail will do perfectly well for the information content of your application. Send it to prasad@cs.chalmers.se This will be of particular help should you be unable to send in complete information to the Section by 1 March. --------------------------------------------------------------- K. V. S. Prasad e-mail: prasad@cs.chalmers.se Dir of Graduate Studies URL: www.cs.chalmers.se Dept. of Computing Science Tel: 46-31-772 1021 Chalmers University 412 96 Gothenburg, Sweden Fax: 46-31-16 56 55 From concurrency.cwi.nl Mon Feb 14 00:00:00 2000 From: Faron Moller Subject: PhD positions in Uppsala, Sweden To: concurrency@cwi.nl (moderated) I am looking to recruit bright students to carry out PhD work on the two research projects described below. The expected starting date for these is Autumn 2000. PhD positions are for 5 years. There is no tuition fee; a PhD position is a regular job with social benefits, and includes 20% teaching duties. These are projects in the theory of computation, and as such the expected candidates should have a high level of mathematical maturity. Particular topics which would be of useful preliminary knowledge are (finite) model theory for the first project and automata and languae theory for the second. If you are interested, please email me in the first instance with a CV. Faron Moller email:fm@csd.uu.se 1) GAMES FOR PROCESSES (1-2 students). Two-person antagonistic games with full information provide useful and intuitive models for diverse problems in computer science, including equivalence and model checking, definability, and characterization of complexity classes. Although well studied and understood mathematically, with a rich classical underlying theory, such games still provide challenging open problems, especially of a complexity-theoretic nature in connection with their increased applications in program verification. The aim of this project is to explore such applications and the problems which they pose. For more information, see http://www.csd.uu.se/~fm/games.ps 2) VERIFICATION OF INFINITE STATE SYSTEMS (1-2 students). Recently, interest in addressing the problems of analysing infinite-state systems has blossomed within the concurrency theory research community. The practical motivation for this has been both to provide for the study of parallel program verification, where infinite data types are manipulated, as well as to allow for more faithful representations of concurrent systems. However, it is strongly driven by its impact on traditional questions in automata theory and formal language theory. The aim of this project is to explore these language- and automata-theoretic applications, with an eye to exploiting newly-developed techniques in practical verifications. For more information, see http://www.csd.uu.se/~fm/infinity.ps From concurrency.cwi.nl Fri Feb 11 00:00:00 2000 Subject: Reminder: Special Sessions on Formal Verification at PDPTA2000 To: concurrency@cwi.nl (moderated) From: Sandeep Kumar Shukla SECOND CALL FOR PAPERS Special Sessions of Formal Validation at PDPTA2000 Las Vegas, June 26-29, 2000 ------------------------------------------------------------ Two special sessions on Formal Verification technology are being organized at the International Conference on Parallel and Distributed Techniques and Applications (PDPTA'2000) to be held in Las Vegas during June 26-29, 2000. These two sessions are entitled 1. Formal Verification and Formal Methodologies in the Industrial Validation flow 2. Technological Challenges in the Formal Verification of Parallel and Distributed System Designs Papers are invited for both the sessions. Authors may contribute previously unpublished papers describing research results, case studies and tool descriptions with benchmark results etc. The specification for the format and length of the contribution, together with important dates are described at the end of this announcement. The background of these two special sessions are as follows: Background ---------- Validation techniques for both hardware and safety-critical software systems are at a critical inflection point. With the wide spread usage of multi-processing and multi-threading in servers to exploit task level parallelism, extensive usage of instruction level parallelism inside processors, distributed nature of many important software applications, the computing world has been growing more and more complex every generation. Under these circumstances, the validation technologies face major challenges than ever before. For example, in the hardware industry, chip design complexity is keeping up well with the Moore's law, and super scalar, super pipelined designs are common place. To exploit the capability of packing more functionality into a chip, multi-threaded, multi-core chips are on the horizon. As a result, a demand for more and more sophisticated validation techniques are extreme necessities. In the software industry, with the deployment of safety-critical, real-time systems, testing based techniques are no longer the only relied upon methodologies. Even the design methodologies need to encompass the proper abstraction capabilities, formal framework, and close link to validation methodologies. Otherwise, complex systems such as today's processor chips, or multi-processor platforms, network protocols, safety-critical systems, face the danger of being ad hoc and hence almost impossible to validate. Formal methodologies and Formal Verification has been a topic of research for several decades now, with established techniques and successful application case studies. In the nineties, formal methodology and verification has also been adopted in industrial validation path, with certain limitations. It seems that most validation engineers agree on the potential of formal verification, design engineers agree on the need formal methodologies and the need for a close tie between design practices and formal validation. However, in practice, how many multi-million transistor chips are designed following a formal methodology and/or have been formally verified? How many complex, communication protocols are designed formally or validated formally? What are the main obstacles towards wide spread adoption of Formal Methodology and validation in the industry? What can the academia do to tie in formal verification methodology in the existing design flow and validation flow? What are the current technological challenges that a formal verification tool has today? What are the current research directions to overcome those hurdles and limitations? Do we see a wide spread usage of formal verification as a major component of a validation flow in major industries? The sessions at the PDPTA2000 will hope to address these these issues, to report and discuss case studies from the industry, to understand the current research directions. History ------- Last year in PDPTA'99 Mike Reed from Oxford University Computing Lab arranged a number of very successful sessions on formal verification techniques and its current limitations. The sessions had a number of very interesting invited talks from industries such as Intel, Motorola, US Naval Research Institute etc. There were many interesting papers from various academic researchers as well. Format and Length of Contribution ---------------------------------- Maximum of 6 pages in Length (double column) Either in microsoft word format or ps format. To be sent via email to either of the two organizers listed below. Organizers ---------- 1. Dr. G. M. Reed Fellow in Computation (St. Edmund Hall) and Lecturer Oxford University Computing Lab Oxford U.K email: gmr@comlab.ox.ac.uk 2. Dr. S. K. Shukla Micro Processor Group Intel Corporation Santa Clara, USA email: sandeep.k.shukla@intel.com Important Dates --------------- Deadline for submission March 1, 2000 Acceptance Notification April 1, 2000 Camera Ready Version Due May 15, 2000 Presentation: June 26-29, 2000 From concurrency.cwi.nl Fri Feb 11 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: Tenured posts. Edinburgh, Scotland From: Fairouz Kamareddine Tenured Posts in Computer Science Heriot-Watt University, Edinburgh, Scotland Posts at the level of lecturer (assistant professor), senior lecturer and reader (associate professor) are available at the department of Computing and Electrical Engeneering at Heriot-Watt University, Edinburgh Scotland. The posts are in a number of areas of Computer Science. I would strongly encourage applications from academics whose research area is on type theory, term rewriting, logic, and the foundations of programming languages and theorm proving. Look at the web pages of the ULTRA group http://www.cee.hw.ac.uk/ultra/ for information on the areas we are involved in. The department of Computing and Electrical at Heriot-Watt is a very lively, active and friendly place with a supportive spirit. The department is expanding fast and is committed to excellence and is investing a lot in the future. So, if you can contribute to this excellence and you want to play an influential role in a supportive environment, send your application. Heriot-Watt is located in beautiful parklands on the outskirsts of Edinburgh, the capital of Scotland and a beautiful and historic city. Further details about the Department are available on http://www.cee.hw.ac.uk/ Informal enquiries to Prof. R.J. Clarke, Head of Department {email rjc@cee.hw.ac.uk}. If your questions are related to the above areas, contact Fairouz Kamareddine (fairouz@cee.hw.ac.uk). For application details please contact the Personnel Office, Heriot-Watt University, Edinburgh EH14 4AS, Tel. 0131 451 3475 (24 hrs), quoting Reference No (Ref. 19/00) for Reader/Senior Lecturer and Reference No (Ref. 20/00) for the Lecturer. Salary for the lectureship is on the scale: 17,238-30,065 UK pounds Salary for the reader/senior lectureship is between: 31,563-35,670 UK pounds Closing date: 3 March 2000. Fairouz Kamareddine From concurrency.cwi.nl Fri Feb 11 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: PhD positions available. Edinburgh, Scotland From: Fairouz Kamareddine PhD positions in Logics, Types, Rewriting The ULTRA group Heriot-Watt University, Edinburgh, Scotland We have many PhD openings within the ULTRA group. See http://www.cee.hw.ac.uk/ultra/index.html The ULTRA group works on the applications of logics, type theories, and rewriting theory to the design and implementation of programming languages, the formalization of mathematics, and theorem proving. The ULTRA group is located in the Department of Computing and Electrical Engineering at Heriot-Watt University, Edinburgh, Scotland. The department of Computing and Electrical at Heriot-Watt is a very lively, active and friendly place with a supportive spirit. The department is committed to excellence and is investing a lot in the future. Heriot-Watt is located in beautiful parklands on the outskirsts of Edinburgh, the capital of Scotland and a beautiful and historic city. We are looking for active, energetic and committed people. If you are interested, send your c.v. to Professor Fairouz Kamareddine of Dr Joe Wells by e-mail (fairouz@cee.hw.ac.uk or jbw@cee.hw.ac.uk) or post (Heriot-Watt University, Department of Computing and Electrical Engineering, Riccarton, Edinburgh EH14 4AS, Scotland) and arrange for three letters of recommendation. From concurrency.cwi.nl Fri Feb 11 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: Vacancy at Manchester University From: Renate Schmidt Research Associate in Formal Methods and Automated Reasoning (Ref 136/00) "Proof Methods for Multi-Agent Systems" Project http://www.cs.man.ac.uk/~schmidt/agents/ Department of Computer Science The University of Manchester Applications are invited for a research associate to work on the EPSRC funded project "Proof Methods for Multi-Agent Systems". This is a three year collaborative research project between the Formal Methods Group within the Department of Computer Science at the University of Manchester and the Centre for Agent Research and Development at the Manchester Metropolitan University. The project is to commence in the first half of 2000. The successful applicant will be required to undertake research into proof systems for logical formalisations of agent theories, in particular, to develop and apply automated reasoning techniques for expressive combinations of modal logics and first-order logic. Experience with logic and proof theory is essential for this post. The appointment will be on a 3 year fixed term contract with an initial salary of 18,185 to 19,869 pounds per annum. Informal enquiries may be made to Dr. Renate Schmidt, Tel: +44 (0)161 275 6163, Email: schmidt@cs.man.ac.uk. More information about this position, the project and the Formal Methods Group can be found at http://www.cs.man.ac.uk/~schmidt/agents/ http://www.cs.man.ac.uk/fmethods/ Applications forms and further particulars can be obtained from the Office of the Director of Personnel, The University of Manchester, Oxford Road, Manchester M13 9PL. Tel: +44 (0)161 275 2028; Fax: +44 (0)161 275 2471; Email: personnel@man.ac.uk, web site: http://www.man.ac.uk. Please quote reference number: 136/00. Closing date for receipt of applications is 10 March. As an equal opportunities employer the university welcomes applications from suitably qualified people from all sections of the community regardless of race, religion, gender or disability. From concurrency.cwi.nl Fri Feb 11 00:00:00 2000 From: George Angelos Papadopoulos Subject: Job Announcement -- C.S. Dept. -- Univ. of Cyprus To: concurrency@cwi.nl (moderated) DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF CYPRUS VISITING PROFESSORSHIPS The Department of Computer Science at the University of Cyprus has a number of vacancies for visiting professors at the ranks of Assistant, Associate, and Full Professor. ALL fields of study will be considered, but preference will be given to applicants associated with one or more of the following ones: * Computer Architecture * Parallel and Distributed Processing * Programming Languages * Multimedia Information Systems * Data Communication Networks * Artificial Intelligence * Software Engineering * Database Systems A new M.Sc. course on "Advanced Information Technologies" will commence next September and the successful applicants will therefore have the opportunity to teach at both the undergraduate and graduate levels. A visiting appointment is usually for one semester (Spring semester: Jan-June; Winter semester: Sept-Dec), but it can be renewed for up to four semesters. Applicants should hold a Ph.D. in a relevant subject, have post Ph.D. experience, and BE FLUENT IN GREEK (both these requirements are mandatory). The annual salaries for these positions (including the 13th salary) are: Professor (Scale A15-A16) CYP 25.479 - 33.120 Associate Professor (Scale A14-A15) CYP 22.473 - 30.636 Assistant Professor (Scale A13-A14) CYP 20.966 - 28.288 Lecturer (Scale A12-A13) CYP 17.706 - 25.933 (At present CYP 1 = 1.1 sterling and CYP 1 = 1.80 U.S. dollars). Presently, the Department is seeking applications for the winter and spring semesters of the academic year 2000-2001. The processing of applications will start on the 1st May 2000 and will continue until all the available positions have been filled. Anyone wishing to apply should send a full CV to the following address: The Chairperson Department of Computer Science University of Cyprus 75 Kallipoleos Street P.O. Box 20537, CY-1678 Nicosia, CYPRUS For more details and other information, interested individuals may contact the Chairperson of the Department of Computer Science: Associate Professor Antonis Kakas Tel: +357-2-892238, Fax: +357-2-339062, E-mail: antonis@ucy.ac.cy From concurrency.cwi.nl Sat Feb 19 00:00:00 2000 From: Concur2000 To: concurrency@cwi.nl (moderated) Subject: CONCUR 2000: Second Call for Papers CONCUR 2000 11th International Conference on Concurrency Theory State College, Pennsylvania, August 22-25, 2000 URL: http://www.cse.psu.edu/concur2000/ E-mail: concur2000@cse.psu.edu Submission deadline: 3 March 2000 SUBMISSIONS Submissions will be evaluated by the Program Committee for inclusion in the proceedings, which will be published by Springer-Verlag. Papers must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. Papers (of at most 15 pages, accompanied by a one-page abstract) should be submitted electronically via the web submission form at on the Conference's web site. Alternatively, submission can be made by emailing a uuencoded PostScript files to concur2000@cse.psu.edu or by post by sending five copies of the paper to the mailing addresses below. All submissions need to be accompanied by the email address, telephone number, and fax number (if available) of the author to whom correspondence should be sent. IMPORTANT DATES Deadline for submission: 3 March 2000 Notification of acceptance: 1 May 2000 Final version due: 29 May 2000 PROGRAM COMMITTEE Samson Abramsky (Edinburgh University, UK) Jos C. M. Baeten (University of Eindhoven, NL) Eike Best (Oldenburg University, Germany) Michele Boreale (University of Florence, Italy) Steve Brookes (Carnegie Mellon University, USA) Luca Cardelli (Microsoft, UK) Ilaria Castellani (INRIA, France) Philippe Darondeau (INRIA, France) Thomas Henzinger (UC Berkeley, USA) Radha Jagadeesan (Loyola University, USA) Marta Kwiatkowska (University of Birmingham, UK) Dale Miller (Co-chair, Penn State University, USA) Robin Milner (Cambridge University, UK) Uwe Nestmann (BRICS, Denmark) Catuscia Palamidessi (Co-chair, Penn State University, USA) Prakash Panangaden (McGill University, Canada) John Reppy (Bell Labs, USA) Vladimiro Sassone (University of Catania, Italy) Moshe Y. Vardi (Rice University, USA) Wang Yi (Uppsala University, Sweden) ORGANIZERS Dale Miller and Catuscia Palamidessi (Co-chairs, Penn State University, USA) SCOPE The purpose of the CONCUR conferences is to bring together researchers, developers and students in order to advance the theory of concurrency, and promote its applications. Interest in this topic is continuously growing, as a consequence of the importance and ubiquity of concurrent systems and their applications, and of the scientific relevance of their foundations. Submissions are solicited in all areas of semantics, logics and verification techniques for concurrent systems. Topics include (but are not limited to) concurrency related aspects of: models of computation and semantic domains, process algebras, Petri nets, event structures, real-time systems, hybrid systems, decidability, model-checking, verification techniques, refinement techniques, term and graph rewriting, distributed programming, logic constraint programming, object-oriented programming, typing systems and algorithms, case studies, tools and environments for programming and verification. ADDRESSES Dale Miller and Catuscia Palamidessi Computer Science and Engineering Department 220 Pond Lab, Penn State University University Park, PA 16802 Phone: +1-814-865-9505, FAX: +1-814-865-3176 URL http://www.cse.psu.edu/concur2000/ E-mail concur2000@cse.psu.edu From concurrency.cwi.nl Fri Feb 18 00:00:00 2000 From: Marta Z Kwiatkowska To: concurrency@cwi.nl (moderated) Subject: Research scholarships available at Birmingham ========================================================================= The University of Birmingham School of Computer Science Research scholarships in Computer Science and Artificial Intelligence ========================================================================= The School of Computer Science has research strengths in the areas of Theoretical Computer Science, Artificial Intelligence and Cognitive Science, and Software Engineering. The Theory of Computation group concentrates on the development of logics and semantics for programming languages. The overall aim is to provide intuitive conceptual tools for the everyday practice of programming. Within this framework, the activities range from abstract mathematics to issues of implementation and software development. For an overview of past research activities of the group, including funded research projects and publications, see the URL: http://www.cs.bham.ac.uk/research/research.html Current academic and research members of the Theory group are: Dr Christoph Benzmueller Mr Carsten Fuhrman Dr Mateja Jamnik Professor Achim Jung Dr Manfred Kerber Dr Marta Kwiatkowska Dr Gethin Norman Professor Uday Reddy Dr Eike Ritter Dr Mark Ryan Dr Andrea Schalk Dr Hayo Thielecke (from September 2000). There are also 11 PhD students associated with the group, of the total of 40 in the School. Possible topics for research include, but are not restricted to: Software verification and model checking Verification of probabilistic systems (theory and implementation) Verification of probabilistic real-time systems Probabilistic and stochastic calculi Semantics for concurrency Temporal and modal logics Domain theory Extensions to the relational database model (theory and implementation) Parametricity and foundations of data abstraction Type systems for imperative and OO programming Semantics and formal methods for OO programming Continuations and control Categorical models of programming languages Linear logic, type theory and corresponding categorical semantics Linear abstract machines Category theory and games models Agent based mathematical reasoning Machine-assisted reasoning Diagrammatic reasoning Theorem proving and proof planning Applicants must have or be about to gain at least an upper second class honours degree or an overseas equivalent in Computer Science or a related degree title. Successful applicants will be offerred an opportunity to join The Midlands Graduate School in the Foundations of Computing Science, a recent initiative between the Universities of Birmingham, Leicester, Nottingham and Warwick aiming to provide broader educational experience for doctoral students. For more information see URL: http://www.cs.nott.ac.uk/MGS/ The School has a number of EPSRC Studentships, School Studentships and Teaching Assistantships available to UK and European Union applicants. School Studentships and Teaching Assistantships cover tuition fees and maintenance for UK and European Union students. EPSRC studentships do not pay maintenance costs for non-UK students. Further details of these studentships and also of studentships for international students are given in: http://www.cs.bham.ac.uk/~pjh/prospectus/funding/research.html The School's research student prospectus and application form are available from: http://www.cs.bham.ac.uk/studentinfo/form_mailer.html Informal enquiries can be directed to any member of the group (see URL http://www.cs.bham.ac.uk/system/auto-gen/staff.html http://www.cs.bham.ac.uk for contact information), or *in the first instance* to Marta Kwiatkowska Email M.Z.Kwiatkowska@cs.bham.ac.uk Tel +44 121 414 7264 FAX +44 121 414 4281 ========================================================================= From concurrency.cwi.nl Fri Feb 18 00:00:00 2000 From: Bjorn Victor To: concurrency@cwi.nl (moderated) Subject: CFP: EXPRESS'00 workshop ANNOUNCEMENT and CALL FOR PAPERS EXPRESS'00: 7th International Workshop on Expressiveness in Concurrency Pennsylvania State University, USA, August 21, 2000 Held in conjunction with the conference CONCUR 2000 http://www.docs.uu.se/~victor/Express/ SCOPE: The EXPRESS workshops aim at bringing together researchers interested in the relations between various formal systems, particularly in the field of Concurrency. More specifically, they focus on the comparison between programming concepts (such as concurrent, functional, imperative, logic and object-oriented programming) and between mathematical models of computation (such as process algebras, Petri nets, event structures, modal logics, rewrite systems etc.) on the basis of their relative expressive power. EXPRESS'00 is organized as a satellite workshop of CONCUR 2000, the 11th International Conference on Concurrency Theory, which will take place at Pennsylvania State University, USA, on August 22-25, 2000. INVITED SPEAKER: Neil Jones (DIKU, Copenhagen, DK) CO-CHAIRS: Luca Aceto (BRICS, Aalborg University, DK) Bjorn Victor (Uppsala University, SE) PROGRAMME COMMITTEE: Luca Aceto (BRICS, DK) Karen Bernstein (DePaul University, US) Rance Cleaveland (SUNY at Stony Brook, US) Wan Fokkink (CWI, NL) Rob van Glabbeek (Stanford University, US) Ursula Goltz (TU Braunschweig, DE) Rosario Pugliese (University of Firenze, IT) Julian Rathke (University of Sussex, UK) Davide Sangiorgi (INRIA Sophia-Antipolis, FR) Igor Walukiewicz (Warsaw University, PL) Bjorn Victor (Uppsala University, SE) For more details see the URL http://www.docs.uu.se/~victor/Express/. From concurrency.cwi.nl Thu Feb 17 00:00:00 2000 From: "A. Rennoch" To: concurrency@cwi.nl (moderated) Subject: ETAPS >> FMICS programme Dear colleagues, the ETAPS conference in March will be followed directly by the 5th FMICS workshop which also takes place in Berlin. The International Workshop on Formal Methods for Industrial Critical Systems (FMICS), is organized by the European Research Consortium for Informatics and Mathematics (ERCIM) on April 3 - 4, 2000. We are pleased to announce the preliminary programme of FMICS. You will find it via the workshop homepage http://www.fokus.gmd.de/tip/fmics/ The workshop will offer discussion rounds on the applicability and usage of formal methods in the industrial context. If you are interested in attending the workshop please do not forget to register in advance. Thank you very much Best regards Ina Schieferdecker and Axel Rennoch From concurrency.cwi.nl Thu Feb 17 00:00:00 2000 From: Sanjiva Prasad To: concurrency@cwi.nl (moderated) Subject: FST TCS 2000 --- cfpo ascii version -- *********************************************************************** * * * FST TCS 2000 * * * * Foundations of Software Technology and Theoretical Computer Science * * December 13--15, 2000 * * New Delhi, India * * * *********************************************************************** * Call for Papers * *********************************************************************** IARCS, the Indian Association for Research in Computing Science, announces the 20th Annual FST TCS Conference in New Delhi. Tentatively planned satellite events include include two workshops: on Computational Geometry and on Advances in Programming Languages. Authors are invited to submit papers presenting original and unpublished research on **any** theoretical aspects of Computer Science. Papers in applied areas with a strong foundational emphasis are also welcome. The proceedings of the last six years' conferences (Springer-Verlag Lecture Notes in Computer Science volumes 880, 1026, 1180, 1346, 1530, 1738) give an idea of the kind of papers typically presented at FST TCS. Typical areas include (but are not restricted to): Automata, Languages and Computability Randomized and Approximation Algorithms Computational Geometry Computational Biology Combinatorial Optimization Graph and Network Algorithms Complexity Theory Parallel and Distributed Computing New Models of Computation Concurrent, Real-time and Hybrid Systems Logics of Programs and Modal Logics Database Theory and Information Retrieval Automated Reasoning, Rewrite Systems, and Applications Logic, Proof Theory, Model Theory and Applications Semantics of Programming Languages Static Analysis and Type Systems Theory of Functional and Constraint-based Programming Software Specification and Verification Cryptography and Security Protocols For an accepted paper to be included in the proceedings, one of the authors must commit to presenting the paper at the conference. Important Dates --------------- Deadline for Submission 31 May, 2000 Notification to Authors 15 August, 2000 Final Version of Accepted Papers due 15 September, 2000 Deadline for Early Registration 15 November, 2000 Submission Guidelines - --------------------- Authors may submit drafts of full papers or extended abstracts. Submissions are limited to 12 A4-size pages, with 1.5 inch top margin and other margins 1 inch wide with 11 point or larger font. Authors who feel that more details are necessary may include a clearly marked appendix which will be read at the discretion of the Programme Committee. Each paper should contain a short abstract. If available, e-mail addresses and fax numbers of the authors should be included. Electronic Submissions - ---------------------- Electronic submission is strongly encouraged. Self-contained uuencoded gzipped Postscript versions of the paper may be sent by e-mail to fsttcs20@cse.iitd.ernet.in In addition, the following information in ASCII format should be sent to this address in a **separate** e-mail: Title; authors; communicating author's name, address, and e-mail address and fax number if available; abstract of paper. Hard-Copy Submissions - --------------------- If electronic submission is not possible, authors may submit five (5) hard-copies of the paper by post to the following address: FST TCS 2000 Department of Computer Science and Engineering I.I.T., Delhi Hauz Khas New Delhi 110 016 INDIA Invited Speakers ---------------- Invited Speakers who have confirmed participation include: Peter Buneman (U Penn) Bernard Chazelle (Princeton) E. Allen Emerson (U Texas, Austin) Philip Wadler (Bell Labs) Programme Committee ------------------- Pankaj Agarwal (Duke) Manindra Aggarwal (IIT, Kanpur) Tetsuo Asano (JAIST) Vijay Chandru (IISc, Bangalore) Rance Cleaveland (Stony Brook) Anuj Dawar (Cambridge) Madhavan Mukund (CMI, Chennai) Sampath Kannan (AT&T Research) Sanjiv Kapoor (IIT, Delhi) (Co-chair) Kamal Lodaya (IMSc, Chennai) Gopalan Nadathur (U Chicago) Seffi Naor (Bell Labs and Technion) Tobias Nipkow (TU Munich) Luke Ong (Oxford) C. Pandurangan (IIT, Madras) Paritosh Pandya (TIFR) Benjamin Pierce (U Penn) Sanjiva Prasad (IIT, Delhi) (Co-chair) Sridhar Rajgopal (IBM, Almaden) A. Ranade (IIT, Bombay) Dave Sands (Chalmers) A Prasad Sistla (U Illinois, Chicago) Michiel Smid (Magdeburg) Mandayam K. Srivas (SRI) Organized by ------------ Indian Institute of Technology, Delhi Hauz Khas, New Delhi 100 016. Organzing Committee ------------------- Sandeep Sen (chair) Naveen Garg (treasurer) S N Maheshwari Conference Site --------------- The Conference will take place at the India International Centre, 40 Lodhi Estate, Max Mueller Marg, New Delhi 110 003. Correspondence Address ---------------------- All correspondence regarding submissions may be addressed to FST TCS 2000 Department of Computer Science and Engineering I.I.T., Delhi Hauz Khas, New Delhi 110 016, INDIA Email: fsttcs20@cse.iitd.ernet.in Fax: +91 11 686 8765 Phone: +91 11 659 1294 / 659 1286 URL: http://www.cse.iitd.ernet.in/~fsttcs20 -- Sanjiva Prasad Associate Professor Department of Computer Science and Engineering sanjiva@cse.iitd.ernet.in Indian Institute of Technology, Delhi (Off) +91 11 659 1294 Hauz Khas, New Delhi 110016 (Res) +91 11 659 1684 INDIA (Fax) +91 11 686 8765 http://www.cse.iitd.ernet.in/~sanjiva From concurrency.cwi.nl Wed Feb 16 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: Assistant professorship and PhD position(s) From: Joost-Pieter Katoen The Faculty of Computer Science at the University of Twente in the Netherlands offers the academic courses Computer Science, Business Information Technology, and Telematics. Besides, the faculty supports the education of computer science for other studies. The research of the faculty, with telematics and information technology as core issues, has been concentrated in the multi-disciplinary research institute CTIT (Centre for Telematics and Computer Science). The faculty currently has about 180 employees and 750 students. +-----------------------------------------------------------------+ | The Formal Methods and Tools group is seeking applications for: | | | | An Assistant Professor and PhD student(s) | +-----------------------------------------------------------------+ The Formal Methods and Tools (FMT) group has currently about 15 employees and is responsible for education and research in the area of development and application of techniques with a sound mathematical basis that are suited for the specification, design and analysis of complex distributed systems. The support of software-tools is considered to be of crucial importance for this aim. The FMT group is a project leader of national research projects on conformance testing (Cote-de-Resyste, funded by STW), and performance analysis (Hard and Softly Timed Systems, funded by STW) and participates in the Systems Validation Center (funded by the Telematics Institute). Besides, there is an intensive co-operation with universities and industry, both at a national and an international level. Assistant Professorship ----------------------- Task description: You will make an active research contribution to the development of software-tools for formal methods. In particular, you will carry out research for the support of the specification, testing and verification of complex information processing systems and carry out and coordinate the lecturing in the area of tool architectures and compiler construction. You are willing to contribute to other lecturing duties within the faculty. In addition, you will actively contribute to the acquisition of external research funding and participate in the management and organizational duties within the group. Profile of the candidate: The candidate has a PhD in Computer Science or comparable qualifications and has research experience in the field of (the development of) software-tools as, amongst others, laid down in publications at international conferences and/or in journals. Experience with formal methods and (industrial) applications of formal methods is preferred. Besides, you are an experienced lecturer with good teaching skills. You enjoy working in a team and have good communication skills. Appointment and salary: It is the Faculty's policy to offer a temporary position for a period of five years. The position is full time and the monthly salary is in accordance with the collective labour agreement of Dutch universities and is maximally DFL 8,682 (salary scale 12) gross. The salary is based on knowledge and experience. (See for application and contact information the end of this mail.) PhD student(s) -------------- Task description: In an inspiring environment you carry out research in one of the following areas: process algebras, formal methods and object- oriented design, combining formal methods and performance analysis, validation and verification techniques (in particular model checking, and automated test derivation and selection), or large scale application of formal methods. Besides you will contribute to the education duties of the FMT group and will be enrolled in the programme of the national Dutch graduate school IPA (Institute for Programming Research and Algorithmics). Profile of the candidate: You have an MSc in Computer Science or in a related area and are interested in carrying out scientific research in the area of formal methods and tools. In addition, you are creative, have good communication skills and are self-employed. Appointment and salary: You will be offered a 4-year position as a PhD student. This position is full time and the monthly salary is in accordance with the collective labour agreement of Dutch universities and is DFL 2.374 gross (for the first year) and grows up to DFL 4.037 (for the fourth year). The University of Twente offers an extra annual compensation to your salary of DFL 8.400, DFL 6.000 and DFL 3.600 (gross) for the first, second and third year, respectively. In addition, you will be offered a substantial financial support (about DFL 35.000) for conference visits, a laptop, support for publication of your dissertation, courses, etc. Information and application --------------------------- You can obtain further information about these positions from Prof. dr. Ed Brinksma (brinksma@cs.utwente.nl), tel. +31 53 4893676, or Dr.ir. Joost-Pieter Katoen (katoen@cs.utwente.nl), tel. +31 53 4895675. More information about the FMT group can be found at URL http://fmt.cs.utwente.nl. Please send a written application together with a curriculum vitae and a list of scientific publications before 11 March 2000. Address your letter to W.H. Fij, Managing Director Faculty of Computer Science, University Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands. Please include the job vacancy code: 2731/00/029 (for the Assistant Professorship) or 2713/00/030 (for the PhD student) From concurrency.cwi.nl Mon Feb 14 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: PROSPER Project Announcement From: Richard Boulton This message is to announce preliminary results of the PROSPER project (funded by the European Union under ESPRIT). PROSPER is a collaboration involving the University of Glasgow (UK), the University of Cambridge (UK), the University of Edinburgh (UK), the Universities of Karlsruhe and Tuebingen (Germany), IFAD (Denmark), and Prover Technology (Sweden). The University of Glasgow acts as the project coordinator. The project is developing an extensible, open proof tool architecture for incorporating formal verification into industrial CAD/CASE tool flows and design methodologies. The tools include novel user-friendly interfaces, and will be tested on two major example systems. Detailed information about the project is available from the project web site at http://www.dcs.gla.ac.uk/prosper/ If you would like to receive further announcements about PROSPER, please subscribe to the prosper-info mailing list as described at http://www.dcs.gla.ac.uk/prosper/mail.html The main result of the project so far is a prototype toolkit for integrating verification components and application tools. The PROSPER Toolkit is based on HOL98, a modern descendent of the HOL theorem prover. HOL98 is highly modular, reflecting the project's approach to proof engine construction from components - whether HOL libraries or external plug-in components. It also has powerful and sophisticated automatic proof procedures. The system's command language is ML, a functional programming language extended with theorem proving functions and an implementation of higher order logic. This gives developers a full programming language to write custom verification algorithms and coordinate the invocation of plugins. Procedures programmed in a proof engine are offered to client applications in an API. The Toolkit includes the PROSPER Integration Interface, a set of libraries that implement a language-independent specification for communication between reasoning components. Implementations include libraries for Java, C, and ML. The Toolkit also provides support to enable developers of other verification tools to offer them as PROSPER plugin components. Plugins under development include a range of model-checkers and decision procedures, some being developed by third-party researchers. PROSPER TOOLKIT VERSION 1.1 The first public release of the Toolkit is version 1.1. The system has been successfully built on recent versions of the Linux and Solaris operating systems. Version 1.1 is a beta release and does not support some functionality that will be included in future releases. Most notably a more robust communication mechanism is in development and will be included in the next release. The Toolkit can be downloaded from the public web site. From concurrency.cwi.nl Tue Feb 22 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: research position (re-advertisement) From: Lawrence C Paulson Research Associate - Compositional Proofs of Concurrent Programs The project concerns proving properties of concurrent systems from the properties of their components. Proofs will be conducted by machine, using the proof tool Isabelle and the UNITY formalism. Many authors have proposed extensions to UNITY for compositional reasoning; a project goal is to test their proposals by conducting substantial machine proofs. Applicants should have a PhD in Computer Science or Mathematics and relevant experience. Particularly valuable would be expertise with a mechanical proof tool such as Isabelle, HOL or PVS, or (as an alternative) familiarity with a UNITY-like model of concurrency. Details of the project can be found on the Internet at http://www.cl.cam.ac.uk/users/lcp/Grants/UNITY.html. The post is funded by the EPSRC and is available for up to 33 months, to start on 1 April 2000 or shortly thereafter. Initial salary will be in the range of 16,286 - 22,579 UK pounds per annum, depending on age and experience. Applications, with curriculum vitae and the names and addresses of two referees, should be to Dr L C Paulson, University of Cambridge Computer Laboratory, Pembroke Street, Cambridge, CB2 3QG to arrive no later than Monday 6th March 2000. -- Lawrence C Paulson Reader in Computational Logic Computer Laboratory, University of Cambridge Pembroke Street, Cambridge CB2 3QG, England Tel: +44(0)1223 334623 Fax: +44(0)1223 334678 From concurrency.cwi.nl Tue Feb 22 00:00:00 2000 Subject: IFIP Workshop: Specification of CBS To: concurrency@cwi.nl (moderated) From: "C Rattray" IEEE TC-ECBS + TF RE and IFIP WG10.1 Joint Workshop on Formal Specification of Computer-Based Systems Edinburgh, Scotland, April 6-7,2000 (following the IEEE ECBS'2000 Conference http://www.dcs.napier.ac.uk/ecbs) Topic The goal of this workshop is to provide a forum for researchers and practitioners from industry and academia to discuss both completed work and work-in-progress related to formal specifications of computer-based systems. We encourage, in particular, studies focusing on integrating formal techniques into system design and implementation and on various applications or case-studies. Submissions Please submit extended abstracts in MS Rich Text Format or in Plain ASCII by e-mail to <> by February 29, 2000. Authors of accepted abstracts, which will be published either in the Preprints Proceedings available at the Workshop or through the IEEE ECBS'2000 Conference WWW page <>, will have the opportunity to present a 20-minute talk on their work. The final papers, based on presented extended abstracts and selected from the refereed full-length versions submitted within two month after the Workshop, will be published in the Journal of Universal Computer Science (electronic journal, <>). Deadlines February 29, 2000 Extended Abstract Submissions April 6-7, 2000 Extended Abstracts Presentation June 9, 2000 Full Papers Submission Workshop Co-Chairs Miroslav Sveda (IEEE Computer Society), E-mail:<> Dept. of Computer Science and Engineering, Technical University of Brno, Czech Republic. Charles Rattray (IFIP TC 10), Email: <> Dept. of Computing Science and Mathematics, University of Stirling, UK. From concurrency.cwi.nl Tue Feb 22 00:00:00 2000 From: hermanns@cs.utwente.nl (Holger Hermanns) Subject: CfReg FMPA 2000: Euro-Summerschool on Formal Methods and Performance Analysis To: concurrency@cwi.nl (moderated) !!! The deadline for scholarship applications is March 1, 2000 !!! FMPA-2k--FMPA-2k--FMPA-2k--FMPA-2k--FMPA-2k--FMPA-2k--FMPA-2k--FMPA-2k--FMPA-2k FORMAL METHODS AND PERFORMANCE ANALYSIS The first Euro-Summerschool on Trends in Computer Science July 3-7 2000, Nijmegen, the Netherlands Supported by the European Commission, Research DG, Human Potential Programme, High-Level Scientific Conferences, HPCF-CT-1999-00186 organised by the Formal Methods and Tools Group, University of Twente http://fmt.cs.utwente.nl/conferences/fmpa2k/ FMPA-2k--FMPA-2k--FMPA-2k--FMPA-2k--FMPA-2k--FMPA-2k--FMPA-2k--FMPA-2k--FMPA-2k Aim and Scope of the Summerschool ================================= The design and analysis of various types of systems, like embedded systems or communication protocols, require insight in not only the functional, but also in the real-time and performance aspects of applications involved. Various traditional techniques for modelling and analysis of these quantitative aspects are known and widely used in practice. Some prominent modelling techniques for which efficient analytic techniques exist, are Markov chains, Queueing Networks, and Stochastic Petri Nets. Traditionally, there has always been a clear separation between the functional and performance aspects of systems, and as a result different communities have constructed and analysed their own, largely unrelated models for the aspects under their responsibility. In modern systems, though, the difference between functional and performance features is getting blurred, and both features are becoming of comparable interest. Thus, it would be beneficial to be able to check how changes in functionality affect performance issues, and vice versa. In addition, one would like to have a better control over the relation between the models that are used for qualitative and quantitative analysis, and avoid the use of different models for different aspects that are mutually incompatible. A single framework where both aspects could be defined, would therefore be advantageous for several reasons. Research in formal methods has recognised the need for the additional support of quantitative aspects like probability and real-time, and various initiatives have been taken to accomplish this. On the one side, extensions of existing specification techniques like process algebras allow for the automatic generation of performance models, and support the hierarchical modelling of complex systems. On the other hand, quantitative extensions of efficient analytic techniques like model checking, allow for the automated derivation of performance and reliability measures. The main goal of the summer school is to report on the-state-of-the-art of the research and tool development aiming at the integrated modelling and analysis of qualitative and quantitative aspects of reactive systems, such as stochastic Petri nets, stochastic process algebras, discrete event systems etc. The school is intended in the first place for PhD students, but we do anticipate attendance by interested researchers from academia and industry. To provide the necessary background also lectures in basic models and methods from both the field of performance evaluation and that of formal methods will be included. Preliminary Program =================== 1. Motivation ------------- Formal methods for performance analysis (1.5 hs) Ulrich HERZOG, University of Erlangen-Nuremberg, Germany 2. Background Performance Evaluation ------------------------------------ Markov chain models and analysis (3 hs) Boudewijn HAVERKORT, RWTH Aachen, Germany Discrete event simulation (1.5 hs) Christos CASSANDRAS, University of Massachusetts at Amherst, USA Non-Markovian analysis (1.5hs) Reinhard GERMAN, Technical University of Berlin, Germany 3. Background Formal Methods ---------------------------- Process algebra (3 hs) Ed BRINKSMA, University of Twente, Netherlands Petri nets and stochastic Petri nets (1.5 hs) Gianfranco BALBO, University of Torino, Italy Model checking (3hs) Pierre WOLPER, University of Liege, Belgium 4. Formal Methods & Performance Analysis ---------------------------------------- Stochastic activity networks and their analysis (3 hs) Bill SANDERS, University of Illinois at Urbana-Champaign, USA Markovian process algebra (1.5 hs) Holger HERMANNS, University of Twente, Netherlands Non-Markovian process algebra (1.5 hs) Joost-Pieter KATOEN, University of Twente, Netherlands Compositional and decompositional analysis (1.5 hs) Jane HILLSTON, University of Edinburgh, UK Structured and distributed analysis (1.5 hs) Gianfranco CIARDO, University of William and Mary, USA Model checking probabilistic and Markovian models (1.5 hs) Christel BAIER, University of Bonn, Germany Verification of probabilistic distributed algorithms (1.5 hs) Roberto SEGALA, University of Bologna, Italy Registration ============ The cost for living expenses will be 397 Euro (covering breakfast, lunch, dinner, refreshments, and social event) and accommodation from July 3 until July 7. This arrangement is based on a single room. In case you want to share a double room the costs are 307 Euro. There is also the possibility to book a room for Sunday 2th July (all prices in Euro): single double --------------------------- budgetroom 48 not available standard room 64 78 luxurous room 91 105 The participation fee for the summerschool is 185 Euro. These costs include working material (handouts) and a copy of the final course notes that will be published as a volume in the series of Lecture Notes in Computer Science, Springer, after the summerschool. (Note: 1 Euro is about 1 US dollar). The deadline for registration is April 1, 2000 (firm). The summerschool can host up to 80 participants. In case the number of registrations is higher than 80 a first come first serve policy will be applied. Registration forms can be found on the web-page mentioned and send in electronically. Scholarships ============ A number of scholarships is available for participants. These grants are funded by the European Union's IHP program. According to EU regulations, young resear- chers (aged 35 years or under) on postgraduate or postdoctorate level who are nationals of EU member states or associated states (and work there) can apply for a grant. The size of the grants will depend on the number of qualified applicants, and the travel distance. In case you meet the aforementioned qualifications and want to apply for a scholarship please send a letter that includes your motivation to attend the summerschool, together with a letter of recommendation by the home department or institution, and a brief cv to: Ms. J. Lammerink EEF Summerschool FMPA 2000 University of Twente Faculty of Computer Science P.O. Box 217 7500 AE Enschede The Netherlands The deadline for application is March 1, 2000 (firm). All applicants will be notified about their application as soon as possible afterwards (on March 15, 2000 at the latest). Venue ===== The summerschool will be held in the Golden Tulip Val-Monte, Berg en Dal, The Netherlands situated at a beautiful place close to the city of Nijmegen. Nijmegen is situated in the eastern part of the Netherlands and can be reached by train from Amsterdam Airport within 90 minutes. Important dates =============== Deadline for scholarships: March 1 Deadline for registration: April 1 Dates of summerschool: July 3-7 Further information =================== Further, updated information can be obtained via the summerschool web-page at http://fmt.cs.utwente.nl/conferences/fmpa2k/ or by sending email to fmpa2k@cs.utwente.nl. Organisation committee ====================== Ed Brinksma Holger Hermanns Joost-Pieter Katoen Joke Lammerink From concurrency.cwi.nl Tue Feb 22 00:00:00 2000 From: Franck Cassez To: concurrency@cwi.nl (moderated) Subject: First announcement - Summer School MOVEP'2k Please find enclosed the annoucement for the summer school MOVEP'2k. We apologize if you received multiple copies of this mail. Please forward this information to your colleagues and other interested people as well. Thank you. ______________________________________________________________________ MOVEP'2k 4th International Summer School on MOdelling and VErification of Parallel Processes June 19-23, 2000 Nantes, France School URL: http://www.ircyn.ec-nantes.fr/movep School Organizers: Franck Cassez (IRCyN/CNRS, Nantes, F), Claude Jard (IRISA/CNRS, Rennes, F) Brigitte Rozoy (LRI, Orsay, F) Mark Ryan (Univ. Birmingham, UK) SCOPE OF THE SCHOOL __________________________________________________ The purpose of the MOVEP'2k summer school is to bring together researchers, students and people from industry working in the area of verification of concurrent systems. The topics of the school encompass various subjects such as Petri nets, model-checking, timed systems, mobile processes etc. Six tutorials and seven short talks will be given by recognized scientists and there will be special sessions devoted to PhD students' talks. Three other sessions focussed on European projects relevant to the themes of MOVEP will take place as well. REGISTRATION ________________________________________________________ Some scholarships for PhD students will be available to cover part of travel and accomodation expenses. Registration to the School will commence in March 2000. From concurrency.cwi.nl Mon Feb 21 00:00:00 2000 To: concurrency@cwi.nl Subject: HOOTS 2000 Call for Papers From: ajeffrey@cs.depaul.edu (Allan Jeffrey) Dear all, This year, the Higher Order Operational Techniques in Semantics workshop will be in Montreal in September, as part of PLI 2000. Attached is the call for papers. Apologies for multiple transmissions. Alan. -- Alan Jeffrey http://fpl.cs.depaul.edu/ajeffrey/ CTI, DePaul University, 243 S. Wabash Ave, Chicago 60604, USA -- HOOTS 2000 Call For Papers for The Fourth International Workshop on Higher Order Operational Techniques in Semantics A satellite workshop of PLI 2000 Montreal, September 21-22 HOOTS 2000 home page: http://hoots.cs.depaul.edu/ HOOTS home page: http://www.cl.cam.ac.uk/users/amp12/hoots PLI 2000 home page: http://www.cs.yorku.ca/pli-00/ SCOPE The fourth workshop on Higher Order Operational Techniques in Semantics (HOOTS 2000) will address fundamental principles and important innovations in the definition, analysis, and application of operational semantics for higher order languages and calculi. Techniques addressed in the HOOTS series include operational equivalences, type systems, program logics and relationships with other forms of semantics. Application areas include the specification and implementation of programming languages, security, and mobility. Languages discussed include both high-level and low-level languages, and a variety of calculi, including calculi of functions, objects, and processes. Deadline for submission: June 22, 2000 Notification of acceptance: July 29, 2000 Final version due: August 26, 2000 HOOTS 2000, Montreal: September 21-22, 2000 PROGRAMME COMMITTEE Andrew Gordon, Microsoft Research; Robert Harper, Carnegie Mellon University; Alan Jeffrey, DePaul University (Chair); Andrew Pitts, Cambridge University; Julian Rathke, Sussex University; David Sands, Chalmers University; Davide Sangiorgi, INRIA Sophia Antipolis; Carolyn Talcott, Stanford University. PREVIOUS MEETINGS The first HOOTS workshop was organised by Andrew Gordon and Andrew Pitts on October 28-30, 1995 as one of the events within the 6-month research programme on Semantics of Computation at the Isaac Newton Institute for Mathematical Sciences, University of Cambridge, UK. A book based on presentations at the workshop appeared in the Publications of the Newton Institute series published by Cambridge University Press. The second HOOTS workshop was organised by Andrew Gordon, Andrew Pitts, and Carolyn Talcott on December 8-11, 1997 at the Center for the Study of Language and Information, Stanford University, USA. The third HOOTS workshop was organized by Andrew Gordon and Andrew Pitts on September 30 and October 1, 1999 in Paris, France, as part of the Principles, Logics, and Implementations of high-level programming languages conference. Elsevier published an electronic proceedings of the second workshop as Volume 10 of Electronic Notes in Theoretical Computer Science, and the proceedings of the third workshop as Volume 26. SUBMISSION & PUBLICATION PostScript submissions of up to 12 pages should be sent by email to Alan Jeffrey ajeffrey@cs.depaul.edu by June 22, 2000. Simultaneous submission to other conferences or journals is not allowed. Papers should be formatted for USLetter or A4 paper. Elsevier will publish the proceedings as a volume of Electronic Notes in Theoretical Computer Science. Hardcopies will be distributed at the workshop. From concurrency.cwi.nl Wed Feb 23 00:00:00 2000 From: Klaus Havelund Subject: 2nd Cfp. SPIN'2000 To: concurrency@cwi.nl (moderated) ===================================== *** Apologies for multiple copies *** ===================================== Second Call for Papers and Other Contributions SPIN'2000 The 7th International SPIN Workshop on Model Checking of Software Stanford University California, USA August 30-31, September 1 Year 2000 http://ase.arc.nasa.gov/spin2000 Objectives ========== The SPIN workshop is a forum for researchers interested in the broad subject of model checking technologies for analysis and verification of asynchronous concurrent/distributed systems. Within the last couple of years, a renewed interest in program verification has emerged, and this year's workshop has a special emphasis on this subject. Several attempts have recently been made to use SPIN for model checking various programming languages, amongst them C, and object oriented languages such as C++ and Java. Even a mainly graphical design language such as UML raises the issue of program verification since UML designs can contain code fragments, and can evolve into fully fledged programs. This new trend brings new challenges into focus, such as dealing with object oriented dynamic memory allocation and garbage collection, program libraries, and, last but not least, an increased state space to explore. These problems require new approaches, amongst them perhaps the most challenging being how to deal with really big state spaces. Techniques to deal with this include for example static analysis, abstraction, guided search, and intelligent testing techniques in between complete state space exploration such as model checking on the one hand, and partial search, such as simulation on the other. Submissions (theoretical as well as practical) addressing software verification are encouraged, but this is absolutely not a requirement. Contributions do not have to build on SPIN, and can describe similar or comparable technologies. Co-located with FMOODS ====================== The workshop takes place in the week before the FMOODS conference: IFIP TC6/WG6.1 Third International Conference on Formal Methods for Open Object-Based Distributed Systems, which occurs September 6-8 at the same place. See: http://www.ics.uci.edu/~fmds2000. Solicited Contributions ======================= Papers ------ Papers must describe original work that is not submitted or accepted for publication elsewhere. Topics of interest include, but are not limited to, the following: - Algorithms - Storage methods - Temporal logic - Extensions of model checking languages and tools - Analysis and verification of software - Abstraction - Static analysis - Guided model checking - Automated testing - Relationship between model checking and testing - Relationship between model checking and other formal methods - Environment generation - Modularity, hierarchy, object orientation and refinement - Methodologies for model checking designs versus programs - Significant or unusual practical applications of model checking - Corporate impact and benefits of model checking techniques - Analyses and comparative studies of model checking tools - Real-time Tutorials and short courses --------------------------- Proposals should consist of an abstract of at least one page, to be published. Longer papers are allowed. Tool Demonstrations ------------------- The workshop will allow presentations of tools as part of the sessions. Submissions of proposals should consist of a short paper up to 4 pages which will be published if accepted. As informal information for the purpose of evaluation it is in addition allowed that a more detailed description of the tool and its capabilities be sent. This will not be published, and can hence be rather informal; for example, an already existing manual. Invited Speakers ================ Peter Gluck (NASA's Jet Propulsion Laboratory, Pasadena, California, USA, http://www.jpl.nasa.gov) Software lead for the Deep-Space 1 space craft (http://nmp.jpl.nasa.gov/ds1) and experience in the Cassini mission (http://www.jpl.nasa.gov/cassini). Leslie Lamport (SRC - Compaq Systems Research Center, Palo Alto, California, USA, http://www.research.digital.com/SRC) Researcher in formal methods and their application to concurrent systems (http://www.research.digital.com/SRC/staff/lamport/bio.html). Important Dates =============== May 1, 2000 : Deadline for submission of contributions June 5, 2000 : Notification of acceptance June 26, 2000 : Camera-ready copy (postscript) for proceedings due Submissions and Publication =========================== Papers, no longer than 20 pages, can be submitted in PDF or PostScript format by sending email to: havelund@ptolemy.arc.nasa.gov It is intended to publish selected papers, edited tutorial materials and tool descriptions as proceedings in a volume of Springer-Verlag's Lecture Notes in Computer Science series. Therefore final camera-ready copies (and not necessarily first submissions) will be required in LNCS format, see http://www.springer.de/comp/lncs/authors.html. Workshop Organization ===================== Klaus Havelund (NASA Ames Research Center,RECOM) havelund@ptolemy.arc.nasa.gov Gerard Holzmann (Bell Labs) gerard@research.bell-labs.com John Penix (NASA Ames Research Center) jpenix@ptolemy.arc.nasa.gov Willem Visser (NASA Ames Research Center,RIACS) wvisser@ptolemy.arc.nasa.gov Program Committee ================= - Dennis Dams (Eindhoven University, Holland) - David Dill (Stanford University, USA) - Orna Grumberg (The Technion, Israel) - John Hatcliff (Kansas State University, USA) - Bengt Jonsson (Uppsala University, Sweden) - Kim Larsen (Aalborg University, Denmark) - Stefan Leue (University of Waterloo, Canada) - Doron Peled (Bell Labs/CMU, USA) - Natarajan Shankar (SRI, USA) - Moshe Y. Vardi (Rice University, USA) - Pierre Wolper (Universite de Liege, Belgium) Electronic Information ====================== Workshop email address : havelund@ptolemy.arc.nasa.gov Workshop homepage : http://ase.arc.nasa.gov/spin2000 NASA Ames homepage : http://ase.arc.nasa.gov SPIN homepage : http://netlib.bell-labs.com/netlib/spin/whatispin.html (includes information about previous workshops) From concurrency.cwi.nl Tue Feb 22 00:00:00 2000 From: "Andy Evans" To: concurrency@cwi.nl (moderated) Subject: <>2000: 2nd Call for Papers, Tutorials and Workshops ================================================================= 2nd Call for Conference Papers, Workshops and Tutorials <>2000 Third International Conference on the Unified Modeling Language "Advancing the Standard" October 2-6, 2000 Royal York Hotel York, UK http://www.cs.york.ac.uk/uml2000 The Unified Modeling Language (UML) has rapidly become the "lingua-franca" of the software design community, both in industry and academia. The <> series of conferences has grown to be the premier venue for exchange of innovative technical ideas and experiences relating to UML. The conference includes, among its active participants, the originators of UML and other key individuals involved in the definition and evolution of the standard. <>2000 takes place just as work on the next version of UML (2.0) begins and will have a strong bearing on the standard. It will provide a forum for lively and exciting debate on key issues of the moment. The conference will be held in York, one of the oldest and most beautiful cities in England. It is with great pleasure that the <>2000 organising committee invites authors to submit: Research Papers: describing innovative research on any aspect of modeling, including, but not limited to, notations, automated tools, foundations, processes, architectures and patterns. Given the timeliness of the conference, papers proposing simplifications, clarifications, extensions and modifications to UML are strongly encouraged. All papers should clearly demonstrate their relationship to UML. Experience Papers: detailing experience of significant industrial applications of UML and related modeling techniques, including, but not limited to, applications in real-time/embedded systems, information systems, software development, business modelling and knowledge representation. Proposals for Advanced Tutorials: all advanced topics relating to the conference are potential candidates for tutorials. The sole requirement for proposals is that topics be of interest to advanced practitioners and researchers. Proposals for Advanced Workshops: workshops addressing a particular sub-area of UML in depth, that aim to investigate the relationship of UML with other areas of computer science, or which focus on the application of UML are all appropriate candidates for workshops. Full guidelines for writing and submitting workshop and tutorial proposals are available at the conference website. Invited Speakers: Steve Cook (IBM) Cris Kobryn (EDS) Ivar Jacobson (Rational Software) Important dates: Deadline for Abstract *24 March 2000* Deadline for Submission *7 April 2000* Notification to Authors 9 June 2000 Final Version of Accepted Papers 24 July 2000 Main conference: 4-6 October, 2000. Tutorials and Workshops: 2-3 October, 2000 Paper Submissions: Submit your manuscript electronically in postscript or PDF using the Springer LNCS style (http://www.springer.de/comp/lncs/authors.html). Papers should be no more than 15 pages in length. Full details of the submission process, including more specific guidelines on the preparation of papers, will be available on the conference website shortly. Accepted papers will be published in the conference proceedings which will be published by Springer-Verlag in the LNCS series. Workshop and Tutorial Submissions: Proposals for advanced tutorials and workshops are requested. Indicate your intention to submit by the deadline for abstracts. Submit a 3-4 page summary of your proposal by the deadline for paper submissions. See website for details. York: The City of York is world famous for its historic buildings and tourist attractions, and is located at the heart of Yorkshire, one of the most scenic counties of England. York's many attractions include the famous York Minster, the York Races, many fascinating museums including the National Railway Museum (where the main conference dinner is to be held), real Yorkshire ales, traditional shops and good food. Access to local beauty spots, such as the Yorkshire Moors and the East Coast resorts of Scarborough and Robin Hoods Bay (among many others) is easy via local transport connections. There is a frequent, direct train service from Manchester Airport. Venue: The conference will be held at the historic Royal York Hotel, situated next to York Railway Station. The Royal York Hotel is a classic Victorian Railway Hotel, built in 1878 to accommodate the aristocracy of Northern England. The hotel is close to the centre of York and has views towards the world famous York Minster. For further details visit http://www.cs.york.ac.uk/uml2000 or contact: Stuart Kent E-mail : s.j.h.kent@ukc.ac.uk Computing Laboratory Tel : ++44 (0) 1227 827753 The University, Canterbury, Kent, UK Fax : ++44 (0) 1227 762811 Andy Evans E-mail : andye@cs.york.ac.uk Department of Computer Science Tel : +44 (0)1904 434751 University of York, York, UK Fax : +44 (0)1904 432767# Committee Members: General Chair: Bran Selic, Canada Conference Chair: Stuart Kent, UK Programme Chair: Andy Evans, UK Publicity Chairs: Jean-Michel Bruel, France and Robert France, US Tutorial Chair: Stephen J. Mellor, US Workshop Chair: Jaelson Castro, Brazil Local Organisation: Tony Clark, UK Steering Committee: Jean Bezivin, France Steve Cook, UK Robert France, US Pierre-Alain Muller, France Bernard Rumpe, Germany Programme Committee: Colin Atkinson (Germany), Jean Bezivin (France), Grady Booch (US), Alan Brown (US), Jean-Michel Bruel (France), David Bustard (UK), Jaelson Castro (Brazil), Derek Coleman (UK), Betty Cheng (US), Steve Cook (UK), Cris Kobryn (US), John Daniels (UK), Eduardo. B. Fernadez (US), Robert France (US), Martin Gogolla (Germany), Brian Henderson-Sellers (Aus), Heinrich Hussman (Germany), Pavel Hruby (Denmark), Peter Hrushchka, Jean-Marc Jezequel (France), Haim Kilov (US), Craig Larman (US), Peter Linnington (UK), Ian Maung (US), Niall Ross (UK), Stephen Mellor (US), Ana Moreira (Portugal), Pierre-Alain Muller (France), John Mylopoulos (US), Gunner Overgaard (Sweden), Niall Ross (UK), James Rumbaugh (US), Bernard Rumpe (US), Andy Schuerr (Germany), Keng Siau (US), Ed Seidewitz (US), Desmond D'Souza (US), Perdita Stevens (UK), Jos Warmer (Netherlands), Anthony Wasserman (US), Alan Cameron Wills (UK). IEEE-CS sponsorship and ACM-SIGSOFT cooperation pending. Dr Andy Evans Department of Computer Science University of York York, UK YO10 5DD Telephone: +44 (0)1904 434751 Facsimile: +44 (0)1904 432767 http://www.cs.york.ac.uk/~andye ->http://www.cs.york.ac.uk/uml2000 From concurrency.cwi.nl Tue Feb 22 00:00:00 2000 From: "TOOLS Conferences" To: concurrency@cwi.nl (moderated) Subject: TOOLS USA 2000 Call for contributions Dear Colleague: This is the abbreviated call for contributions for TOOLS USA 2000. The full information is at http://www.tools-conferences.com/usa Please post or forward this information to any other colleague who think might be interested. With best regards, -- TOOLS Conference organization ************************************************************************* TOOLS USA 2000 "Software Serving Society" Santa Barbara, California July 30 - August 3, 2000 http://www.toolsconferences.com/usa CALL FOR CONTRIBUTIONS (deadline 10 March 2000) TOOLS is the major international conference series devoted to applications object technology, component technology and other advanced approaches to software development. TOOLS USA 2000 will be held in Santa Barbara, CA at the Fess Parker Double Tree Resort, one of the most beautiful resorts on the West Coast and will continue the commitment to excellence of earlier TOOLS conferences in Europe, Australia, Asia and the USA since 1989. The proceedings will be published world-wide by the IEEE Computer Society. PAPERS ------ TOOLS USA 2000 is now soliciting papers on all aspects of object and component technology. All submitted papers will be refereed and assessed for technical quality and usefulness to practitioners and applied researchers. TOOLS USA particularly welcomes papers that present general findings based upon industrial experience. Such papers will be judged by the quality of their contribution to industrial best-practice. TUTORIALS, WORKSHOPS AND PANELS ------------------------------- Tutorials, workshops, and panels form an important part of the TOOLS conferences. TOOLS USA 2000 is welcoming proposals for tutorials, workshops and panels on topics related to the theme of the conference. FOR MORE DETAILS AND REGISTRATION INFORMATION PLEASE VISIT THE CONFERENCE WEBSITE AT http://www.tools-conferences.com/usa From concurrency.cwi.nl Mon Mar 6 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: 2nd CFP:LICS Workshop on Chu Spaces and Applications 25th June 2000, CA From: Valeria Correa Vaz de Paiva SECOND CALL FOR PAPERS LICS'2000 Workshop on Chu Spaces: Theory and Applications Sunday, June 25, 2000, Santa Barbara, California http://www.cs.bham.ac.uk/~vdp/chu.html A Chu space is a related pair of complementary objects. Besides having intrinsic interest in their own right, Chu spaces have found applications to concurrent processes, information flow, linear logic, proof theory, and universal categories. The workshop is concerned with the theory and applications of Chu spaces, as well as related structures such as the Dialectica construction and double glueing. The workshop will bring together computer scientists, mathematicians, logicians, philosophers, and other interested parties to discuss the development of the subject with regard to its foundations, applications, prospects, and directions for future work. Work in the subject is currently fragmented across several areas: category theory, traditional model theory, concurrency, and the semantics of programming languages, and such a workshop can contribute to the coordination and possibly even some unification of these efforts. Suggested topics for presentation and discussion include but are by no means limited to new results about Chu spaces and related structures; their applications to various areas such as concurrency, games, proof theory, etc.; and their implications for foundations and philosophy of computation, mathematics, physics, and other disciplines. The workshop will be held on Sunday, June 25, 2000 at Santa Barbara, California, as an adjunct to the International Conference on Logic in Computer Science (LICS'2000), June 26-29 at the same location as per http://www.cs.bell-labs.com/who/libkin/lics/index.html. Papers within the scope of the workshop are solicited, and may be either work in progress or more mature work. Submission should be in the form of an extended abstract of at most 10 pages, in postscript format, mailed electronically to paiva@parc.xerox.com. Submissions will be evaluated by a committee selected by the organizers, and the full version of accepted papers will be printed in a proceedings available at the start of the workshop. Important dates: Extended abstract: April 25, 2000 Notification of acceptance: May 15, 2000 Proceedings version: June 9, 2000 The workshop will be one full day and is open to all interested researchers. Valeria de Paiva paiva@parc.xerox.com Vaughan Pratt pratt@cs.stanford.edu http://www.cs.bham.ac.uk/~vdp/chu.html From concurrency.cwi.nl Mon Mar 6 00:00:00 2000 From: Doris Faehndrich To: concurrency@cwi.nl (moderated) Subject: ETAPS 2000 - 2nd Call for Participation ------------------------------------------------------------------ ETAPS 2000 - EUROPEAN JOINT CONFERENCES ON THEORY AND PRACTICE OF SOFTWARE Technical University of Berlin, March 25 - April 2, 2000 -------- CALL FOR PARTICIPATION ----- REMINDER ------------------- Welcome to Berlin, welcome to ETAPS, the European Joint Conferences on Theory and Practice of Software, the European forum for academic and industrial researchers working on these topics! For 9 days you will be able to choose between 5 conferences -TACAS 2000, FOSSACS 2000, FASE 2000, ESOP 2000, CC 2000 - with more than 120 regular papers and tool demonstrations covering a wide range of topics from theory and practice, 7 invited lectures by Abbas Edalat, David Harel, Martin Odersky, Richard M. Soley, Wlayslaw M. Turski, Reinhard Wilhelm, Pierre Wolper, 5 satellite events - GRATRA 2000, CMCS 2000, CBS 2000, INT 2000, CoFi 2000 -, 10 tutorials - XML for Software Engineers, A tutorial on Maude, Rigorous Requirements for Safety-Critical Systems: Fundamentals and Applications of the SCR Method, Multi-Paradigm Programming, Query-based Automated Debugging, The Unified Modelling Language, Swinging Types, Tables and computation, SDL 2000, Software Metrology Basis - (We reserve the right to cancel a tutorial owing to unsufficient participation.) We are pleased that so many people will be attending ETAPS 2000. For those who still haven't registered, we are extending EARLY REGISTRATION DATE UNTIL 15th MARCH! -------------------------------------------------------------------- Please, check for details http://iks.cs.tu-berlin.de/etaps2000/ Use the option of online registration or one of the downloadable registration forms! Registration Address: BWO Marketing Service GmbH Mohrenstr. 63-64 D-10117 Berlin-Mitte Germany Fax: ++49 30 22 66 84-64 Email: Etaps2000@BWO-Berlin.de Conference Mail Address: etaps2000@iks.cs.tu-berlin.de -------------------------------------------------------------------- Doris Faehndrich: TU Berlin FB-13 Sekr. FR 5-6, Franklinstr. 28/29, 10587 Berlin, Tel: 030/31473436 -------------------------------------------------------------------- From concurrency.cwi.nl Mon Mar 6 00:00:00 2000 From: Flavio Corradini To: concurrency@cwi.nl (moderated) Subject: MTCS 2000 First Workshop on Models for Time-Critical Systems MTCS 2000 Co-Located with CONCUR 2000 Pennsylvania State University, Pennsylvania, USA August 26 2000 http://univaq.it/~mtcs2000/ AIMS OF THE WORKSHOP: To validate the more promising proposals on models for time-critical systems. Advances which involve dialects of process algebras, logics, Z-specifications, Petri nets, automaton, software architectures, UML ... for the specification, verification, formal reasoning of time-critical systems will be considered. Papers with a clear impact on application fields such as web, multimedia systems, distributed information systems, knowledge-based systems, such as any general paper on the topic, are welcome. To promote interaction between different research areas in the field of time-critical systems in order to exchange and to transfer techniques, analytic concepts and developed tools from a model to another one. Papers contrasting models from (as far as possible) different application fields are welcome. These include papers reporting results on the expressiveness of the models, relations between informal and formal reasoning and, more in general, relations among different systems abstractions... SUBMISSIONS: Send a self-contained .ps version of the paper to mtcs2000@univaq.it and, in a separate e-mail, Title, Authors and Abstract of the paper in ASCII format. IMPORTANT DATES: Deadline for Submission: May 14 2000 Notification to Authors: June 22 2000 Final Version of Accepted Papers due: July 15 2000 PROGRAM CO-CHAIRS: Flavio Corradini (University of L'Aquila) Paola Inverardi (University of L'Aquila) PROGRAM COMMITTEE: Rajeev Alur (University of Pennsylvania) Frank de Boer (University of Utrecht) Flavio Corradini (University of L'Aquila) Colin Fidge (University of Qeensland) Roberto Gorrieri (University of Bologna) Paola Inverardi (University of L'Aquila) Amir Pnueli (The Weizmann Institute of Science, Israel) Joseph Sifakis (Verimag Laboratory) Bran Selic (Rational Software Inc.) Walter Vogler (University of Augsburg) From concurrency.cwi.nl Mon Mar 6 00:00:00 2000 From: "Johan Lilius" To: concurrency@cwi.nl (moderated) Subject: ACF 0.1 Announcement Announcement We are happy to announce the pre-alpha release of ACF: a framework for writing model-checkers. ACF is built on the fundamental observation that the structure of most model-checking algorithms is independent of the formalism used to describe the system. By constructing suitable interfaces it is possible to provide generic algorithms that can be instanciated for any suitable formalism. ACF consists of generators, algorithms, and containers. In version 0.1 the following components have been implemented: - Generators: - A generator for UML state machines - A generator for Timed Automata - Generators for both Elementary Nets and Place/Transition nets - Algorithms - Depth-first and Breadth-first state search - Containers - StateSet - StateSpace ACF is available at http://aiken.cs.abo.fi/acf Regards, the ACF team Johan Lilius (jolilius@abo.fi) Henri Sara (hsara@abo.fi) Marcus Alanen (maalanen@abo.fi) Marcus Ahlfors (mahlfors@abo.fi) From concurrency.cwi.nl Fri Mar 3 00:00:00 2000 From: "N. Yoshida" To: concurrency@cwi.nl (moderated) Subject: Paper Announcement: Secure Information Flow as Typed Process Behaviour We are pleased to announce the following paper Secure Information Flow as Typed Process Behaviour by Kohei Honda Vasco Vasconcelos Nobuko Yoshida * Long version: - Queen Mary and Westfield College, CS Technical Paper 767 - University of Leicester, MCS Technical Paper, 1/2000 * Short version: a revised version will appear in ESOP 2000, LNCS, Springer are available from: http://www.dcs.qmw.ac.uk/~kohei (Queen Mary and Westfield College) http://www.di.fc.ul.pt/~vv/publications.html (Lisbon University) http://www.mcs.le.ac.uk/~nyoshida/paper.html (Leicester University) Your comments are warmly welcome. Kohei Honda: Queen Mary and Westfield College, kohei@qmw.dcs.ac.uk Vasco Vasconcelos: University of Lisbon, vv@padme.di.fc.ul.pt Nobuko Yoshida: University of Leicester, ny11@mcs.le.ac.uk ----------------------------- ABSTRACT ------------------------------ We propose a new type discipline for the $\pi$-calculus in which secure information flow is guaranteed by static type checking. Secrecy levels are assigned to channels and are controlled by subtyping. A behavioural notion of types capturing causality of actions plays an essential role for ensuring safe information flow in diverse interactive behaviours, making the calculus powerful enough to embed known calculi for type-based security. The paper introduces the core part of the calculus, presents its basic syntactic properties, and illustrates its use as a tool for programming language analysis by a sound embedding of a secure multi-threaded imperative calculus of Volpano and Smith. The embedding leads to a practically meaningful extension of their original type discipline. Other fundamental technical elements, culminating in the behavioural non-interference result, are also sketched. --------------------------------------------------------------------------- From concurrency.cwi.nl Fri Mar 3 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: Dissertation available From: Luis Barros Lopes Dear all, I would like to announce the availability of a Phd thesis entitled "On the Design and Implementation of a Virtual Machine for Process Calculi" Keywords: pi-calculi, objects, virtual machine, implementation The abstract and postscript file can be obtained from: http://www.ncc.up.pt/fcup/DCC/Pubs/Teses/teses.html Best regards, Luis Lopes =========================================================== Luis Miguel Barros Lopes =========================================================== Departamento de Ciencia de Computadores Faculdade de Ciencias da Universidade do Porto (FCUP), Rua do Campo Alegre, 823, 4150 Porto, PORTUGAL Tel: 351-22 607 8830, Ext: 108, Fax: 351-22 600 3654, Internet: lblopes@ncc.up.pt =========================================================== From concurrency.cwi.nl Fri Mar 3 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: Job Offer on Esterel From: Robert De_Simone JOB OFFER for R&D engineers on ESTEREL ---------------------------------------- Applications are sought for a software engineer position on the development of the synchronous reactive language Esterel and its programming environment. Duration : 18 months Starting date: open from april 1st, 2000 Location : Sophia-Antipolis (near Cannes, french Riviera, southern France) The position is to be held in the Tick team, a joint research effort between INRIA and CMA/Ecoles des Mines. The position concerns the development of the reactive synchronous Esterel language and of its compiling and verification environment. Specifically, the job will consist mainly in upgrading the model-checking functionalities of Xeve, our current symbolic model-checker dedicated to Esterel. This will allow better integration of dynamic analysis of programs in the current compilation flow. The position will be funded by the french national RNRT initiative as part of the SYNTEL project, a project aimed at showing the feasible application of Esterel to advanced protocol design. It will be conducted in close collaboration with Simulog as industrial partner. More information on applications can be found at URL: http://www-sop.inria.fr/meije/SYNTELjoboffer.html or by contacting Robert.de_Simone@sophia.inria.fr From concurrency.cwi.nl Fri Mar 3 00:00:00 2000 From: Purandar Bhaduri To: concurrency@cwi.nl (moderated) Subject: FTRTFT 2000: Second Call for Papers (Please note the new guidelines for submission of papers.) Second Call for Papers FTRTFT 2000 Formal Techniques in Real-Time and Fault-Tolerant Systems 6th International School and Symposium School: 18-19 September; Symposium: 20-22 September 2000 Pune, India OBJECTIVES Computer systems are increasingly being used in real-time and mission-critical applications. These systems are complex and have critical timing and reliability requirements. Formal techniques provide a foundation for the systematic design of complex systems. They have been used effectively throughout the software engineering process, from the capture of requirements to the definition and verification of system specifications, the design, coding and implementation of a system and down to the hardware, which embeds the system into its environment. The FTRTFT 2000 School and Symposium will focus on problems and solutions in the design of safe and reliable systems and will examine how well the use of formal methods serves practical realities. This is the sixth in a series of International Schools and Symposia started in Warwick in 1988, with succeeding meetings at Nijmegen (1992), L?beck (1994), Uppsala (1996) and Lyngby (1998). Proceedings of the Symposia are published as volumes 331, 571, 863, 1135 and 1486 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 embedded systems, covering all stages from requirements analysis to hardware and software implementation. In addition to the general topics, special themes of this symposium will be: * Verification tools and algorithms for real-time and fault-tolerant systems * Tools and algorithms supporting formal methods * Scheduling and timing constraints in real-time systems * Fault-tolerance in real-time systems * Use of formal methods for building real-time and fault-tolerant systems * Hybrid systems * Case studies and applications of formal methods GUIDELINES FOR SUBMISSION OF PAPERS Submissions are limited to 20 double spaced standard pages in postscript format, and will be through the Web-based conference management system START. Full details of the submission process are available on the conference website at http://www.pune.tcs.co.in/ftrtft/. Accepted papers will be published in the conference proceedings which will be published by Springer-Verlag in the LNCS series. Important Dates. Deadline for Submission 31 March, 2000 Notification to Authors 31 May 2000 Final Version of Accepted Papers due 14 July 2000 TOOLS DEMONSTRATION Demonstrations of software tools that support formal approaches to the development of real-time, fault-tolerant and embedded systems are invited for the School and Symposium. Proposers should contact the Tools Demonstration Chair at ftrtft@pune.tcs.co.in. VENUE The School will be held at the Tata Research Development and Design Centre, Pune. The Symposium will be held in Pune. FOR MORE INFORMATION Consult the symposium page at: http://www.pune.tcs.co.in/ftrtft PROGRAM COMMITTEE ORGANIZING COMMITTEE R. ALUR (U Penn) P. Bhaduri A. ARORA (Ohio State U) M. Joseph H. HANSSON (M?lardalen U) A.V. Nori I. HAYES (U Queensland) K.V. Nori Lin HUIMIN (IOS Beijing) R. Venkatesh He JIFENG (IIST Macau) M. JOSEPH (TRDDC) -- Chair Z. LIU (U Leicester) A. MOK (U Texas) K.V. NORI (TRDDC) P. PANDYA (TIFR) A. PNUELI (Weizmann Inst.) K. RAMAMRITHAM (IIT Mumbai) S. RAMESH (IIT Mumbai) STEERING COMMITTEE A.P. RAVN (Aalborg U) W.-P. de ROEVER (KAU Kiel) M. Joseph N. SHANKAR (SRI) A. Pnueli J. VYTOPIL (KU Nijmegen) W.-P. de Roever S. YOVINE (IMAG Grenoble) J. Vytopil ADDRESS FOR CORRESPONDENCE FTRTFT Tata Research Development & Design Centre 54B Hadapsar Industrial Estate Pune 411 013 INDIA E-mail: ftrtft@pune.tcs.co.in URL : http://www.pune.tcs.co.in/ftrtft Tel: +91 20 6877 186 Fax: +91 20 6812 225 / 6810 921 -- Purandar Bhaduri Email: pbhaduri@pune.tcs.co.in Formal Methods Group Phone: +91 20 687 1058 TRDDC, Tata Consultancy Services Fax: +91 20 681 0921 54 B, Hadapsar Industrial Estate, Pune 411 013, INDIA From concurrency.cwi.nl Wed Mar 1 00:00:00 2000 From: Martin Grohe To: concurrency@cwi.nl (moderated) Subject: LICS 2000 - Call for Short Presentations Fifteenth Annual IEEE Symposium on LOGIC IN COMPUTER SCIENCE June 26 - 28, 2000, Santa Barbara, California CALL FOR SHORT PRESENTATIONS The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic in a broad sense. LICS 2000 will have a session of short (5 - 10 minutes) presentations. This session is intended for descriptions of work in progress, student projects, and relevant research being published elsewhere; other brief communications may be acceptable. Submissions for these presentations, in the form of short abstracts (1 or 2 pages long, in English), should be entered at the LICS submission site http://lics.cs.bell-labs.com/ between March 16 and March 31, 2000. Authors will be notified of acceptance or rejection by May 1, 2000. Suggested, but not exclusive, topics of interest for submissions include: abstract data types, automata theory, automated deduction, bounded arithmetic, categorical models and logics, coinductive techniques, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, domain theory, finite model theory, formal aspects of program analysis, formal methods, game semantics, hybrid systems, logics of knowledge, lambda and combinatory calculi, linear logic, logical aspects of computational complexity, logics in artificial intelligence, logics of programs, logic programming, modal and temporal logics, model checking, reasoning about security, rewriting, semantics, specifications, type systems and type theory, universal algebra, and verification. The symposium is sponsored by the IEEE Technical Committee on Mathematical Foundations of Computing in cooperation with the Association for Symbolic Logic, and the European Association for Theoretical Computer Science. Collocated events: The International Static Analysis Symposium (SAS2000) will also take place in Santa Barbara, immediately following LICS, from June 29 to July 1. For more information, see http://www.cis.ksu.edu/santos/sas/. In addition, several workshops are planned in conjunction with LICS; they include workshops on Nonmonotonicity and Belief Revision, Logical Frameworks and Meta-Languages, Chu Spaces, Implicit Computational Complexity, and Proof-Carrying Code. Program Chair: Martin Abadi Bell Labs - Lucent Technologies 3180 Porter Drive Palo Alto, California 94304, USA Email: abadi@research.bell-labs.com lics2000@research.bell-labs.com Phone: +1 650 565 7477 Fax: +1 650 565 7676 Program Committee: Pierre-Louis Curien, CNRS & U. Paris 7 Rocco De Nicola, U. Florence Javier Esparza, U. Munich Marcelo Fiore, U. Sussex Harald Ganzinger, MPI Informatik Joe Halpern, Cornell U. Martin Hofmann, U. Edinburgh Bart Jacobs, U. Nijmegen Orna Kupferman, Hebrew U. Kim Larsen, Aalborg U. Leonid Libkin, Bell Labs James F. Lynch, Clarkson U. Vincent van Oostrom, U. Utrecht & CWI Frank Pfenning, CMU Benjamin C. Pierce, U. Penn Jon G. Riecke, Bell Labs Igor Walukiewicz, Warsaw U. Publicity Chair: Martin Grohe Institut fuer Mathematische Logik Albert-Ludwigs-Universitaet Freiburg Eckerstr. 1, 79104 Freiburg, Germany Email: grohe@logik.mathematik.uni-freiburg.de General Chair: John C. Mitchell Computer Science Department Stanford University Stanford, CA 94305-9045, USA Email: mitchell@cs.stanford.edu Organizing Committee: M. Abadi, A. Aggarwal, M. Bezem, E. Clarke, R. Constable, N. Dershowitz, J. Diaz, H. Ganzinger, F. Giunchiglia, M. Grohe, D. Leivant, L. Libkin, G. Longo, D. A. Martin, J. Mitchell (chair), E. Moggi, V. Pratt, S. Ronchi della Rocca, J. Tiuryn, M.Y. Vardi, J. Vitter, G. Winskel. Advisory Board: M. Abadi, S. Abiteboul, S. Abramsky, M. Dezani, J. Halpern, R. Impagliazzo, D. Kozen, L. Pacholski, A. Scedrov, D. Scott, J. Wing. LICS-URL: http://logik.mathematik.uni-freiburg.de/lics/ From concurrency.cwi.nl Fri Mar 10 00:00:00 2000 To: concurrency@cwi.nl (moderated) From: Pat Hall Subject: Chair/Professor, Lecturers in Computing at the Open University, GB JOIN THE OU AS IT BUILDS ON 30 YEARS OF SUCCESS Chair, Senior Lectureships/Lectureships in Computing The Open University is making a strategic investment in Computing to create a focus for academic excellence. We wish to attract productive and enthusiastic academics to enhance our research and extend our teaching provision to create a broader range of courses for our highly motivated adult students. This is an exciting opportunity to participate in global distance education and research in an institution committed to quality and growth. Our course Computing: an object-oriented approach was approved by the Design Council as a Millennium Product. We offer you: * the chance to join an ambitious expanding Department of Computing that teaches over 8,000 undergraduates and 4,500 postgraduates each year - more than any other UK university * strong encouragement for your research, internal research funding opportunities and excellent support for external funding bids * the opportunity to collaborate extensively across discipline boundaries * extensive technological resources to support your teaching ideas (most of our students are networked) * the opportunity to innovate in teaching at all levels * good flexible study leave provision ---------------------------------------------------------------------------- ------------------------ Chair in Computing -------------------------- The Professor of Computing will have an excellent record of research publication and of teaching at a range of levels, academic leadership qualities (proven or potential), and a vision for our curriculum development. You will: * have the opportunity to build up a strong research team in your area and in other areas of Computing * lead the current expansion of our undergraduate and postgraduate curriculum in Computing * inspire colleagues in research and teaching * attract external research funding * work effectively across discipline boundaries * develop links with industry and commerce * lead developments in on-line teaching * contribute to policy-making at Faculty level Closing date for applications: 31st March 2000 ---------------------------------------------------------------------------- ------------------------ Lecturers in Computing/Senior Lecturers ------------------------------------------------------- We are appointing up to four permanent Lecturers (if you have appropriate qualifications and experience you may be appointed to a Senior Lectureship) to conduct research and teaching in: * software project management * software engineering * object-oriented technology * distributed computing * databases * multimedia systems * software systems, operating systems or in closely related areas, as appropriate. We hope that at least one post will be in the area of project management. If you are finishing your PhD in these or related areas, we would give you time to complete your thesis. Closing date for applications: 7th April 2000 ---------------------------------------------------------------------------- ------------------------ We are happy to consider joint applications of groups of academics who wish to work together in these or related areas in Computing, if each individual meets our person specification. For further information on these posts and an application form, please contact The Recruitment Secretary, Faculty of Mathematics and Computing, The Open University, Walton Hall, Milton Keynes MK7 6AA, UK (Tel: +44 - (0)1908-654161; email: mcs-recruitment@open.ac.uk); please specify whether you are enquiring about the chair or the other posts. The Professorial salary will be not less than =A336,401, according to experience and qualifications. The Lecturer salary will be between =A317,238 and =A330,065 - or exceptionally up to =A333,593. The Senior Lect= urer salary will be between =A331,563 and =A335,560. Disabled applicants whose skills and experience meet the requirements of the job will be interviewed. Please let us know if you need your copy of the further particulars in large print, on computer disk, or on audio-cassette tape. Hearing impaired persons may make enquiries on Milton Keynes (01908) 654901 (Minicom answerphone). The University offers a wide range of jobs with excellent training and career development opportunities. We actively promote equal opportunities in education and employment and welcome applications from all sections of the community. Equal Opportunity is University Policy. http://watt.open.ac.uk/personnel/emp/pr.htm ------------------------------------------------------------------ Professor Pat Hall, Computing Department, Open University, Milton Keynes MK7 6AA tel: 01908 652694 (work at OU), 0181 980 4720 (home and work) ------------------------------------------------------------------ From concurrency.cwi.nl Fri Mar 10 00:00:00 2000 From: Marco Bernardo To: concurrency@cwi.nl (moderated) Subject: PAPM 2000: deadline extension (March 22) *************************************************************************** * * * PAPM 2000 * * * * 8th INTERNATIONAL WORKSHOP ON PROCESS ALGEBRA AND PERFORMANCE MODELLING * * * * 15th July 2000 - Geneva (Switzerland) * * * * Satellite Workshop of ICALP 2000 * * * * http://www.cs.unibo.it/~bravetti/papm2000/ * * * *************************************************************************** The aim of the workshop is to bring together researchers and practitioners interested in the development and application of process algebras to performance modeling and evaluation. Topics of the workshop include (but are not limited to): * Semantic theory of stochastically timed and probabilistic process algebras (equivalence, preorder, axiomatization, ...); * Efficient performance evaluation techniques (product form solution, distributed simulation, ...); * Probabilistic verification techniques (probabilistic model checking, ...); * Relationships with other formalisms for performance modeling and analysis (stochastic Petri nets, queueing networks, ...); * Tools and case studies (communication protocols, software systems, ...). Papers of at most 15 pages in A4 format should be submitted electronically by sending two separate e-mails to papm2000_sub@cs.unibo.it. The first e-mail should contain indication of authors, title, abstract, keywords, and contact author address. The second e-mail should contain the paper itself in .ps or .pdf format. For further information, please send an e-mail to papm2000_info@cs.unibo.it. PAPM 2000 proceedings will be published by Carleton Scientific (joint volume with all the other satellite workshops of ICALP 2000). The publication of a selection of papers as a special issue of a journal is under negotiation. Important dates: - 22nd March 2000: paper submission; - 14th April 2000: notification of acceptance/rejection; - 7th May 2000: camera ready of accepted papers due. Invited Speakers: Rance Cleaveland (State Univ. of New York at Stony Brook) Boudewijn Haverkort (Univ. of Aachen) Program Committee: Marco Bernardo (Univ. of Torino) Luca de Alfaro (Univ. of California at Berkeley) Roberto Gorrieri - Chair (Univ. of Bologna) Peter Harrison (Imperial College) Holger Hermanns (Univ. of Twente) Ulrich Herzog (Univ. of Erlangen) Jane Hillston (Univ. of Edinburgh) Marta Kwiatkowska (Univ. of Birmingham) Kim Larsen (Univ. of Aalborg) Prakash Panangaden (McGill Univ.) Manuel Silva (Univ. of Zaragoza) Scott Smolka (State Univ. of New York at Stony Brook) Organizing Committee: Alessandro Aldini (Univ. of Bologna) Marco Bernardo - Chair (Univ. of Torino) Mario Bravetti (Univ. of Bologna) Steering Committee: Ed Brinksma (Univ. of Twente) Roberto Gorrieri (Univ. of Bologna) Ulrich Herzog (Univ. of Erlangen) Jane Hillston (Univ. of Edinburgh) From concurrency.cwi.nl Thu Mar 9 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: Postdoctoral Research Associate at CMU From: Frank Pfenning POSTDOCTORAL RESEARCH ASSOCIATE Department of Computer Science Carnegie Mellon University The Fox project on Advanced Language Technology for Extensible Systems under the direction of Robert Harper, Peter Lee, and Frank Pfenning is looking for a postdoctoral researcher. Applicants should have background and interests in one or more of the following areas: - design and implementation of ML and related languages - advanced type systems, proof-carrying code and certifying compilation - embedded systems, network software and safety infrastructure The ideal candidate will have credentials in system building and a lively interest in language theory. Participation in teaching activities is also encouraged. The appointment is initially for one year with a potential renewal for a second year. Salary is negotiable and commensurate with experience. The Fox project is working to demonstrate the viability and benefits of advanced languages for programming real-world systems, with an emphasis on networking, mobile code, and related safety and efficiency problems. For more information on the Fox project, see http://foxnet.cs.cmu.edu/. Please direct inquiries and applications to Frank Pfenning Department of Computer Science Carnegie Mellon University Pittsburgh, PA 15213-3891 fp@cs.cmu.edu Carnegie Mellon is an affirmative action/equal opportunity employer and we invite and encourage applications from women and minorities. From concurrency.cwi.nl Thu Mar 9 00:00:00 2000 From: MFCS 2000 Subject: MFCS 2000 - Submission Deadline Approaching To: concurrency@cwi.nl (moderated) Please, note that the submission deadline is MARCH 24, 2000. ************************************************************************** MFCS 2000 25th International Symposium on Mathematical Foundations of Computer Science August 28 - September 1, 2000 Bratislava, Slovak Republic, Europe http://www.mfcs.sk/ ************************************************************************** CALL FOR PAPERS ************************************************************************** The series of MFCS symposia, organized alternately in the Czech Republic, Poland and Slovakia since 1972, has a long and well-established tradition. The MFCS symposia encourage high-quality research in all branches of theoretical computer science. Their broad scope provides an opportunity to bring together specialists who do not usually meet at specialized conferences. Papers presenting original research on theoretical aspects of computer science are solicited. Principal topics of interest include (but are not limited to): design and analysis of algorithms (sequential, parallel, distributed, approximation, computational biology, computational geometry, graph, network, on-line, optimisation) and data structures, algorithmic learning theory, automata, grammars and formal languages, structural and computational complexity, concurrency theory, cryptography and security, databases and knowledge-based systems, foundations of programming, formal specifications and program development, models of computation, parallel and distributed computing, quantum computing, molecular computing, mobile computing, net computing, semantics and logics of programs, theoretical issues in artificial intelligence. The scientific program will include invited lectures covering the areas of current interest, short communications describing original research, and a number of 1-2 day workshops immediately preceding or following the conference. So far, the following workshops were confirmed: * Algorithmic Foundations of Communication Networks * New Developments in Formal Languages versus Complexity * Prague Stringology Club Workshop 2000 (See the conference Web page for current information.) INVITED SPEAKERS So far, the following have confirmed: A. Gordon (Cambridge), J. Davenport (Bath), R. Grosu (Philadelphia), L. Hemaspaandra (Rochester), G. Italiano (Rome), V. Pratt (Stanford), J. van Leeuwen (Utrecht), M. Vardi (Houston), S. Zaks (Haifa). PROGRAM COMMITTEE M. Broy (Munich), J. Diaz (Barcelona), R. Freivalds (Riga), Z. Fulop (Szeged), G. Gottlob (Vienna), B. Jonsson (Uppsala), J. Karhumaki (Turku), L. Kari (London, Ontario), D. Kozen (Ithaca), M. Kretinsky (Brno), C. Marche (Orsay), A. Marchetti-Spaccamela (Rome), M. Mavronicolas (Nicosia), B. Monien (Paderborn), M. Nielsen (Aarhus) co-chair, L. Pacholski (Wroclaw), J.-E. Pin (Paris), B. Rovan (Bratislava) chair, J. Rutten (Amsterdam), P. Ruzicka (Bratislava), V. Sassone (Catania), J. Sgall (Prague), A. Simpson (Edinburgh), K. Wagner (Wurzburg), I. Walukiewicz (Warsaw). AUTHORS are invited to submit a self contained PostScript version of their paper in English AND an abstract of up to 20 lines (in a separate mail) by e-mail to mfcsPC@dcs.fmph.uniba.sk The submission must not exceed ten pages (preferably in Springer-Verlag Lecture Notes [La]Tex style) and must be received by MARCH 24, 2000. An e-mail address and the fax number for the contact author should be included. Simultaneous submission of papers to any other conference with published proceedings is not allowed. Accepted papers will be published in the proceedings (Lecture Notes in Computer Science, Springer-Verlag) and distributed at the conference. IMPORTANT DATES Submission deadline: March 24, 2000 Acceptance notification: May 22, 2000 Final version due: June 9, 2000 Symposium: August 28 - September 1, 2000 Attached workshops: August (26) 27, and September 2 (3), 2000 CONFERENCE ADDRESS Branislav Rovan MFCS 2000 Department of Computer Science Comenius University Mlynska dolina, MFF UK 842 48 Bratislava, Slovak Republic Phone: (+421 7) 654 26 635 Fax: (+421 7) 654 27 041 E-mail: mfcs2000@dcs.fmph.uniba.sk E-mail (submissions): mfcsPC@dcs.fmph.uniba.sk WWW: http://www.mfcs.sk/ (Please, visit often for current information.) The symposium is organized by the Slovak Society for Computer Science and the Comenius University, in cooperation with other institutions in Slovakia. It is supported by the European Association for Theoretical Computer Science, the European Research Consortium for Informatics and Mathematics, and the Slovak Research Consortium for Informatics and Mathematics. Further information about symposium is available at http://www.mfcs.sk/ From concurrency.cwi.nl Tue Mar 7 00:00:00 2000 From: Henrik Reif Andersen To: concurrency@cwi.nl (moderated) Subject: Vacant Ph.D.-scholarships at the IT University of Copenhagen 8 Vacant Ph.D.-scholarships at the IT University of Copenhagen ============================================================ The IT University of Copenhagen now invites applications for 8 Ph.D.-scholarships. The successful applicant will be an excellent student able to conduct research under supervision at highest international standards. Six scholarships are funded by the IT University and will be filled with at least one position in each of the following four areas: Software Development; Internet Technologies; Multi-Media Technologies; Design, Communication, and Media. Two scholarships are funded by the research programmes "Resource Constrained Embedded Systems" and "Computing Natural Shape". The full announcement, further information, and application forms can be downloaded from the web-page at http://www.itu.dk/phd. Deadline for applications is April 11th, 2000. Please direct questions to the application form and the Ph.D.-studies in general to phdadm@itu.dk. Yours sincerely, Henrik Reif Andersen Associate Professor and Ph.D. Advisor at the IT University phdadm@itu.dk ================= The IT University of Copenhagen is a new university formed by the Danish government for the increase and improvement of research and education in information technology in the Copenhagen area. Studies are at graduate level (Master and Ph.D.) and cover aspects of information technology ranging from natural and technical sciences to arts and business perspectives. The IT University is a graduate school; its areas of interests span Science, Arts and Business Studies. The school has 300 graduate students by February 2000 and stands to accept 800 students annually within five years. The PhD scholarship runs for a period of three or four years depending on the educational level of the student. A three-year scholarship can only be awarded to applicants who have a Master's degree, equivalent to a Danish graduate degree. A four-year scholarship can be awarded to students with a Bachelor's degree who have obtained the equivalent of four years of Danish University studies. Appointment and salary will be in accordance with the collective agreement between the Ministry of Finance and the Danish Confederation of Professional Associations (AC). The three-year scholarship is approximately 19,500 DKK monthly which is subject to taxation plus pension. The four-year scholarship is for the first 2 years approximately 8,000 DKK monthly plus eventually extra 4,000 DKK monthly on certain conditions. These two amounts are subjects to taxation. As for the 4.000 DDK pension is added. Grant portions (Danish S.U.) may also be added provided that conditions are met. For the last two years the scholarship is 19,500 DKK monthly. The PhD programme includes courses and the possibility of staying at an international laboratory for a period of 6 months. To be awarded a scholarship requires enrolment as a PhD student, which is based on an application. The submitted applications will be processed by a committee of experts within the field in question. Applications must contain the application form available at www.itu.dk/phd and must include a letter of motivation, documentation of studies, a brief CV, a list of publications and copies of publications or theses. Application deadline: 11 April 2000, 12.00 noon. Applications in Danish or English must be sent in 4 copies to the following address: The IT University Att. Kirsten Talbro Laraignou Glentevej 67 DK-2400 Copenhagen NV Denmark From concurrency.cwi.nl Sun Mar 19 00:00:00 2000 From: Zhong Shao To: concurrency@cwi.nl (moderated) Subject: Postdoctoral Research Position at Yale Post-Doctorate Research Position Yale University Department of Computer Science The FLINT project (URL - http://flint.cs.yale.edu ) in the Department of Computer Science at Yale University is seeking applicants for a Post-Doctoral Research Position. The successful applicant will be expected to participate in a rigorous research program centered on the following topics: o Typed intermediate languages and type-directed compilation o Proof-carrying code and certifying compilation o Systems programming in advanced type-safe languages o Application of language theory to secure internet programming (more information about these topics can be found in the white paper available at URL - http://flint.cs.yale.edu/publications/pcc-white ) Successful applicants must have a PhD in Computer Science or closely related field, and experience with modern programming languages such as ML, Java, or Haskell. The term of the position is 1 year with an option to renew for an additional year. A starting date around September 2000 (or earlier) is expected; candidates should have completed all thesis requirements by that time. A competitive salary will be offered, with actual salary dependent on the applicant's qualifications and experience. Yale University is an Equal Opportunity/Affirmative Action employer; qualified women and minority candidates are encouraged to apply. Interested applicants should send a resume, a one- to two- page research statement, and three letters of recommendation to Professor Zhong Shao (Email Address: shao-zhong@cs.yale.edu). Electronic application is preferred, but if necessary, applications may be sent to the address below. Professor Zhong Shao Department of Computer Science Yale University P.O. Box 208285 New Haven, CT 06520-8285, USA Phone: 203-432-6828 Email: shao-zhong@cs.yale.edu From concurrency.cwi.nl Thu Mar 16 00:00:00 2000 From: Susanne Graf To: concurrency@cwi.nl (moderated) Subject: SAM2000 --- Grenoble --- june, 26-28, 2000 call for papers ********************************************************** *** 2nd Workshop on SDL and MSC *** *** SAM 2000 *** *** Grenoble, France June, 26-28 2000 *** ********************************************************** Co-organised by the SDL Forum Society VERIMAG, Grenoble IRISA, Rennes Complete and up to date Information can be found at: http://www.irisa.fr/manifestations/2000/sam2000/ C A L L F O R P A P E R S ---------------------------- The SDL and MSC workshop will provide an open discussion platform between SDL forums. It addresses topics related to both description and specification techniques. The intended audience ranges from SDL Forum members, tool vendors over researchers and users to standardizers and will be limited to about 100 persons. Being a less formal event as the biennial SDL Forum, the workshop is expected to be a place for intensive discussions enabling the unfolding of ideas for the future development and application of SDL and MSC. The workshop will consist of a set of invited presentations and topic centered breakout sessions. Potential participants of the sessions are also encouraged to submit and present papers reflecting their work. Following the presentations, plenty of time will be made available for in-depth discussions. Research papers, industrial usage reports, poster displays and tool demonstrations are welcome, particularly in the following areas: * SDL and MSC applications to the development cycle of network protocols and distributed systems engineering: - Requirements capture, specification and verification/validation - Simulation, implementation, debugging and tuning - Testing, test selection, test generation and test coverage - Performance analysis and modeling - Quality of Service modeling and verification - Real time and probability modeling and verification - Integration of SDL and MSC and development methodologies * Case studies SDL and MSC applications in the areas of: - Multicast and multimedia protocols - Distributed platforms and middleware protocols - Internet protocols - High speed protocols - Mobile communication - Network security protocols - Medium access control protocols, local loop protocols - Factory communication protocols - Field Bus protocols - Case studies * SDL and MSC applications to telecommunication services and distributed applications: - Architectures for telecommunication services (Intelligent Network architecture, TINA, object based architectures, CORBA, COM-DCOM, ActiveX, internet,...) - Service creation, service composition, service and feature interaction - Reusable components architectures - Workflow and Groupware - Case studies * Development of SDL and MSC methods and tools: - Semantic foundations - Formal support to object modeling - Extensions of SDL and MSC - Real-time and probability aspects - Consistency and refinement relations - Practical algorithms and tool support - Case studies * Industrial and business focus: - Corporate strategic and financial consequences of SDL and MSC use - Corporate experiences in SDL and MSC based developments - Tools and training cases for protocols teaching - >Case studies Important Dates Deadline for submissions: 10th April 2000 Notification of acceptance: 10th May 2000 Final versions due : 10th June 2000 Conference Dates : 26-28th June Submission policy: ----------------- Full original research papers and industrial usage reports should be up to 16 pages, 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. For industrial usage reports, short papers up to 8 pages are also welcome. Authors should indicate a contact author (including postal and E-mail address) and the preferred category (research paper or industrial usage report) in which the paper should be considered. Authors are strongly encouraged to use A4 size papers and to make sure that their submissions are easy to print on a variety of postscript printers (e.g. by using standard fonts). Authors are required not to submit papers that have been submitted to another conference or a journal. The submitted paper format can be PostScript, PDF or MS word for windows. Authors are encouraged to submit their full original research papers and industrial usage reports electronically. Submissions should be made to the following address: Sam2000@sdl-forum.org -- ------------------------------------------------------------------------ Susanne Graf | tel : (+33) (0)4 76 63 48 52 VERIMAG | 76 63 48 48 (secr) Centre Equation | fax : (+33) (0)4 76 63 48 50 2, avenue de la Vignate | http://www-verimag.imag.fr/~graf/ F - 38610 Gieres | e-mail: Susanne.Graf@imag.fr ------------------------------------------------------------------------ From concurrency.cwi.nl Wed Mar 15 00:00:00 2000 From: Pao-Ann Hsiung To: concurrency@cwi.nl (moderated) Subject: DSVV: Call For Participation International Workshop on Distributed System Validation and Verification (DSVV'2000) Call For Participation Held in conjunction with the 20th IEEE International Conference on Distributed Computing Systems (ICDCS'2000) DSVV: April 10, 2000 ICDCS: April 11-13, 2000 Grand Hotel, Taipei, Taiwan, ROC http://www.iis.sinica.edu.tw/~eric/icdcs2k-dsvv/ Distributed systems have parts located in more than one location and distributed applications need to work coherently within such a system to be feasible. Such systems and applications are difficult to validate and verify. The DSVV'2000 workshop will try to assimilate all related techniques, either formal or technical, which contribute towards proving systems valid. Formal methods include queuing theory, analytic methods, model-checking, process algebra, theorem proving, term rewriting, and other logic-related techniques. Technical methods include different simulation models, testing, emulation, virtual prototyping, rapid prototyping, and other ad-hoc techniques. In today's world of wireless and mobile networking, distributed system protocols form a major aspect of system design. Verifying such protocols is usually a formidable task. DSVV'2000 will try to uncover and integrate existing techniques and introduce new ones for distributed system protocol verification. DSVV'2000 workshop will span over one full day, April 10, 2000. There will be two invited talks: (1) Formal Methods for Message Sequence Charts Dr. Doron Peled, Bell Laboratories, USA (2) Model checking versus theorem proving for verifying distributed protocols Dr. Jean-Pierre Jouannaud, University of Paris, FRANCE There will be 16 paper presentations divided into 5 interesting sessions. (1) Validation and Verification Tools (2) Formal Methods (3) Testing (4) Model Checking (5) Protocol Verification Advance Program (Click Below): http://www.iis.sinica.edu.tw/~eric/icdcs2k-dsvv/program.html Registration Form: http://www.cis.ohio-state.edu/~icdcs20/registration.html Hotel Room Reservation Form: http://www.cis.ohio-state.edu/~icdcs20/reservation.html The Grand Hotel: http://www.grand-hotel.org/taipei/index.htm Workshop Organizer / Program Chair: Postal Address: Pao-Ann Hsiung Institute of Information Science Academia Sinica 128, Academic Road, Sec. 2 Nankang, Taipei 115, TAIWAN, R.O.C. E-mail: eric@iis.sinica.edu.tw Telephone: +886-2-27883799 Fax: +886-2-27824814 For further details, please refer to the following pages: DSVV'2000: http://www.iis.sinica.edu.tw/~eric/icdcs2k-dsvv/ ICDCS'2000: http://www.cis.ohio-state.edu/~icdcs20/ From concurrency.cwi.nl Mon Mar 27 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: PhD places at LFCS From: Ian.Stark@ed.ac.uk PhD positions available for October 2000 Laboratory for Foundations of Computer Science Division of Informatics, University of Edinburgh Applications are open for students to take up PhD places at Edinburgh in October 2000. Supporting funds are available for postgraduates of any nationality. The Laboratory for Foundations of Computer Science is one of the world's leading centres of research into theoretical computer science and its application. An important part of this is its active community of research students, currently over 20 strong. LFCS runs a 3-year PhD programme; this includes a series of taught courses which provide a broad background in the theory of computation, and prepare students to do their own research work. All students are directly supervised by an academic staff member. The Laboratory and the Division fund some studentships of their own, open to applicants of any nationality. UK students can also apply for one of several grants awarded to the Division by the EPSRC. For more information, including details of how to apply, please consult our web site. http://www.lfcs.informatics.ed.ac.uk/research/students.html -------------------------------------------------------------------- Ian Stark Deputy Director, LFCS http://www.lfcs.informatics.ed.ac.uk From concurrency.cwi.nl Fri Mar 24 00:00:00 2000 From: Hans Hansson To: concurrency@cwi.nl (moderated) Subject: ABB Chair in IIT, Vasteras, Sweden 8><------------------------ Mälardalen University announces, THE ABB CHAIR IN INDUSTRIAL INFORMATION TECHNOLOGY The holder of this chair will work at the Department of Computer Engineering. The department currently has extensive research and education in real time systems, hardware construction, computer science, and software engineering. With support from a donation from ABB, the department now plans to increase its strength significantly in Industrial Information Technology. The aim is to build a strong research group in the area, which will conduct research in close cooperation with industry and develop a complete education portfolio in the area - it is for instance expected to play an important role in the planned CS/CE/EE M.Sc. programme at Mälardalen University. The holder of the chair will lead this research group and its formation. Area The scope of the chair is strategies, development, and management of industrial information technology systems, such as Open Control Systems, Information Management Systems, and Manufacturing Execution Systems, with an emphasis on practically applicable techniques and methods. Central areas include: - Component-based technologies - COM/DCOM, JavaBeans, CORBA, etc.; - Standard and de-facto standard technology such as WEB- and Internet- based technology; - Embedded and real-time systems built on standard components and technologies; - Man-machine communication. Qualifications and Criteria for Selection In order to be qualified as holder of a professorial chair, scientific and pedagogical proficiency is required. For this position, especially important merits are documented pedagogical proficiency in undergraduate and graduate education, successful supervision of PhD students, leadership abilities, experience of cooperation with industry, and ability to attract external research grants. Direct industrial experience is also a merit. Mälardalen University encourages both female and male candidates to apply. Information More information about the position can be obtained from professor Björn Lisper, phone +46-21-15 17 09, email bjorn.lisper@mdh.se, and administrative officer Per Ljunggren, phone +46-21-10 15 82, e-email per.ljunggren@mdh.se. More information about the Department of Computer Engineering is found at http://www.idt.mdh.se/. Applications should be directed to the Head of Mälardalen University and be sent to: Registrator, Mälardalen University, P.O. Box 883 SE-721 23 Västerås Sweden The application much have reached us at latest April 27, 2000. 8><-------------------------- From concurrency.cwi.nl Wed Mar 22 00:00:00 2000 From: Gurdip Singh Subject: visiting position at Kansas State Univ. To: concurrency@cwi.nl (moderated) Visiting Faculty Position Kansas State University The department of Computing and Information Sciences at Kansas State University invites applications for a visiting position beginning in Fall 2000. Applicants should have a PhD degree in computer science by the starting date of the appointment; salary will be commensurate with qualifications. Applicants must be committed to both teaching and research. Primary consideration will be given to computer scientists who work in programming languages, distributed and parallel systems, embedded systems, data/knowledge base systems, and software engineering. Applications must include descriptions of teaching and research interests along with copies of representative publications. Non-U.S. citizens must include visa status. The department has a faculty of seventeen and offers BS, MS, MSE, and PhD degrees. Computing facilities center around a network of UNIX- and Solaris-based single- and multi- processor Sun workstations, X-terminals, and PCs. Details can be found at the URL http://www.cis.ksu.edu/ Please send applications to Dr. Virgil Wallentine, Head, Department of Computing and Information Sciences, 234 Nichols Hall, Kansas State University, Manhattan, KS 66506 (email: virg@cis.ksu.edu). Review of applications will commence April 1st and will continue until the position is filled. Kansas State University is an Affirmative Action Equal Opportunity Employer. From concurrency.cwi.nl Wed Mar 22 00:00:00 2000 To: concurrency-request@cwi.nl From: Jud Wolfskill Subject: book announcement--Dolev The following is a book which readers of this list might find of interest. For more information please visit http://mitpress.mit.edu/promotions/books/DOLSHS00 Self-Stabilization Shlomi Dolev Self-stabilization, an important concept to theoreticians and practitioners in distributed computing and communication networks, refers to a system's ability to recover automatically from unexpected faults. In this book Shlomi Dolev presents the fundamentals of self-stabilization and demonstrates the process of designing self-stabilizing distributed systems. He details the algorithms that can be started in an arbitrary state, allowing the system to recover from the faults that brought it to that state. The book proceeds from the basic concept of self-stabilizing algorithms to advanced applications. Shlomi Dolev is Senior Lecturer and Coordinator of Computer Science in the Department of Mathematics and Computer Science at Ben-Gurion University of the Negev, Israel. 6 x 9, 208 pp., 38 illus., cloth ISBN 0-262-04178-2 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | Jud Wolfskill ||||||| Associate Publicist Phone: (617) 253-2079 ||||||| MIT Press Fax: (617) 253-1709 ||||||| Five Cambridge Center E-mail: wolfskil@mit.edu | Cambridge, MA 02142-1493 http://mitpress.mit.edu From concurrency.cwi.nl Tue Mar 21 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: CTCS '99 Special Issue in TCS. Final Reminder. From: "Martin Hofmann" Call for Papers Special Issue of Theoretical Computer Science (TCS) on Categories in Computer Science Editors: J. Adamek, M. Escardo, M. Hofmann The eighth conference on Category Theory and Computer Science (CTCS'99) has been held in Edinburgh 10-12 September 1999. A special issue of the journal Theoretical Computer Science (TCS) will be devoted to journal versions of papers presented at that conference and other papers on the same topic. Submissions will undergo the usual refereeing process for TCS; authors of submissions are not required to have participated at CTCS'99. From the call for papers: "The purpose of the conference series is the advancement of the foundations of computing using the tools of category theory. While the emphasis is upon applications of category theory, it is recognized that the area is highly interdisciplinary. Topics of interest include but are not limited to category-theoretic aspects of the following: concurrent and distributed systems, constructive mathematics, declarative programming and term rewriting, domain theory and topology, linear logic, models of computation, program logics, data refinement, and specification, programming language semantics, type theory". See also http://www.dcs.ed.ac.uk/home/ctcs99 for the conference programme. Instructions to Authors ----------------------- Authors are invited to submit full original research papers. Papers should be submitted via email to ctcs99@dcs.ed.ac.uk as a postscript file, or by mailing a hard copy to Martin Hofmann Laboratory for Foundations of Computer Science JCM, Rm 2606 The King's Buildings Mayfield Rd Edinburgh EH9 3JZ UK before 31st March, 2000. Authors who would like to submit a paper but feel that the deadline is too tight should contact me by email (mxh@dcs.ed.ac.uk) before the deadline. An extension could then be negotiated. From concurrency.cwi.nl Tue Mar 21 00:00:00 2000 From: "E. Allen Emerson" To: concurrency@cwi.nl (moderated) Subject: Accepted papers CAV 2000 12th International Conference on Computer Aided Verification CAV 2000 Chicago, IL USA 15-19 July 2000 http://www.cs.utexas.edu/cav2k/users/cav2k/ LIST OF ACCEPTED PAPERS: Model checking continuous-time Markov chains by transient analysis Authors: Christel Baier, Boudewijn Haverkort, Holger Hermanns and Joost-Pieter Katoen Binary Reachability Analysis of Discrete Pushdown Timed Automata Authors: Zhe Dang, Oscar H. Ibarra, Tevfik Bultan, Richard A. Kemmerer, and Jianwen Su FoCs: Automatic Generation of Simulation Checkers from Formal Specifications (Tool Paper) Authors: Yael Abarbanel-Vinov, Ilan Beer, Leonid Gluhovsky, Sharon Keidar, and Yaron Wolfsthal Temporal-Logic Queries Author: William Chan An Automata-Theoretic Approach to Reasoning about Infinite-State Systems Authors: Orna Kupferman and Moshe Y. Vardi Decision Procedures for Inductive Boolean Functions based on Alternating Automata Authors: Abdelwaheb Ayari, David Basin, and Felix Klaedtke Bounded Model Construction for Monadic Second-Order Logics Authors: Abdelwaheb Ayari and David Basin The STATEMATE Verification Environment - Making it real (Tool Paper) Authors: Tom Bienmueller, Werner Damm, and Hartmut Wittke Boolean Satisfiability with Transitivity Constraints Authors: Randal E. Bryant and Miroslav N. Velev Integrating WS1S with PVS (Tool Paper) Authors: Sam Owre and Harald Ruess VINAS-P: A tool for trace-theoretic verification of timed asynchronous circuits (Tool Paper) Author: Tomohiro Yoneda Prioritized Traversal: Efficient Reachability Analysis for Verification and Falsification Authors: Ranan Fraer, Gila Kamhi, Barukh Ziv, Moshe Y. Vardi, and Limor Fix Automatic Verification of Parameterized Cache Coherence Protocols Author: Giorgio Delzanno Distributing Timed Model Checking -- How the search order matters Authors: Gerd Behrmann, Thomas Hune, and Frits Vaandrager A Proof-Carrying Code Architecture For Java (Tool Paper) Authors: Christopher Colby, Peter Lee, and George Necula Mechanical Verification of a Generic Incremental ABR Conformance Algorithm Authors: Michael Rusinowitch, Sorin Stratulat, and Francis Klay Tuning SAT checkers for Bounded Model Checking Author: Ofer Shtrichman Regular Model Checking Authors: Ahmed Bouajjani, Bengt Jonsson, Marcus Nilsson, and Tayssir Touili A Discrete Strategy Improvement Algorithm for Solving Parity Games Authors: Jens Voege and Marcin Jurdzinski On the Completeness of Compositional Reasoning Authors: Kedar S. Namjoshi and Richard J. Trefler Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking Authors: Poul F. Williams, Armin Biere, Edmund Clarke, and Anubhav Gupta Syntactic Program Transformations for Automatic Abstraction Authors: Kedar S. Namjoshi and Robert P. Kurshan Efficient Algorithms for Model Checking Pushdown Systems Authors: Javier Esparza, David Hansel, Peter Rossmanith, and Stefan Schwoon Efficient Detection of Global Properties in Distributed Systems Using Partial-Order Methods Authors: Scott D. Stoller, Leena Unnikrishnan, and Yanhong A. Liu Verification Diagrams Revisited: Disjunctive Invariants for Easy Verification Author: John Rushby Verifying Microarchitectures that Support Speculation and Exceptions Authors: Ravi Hosabettu, Ganesh Gopalakrishnan, and Mandayam Srivas Efficient Reachability Analysis of Hierarchical Reactive Machines Authors: R. Alur, R. Grosu, and M. McDougall Liveness and Acceleration in Parameterized Verification Authors: Amir Pnueli and Elad Shahar An Abstraction Algorithm for the Verification of Generalized C-Slow Designs Authors: Jason Baumgartner, Anson Tripp, Adnan Aziz, Vigyan Singhal, and Flemming Andersen TAPS: A first-order verifier for cryptographic protocols (Tool Paper) Author: Ernie Cohen Induction in Compositional Model Checking Authors: K. McMillan, S. Qadeer, and J. Saxe Efficient Buechi Automata from LTL Formulae Authors: Fabio Somenzi and Roderick Bloem Detecting Errors Before Reaching Them Authors: Luca de Alfaro, Thomas A. Henzinger, and Freddy Y.C. Mang Counterexample-guided Abstraction Refinement Authors: Edmund Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, and Helmut Veith Model-checking for hybrid systems by quotienting and constraints solving Authors: Franck Cassez and Fran\c{c}ois Laroussinie IF: A Validation Environment for Timed Asynchronous Systems (Tool Paper) Authors: Marius Bozga, Jean-Claude Fernandez, Lucian Ghirvu, Susanne Graf, Jean-Pierre Krimm, and Laurent Mounier Are Timed Automata Updatable? Authors: Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, and Antoine Petit PET: an Interactive Software Testing Tool (Tool Paper) Authors: Elsa Gunter, Robert Kurshan, and Doron Peled Unfoldings of Unbounded Petri Nets Authors: Parosh Aziz Abdulla, S. Purushothaman Iyer, and Aletta Nylen Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits Authors: Tamir Heyman, Danny Geist, Orna Grumberg, and Assaf Schuster Building Circuits from Relations Authors: James H. Kukula and Thomas R. Shiple Formal Verification of VLIW Processors with Speculative Execution Authors: Miroslav N. Velev Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems Authors: Aurore Annichini, Eugene Asarin, and Ahmed Bouajjani XMC: A Logic-Programming-Based Verification Toolset (Tool Paper) Authors: C.R. Ramakrishnan, I.V. Ramakrishnan,Scott Smolka, Yifei Dong, Xiaoqun Du, Abhik Roychoudhury, and V.N. Venkatakrishnan From concurrency.cwi.nl Mon Mar 20 00:00:00 2000 From: "C. Michael Holloway" Subject: Call for Participation: Lfm2000 To: concurrency@cwi.nl (moderated) Call for Participation in Lfm2000 ______________________________________________________________________ Full information on Lfm2000 is available on the web at Please do not take offense at receiving multiple copies; you can pass them on to others who you think might be interested ______________________________________________________________________ You are cordially invited to attend Lfm2000: The Fifth NASA Langley Formal Methods Workshop. Lfm2000 will be held 13-15 June 2000 at the Radisson Fort Magruder Hotel & Conference Center in historic Williamsburg, Virginia. It will be the fifth in a series of meetings begun in 1990 by the formal methods team at NASA Langley Research Center with the primary purpose of bringing together formal methods researchers and practicing engineers in an environment in which each group can learn from the other. Whether you're an academic researcher, an industry engineer, an industry or government researcher, or an educator, you can benefit from attending the workshop. Come to Williamsburg in June, and bring your family, friends, and co-workers with you. We look forward to seeing you! PRELIMINARY PROGRAM Tuesday 13 June 2000 08:30-08:45 Welcome and Opening Remarks Ricky Butler & Michael Holloway, NASA Langley Research Center 08:45-09:30 Using Risk Assessments to Guide the Formal Development of Safety-Critical Systems. Chris Johnson, University of Glascow 09:30-10:00 break Modeling techniques 10:00-10:25 On Tableau Constructions for Timing Diagrams Kathi Fisler, Rice University 10:30-10:55 Abstraction Relationships for Real-Time Specifications Monica Brockmeyer, Wayne State University 11:00-11:25 Algebra of Behavior Tables Steven D. Johnson and Alex Tsow, Indiana University 11:25-01:30 lunch on your own Hybrid systems & mathematical modeling 01:30-01:55 Modeling and Validating Hybrid Systems using VDM and Mathematica Bernhard K. Aichernig and Reinhold Kainhofer, Technical University Graz, Austria 02:00-02:25 Modeling the Fault Tolerant Capability of a Flight Control System: An Exercise in SCR Specification Chris Alexander, Azimuth Inc.; Vittorio Cortellessa, Institute for Software Research; Diego Del Gobbo, West Virginia University (WVU); Ali Mili, WVU; Marcello Napolitano, WVU 02:30-02:55 Towards Formal Methods for Mathematical Modelling Ursula Martin, SRI International 02:55-03:30 break Real time analysis 03:30-03:55 Applying Model Checking & Abstraction to Verify Time Partitioning in the DEOS Scheduler Kernel John Penix and Willem Visser, NASA Ames Research Center; Eric Engstrom, Aaron Larson, and Nicholas Weininger, Honeywell Technology Center 04:00-04:25 Timing Analysis by Model Checking Dimitri Naydich and David Guaspari, Odyssey Research Associates 04:30-04:55 Modeling and Verification of Real-Time Software Using Extended Linear Hybrid Automata Steve Vestal, Honeywell Technology Center 06:30-08:30 Reception in a Civil War Redoubt Wednesday 14 June 2000 08:30-08:45 Opening Remarks (if necessary) Michael Holloway, NASA Langley Research Center 08:45-09:10 Analysis of the SPIDER Fault-Tolerance Protocols Paul Miner, NASA Langley Research Center 09:15-09:40 Aircraft Trajectory Modeling and Analysis: A Challenge to Formal Methods Victor Carreno, NASA Langley Research Center; Casar Munoz, ICASE 09:40-10:15 break Hardware specification & verification 10:15-10:40 Orpheus: A Self-Checking Translation Tool Arrangement for Flight Critical Hardware David Greve and Matthew Wilding, Rockwell Collins; Mark Bickford and David Guaspari, Odyssey Research Associates 10:45-11:10 FormalCORE(TM) PCI/32 - A Formally Verified VHDL Synthesizable PCI Core Bhaskar Bose, M. Esen Tuna, and Ingo Cyliax, Derivation Systems, Inc. 11:15-11:40 Structuring Formal Control Systems Specifications for Reuse: Surviving Hardware Changes Jeffrey M. Thompson, Mats P.E. Heimdahl, and Debra M. Erickson, University of Minnesota 11:40-01:00 lunch on your own Tutorial session 1 (Choose one of the four to attend) 01:00-03:00 Model Checking Foundations Edmund Clarke, Carnegie Mellon University 01:00-03:00 Abstract State Machines and their Industrial Employment: A Survey Egon Boerger, Microsoft Research 01:00-03:00 Formal Hardware Synthesis Using DRS Bhaskar Bose and M. Esen Tuna, Derivation Systems, Inc. 01:00-03:00 Automated First-Order Theorem Proving in Software Engineering Johann Schumann, Caelum Research 03:00-03:30 break Tutorial session 2 (Choose one of the four to attend) 03:30-05:30 Software Model Checking Tools and Trends at NASA Charles Pecheur and Willem Visser, RIACS; Reid Simmons, Carnegie Mellon University 03:30-05:30 Model Checking & Limiting State Explosion E. Allen Emerson, University of Texas at Austin 03:30-05:30 The Algebraic Specification Language CASL Markus Roggenbach, University of Bremen 03:30-05:30 Developing Correct Software with AutoFocus & Quest Oscar Slotosch, Technische Universitat Munchen Thursday 15 June 2000 08:30-08:45 Opening Remarks (if necessary) Michael Holloway, NASA Langley Research Center 08:45-09:30 Formal Methods Adoption: What's Working? What's Not! Dan Craigen, ORA Canada (invited speaker) 09:30-10:00 break Lightweight methods 10:00-10:25 Automated V&V for High Integrity Systems, A Targeted Formal Methods Approach Simon Burton, John Clark, Andy Galloway, and John McDermid, University of York 10:30-10:55 Integrating Z and Cleanroom Allan M. Stavely, New Mexico Tech 11:00-11:25 Applying Use Case Maps and Formal Methods to the Development of Wireless Mobile ATM Networks Rossana M. C. Andrade, University of Ottawa 11:25-01:30 lunch on your own Middleweight methods 01:30-01:55 Formal Analysis of the Remote Agent Before and After Flight Klaus Havelund, Recom Technologies; Mike Lowry, NASA Ames Research Center (ARC); SeungJoon Park, RIACS; Charles Pecheur, RIACS; John Penix, ARC; Willem Visser, RIACS; Jon L. White, Caelum 02:00-02:25 Taking the hol out of HOL Nancy A. Day, Oregon Graduate Institute; Michael R. Donat and Jeffrey J. Joyce, Intrepid Critical Software Inc. 02:30-02:55 An Overview of SAL Saddek Bensalem, Vijay Ganesh, Yassine Lakhnech, Casar Munoz, Sam Owre, Harald RueB, John Rushby, Vlad Rusu, Hassen Saadi, N. Shankar, Eli Singerman, Ashish Tiwari, SRI International 02:55-03:30 break Great debate 03:30-05:00 Considering the motion: "This house believes that formal methods are the only intellectually defensible means for ensuring the absence of hazardous design faults in digital systems." Participants to be announced soon. This is an event you don't want to miss! REGISTRATON INFORMATION The cost for the workshop is $US150 if you register and pay on or before 12 May 2000. This includes morning and evening snacks each day, a dinner reception on Tuesday evening, a printed copy of the proceedings, and a CD version of the proceedings. (Menus will be posted eventually.) The cost for those registering or paying after 12 May 2000 is $US300. You may purchase additional reception tickets for guests at $US35 per guest. All fees must be paid by check (U.S. funds only) made payable to "NASA Langley Conference Center". A limited number of student discount registrations are available. See the web site for information. Please register through the web if possible; otherwise, contact the Lfm2000 Chairman for alternate means of registering. Hotel Reservations You are responsible for making your own hotel reservations at the Radisson Fort Magruder Hotel & Conference Center. The rate is US$99 (U.S. Government Per Diem Rate) per night single or double occupancy. To receive the conference discount, you need to make your reservation by 22 May 2000. The toll-free reservations number is 1.800.333.3333. The reservations fax number is 1.757.221.6982, and the direct number to the hotel is 1.757.220.2250. When making your reservations, please identify yourself as a participant in The Fifth NASA Langley Formal Methods Workshop. - --- C. Michael Holloway, Lfm2000 Chairman NASA Langley Research Center, Mail Stop 130, Hampton VA 23681-2199 From concurrency.cwi.nl Mon Mar 27 00:00:00 2000 From: "J. Nuno Oliveira" To: concurrency@cwi.nl (moderated) Subject: FME 2001: Call for Papers FORMAL METHODS EUROPE FME 2001 "Formal Methods for Increasing Software Productivity" International Symposium and Tutorials 12-16 March 2001 Humboldt-Universitaet zu Berlin, Germany (http://www.informatik.hu-berlin.de/top/fme2001) Call for Submissions ******************** FME 2001 is the tenth in a series of symposia organised by Formal Methods Europe, an independent association whose aim is to stimulate the use of, and research on, formal methods for software development. These symposia have been notably successful in bringing together a community of users, researchers, and developers of precise mathematical methods for software development. The theme of FME 2001 is Formal Methods for Increasing Software Productivity. This theme recognizes that formal methods have the potential to do more for industrial software development than enhance software quality--they can also increase productivity at many different points in the software life-cycle. The symposium committee is particularly interested in papers on the use of formal methods to increase productivity, for example on: * Codifying domain knowledge * Re-using components * Automatically generating code and/or documentation * Improving the efficiency of software testing * Enhancing analysis techniques for validation and verification * Exploiting commonalities within product families * Improving the maintainability and modifiability of software * Empirical studies of effects on productivity SCOPE The scope of the symposium, as always in its distinguished history, also includes all other aspects of the use of formal methods, for development of software in all application areas. The scope of the symposium covers the entire range from fundamental theory of description and reasoning to particulars of practice and experience. In addition to presentations of submitted papers, the symposium will also offer tutorials, workshops, invited speakers, and tool demonstrations. PAPERS The symposium committee solicits full-length papers in two broad categories: 1. Use of formal methods, including reports on industrial use, substantial case studies, comparisons among methods, education, and technology transfer. 2. Development of formal methods, including motivating factors, theoretical foundations, extensions, manual procedures, and tool support. Authors are requested to mention the category (1 or 2) of their papers when they submit. Full papers should be submitted in Postscript or PDF format by E-mail to reach fme2001sub@di.uminho.pt by 25th August, 2000. There are no fixed page limits on submissions but authors are warned that papers exceeding twenty A4 pages will be regarded as long, and that the content must justify the length. TUTORIALS Tutorials will be held on 12-13th March. Each tutorial will last one-half or one day. Proposals for tutorials are welcome, and should be directed to the programme chairs. WORKSHOPS Proposals for parallel workshops are welcome, and should be directed to the programme chairs. TOOL DEMONSTRATIONS Tool demonstrations will take place during the symposium, with the opportunity for presentations to be made about each tool. Proposals for tool demonstrations are welcome and should be made to the organising chairs, with whom provision of necessary computing facilities should be discussed. PEOPLE Organising Co-Chairs Stefan Jaehnichen Wolfgang Reisig Organising Committee BWO Marketing Service Birgit Heene Adrianna Foremniak Axel Martens Programme Co-Chairs Jose Oliveira, Dept. Informatica, Universidade do Minho, Campus de Gualtar, 4700-320 Braga, Portugal Tel: +351 253 604 470 E-mail: jno@di.uminho.pt Pamela Zave, AT&T Laboratories, 180 Park Avenue, Florham Park, NJ 07932, USA Tel: +1 973 360 8676 E-mail: pamela@research.att.com Programme Committee Eerke Boiten University of Kent at Canterbury Rick Butler NASA Langley Research Center Lars-Henrik Eriksson Industrilogik L4i AB John Fitzgerald Centre for Software Reliability, Newcastle, UK Peter Gorm Larsen IFAD Yves Ledru Universite Joseph Fourier - Grenoble Dominique Mery Universite Henri Poincare - Nancy Jayadev Misra University of Texas at Austin Richard Moore United Nations University IIST Friederike Nickl F.A.S.T. GmbH Tobias Nipkow Technische Universitaet Muenchen Jose Oliveira (co-chair) Universidade do Minho Paritosh Pandya TIFR Mumbai, India Nico Plat Cap Gemini Amir Pnueli Weizmann Institute Augusto Sampaio Universidade Federal de Pernambuco Steve Schneider Royal Holloway, University of London Jim Woodcock Oxford University Pamela Zave (co-chair) AT&T Laboratories IMPORTANT DATES Deadline for submission of papers, tutorial proposals, and workshop proposals: 25th August, 2000 Notification of acceptance/rejection: 17th November, 2000 Camera ready final version of papers due: 5th January, 2001 From concurrency.cwi.nl Mon Apr 3 00:00:00 2000 From: Dr Joseph Ng To: concurrency@cwi.nl (moderated) Subject: RTCSA 2000 CALL FOR PAPERS (Deadline 15 July, 2000) This is the CFP (Call for Papers) of RTCSA 2000 which will be held in Cheju Island, South Korea during 12-14 Dec. 2000. Please refer to our home page at: http://rtlab.kaist.ac.kr/~rtcsa/ The paper due date is July 15, 2000. With best regards, Joseph Ng Publicity Co-Chair, RTCSA 2000 Organizing Committee. ====================================================================== CALL FOR PAPERS (DEADLINE to JULY 15, 2000) The 7th International Conference on Real-Time Computing Systems and Applications (RTCSA 2000) December 12-14, 2000, Cheju KAL Hotel, Cheju Island, South Korea. Co-sponsored by Advanced Information Technology Research Center(AITrc), Korea Information Science Society (KISS) and Information Processing Society of Japan (IPSJ) In cooperation with the IEEE Computer Society, Technical Committee on Real-Time Systems (approval pending) ========================================================================= Conference Home Page: http://rtlab.kaist.ac.kr/~rtcsa/ ========================================================================= Scope of the Conference RTCSA 2000 will bring together researchers and developers from academia and industry for advancing the technology of real-time computing systems and applications. The conference has the following goals: 1. to investigate advances in real-time systems and applications; 2. to promote interaction among real-time systems and applications; 3. to evaluate the maturity and directions of real-time system technology. Conference attendees will explore the best current ideas on real-time computing systems and applications. Papers describing new ideas, promising approaches, experiences with practical and research systems, and work in progress are considered particularly appropriate. Proposals for panel sessions are also solicited. Papers on all aspects of real-time systems are welcome, including (but not limited to) scheduling and resource management, real-time requirements and designs specification, formal methods, modeling, operating systems, databases, file systems, networks and communications, multimedia applications, software systems, programming languages and programming environments, architecture, middleware and APIs, instrumentation, fault tolerance, software engineering, performance analysis, signal-processing, embedded systems, distributed control, responsive systems and mission-critical systems, computer-based control applications, tool support, case studies, and any core application area in real-time systems. Submissions Papers should describe original research, and should not exceed 20 double-spaced pages (or approximately 5000 words). All accepted submissions will appear in the proceedings published by IEEE Computer Society Press. If possible, submissions should be made electronically, either in postscript or PDF format. The cover page should contain the title, author's full name(s), affiliation, address, telephone number, fax number, e-mail address, an abstract and keywords. Details on submission guidelines will be posted at the RTCSA'00 web page (http://rtlab.kaist.ac.kr/~rtcsa). While electronic submissions are preferred, postal submissions will be accepted for review, provided they arrive by the submission deadline of July 15, 2000. All authors taking this option should mail four(4) copies of their submitted papers to the Program Chair: A text file containing paper title, full name, affiliations, complete addresses, phone and fax numbers, email addresses, and an abstract of up to 150 words should also be emailed to the Program Chair. Dr. Heung-Kyu Lee Department of Electrical Engineering and Computer Science Korea Advanced Institute of Science and Technology(KAIST) 373-1 Gusong-dong, Yusong-gu, Taejon, 305-701, South Korea Phone: +82-42-869-3526 Fax: +82-42-869-3510 Email: hklee@rtlab.kaist.ac.kr URL: http://rtlab.kaist.ac.kr/~hklee Dr. Tei-Wei Kuo Department of Computer Science and Information Engineering National Chung Cheng University Chia-yi, Taiwan 621, ROC Phone: +886-52720411 ext. 6170 Fax: +886-52720859 Email: ktw@cs.ccu.edu.tw URL: http://www.cs.ccu.edu.tw/~ktw/ ========================================================================= Important Dates July 15, 2000 ---------------- Deadline for paper submissions September 5, 2000 ------------ Notification of acceptance October 1, 2000 -------------- Camera-ready due December 12-14, 2000 -------- RTCSA 2000, Korea ========================================================================= Organizing Committee General Co-Chairs: Hans A. Hansson , MalardalenU, Sweden Gil-Rok Oh, ETRI, Korea Program Co-Chairs: Heung-Kyu Lee, KAIST, Korea Tei-Wei Kuo, NCCU, Taiwan Treasurers: Kihyun Pyun, KAIST, Korea Naehyuck Chang, SeoulU, Korea Publicity co-chairs: Joseph Ng, HKBU, Hong Kong Kenji Toda, ETL, Japan Yau-Hwang Kuo, NCKU, Taiwan Young-Kuk Kim, ChoongnamU, Korea Local Arrangements: Jung-Hoon Lee, ChejuU, Korea Bong-Kyu Lee, ChejuU, Korea ========================================================================= Steering Committee: Heonshik Shin (Korea) Hideyuki Tokuda (Japan) Insup Lee (USA) Jane Liu (USA) Kang Shin (USA) Kenji Toda (Japan) Sang Hyuk Son (USA) Seung-Kyu Park (Korea) ========================================================================= Program Committee: Benjamin Kao (Hong Kong) Byung Kook Kim (Korea) Chae-Kyu Kim (Korea) Cheng Chang (Taiwan) Chih-wen Hsueh (Taiwan) Colin Fidge (Australia) Doo-Hwan Bae (Korea) Farn Wang (Taiwan) Francis Chin (Hong Kong) Gerhard Fohler (Sweden) Gilbert H. Young (Hong Kong) Giorgio Buttazzo (Italy) Heonshik Shin (Korea) Heung-Kyu Lee(Korea) Heung-Nam Kim (Korea) Hiroaki Takada (Japan) Ichiro Suzuki (USA) Jae-Heon Yang (Korea) Jennifer Hou (USA) Jin Chen (Taiwan) Jin-Young Choi (Korea) John Stankovic (USA) Jorgen Hansson (Sweden) Joseph Ng (Hong Kong) Kam-Yiu Lam (Hong Kong) Kenji Ishida (Japan) Kwei-Jay Lin (USA) Laurent Hazard (France) LihChyun Shu (Taiwan) Pyeongsoo Mah (Korea) Qing Li (Hong Kong) Riccardo Bettati (USA) Samuel Chanson (Hong Kong) Sang Lyul Min (Korea) Sten F. Andler (Sweden) Seongsoo Hong (Korea) Tatsuhiro Tsuchiya (Japan) Tatsuo Nakajima (Japan) Wei Zhao (USA) Wei-Kuan Shih (Taiwan) Weijia Jia (Hong Kong) Yann-Hang Lee (USA) Yasushi Wakahara (Japan) Yukikazu Nakamoto (Japan) From concurrency.cwi.nl Fri Mar 31 00:00:00 2000 From: Colin Stirling To: concurrency@cwi.nl (moderated) Subject: PhD Position, Edinburgh, GB Division of Informatics, Edinburgh Institute of Systems Architecture/Laboratory for Foundations ofComputer Science PhD in Model Checking Group Protocols Applications are sought for a PhD studentship, funded by UK EPSRC for three years starting September 2000. The studentship covers university fees and includes a maintenance award. Applicants domiciled outside the UK are eleigible for this award. The research is intended to cover analysis of protocols for group agreement (such as commit protocols). Current work in this particular area at Edinburgh can be found at http://www.dcs.ed.ac.uk/home/tdk/projectpage.html If you are interested please get in touch with one of the team. Tim Kempster (tdk@dcs.ed.ac.uk) Colin Stirling (cps@dcs.ed.ac.uk) Peter Thanisch (pt@dcs.ed.ac.uk) From concurrency.cwi.nl Thu Mar 30 00:00:00 2000 From: Dave Schmidt Subject: POPL2001: Call for Papers To: concurrency@cwi.nl (moderated) ***************************************************** * CALL FOR PAPERS * * * * The 28th Annual ACM SIGPLAN-SIGACT Symposium on * * Principles of Programming Languages * * London, January 17-19, 2001 * * * ***************************************************** See http://www.daimi.au.dk/~popl01/ The 28th symposium on Principles of Programming Languages (POPL'01) will address fundamental principles and important innovations in the design, definition, analysis, and implementation of programming languages, programming systems, and programming interfaces. Both practical and theoretical papers are welcome. Papers on a diversity of topics are encouraged, particularly ones that point out new directions. POPL'01 is not limited to topics discussed in previous symposia. Authors concerned about the appropriateness of a topic may communicate with the program chair prior to submission. Papers are to be submitted in the form of an extended abstract of 5000 words or less (excluding bibliography and figures). Submissions will be judged on originality, significance, correctness, and clarity. The summary should clearly express the contribution of the paper, both in general and in technical terms. It is essential to identify what was accomplished, describe its significance, and explain how the paper compares with and advances previous work. Authors should make every effort to make the technical content understandable to a broad audience. Authors should bear in mind that individual program-committee members will be asked to referee approximately 40-50 extended abstracts. While every effort will be made to assign submissions to an appropriate subset of the program committee, very few papers are likely to be reviewed solely by experts in a paper's topic area. A good rule of thumb is that an informed colleague (with expertise in programming languages) should be able to form an initial judgement of the technical content of a submission in 40 minutes. Submitted papers must describe work unpublished in refereed venues and not submitted for publication elsewhere (i.e., either a conference or a journal). Papers that are too long or are submitted too late (see below) will be rejected by the program chair. ************************************************************ * For electronic submissions, papers must be received by * * 13:00 UTC (GMT), Monday, July 17, 2000 * ************************************************************ This is a hard deadline. The submissions will be carried out via the Web (a link to the web-page will be available in June 2000). Extended abstracts must be submitted as Postscript documents that are interpretable by Ghostscript, or in PDF format, and they must be printable on both A4 paper and US-letter; to facilitate this, extensive use of special fonts and colours should be avoided. Authors who cannot meet these requirements should contact the program chair. These are firm constraints; submissions not meeting the criteria described above will not be considered. Receipt of the submissions will be acknowledged. Authors are responsible for inquiring about the lack of a prompt acknowledgement. Submissions lost or received late due to unusual circumstances might not be considered. Notification of the acceptance or rejection of papers will be given by Wednesday, September 27, 2000. Final versions of accepted papers must be received by Monday, November 7, 2000. Authors of accepted papers will be required to sign ACM copyright release forms. Program chair: Hanne Riis Nielson Aarhus University and Saarland University Email: popl01@cs.uni-sb.de General chairs: Chris Hankin Dave Schmidt Imperial College, London Kansas State University Email: clh@doc.ic.ac.uk Email: schmidt@cis.ksu.edu Program committee: Evelyn Duesterwald, Hewlett-Packard Labs Susan L. Graham, University of California, Berkeley Robert Harper, Carnegie Mellon University Manuel Hermenegildo, Technical University of Madrid Simon Peyton Jones, Microsoft Research Paul Klint, CWI Greg Morrisett, Cornell University Hanne Riis Nielson, University of Aarhus Bengt Nordstrom, Chalmers University Christian Queinnec, University of Paris 6 Mooly Sagiv, Tel Aviv University Bernhard Steffen, University of Dortmund Jan Vitek, Purdue University Phillip Yelland, SUN Microsystems From concurrency.cwi.nl Wed Mar 22 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: FICS 2000, change in submission guidleines From: esik (researcher;Itou Masami) FIXED POINTS IN COMPUTER SCIENCE (FICS 2000) July 22-23, 2000, Paris, France Call for Papers: http://www.liafa.jussieu.fr/~ig/FICS.html * Fixed points play a fundamental role in several areas of computer science and logic by justifying induction and recursive definitions. The construction and properties of fixed points have been investigated in many different frameworks. The aim of the workshop is to provide a forum for researchers to present their results to those members of the computer science and logic communities who study or apply the fixed point operation in the different fields and formalisms. * Invited speakers: S. Bloom, B. Courcelle, H. Marandjian, J. Rutten, I. Walukiewicz. * Paper submission: Electronic submissions in the form of uuencoded postscript file are encouraged and should be sent in duplicate to ***both*** ig@liafa.jussieu.fr **and** esik@inf.u-szeged.hu Authors can also send 3 copies of an abstract not exceeding 3 pages to the PC chair. Submissions are to be received before April 3, 2000. Authors will be notified of acceptance by June 1, 2000. From concurrency.cwi.nl Tue Mar 28 00:00:00 2000 From: "Ganesh C. Gopalakrishnan" To: concurrency@cwi.nl (moderated) Subject: CFP: Workshop on Advances in VErification (Post-CAV 2000) CALL FOR PAPERS Workshop on Advances in VErification (post-CAV 2000 Workshop) 20 July 2000 Chicago, USA The purpose of this workshop is to provide an informal forum for the presentation of recent work, work-in-progress, and even highly speculative work on all aspects of mechanical program verification. Topics of interest include specification methods (specification languages, modeling frameworks, logics), verification methods (model checking, theorem proving, etc. ), applications and case studies (hardware verification, communication protocol verification, etc.), tools, practical aspects of verification, and theoretical foundations. Note: The only topics not sought for this workshop are security and symbolic trajectory evaluation; those should be submitted to the speciality workshops affiliated with CAV 2000. It is anticipated that the program will entail short talks (15 minutes), longer talks (30 minutes), tool demonstrations, and a roundtable discussion. Paper submission: An extended abstract (about 5-10 pages) explaining recent research results or work in progress should be mailed electronically to wave2000@cs.utah.edu, to be received by 21 April 2000. Submissions should be formatted as a PostScript file in USLetter or A4 size. Authors will be notified of acceptance or rejection by 21 May 2000. Final versions of accepted papers will be due by 21 June 2000. These papers will be collected and distributed in an informal proceedings to be made available at the workshop. It is anticipated that most of the contributions will appear later in more polished form in refereed conferences and journals. DATES: Submissions: April 21, 2000 Notification: May 21, 2000 Final papers: June 21, 2000 Workshop: July 20, 2000 WEBSITE: www.cs.utah.edu/wave PROGRAM COMMITTEE: Rajeev Alur, U. Penn David Dill, Stanford Patrice Godefroid, Bell Labs Ganesh Gopalakrishnan, Utah Mike Gordon, Cambridge Ken McMillan, Cadence Berkeley Labs Fabio Somenzi, Colorado ORGANIZING COMMITTEE: E. Allen Emerson A. Prasad Sistla --- From concurrency.cwi.nl Tue Mar 28 00:00:00 2000 Received: from CSDAlpha2.sbu.ac.uk (csdalpha2.sbu.ac.uk [136.148.1.111]) by hera.cwi.nl with ESMTP id QAA12104 for ; Tue, 28 Mar 2000 16:40:05 +0200 (MET DST) Received: from CSDAlpha1.sbu.ac.uk (csdalpha1.sbu.ac.uk [136.148.1.1]) by CSDAlpha2.sbu.ac.uk (8.9.3/8.8.8) with ESMTP id OAA00434; Tue, 28 Mar 2000 14:37:54 GMT Received: from guyc by CSDAlpha1.sbu.ac.uk (8.8.8/1.1.22.3/22Jul99-1031PM) id PAA0000024086; Tue, 28 Mar 2000 15:37:50 +0100 (BST) Message-Id: <3.0.6.32.20000328153505.012825d0@unix.sbu.ac.uk> X-Sender: guyc@unix.sbu.ac.uk X-Mailer: QUALCOMM Windows Eudora Light Version 3.0.6 (32) Date: Tue, 28 Mar 2000 15:35:05 +0100 To: tc-1@cs.unibo.it, seworld@cs.colorado.edu, agents@cs.umbc.edu, ecoop-info@ecoop.org, softwarequalitaet@uni-koeln.de, ooui@man.cs.ac.uk, oose@uni-paderborn.de, ISWORLD@Danann.hea.ie, infolist@informatik.hu-berlin.de, concurrency@cwi.nl, lotos-world@sanson.dit.upm.es, theorynt@listserv.nodak.edu, dbworld@cs.wisc.edu From: Guy D Carter Subject: Call for Papers/Participation Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Call for Papers and/or Participation ======================================= (apologies for any duplication of mail) Are you involved in the mamagement of O-O system development? Are you working with the 'latest O-O tools/technigues'? Are you pushing back the O-O development frontiers? Are you frustrated with the lack of management within O-O systems development? Participate in our workshop at TOOLS USA, 2000 Workshop -------- Project Management of Object-Oriented Developed Systems 2 www.cios.sbu.ac.uk/pmtools2 to be held at TOOLS USA 2000, July 31 - Aug 3, 2000 http://www.tools.com/tools/usa/index.html Workshop Theme --------------- The ongoing evolution in object-oriented software development techniques has provided the designers with the potential for delivering quality software. However this potential can only be released with an integrated, holistic approach to O-O design and development. Software that will 'serve society' must address the strategic issues of O-O system development within a business environment and ensure that all the successful O-O techniques are drawn together and managed as one strategy to meet business requirements. The TOOLS USA 99 Project Management (PM) workshop addressed the general issues of producing a PM strategy for the planning and management of an O-O developed system. The TOOLS USA 2000 workshop intends to build upon those issues and specifically address two major areas of O-O development - management of the process components and matching these to business requirements. Advances in the individual O-O process components, such as architecture, frameworks and patterns have provided the O-O developer with a set of techniques for producing quality systems. However without facilities to map these individual techniques to analysis and design, and hence management, throughout the development life cycle leaves a product without a quality guarantee. Furthermore a solid, holistic, quantified approach to analysis and design is imperative to mapping a system to the business requirements The workshop should draw together participants from academia and industry, who have experience of managing the O-O process components throughout the development life cycle and/or an interest in the capture and modelling of business requirements associated with the stages of development, from initiation to delivery of SW, of O-O systems. Areas of interest within the management of O-O systems development include: - capture and modelling business requirements - mapping process components to analysis and design - holistic approach toward one management strategy. Length of Workshop: Half-Day Workshop Organisers Primary Contact GUY CARTER is a Lecturer in Information Systems in the School of Computing, Information Systems and Mathematics, at South Bank University , London, England. His teaching interests include Object Oriented Information Systems, Systems Analysis and Design and Project Management. His primary research interest is Project Management of IS. email: guyc@sbu.ac.uk fax: +44 (0) 20 7815 7499 DILIP PATEL is the Head of the Centre for Information and Organisation Studies and Lecturer in Information Systems in the School of Computing, Information Systems and Mathematics, at South Bank University , London, England. His teaching interests include Object Oriented Information Systems, Software Engineering, Systems Analysis and Design and Project Management. His research interests span Information and Business Modelling and Databases. He is a founder member of the Object Oriented Information Systems conference series, and annually organises a Workshop on Business Objects at the OOPSLA conference. dilip@sbu.ac.uk Call for Papers An electronic copy (MSWord) should be sent to the Organiser. (1) Name, affiliation, and complete address for each author. (2) A designated contact person including their telephone number and e-mail. (3) A designated presenter, should the paper be accepted. In order to appear in the Proceedings papers need to comply with the given dates, however non-published papers/contributions for workshop participation will be welcome up to July 7, 2000. Papers should be 4-10 pages (double-spaced) in length, suitable for presentation in 15 minutes. Short papers need not make such a substantial contribution to the field, and in particular may report work in progress, or describe an industrial application, developed using tried techniques. . In order to appear in the Proceedings papers must be submitted by May 5, 2000. Authors will be notified of acceptance or rejection by May 19, 2000, and will be given instructions for final preparation of their papers at that time, the camera-ready copy must reach the Organisers by May 22, 2000. IMPORTANT DATES (for publication) Closing date for submission: May 5, 2000 Notification of acceptance: May 19, 2000 Camera-ready copy: May22, 2000 Guy D Carter Course Director School of Computing, Info Sys & Maths South Bank University Borough Road London SE1 0AA England email: guyc@sbu.ac.uk phone: +44 (0) 20 7815 7406 fax : +44 (0) 20 7815 7499 From concurrency.cwi.nl Mon Mar 27 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: PhD Studentship - Cambridge From: Peter Sewell PhD Studentship Wide-area programming: Language, Semantics and Infrastructure Design Computer Laboratory, University of Cambridge We are seeking applicants for a PhD studentship on the EPSRC-funded project Wide-area programming: Language, Semantics and Infrastructure Design The project is studying the foundations of distributed programming, looking at problems of distributed infrastructure, security, failure, and modularity in the context of language design, implementation and semantics. Experience in semantics, distributed systems and/or language implementationwould be advantageous. See http://www.cl.cam.ac.uk/users/pes20/advert-phd.html for more details. The project is associated with the Theory and Semantics and Opera (Distributed Systems) groups of the University of Cambridge Computer Laboratory. For general information about the Computer Laboratory and its research see http://www.cl.cam.ac.uk/. Peter Sewell Robin Milner James Leifer From concurrency.cwi.nl Mon Apr 3 00:00:00 2000 From: Maryse Renaud To: concurrency@cwi.nl (moderated) Subject: offre d'emploi (=job offer) INRIA Sophia Antipolis opens one Research and Development Engineer position (2-year contract) to join the Formavie project (formal methods for smartcard security, in partnership with Bull and Schlumberger). See http://www.inria.fr/oasis/Formavie If any question, please contact: Isabelle Attali INRIA Sophia Antipolis ia@sophia.inria.fr Tél: (33) 4 92 38 79 10 Fax: (33) 4 92 38 79 71 From concurrency.cwi.nl Mon Apr 10 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: Postdoc position at the University of Pennsylvania From: Insup Lee Postdoctoral Research Position in Software Engineering for Hybrid Systems A postdoctoral research position is available in the context of CHARON, a joint project in hybrid systems between the Systems Design Research Lab (SDRL at www.cis.upenn.edu/sdrl/) and the Robotics Lab (GRASP at www.cis.upenn.edu/~grasp/) at the University of Pennsylvania. Applications are invited from candidates with background and interest in hybrid systems, software engineering, reactive programming, formal methods, or robotics. The project involves multiple aspects: developing high-level modeling language for multiagent hybrid systems, simulation, code generation, formal verification, runtime monitoring, and design and implementation of control algorithms. The primary application of interest is high-level programming, control, and sensing of interacting autonomous robots. Visit the homepage (www.seas.upenn.edu/~jme/Hybrid_Sys.html) of our hybrid systems group for an introduction to the current activities. The University of Pennsylvania is an Ivy League university located near the center of Philadelphia. The School of Engineering and Applied Sciences has strong groups in software systems (SDRL) and robotics (GRASP) with many related research projects. The appointment can be upto two years starting Summer/Fall 2000. Please email enquiries and applications to Rajeev Alur (alur@cis.upenn.edu), Vijay Kumar (kumar@cis.upenn.edu), Insup Lee (lee@cis.upenn.edu), or George Pappas (pappasg@grip.cis.upenn.edu). ========= Insup Lee Professor 262 Moore email: lee@cis.upenn.edu Department of Computer and Information Science tel: (215) 898-3532 University of Pennsylvania fax: (215) 573-7362/573-8190 Philadelphia, PA 19104-6389 http://www.cis.upenn.edu/~lee ========= From concurrency.cwi.nl Mon Apr 10 00:00:00 2000 From: Cardell-Oliver R To: concurrency@cwi.nl (moderated) Subject: Lecturers/Senior Lecturers in Logic and Formal Methods, ESSEX, UK UNIVERSITY OF ESSEX, COLCHESTER, UK DEPARTMENT OF COMPUTER SCIENCE *** LECTURER/SENIOR LECTURERS IN LOGIC AND FORMAL METHODS *** *** Closing date: 30 April 2000 *** The Department of Computer Science is currently advertising FIVE new permanent posts, as part of a research-led expansion. The Department has research groups in logic and formal methods, robotics and intelligent machines, adaptive computing, distributed information systems, multi-agent systems, numerical computation and quality video over IP networks. Research in the logic and formal methods group includes set theoretic specification, constructive set theories, foundations of Z, program development and specification refinement in Z-lambda, and formal methods for real-time and hybrid systems. Tools being used in the group include the Isabelle theorem prover and Uppaal model checker. For further information see our research web pages from http://cswww.essex.ac.uk/ Informal enquiries to myself (cardr@essex.ac.uk), Prof Ray Turner (turnr@essex.ac.uk) or the Head of Department, Anne de Roeck (deroe@essex.ac.uk) are most welcome. Further details for the posts can be found on http://www2.essex.ac.uk/personnel/vacancies/651.htm From concurrency.cwi.nl Mon Apr 10 00:00:00 2000 From: Franck Cassez To: concurrency@cwi.nl (moderated) Subject: [second announcement] summer school MOVEP'2k MOVEP'2k 4th International Summer School on MOdelling and VErification of Parallel Processes June 19-23, 2000 Nantes, France School URL: http://www.ircyn.ec-nantes.fr/movep SCOPE OF THE SCHOOL __________________________________________________ The purpose of the MOVEP'2k summer school is to bring together researchers, students and people from industry working in the area of verification of concurrent systems. The topics of the school encompass various subjects such as Petri nets, model-checking, timed systems, mobile processes etc. PROGRAMME ____________________________________________________________ Six tutorials and six short talks will be given by recognized scientists (see the web site for details). Tutorials (1:30) Ed Brinksma (U. of Twente, NL) & Alex Petrenko (CRIM, Montreal, Ca) Testing. Javier Esparza (TU. of Muenchen, G) Infinite systems. Kim Larsen & Paul Pettersson (BRICS, Aalborg, DK) Timed and hybrid systems. Stephan Merz (U. of Muenchen, G) Model-Checking John Rushby (SRI, USA) Theorem proving. Antti Valmari (Tampere U. of Tech., Fin) Composition and abstraction Talks (1:00) Philippe Darondeau (IRISA, Rennes, F) Message Sequence Charts and Petri Nets. Manuel Silva (Universidad de Zaragoza, SP) Design and Operation of Manufacturing Systems: A Petri Nets based view Dominique Bolignano (Trusted-Logic, F) Security for Distributed systems. Silvano Dal Zilio (Microsoft, Cambridge, UK) Mobile Processes. Joseph Sifakis (VERIMAG, Grenoble, F) Construction of Live Timed Systems. Alessandro Cimatti (IRST, Trento, I) Industrial applications of model-checking. CALL FOR PAPERS ______________________________________________________ PhD. Students are invited to give a short talk about their work (even if it is in progress or just begining) and should submit an abstract before april 30th, 2000. See the web site for guidelines. SPECIAL SESSIONS _____________________________________________________ There will be special sessions devoted to PhD students' talks. Moreover three other sessions focussed on European projects (Mars, CRISYS and FIREworks) relevant to the themes of MOVEP will take place as well. SCOLARSHIPS __________________________________________________________ Some scholarships for PhD students will be available to cover part of travel and accomodation expenses. See the web site for the application procedure (deadline for application is april 30th). REGISTRATION _________________________________________________________ Registration to the School will commence in March 2000. The registation forms are available from the web site. ______________________________________________________________________ School Organizers: Franck Cassez (IRCyN/CNRS, Nantes, F), Claude Jard (IRISA/CNRS, Rennes, F) Brigitte Rozoy (LRI, Orsay, F) Mark Ryan (Univ. Birmingham, UK) From concurrency.cwi.nl Fri Apr 7 00:00:00 2000 From: Matthias Klusch To: klusch@cs.vu.nl Subject: CIA-2000 Call for Participation ****************************************************** First Call for PARTICIPATION Fourth International Workshop CIA-2000 on COOPERATIVE INFORMATION AGENTS July 7 - 9, 2000 Boston Park Plaza Hotel, Boston, USA http://www.dfki.de/~klusch/cia2000.html ****************************************************** This workshop is sponsored in part by NASA Goddard Space Flight Center, USA. Swiss Life, Switzerland. IFMAS International Foundation of Multiagent Systems. INVITED TALKS ------------- This year's CIA workshop again offers its participants an exclusive sequence of 8 invited talks of excellent, worldwide known experts in the field. The talks are devoted to the potential future of information agents as considered from different perspectives. * Jeff Kephart (IBM Thomas Watson Research Center, USA) Collaborating Rational Agents for Next-Generation E-Commerce. * Rosalind W. Picard (MIT Media Arts and Sciences, USA) Affective Computing for Future Agents. * Elisabeth Andre (DFKI Intelligent User Interfaces Lab, Germany) Life-Like Synthetic Characters in the Internet: The Future Landscape. * Todd Papaioannu (Loughborough University, MSI, UK) Mobile Information Agents for Cyberspace - State of the Art and Visions. * Richard J. Doyle (NASA JPL, USA) Inspiration for Future Autonomous Space Systems. * Jan Treur (Free University of Amsterdam, The Netherlands) Design of Collaborative Information Agents. * Paul Davidsson (University of Karlskrona/Ronneby, SOCS, Sweden) Emergent Societies of Information Agents in Future Cyberspace. * Frank Dignum (Technical University of Eindhoven, The Netherlands) Advanced Communication of Collaborating Information Agents. PROGRAM & PROCEEDINGS --------------------- In addition to the invited talks CIA-2000 offers you 14 regular high-quality talks which will report on recent progress in the area of intelligent information agents. Updated information on the preliminary program can be found at: http://www.dfki.de/~klusch/cia2000prog.html The CIA workshop proceedings are published in the Springer LNAI series (LNAI vol. 1202, 1435, 1652). Proceedings of CIA-2000 workshop will be available at the workshop. REGISTRATION ------------ The 4th intl CIA-2000 workshop is a federated event of and hosted by the 4th intl conference on Multiagent Systems ICMAS-2000. CIA-2000 registration fee amounts to - Early (Received By May 1, 2000): 250 USD - Late (Received After May 1, 2000): 300 USD - On-Site: 350 USD Subtract $25 if you are also registering for ICMAS-2000 conference. Registration fee entitles individual participant to complete access to to CIA-2000 Workshop on Cooperative Information Agents, and associated proceedings and events. For registration please fill in and send, fax or email registration form to be obtained at the workshop's web page: http://www.dfki.de/~klusch/cia2000register.html or at ICMAS-2000 web page: http://icmas.lania.mx/ to ICMAS-2000,c/o Professor Michael N. Huhns Electrical Eng. and Computer Science Dept. University of South Carolina, Columbia, SC 29208 USA Fax: +1-803-777-8045 email: huhns@sc.edu LOCATION & ACCOMODATION ----------------------- Since CIA-2000 workshop is a federated event of ICMAS-2000 conference. Both, CIA-2000 and ICMAS-2000, share the same conference site which is the Boston Park Plaza Hotel in Boston, USA: http://www.bostonparkplaza.com/ The ICMAS-2000 organizers have arranged special room rates with the Boston Park Plaza Hotel. These rates (excluding applicable taxes) per night are $160 (single), $180 (double), $375+ (suite). Additional persons are $20 per night. Rollaway beds are in addition subject to a $25 fee per stay. For less expensive hotels in the Boston city area you may check, for example, the Boston City Guide (including hotels): http://www.worldexecutive.com/cityguides/boston/maps.html or the Boston Hotel Guide: http://boston.hotelguide.net/ Please note: Rooms in Boston are already scarce in coming July, as it is a very busy time. It is highly recommended to make your room reservations as early as possible! CONTACT ------- Matthias Klusch German AI Research Center (DFKI GmbH) Stuhlsatzenhausweg 3, 66123 Saarbrücken, Germany Tel.: +49-681-302-5297 Fax: +49-681-302-2235 EMail: klusch@dfki.de To: concurrency@cwi.nl (moderated) Subject: Call for Participation: Workshop on Proof-Carrying Code From: Trevor Jim CALL FOR PARTICIPATION: PCC 2000 Tutorial Workshop on Proof-Carrying Code University of California, Santa Barbara, USA Wednesday, June 28, 2000 -- Thursday, June 29, 2000 http://www.research.att.com/~conf/PCC2000/ The Workshop on Proof-Carrying Code aims to foster discussion and collaboration between implementors of proof-carrying code systems and researchers in the foundational areas of logic, static analysis, programming language semantics, compilers, type theory, and theorem proving. It will be held on Wednesday and Thursday, June 28-29, 2000 at the University of Santa Barbara, California, USA, between LICS 2000 (26 to June 29) and SAS 2000 (29 June to 1 July). Tutorials and reports on work in progress will be given by invited speakers, including Karl Crary Amy Felty Greg Morrisett George Necula Atsushi Ohori Additional contributions are solicited. Appropriate topics include (but are not limited to): * certifying compilers * type systems, safety policies, and security policies in proof-carrying code systems * efficient proof checking * compact proof representations * secure mobile code frameworks Interested parties should contact the organizer. CONTACT INFORMATION Workshop home page: http://www.research.att.com/~conf/PCC2000/ Organizer: Trevor Jim Web: http://www.research.att.com/~trevor/ E-mail: trevor@research.att.com Phone: 973-360-8175 Fax: 973-360-8077 Address: AT&T Shannon Laboratory 180 Park Avenue Florham Park, NJ 07932 USA From concurrency.cwi.nl Fri Apr 7 00:00:00 2000 From: "Heike Wehrheim" To: concurrency@cwi.nl (moderated) Subject: Call for Papers: IFM2000 Call for Papers: IFM2000 Submission Deadline 15th May Invited Speakers: Tony Hoare, Microsoft Research, Cambridge, UK Wolfram Schulte, Microsoft Research, USA The Second International Workshop on Integrated Formal Methods will be held at the 18th century chateau of Schloss Dagstuhl, Saarland, Germany, from the 1st to the 3rd of November 2000 Applying formal methods may involve the modelling of different aspects of a system that are expressed through different paradigms. This motivates us to research the combination of different viewpoints of a system, either by the creation of hybrid notations, by extending existing notations, by translating between notations, or by incorporating a wider perspective by innovative use of an existing notation. The integration of formal methods promises great benefits for systems modelling and software development. Whichever approach is taken however, significant issues can arise in areas such as semantic integration, the tractability of our notations, the integration of tool support, the integration of proof systems, consistency and completeness. Issues arise equally in our conceptualisation of systems at different levels of abstraction and the development of these conceptualisations through the process of refinement. The stated theme of IFM'99 was the integration of state based and behavioural formalisms. For IFM2000 this has been widened to include all aspects pertaining to the integration of formal methods and formal notations. The conference also welcomes contributions in related areas such as: hybrid systems, the embedding of one formalism within another, and the integration of formal methods with informal or semi-formal diagram notations and structuring techniques. Location Schloss Dagstuhl is a beautiful 18th century chateau converted for dedicated use as a computer science conference centre but retaining many original features including a chapel and music room. It is set in the wooded hills of Saarland, Germany, close to the French border. Its many facilities include a world class computer science library, extensive computing facilities, and accomodation for conference participants. For further details and travel information see the Dagstuhl web site at: www.dagstuhl.de IFM2000 Web Site On line conference information may be found at http://uebb.cs.tu-berlin.de/ifm00 Submissions and Publication Submissions should be original work, not published or submitted elsewhere. Submissions may be up to 20 pages in length and should prepared with LaTeX, preferably using the Springer lncs style package: www.springer.de/comp/lncs/authors . Conference proceedings will be published by Springer Verlag in the series "Lecture Notes in Computer Science". Completed submissions should be emailed to IFMPapers@tees.ac.uk Each submission should have two attachments, these being the draft paper and a cover sheet. They should be in postscript format. The cover sheet should contain the title, abstract, and key words, the postal and email addresses of all authors, and the telephone and fax numbers of the contact author. In case of difficulty with submissions please contact one of the organisers: Wolfgang Grieskamp; wg@cs.tu-berlin.de Thomas Santen; santen@cs.tu-berlin.de Bill Stoddart; bill@tees.ac.uk Important Dates May 15th submission deadline June 25th notification of acceptance July 18th submission of final copy. Nov 1st-3rd workshop Programme Committee Keijiro Araki, Univ of Kyushu, Japan Didier Bert, Univ of Grenoble, France Egon Boerger, Univ of Pisa, Italy Jonathan Bowen, Southbank University, London, UK Michael Butler, Univ of Southampton, UK Jim Davies, Oxford University, UK John Derrick, Univ of Kent, UK Heiko Doerr, Daimler Chrysler, Germany Jin Song Dong, National Univ of Singapore Clemens Fischer, Univ of Oldenburg, Germany John Fitzgerald, Univ of Newcastle, UK Andy Galloway, Univ of York, UK Chris George, United Nations University, Macao Wolfgang Grieskamp, Technical University of Berlin, Germany Henri Habrias, Univ of Nantes, France Susumu Hayashi, Kobe University, Japan Maritta Heisel, Univ of Magdeburg, Germany Mike Hinchey, Univ of Omaha, USA Bernd Krieg-Brueckner, Univ of Bremen, Germany Michel Lemoine, ONERA, Toulouse, France Shaoying Liu, Hiroshima City Univ, Japan John McDermid, Univ of York, UK Dominique Mery, LORIA, France Thomas Santen, Technical Univ of Berlin, Germany Steve Schneider, Royal Holloway, UK Wolfram Schulte, Microsoft Research, USA Jane Sinclair, Warwick University, UK Graeme Smith, Software Verification Centre, Queensland, Australia Bill Stoddart, University of Teesside, UK Kenji Taguchi, Chikushi Jogakven Univ, Japan W J (Hans) Toetenel, University of Delft, Holland Heike Wehrheim, University of Oldenburg, Germany Jim Woodcock, Oxford University, UK Organising Committee Wolfgang Grieskamp, Thomas Santen, Bill Stoddart Local Organisation: Nicole Probst From concurrency.cwi.nl Fri Apr 7 00:00:00 2000 From: Bjorn Victor To: concurrency@cwi.nl (moderated) Subject: CFP: EXPRESS'00 workshop Second CALL FOR PAPERS EXPRESS'00: 7th International Workshop on Expressiveness in Concurrency Pennsylvania State University, USA, August 21, 2000 Held in conjunction with the conference CONCUR 2000 http://www.docs.uu.se/~victor/Express/ SCOPE: The EXPRESS workshops aim at bringing together researchers interested in the relations between various formal systems, particularly in the field of Concurrency. More specifically, they focus on the comparison between programming concepts (such as concurrent, functional, imperative, logic and object-oriented programming) and between mathematical models of computation (such as process algebras, Petri nets, event structures, modal logics, rewrite systems etc.) on the basis of their relative expressive power. EXPRESS'00 is organized as a satellite workshop of CONCUR 2000, the 11th International Conference on Concurrency Theory, which will take place at Pennsylvania State University, USA, on August 22-25, 2000. IMPORTANT DATES: Paper submission: May 14, 2000 (midnight UTC) Notification: June 16, 2000 Final version: July 31, 2000 INVITED SPEAKER: Neil Jones (DIKU, Copenhagen, DK) CO-CHAIRS: Luca Aceto (BRICS, Aalborg University, DK) Bjorn Victor (Uppsala University, SE) PROGRAMME COMMITTEE: Luca Aceto (BRICS, DK) Karen Bernstein (DePaul University, US) Rance Cleaveland (SUNY at Stony Brook, US) Wan Fokkink (CWI, NL) Rob van Glabbeek (Stanford University, US) Ursula Goltz (TU Braunschweig, DE) Rosario Pugliese (University of Firenze, IT) Julian Rathke (University of Sussex, UK) Davide Sangiorgi (INRIA Sophia-Antipolis, FR) Igor Walukiewicz (Warsaw University, PL) Bjorn Victor (Uppsala University, SE) For more details see the URL http://www.docs.uu.se/~victor/Express/. From concurrency.cwi.nl Fri Apr 7 00:00:00 2000 From: Sanjiva Prasad To: concurrency@cwi.nl (moderated) Subject: Second Call for Papers *********************************************************************** * * * FST TCS 2000 * * * * Foundations of Software Technology and Theoretical Computer Science * * December 13--15, 2000 * * New Delhi, India * * * *********************************************************************** * Call for Papers * *********************************************************************** IARCS, the Indian Association for Research in Computing Science, announces the 20th Annual FST TCS Conference in New Delhi. Two satellite workshops are planned: on Computational Geometry and on Advances in Programming Languages. Authors are invited to submit papers presenting original and unpublished research on **any** theoretical aspects of Computer Science. Papers in applied areas with a strong foundational emphasis are also welcome. The proceedings of the last six years' conferences (Springer-Verlag Lecture Notes in Computer Science volumes 880, 1026, 1180, 1346, 1530, 1738) give an idea of the kind of papers typically presented at FST TCS. Typical areas include (but are not restricted to): Automata, Languages and Computability Randomized and Approximation Algorithms Computational Geometry Computational Biology Combinatorial Optimization Graph and Network Algorithms Complexity Theory Parallel and Distributed Computing New Models of Computation Concurrent, Real-time and Hybrid Systems Logics of Programs and Modal Logics Database Theory and Information Retrieval Automated Reasoning, Rewrite Systems, and Applications Logic, Proof Theory, Model Theory and Applications Semantics of Programming Languages Static Analysis and Type Systems Theory of Functional and Constraint-based Programming Software Specification and Verification Cryptography and Security Protocols For an accepted paper to be included in the proceedings, one of the authors must commit to presenting the paper at the conference. Important Dates --------------- Deadline for Submission 31 May, 2000 Notification to Authors 15 August, 2000 Final Version of Accepted Papers due 15 September, 2000 Deadline for Early Registration 15 November, 2000 Submission Guidelines - --------------------- Authors may submit drafts of full papers or extended abstracts. Submissions are limited to 12 A4-size pages, with 1.5 inch top margin and other margins 1 inch wide with 11 point or larger font. Authors who feel that more details are necessary may include a clearly marked appendix which will be read at the discretion of the Programme Committee. Each paper should contain a short abstract. If available, e-mail addresses and fax numbers of the authors should be included. Electronic Submissions - ---------------------- Electronic submission is strongly encouraged. Self-contained uuencoded gzipped Postscript versions of the paper may be sent by e-mail to fsttcs20@cse.iitd.ernet.in In addition, the following information in ASCII format should be sent to this address in a **separate** e-mail: Title; authors; communicating author's name, address, and e-mail address and fax number if available; abstract of paper. Hard-Copy Submissions - --------------------- If electronic submission is not possible, authors may submit five (5) hard-copies of the paper by post to the following address: FST TCS 2000 Department of Computer Science and Engineering I.I.T., Delhi Hauz Khas New Delhi 110 016 INDIA Invited Speakers ---------------- Invited Speakers who have confirmed participation include: Peter Buneman (U Penn) Bernard Chazelle (Princeton) E. Allen Emerson (U Texas, Austin) Jose Meseguer (SRI) Philip Wadler (Bell Labs) Programme Committee ------------------- Pankaj Agarwal (Duke) Manindra Agrawal (IIT, Kanpur) Tetsuo Asano (JAIST) Vijay Chandru (IISc, Bangalore) Rance Cleaveland (Stony Brook) Anuj Dawar (Cambridge) Sampath Kannan (AT&T Research) Sanjiv Kapoor (IIT, Delhi) (Co-chair) Kamal Lodaya (IMSc, Chennai) Madhavan Mukund (CMI, Chennai) Gopalan Nadathur (Loyola) Seffi Naor (Bell Labs and Technion) Tobias Nipkow (TU Munich) Luke Ong (Oxford) C. Pandu Rangan (IIT, Chennai) Paritosh Pandya (TIFR) Benjamin Pierce (U Penn) Sanjiva Prasad (IIT, Delhi) (Co-chair) Sridhar Rajagopalan (IBM, Almaden) Abhiram Ranade (IIT, Mumbai) Dave Sands (Chalmers) A Prasad Sistla (U Illinois, Chicago) Michiel Smid (Magdeburg) Mandayam K. Srivas (SRI) Organized by ------------ Indian Institute of Technology, Delhi Hauz Khas, New Delhi 100 016. Organizing Committee ------------------- Sandeep Sen (chair) Naveen Garg (treasurer) S N Maheshwari Conference Site --------------- The Conference will take place at the India International Centre, 40 Lodhi Estate, Max Mueller Marg, New Delhi 110 003. Correspondence Address ---------------------- All correspondence regarding submissions may be addressed to FST TCS 2000 Department of Computer Science and Engineering I.I.T., Delhi Hauz Khas, New Delhi 110 016, INDIA Email: fsttcs20@cse.iitd.ernet.in Fax: +91 11 686 8765 Phone: +91 11 659 1294 / 659 1286 URL: http://www.cse.iitd.ernet.in/~fsttcs20 -- Sanjiva Prasad Associate Professor Department of Computer Science and Engineering sanjiva@cse.iitd.ernet.in Indian Institute of Technology, Delhi (Off) +91 11 659 1294 Hauz Khas, New Delhi 110016 (Res) +91 11 659 1684 INDIA (Fax) +91 11 686 8765 http://www.cse.iitd.ernet.in/~sanjiva From concurrency.cwi.nl Wed Apr 5 00:00:00 2000 To: concurrency@cwi.nl From: Paolo Nesi Subject: CFPs: IEEE ICECCS ------------------------------------------------------- SIXTH IEEE INTERNATIONAL CONFERENCE ON ENGINEERING OF COMPLEX COMPUTER SYSTEMS (ICECCS 2000) Boissonade Tower, Ichigaya Campus, Hosei University, Tokyo, Japan September 11-15, 2000 Sponsored by: IEEE Computer Society and the IEEE Technical Committee on Complexity in Computing In cooperation with: Information Processing Society of Japan Institute of Electronics, Information and Communication Engineers of Japan (IEICE) Software Engineering Association of Japan Software Engineering Association of Japan Supported by: IEICE Communications Society Technical Committee on Network Revolution and Software (approval pending) Invited speakers: John A. McDermid, University of York, UK Tosiyasu L. Kunii, Hosei University, Japan David Notkin, University of Washington, USA Takuya Katayama, JAIST, Japan DESCRIPTION: IEEE Computer Society's Sixth International Conference on the Engineering of Complex Computer Systems (ICECCS 2000) is to be held in Boissonade Tower, Ichigaya Campus, Hosei University, Tokyo, Japan. SCOPE: Complex computer systems are common in many sectors, such as manufacturing, communications, defense, transportation, aerospace, hazardous environments, energy, and health care. These systems are frequently distributed over heterogeneous networks, and are driven by many diverse requirements on performance, real-time behavior, fault tolerance, security, adaptability, development time and cost, long life concerns, and other areas. Such requirements frequently conflict, and their satisfaction therefore requires managing the trade-off among them during system development and throughout the entire system life. The goal of this conference is to bring together industrial, academic, and government experts, from a variety of user domains and software 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. The scope of interest includes long-term research issues, near-term complex system requirements and promising tools, existing complex systems, and commercially available tools. TOPIC AREAS: Papers are solicited in all areas related to complex computer-based systems, including the causes of complexity and means of avoiding, controlling, or coping with complexity. Topic areas include, but are not limited to: - System and Software Architecture and Systems Engineering - Tools, Environments, and Languages for Complex Systems - Complex Data Management, including Distributed, Real-Time, and Mobile Databases - Formal Methods and Approaches to Achieving Dependability in Complex Systems - Integration of Heterogeneous Technologies - Software and System Development Processes for Complex Systems - Human Factors and Collaborative ("Groupware") Aspects - Interoperability and Standardization - System and Software Safety and Security SESSION ORGANIZATION: Different kinds of contributions are sought, including research papers, lessons learned, status reports, and discussion of practical problems faced by industry and user domains. The ultimate goal is to build a rich and comprehensive conference program that can fit the interests and needs of different classes of attendees: professionals, researchers, managers, and students. A program goal is to organize several sessions that include both academic and industrial papers on a given topic and culminate panels to discuss relationships between industrial and academic research. PAPER SUBMISSIONS: Papers are divided into two categories: Technical Papers and Industrial Experience Reports. The papers submitted to both categories will be reviewed by program committee members, and papers accepted in either category will be published in the conference proceedings. Technical papers should describe original research, and industrial experience reports should describe practical projects carried out in industry, and reflect on the lessons learnt from them. Submitted manuscripts should be in English and no longer than 5000 words or 20 double-spaced pages. Each submission should include submission category, a cover page containing title, all authors' names, affiliations, and complete mail and electronic mail addresses, together with a maximum 200 word abstract and keyword list. Authors of accepted papers must sign a copyright release form. IEEE Computer Society Press will publish the proceedings. Final versions of accepted papers will be limited to 11 pages in the IEEE proceedings format described at http://computer.org/cspress/instruct.htm. SUBMISSION FORM: Electronic submission is encouraged, but hardcopy submissions will also be accepted. Electronic submissions may be in PDF or portable PostScript only; word processor files will not be accepted. If the authors are not able to submit electronically, 6 paper copies may be submitted. All submissions, electronic or paper, are to be submitted to the Publication Chair: Masahiro Yamamoto The Faculty of Intercultural Communication, Hosei University 2-17-1 Fujimi-cho Chiyoda-Ku, Tokyo, 102-8160, Japan Email: yamamoto@i.hosei.ac.jp PANEL PROPOSALS: Panel proposals (maximum 2 pages) should describe the topic and format, and include a list of panelists who have agreed to participate if the panel is accepted. Panel proposals should be submitted by electronic mail to yamamoto@i.hosei.ac.jp. SPECIAL SESSIONS: Special sessions on various focused topics will be organized at ICECCS 2000. If you are interested in organizing a special session please send a proposal including an outline of a topic, number of papers, etc. to SPECIAL SESSION CHAIR. All papers related to your session will be sent to you after due date for submission. You will be responsible for selecting the papers based on three independent reviews and chairing special session at ICECCS 2000. 2 page abstracts of the accepted papers will be included in the conference proceedings. The Network Software Workshop will be planned as a special session of ICECCS 2000. The proceedings of the Network Software Workshop will be freely distributed to all participants of ICECCS 2000. The details of this workshop can be seen in http://www.ieice.or.jp/cs/nswj. POSTER PRESENTATIONS: Poster presentations are encouraged for people who wish to receive peer feedback, and practical examples of applied research are particularly welcome. Papers are sent to EXHIBITS CHAIR. Poster sessions will allow the presentation and discussion of respective papers. 2 page abstracts of the selected papers will also be included in the conference proceedings. INDUSTRIAL EXHIBITS: ICECCS 2000 will provide industrial exhibitors an opportunity to present their state-of-the-art systems, development tools, and applications. This opportunity will also allow exhibitors to exchange ideas with leading researchers from all around the world, and to make new contacts for future interactions or consulting. Proposals for exhibits are sent to EXHIBITS CHAIR. TUTORIALS: Proposals should be submitted to TUTORIAL CHAIR. IMPORTANT DATES (In the year 2000): January 31 - Deadline for submission of special session proposals. April 17 - Deadline for submission of papers, panel proposals, and tutorial proposals. May 10 - Deadline for submission of proposals for exhibits. May 31 - Notification of acceptance or rejection. June 30 - Deadline for receipt of accepted papers in final, camera-ready form. The ICECCS conference series can be monitored via WWW at www.elet.polimi.it/iceccs2000 or www.cs.uoregon.edu/research/perpetual/iceccs2000 or on the IEEE Computer Society home page at http://www.computer.org. ICECCS 2000 CONFERENCE ORGANIZING COMMITTEE: General Chair: Kenji Ohmori Faculty of Information Sciences, Hosei University 3-7-2 Kajino-cho Koganei-shi, Tokyo 184, Japan Email: ohmori@k.hosei.ac.jp Phone: +81-423-87-6349 Fax: +81-423-87-6126 Vice Chair: Mike Hinchey University of Nebraska-Omaha Department of Computer Science College of Information Science & Technology 6001 Dodge Street, Omaha, NE 68182-0500, USA E-mail: Michael_Hinchey/IST/UNO/UNEBR@unomail.unomaha.edu Program Chairs Shaoying Liu Faculty of Computer and Information Sciences Hosei University 3-7-2 Kajino-cho Koganei-shi Tokyo 184-8584 Japan Tel: 042-387-4550 Email: sliu@k.hosei.ac.jp Jim Woodcock Oxford University Software Engineering Centre Computing Laboratory Wolfson Building, Parks Road Oxford OX1 3QD, U.K. Fax: +44 (0) 1865 273839 Tel: +44 (0) 1865 283514 E-mail: Jim.Woodcock@comlab.ox.ac.uk Alexander D. Stoyen University of Nebraska-Omaha Department of Computer Science College of Information Science & Technology 6001 Dodge Street, Omaha, NE 68182-0500, USA Tel: +1-402-554-2423 (department) Fax: +1-402-554-2975 Email: Alex_Stoyen/IST/UNO/UNEBR@unomail.unomaha.edu Publication and Publicity Chairs Masahiro Yamamoto The Faculty of Intercultural Communication, Hosei University 2-17-1 Fujimi-cho Chiyoda-Ku, Tokyo, 102-8160, Japan Email: yamamoto@i.hosei.ac.jp Luciano Baresi Politecnico di Milano, Italy Email: baresi@elet.polimi.it Tutorials Chair Yoshiaki Kakuda Faculty of Information Sciences Hiroshima City University 4-1, 3-chome, Ozuka-higashi, Asaminami-Ku Hiroshima 731-3194, Japan Email: kakuda@ce.hiroshima-cu.ac.jp Exhibits Chair Toshiyuki Nakata NEC Corporation 4-1-1 Miyazaki, Miyamaeku Kawasaki, Kanagawa, Japan Email: nakata@csl.cl.nec.co.jp Local Arrangement Chair: Masahiro Yamamoto, Hosei University, Japan Members: Hiromu Hayashi, Fujitsu Laboratories LTD., Japan Shinichi Honiden, Toshiba Corporation, Japan Sachiko Kawachiya, Hosei University, Japan Toshiyuki Nakata, NEC Corporation, Japan Yoshiaki Ohshima, Hosei University, Japan Terunao Soneoka, NTT DATA Corporation, Japan Kenji Suzuki, KDD R&D Laboratories Inc., Japan Special Session Chair Tetsuo Tamai College of Arts and Sciences University of Tokyo 3-8-1 Komaba, Meguro-ku, Tokyo, Japan Email: tamai@graco.c.u-tokyo.ac.jp Steering Committee Chair: Alexander D. Stoyen University of Nebraska-Omaha College of Information Science & Technology 6001 Dodge Street, Omaha, NE 68182-0500, USA Program Committee Kiyoshi Agusa, Nagoya University, Japan Sten F. Andler, University of Skovde, Sweden George Avrunin, University Massachusetts, USA Luciano Baresi, Politecnico di Milano, Italy Kai-Yuan Cai, Beijing University of Aeronautics and Astronautics, China Ana Cavalcanti, Federal University of Pernambuco, Brazil Jingde Cheng, Saitama University, Japan Dan Craigen, ORA, Canada Jin Song Dong, National University of Singapore John Fitzgerald, University of Newcastle upon Tyne, UK Hassan Gomaa, George Mason University, USA John Harauz, Ontario Power Generation Inc., Canada Chris Ho-Stuart , Queensland University of Technology, Australia Yoshiaki Kakuda, Hiroshima City University, Japan Rick Kazman, CMU/SEI, USA Kazuo Iwano, IBM Tokyo Research Laboratory, Japan Tomase Janowski, UNU/IIST, Macau Kung-Kiu Lau, University of Manchester, UK Peter Lindsay, University of Queensland, Australia Jun Matsuda, ATR Adaptive Communications Research Laboratories, Japan Jonas Mellin, University of Skovde, Sweden Huaikou Miao, Shanghai University, China Hideo Miyahara, Osaka University, Japan John C. Munson, University of Idaho, USA Paolo Nesi, University of Florence, Italy Joseph Ng, Hong Kong Baptist University, China Koichiro Ochimizu, JAIST, Japan Jeff Offutt, George Mason University, USA Takahiko Ogino, Railway Technical Research Institute, Japan Tadashi Ohta, Soka University, Japan Alessandro Orso, Politecnico di Milano, Italy Mauro Pezze, Politecnico di Milano, Italy Peter T. Poon, Jet Propulsion Laboratory, USA Juan Antonio de la Puente, Universidad Politecnica de Madrid, Spain Jose Salinas, Texas A\&M University, USA Jean-Jacques Schwarz, University of Lyon, France Etsuya Shibayama, Tokyo Institute of Technology, Japan Timothy K. Shih, Tamkang University, Taiwan Jacques Skubich, Institut National des Sciences Appliquees, France Yasuhiro Sugiyama, Nihon University, Japan Ichiro Suzuki, University of Wisconsin-Milwaukee, USA Tetsuo Tamai, Tokyo University, Japan Yuzuru Tanaka, Hokkaido University, Japan Kenji Toda, Electrotechnical Laboratory, Japan Kazunori Ueda, Waseda University, Japan Jeffrey Voas, RST Corporation, USA Xuequn Wu, DeTeCSM, Germany Yoshinori Yamaguchi, University of Tsukuba, Japan Naoki Yonezaki, Tokyo Institute of Technology, Japan Michal Young, University of Oregon, USA Toshitsugu Yuba, University of Electro-Communications, Japan ------------------------------------------------------------------------ Please note my new email addresses, please use all of them in this while ------------------------------------------------------------------------ Paolo Nesi, Ph.D. tel: +39-055-4796523/425 cell:+39-335-5917797 Associate Professor..................fax: +39-055-4796363 Dept. of Systems and Informatics.....email: nesi@ingfi1.ing.unifi.it University of Florence..............._____: nesi@dsi.unifi.it Via S. Marta 3......................._____: nesi@hpcn.ing.unifi.it 50139 Firenze........................p.nesi@computer.org, pnesi@acm.org Italy................................WWW: 0000,0000,fefehttp://www.dsi.unifi.it/~nesi ------------------------------------------------------------------------ From concurrency.cwi.nl Mon Apr 3 00:00:00 2000 From: Emily Todd To: concurrency@cwi.nl (moderated) Subject: Research Positions in Formal Analysis: ICASE, Hampton, VA, USA The Institute for Computer Applications in Science and Engineering (ICASE) is seeking two staff scientists to conduct research in the area of formal methods for the specification, design, and analysis of an advanced air traffic management system. The positions are intended to be filled as early as June 2000. The appointees will participate in research leading to the development and application of formal methods and tools for specifying and analyzing a distributed air/ground traffic management system under development at the NASA Langley Research Center. This system is being designed under a "design for safety" philosophy which will employ software safety methods such a formal modeling, consistency and completeness analysis, state machine hazard analysis, proofs of invariants, software deviation analysis, timing analysis, human factors procedure and interface analysis throughout the development lifecycle. Requirements: * Ph.D. degree or equivalent in EE, CE, CS, CEE or CSEE * Experience in applying formal methods to realistic systems * Expertise in at least one of the following fields: - specification and modeling languages (e.g. RSML, SpecTRM-RL, UML, Statecharts, LOTOS, Z) - verification tools (e.g. PVS, SPIN, Z/Eves, SMV, HOL etc.) * Knowledge of one of the following application areas: - embedded computer systems - air traffic management systems - distributed computer systems * Strong communication and teamwork skills Selected candidates will be offered appointments as ICASE Staff Scientists to pursue independent research in collaboration with scientists at NASA Langley Research Center. This solicitation is aimed at all levels from post-doctoral to senior scientists. Appointments are expected to be for two years with a possible third-year extension. Longer term appointments are possible for more senior applicants. Compensation will be commensurate with experience and qualification. U.S. citizens or permanent resident aliens are preferred, but foreign nationals are not excluded. Applications from women and minorities are encouraged. ICASE is a non-profit research organization located at the NASA Langley Research Center in Hampton, Virginia. The Institute offers excellent opportunities to computer science researchers for collaboration with other scientists and engineers on problems of interest to NASA. Additional information about ICASE and its research programs is available via the World Wide Web at "http://www.icase.edu". Please send resumes to: Director ICASE, MS 132C NASA Langley Research Center Hampton, VA 23681-2199 or by e-mail to: positions@icase.edu ICASE is a nonprofit equal opportunity employer. From concurrency.cwi.nl Fri Apr 14 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: LICS Workshop on Chu Spaces and Applications 25th June 2000, From: Valeria Correa Vaz de Paiva Final CALL FOR PAPERS LICS'2000 Workshop on Chu Spaces: Theory and Applications Sunday, June 25, 2000, Santa Barbara, California http://www.cs.bham.ac.uk/~vdp/chu.html ****Submission deadline: April,25, 2000**** A Chu space is a related pair of complementary objects. Besides having intrinsic interest in their own right, Chu spaces have found applications to concurrent processes, information flow, linear logic, proof theory, and universal categories. The workshop is concerned with the theory and applications of Chu spaces, as well as related structures such as the Dialectica construction and double glueing. The workshop will bring together computer scientists, mathematicians, logicians, philosophers, and other interested parties to discuss the development of the subject with regard to its foundations, applications, prospects, and directions for future work. Work in the subject is currently fragmented across several areas: category theory, traditional model theory, concurrency, and the semantics of programming languages, and such a workshop can contribute to the coordination and possibly even some unification of these efforts. Suggested topics for presentation and discussion include but are by no means limited to new results about Chu spaces and related structures; their applications to various areas such as concurrency, games, proof theory, etc.; and their implications for foundations and philosophy of computation, mathematics, physics, and other disciplines. The workshop will be held on Sunday, June 25, 2000 at Santa Barbara, California, as an adjunct to the International Conference on Logic in Computer Science (LICS'2000), June 26-29 at the same location as per http://www.cs.bell-labs.com/who/libkin/lics/index.html. Papers within the scope of the workshop are solicited, and may be either work in progress or more mature work. Submission should be in the form of an extended abstract of at most 10 pages, in postscript format, mailed electronically to paiva@parc.xerox.com. Submissions will be evaluated by a committee selected by the organizers, and the full version of accepted papers will be printed in a proceedings available at the start of the workshop. Important dates: Extended abstract: April 25, 2000 Notification of acceptance: May 15, 2000 Proceedings version: June 9, 2000 The workshop will be one full day and is open to all interested researchers. Valeria de Paiva paiva@parc.xerox.com Vaughan Pratt pratt@cs.stanford.edu http://www.cs.bham.ac.uk/~vdp/chu.html From concurrency.cwi.nl Thu Apr 13 00:00:00 2000 From: Wan.Fokkink@cwi.nl To: concurrency@cwi.nl (moderated) Subject: IPL special issue on process algebra CALL FOR PAPERS Special Issue of Information Processing Letters (IPL) on PROCESS ALGEBRA Guest editors: Luca Aceto and Wan Fokkink Deadline for submission: August 28, 2000 Process algebra is a successful method for reasoning about concurrent systems. The foundations of process algebra have been studied thoroughly over the last twenty years, and are still leading to large numbers of interesting results and fruitful ideas. In recent years, powerful tool sets for the analysis of concurrent systems, such as Caesar/Aldebaran, muCRL, Concurrency Factory, FDR, FC2Tools and Concurrency Workbench Edinburgh, have been developed on the basis of process algebra. A wide range of advanced protocols and distributed algorithms have been verified using process algebraic methods, and/or analysed using the aforementioned tool sets. This special issue of IPL is devoted to reporting significant research developments and to motivating further investigations in the field of process algebra. Original research papers describing recent advances and new insights on all aspects of process algebra are solicited. Specific topics of interest, in relation to process algebra, include (but are not limited to): - verifications of concurrent systems - foundational work, such as completeness and expressiveness results - algorithms for the generation and analysis of labelled transition systems - behavioural equivalences - abstract data types - term rewriting - structural operational semantics - modal and temporal logics The aim of IPL is to allow rapid dissemination of interesting results in the field of information processing in the form of short, concise papers. To this end, submissions should not extend the equivalent of nine A4 or 8.5-by-11 double-spaced typed pages. An editor's decision to reject a contribution because of its length is final. The deadline for submission is August 28, 2000. All submitted papers will be refereed according to the IPL refereeing process. The special issue is expected to appear in the second quarter of 2001. Authors are invited to submit electronically a self-contained postscript version of their manuscript to one of the two guest editors, Luca Aceto (luca@cs.auc.dk) or Wan Fokkink (wan@cwi.nl). Alternatively, four hard copies can be sent to one of the following addresses: Dr. Luca Aceto Dr. Wan Fokkink BRICS CWI Aalborg University Department of Software Engineering Fredrik Bajers Vej 7-E, DK-9220 Aalborg Kruislaan 413, 1098 SJ Amsterdam Denmark The Netherlands Fax: +45 9815 9889 Fax: +31 20 592 4199 From concurrency.cwi.nl Tue Apr 11 00:00:00 2000 To: concurrency@cwi.nl (moderated) From: Roberto Gorrieri Subject: FOSAD -- call for participation [look at the URL http://www.cs.unibo.it/~gorrieri/fosad for more details] %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % INTERNATIONAL SCHOOL ON % % FOUNDATIONS OF SECURITY ANALYSIS AND DESIGN % % ============================================== % % % % 18-30 September 2000, Bertinoro, Italy % % % % Preliminary Announcement % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% General Information ^^^^^^^^^^^^^^^^^^^ Security in computer systems and networks is emerging as one of the most challenging research areas for the future. The main aim of the school is to offer a good spectrum of current research in foundations of security, ranging from programming languages to analysis of protocols, that can be of help for graduate students or young researchers that intend to approach the field. The school covers two weeks (from monday 18 to saturday 30, september 2000) and alternates four lecturers per week on monographic courses of about 6/8 hours each. Saturdays are reserved for presentations given by those participants that intend to take advantage of the audience for discussing their current research in the area. The school is organised at the Centro Residenziale Universitario of the University of Bologna, situated in Bertinoro, a small village on a scenic hill with a wonderful panorama, in between Forli' and Cesena (about 50 miles south-east of Bologna, 15 miles from the Adriatic sea). Lecturers and Courses ^^^^^^^^^^^^^^^^^^^^^ The school offers eight main courses, each composed of 3/4 seminars (on different days), each seminar of 2 hours. In alphabetic order, the lecturers of the eight main courses are the following: - Li Gong (Javasoft - Sun Microsystems, Palo Alto) Java Security - Andrew D. Gordon (Microsoft Research, Cambridge) Process Calculi for Security and Mobility - Roberto Gorrieri (University of Bologna) Classification of Security Properties - Joshua Guttman (Mitre, Bedford) Security Goals: Packet trajectories and strand spaces - Peter Ryan (SRI, Cambridge) Mathematical Models of Computer Security - Pierangela Samarati (University of Milano) Access Control: Policies, Models, Architectures and Mechanisms - Paul Syverson (Naval Research Lab, Washington) The Logic of Security Protocols - Moti Yung (CertCo Inc., New York) Cryptographic Technology and Protocols in E-Commerce Further short courses will be given by: - Carlo Blundo (Univ. of Salerno) Introduction to Cryptography - Luigia Carlucci Aiello and Fabio Massacci (Univ. of Roma "La Sapienza") Planning, Logic Programs and Security Protocols - Pierpaolo Degano (Univ. of Pisa) Control Flow Analysis for security - Rocco De Nicola (Univ. of Firenze) Testing for spi Processes - Fausto Giunchiglia (Univ. of Trento) Model Checking Using a Logic of Belief - Roberto Segala (Univ. of Bologna) Applied Cryptography Organisation ^^^^^^^^^^^^ The scientific school director is Roberto Gorrieri (fosad@cs.unibo.it). The administrative directors are Andrea Bandini and Roberta Poggi (cbert@sun1.spfo.unibo.it). Notice and Dates ^^^^^^^^^^^^^^^^ The school is directed to PhD students and young researchers. In order to be really effective, at most 45 participants will be admitted to the lectures. Prospective participants should send an application to the address below, together with a recommendation letter, by May 15, 2000. Notification of accepted applicants will be posted by June 15, 2000. Registration to the school is due by July 15, 2000. Applications should be sent to Roberto Gorrieri (by e-mail) and to Andrea Bandini (by mail or fax): Roberto Gorrieri Dipartimento di Scienze dell'Informazione Mura Anteo Zamboni 7 I-40127 Bologna, Italy e-mail: fosad@cs.unibo.it Andrea Bandini Ser.In.Ar. Corso Diaz 43, I-47100 Forli, Italy tel: +39-0543-35180 fax: +39-0543-450204 e-mail: cbert@sun1.spfo.unibo.it Grants ^^^^^^ A limited amount of grants will be provided to cover part of the expenses. Applications are pending to EU for european young researchers and to UNESCO-ROSTE for prospective participants from East European and South Mediterranean countries. Please, include your request with the application. Accommodation and Registration fees ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Accommodation fee is 750 Euro and covers costs for the whole period in single room, half board (breakfast and lunch). Registration fee is 550 Euro and includes didactical material from the lecturers. Further Information ^^^^^^^^^^^^^^^^^^^ More detailed information on courses can be found at the URL http://www.cs.unibo.it/~gorrieri/fosad Requests of information on the school, grants and applications should be addressed to fosad@cs.unibo.it, while information on organisation (address, how to reach us, etc...) can be requested by e-mail to cbert@sun1.spfo.unibo.it Under the auspices of ^^^^^^^^^^^^^^^^^^^^^ European Association of Theoretical Computer Science -- Italian Chapter International Federation for Information Processing -- IFIP TC1-WG1.7 European Educational Forum Sponsors ^^^^^^^^ Ser.In.Ar., Cassa di Risparmio di Forli', Universita' di Bologna GlobalSign Italy EU (pending) UNESCO (pending) CNR - GNIM (pending) Regione Emilia-Romagna (pending) ======================================================================= From concurrency.cwi.nl Mon Apr 24 00:00:00 2000 From: k.j.turner@cs.stir.ac.uk (Ken Turner) Subject: Phd Studentship Scotland To: concurrency@cwi.nl (moderated) A PhD studentship is available at the University of Stirling (central Scotland). The goal is to use formal methods (LOTOS) to specify and test radiotherapy equipment used in cancer treatment. Details and application procedures can be found at: http://www.cs.stir.ac.uk/~kjt/research/conformed.html Ken Turner From concurrency.cwi.nl Fri Apr 21 00:00:00 2000 From: GOUBAULT Eric To: concurrency@cwi.nl (moderated) Subject: CFP for GETCO'00 _________________________________________________________________________ 2nd CALL FOR PAPERS GETCO'00 2nd Workshop on Geometric and Topological Methods in Concurrency Theory http://www.dmi.ens.fr/~goubault/getco.html a satellite to CONCUR'00 PennState, 21st of August 2000 (to coincide with EXPRESS'00, another satellite) _________________________________________________________________________ (apologies for multiple copies) This workshop follows last year's "Geometric and Topological Methods in Concurrency Theory" meeting held at Aalborg University. The aim is to bring together researchers that apply geometric, topological and algebraic topological methods to formalize and analyze dynamical, concurrent and distributed systems. The spirit of the meeting will be informal and will focus on exchange of information and discussion. It will consist of a number of tutorials, invited talks, together with accepted papers. Abstracts and work in progress reports are encouraged. The submission deadline is the 19th of may. Accepted papers will be published first as a BRICS report made available to participants. Contacts have been taken with ENTCS for publication of final versions of the papers. For more information please see URLs or email Eric.Goubault@cea.fr GETCO'00 http://www.dmi.ens.fr/~goubault/getco.html CONCUR'00 http://www.cse.psu.edu/concur2000/ EXPRESS'00 http://www.docs.uu.se/~victor/Express/express00.shtml GETCO'99 http://www.math.auc.dk/ _________________________________________________________________________ From concurrency.cwi.nl Fri Apr 21 00:00:00 2000 From: owner-forte-pstv-2000-lists@mail.iat.cnr.it To: concurrency@cwi.nl (moderated) Subject: Formal methods elsewhere: FORTE-PSTV satellite --------- Second Call for Papers --------- F M - E L S E w H e R E --------------------------------------------------- (FORMAL METHODS *ELSEWHERE*) --------------------------------------------------- A Satellite Workshop of FORTE-PSTV-2000, devoted to applications of Formal Methods to areas *other than* communication protocols and software engineering. P i s a , I t a l y, O c t o b e r 1 0 , 2 0 0 0 FM-ELSEWHERE web page - http://www.cs.ukc.ac.uk/people/staff/hb5/Elsewhere/ FORTE/PSTV web page - http://forte-pstv-2000.cpr.it OBJECTIVES ========== A wide variety of formal models, languages and methods have been developed in the last two decades for supporting the specification, design, verification, implementation and testing of computer networks and distributed software systems. These include CCS, pi-calculus, timed and stochastic process algebra, VDM, Z, B, Automata and Timed Automata, Petri Nets, Statecharts, Logics, TLA, Message Sequence Charts, ADT's, OBJ, Larch, formal Object-Oriented approaches, the international standards Estelle, LOTOS, SDL, ASN.1 and TTCN, and others. Formal specification languages have been designed to support the description of system structure and behaviour in terms of concepts such as event occurrence, observation and experiment, temporal ordering, causality, cooperation and synchronisation among entities, non determinism, concurrency and parallelism, state changes and invariants, and others. While considerable experience has been gained in the application of formal methods to the areas for which they were initially conceived, the high abstraction level of these concepts suggests that they could play an important role in several other disciplines such as chemistry, biology, physics and even arts, humanites and social sciences. After two decades of 'traditional' applications, during which the initial gap between the excessive optimism of academic supporters and the skepticism of industrial detractors have been substantially reduced, often leading to a positive and constructive attitude towards their adoption, formal methods are perhaps ready to spread out of their native territory and, at the turn of the decade and millenium, invade new exciting areas of research, thus providing a much wider exploitation of the huge intellectual investment behind their definition. In fact, it is often the case that a technique designed with a particular application in mind, turns out to perform better and to be more useful in a context other than the originally intended one. The FM-ELSEWHERE workshop, co-located with FORTE-PSTV-2000 at Pisa, will be a forum for researchers who are interested in the application of formal methods, as identified above, to virtually any area of research, except communication protocols and software engineering. Topics of interest include (but are certainly not limited to) the following: - formal methods in physics, chemistry, biology; - formal methods in human and social sciences; - formal methods in the arts; - formal description of games and generic rule systems; - formal methods for the analysis and development of user manuals (from consumer electronics to avionics and nuclear plants); - formalisation and verification of legal, medical, bureaucratic and safety critical procedures and protocols; - formalised music analysis, synthesis and composition; - formal modeling of narrative (novels, theatre, movie plots). If you are interested to submit but are not sure whether your application of formal methods is sufficiently strange, you can mail Howard Bowman (H.Bowman@ukc.ac.uk) to see whether it passes the "unusualness" criteria. Also, we will be keeping a list of known non-traditional applications of formal methods on the workshop web page, http://www.cs.ukc.ac.uk/people/staff/hb5/Elsewhere/ and if you wish to contribute an item to the list mail Howard Bowman (H.Bowman@ukc.ac.uk). ORGANISERS =========== Howard Bowman (Univ. of Kent at Canterbury) Tommaso Bolognesi (CNR/I.E.I. at Pisa) Giorgio Faconti (CNR/CNUCE at Pisa) WORKSHOP COMMITTEE =================== Tommaso Bolognesi (CNR/I.E.I. at Pisa, Italy) Howard Bowman (Univ. of Kent at Canterbury, UK) Alan Dix (aQtive Limited, UK) David Duce (Rutherford Appleton Laboratory, UK) David Duke (University of York, UK) Giorgio Faconti (CNR/CNUCE at Pisa, Italy) Chris Johnson (University of Glasgow, UK) Peter Johnson (University of Bath, UK) Peter B. Ladkin (University of Bielefeld, Germany) Scott Smolka (State University of New York at Stony Brook, US) SUBMISSIONS ============ Send by e-mail a copy of your paper to Howard Bowman (H.Bowman@ukc.ac.uk). A light-weight review process will be employed. Electronic publication of the workshop contributions is being investigated. Submission deadline: May 15, 2000 Notification of acceptance: June 15, 2000 A 'Most Bizarre FM-Application' Award (of the symbolic value of one Euro) will be assigned to the authors of the paper that best matches the spirit of the Workshop -- one of combining technical soundness with extreme application originality. From concurrency.cwi.nl Fri Apr 21 00:00:00 2000 From: Jan Friso Groote To: concurrency@cwi.nl (moderated) Subject: Resolution versus BDDs Because we believe the following report is of interest in the area of symbolic verification using proposition logic we would like to draw your attention to the following report, that proves that resolution and BDDs are fundamentally different techniques: Resolution and Binary Decision Diagrams cannot simulate each other polynomially. By Jan Friso Groote and Hans Zantema. Technical Report CS-2000-14. Utrecht University, Utrecht, 2000. ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-2000/2000-14.ps.gz (see alternatively: www.cwi.nl/~jfg/publications1.html) Abstract: There are many different ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (eg. Stalmarck's method, Grasp, Sato). Others use so-called binary decision diagrams (BDDs). Experimental evidence suggests that BDDs and resolution based techniques are fundamentally different, in the sense that their performance can differ very much on benchmarks. In this paper we confirm these findings by mathematical proof. We provide examples that are easy for BDDs and exponentially hard for any form of resolution, and vice versa, examples that are easy for resolution, and exponentially hard for BDDs. Jan Friso Groote and Hans Zantema (jfg@cwi.nl, hansz@cs.uu.nl) From concurrency.cwi.nl Thu Apr 20 00:00:00 2000 Received: from wrath.cs.utah.edu (wrath.cs.utah.edu [155.99.198.100]) by hera.cwi.nl with ESMTP id VAA16253 for ; Thu, 20 Apr 2000 21:48:10 +0200 (MET DST) Received: from durga.cs.utah.edu (durga.cs.utah.edu [155.99.203.104]) by wrath.cs.utah.edu (8.8.8/8.8.8) with ESMTP id NAA07913; Thu, 20 Apr 2000 13:47:42 -0600 (MDT) Received: (from ganesh@localhost) by durga.cs.utah.edu (8.9.3/8.9.3) id NAA02284; Thu, 20 Apr 2000 13:47:35 -0600 (MDT) Date: Thu, 20 Apr 2000 13:47:35 -0600 (MDT) Message-Id: <200004201947.NAA02284@durga.cs.utah.edu> From: "Ganesh C. Gopalakrishnan" To: concurrency@cwi.nl Subject: Final CFP: Workshop on Advances in VErification (Post-CAV 2000) FINAL CALL FOR PAPERS Workshop on Advances in VErification www.cs.utah.edu/wave (post-CAV 2000 Workshop) 20 July 2000 Chicago, USA The purpose of this workshop is to provide an informal forum for the presentation of recent work, work-in-progress, and even highly speculative work on all aspects of mechanical program verification. Topics of interest include specification methods (specification languages, modeling frameworks, logics), verification methods (model checking, theorem proving, etc. ), applications and case studies (hardware verification, communication protocol verification, etc.), tools, practical aspects of verification, and theoretical foundations. Note: The only topics not sought for this workshop are security and symbolic trajectory evaluation; those should be submitted to the speciality workshops affiliated with CAV 2000. It is anticipated that the program will entail short talks (15 minutes), longer talks (30 minutes), tool demonstrations, and a roundtable discussion. Paper submission: An extended abstract (about 5-10 pages) explaining recent research results or work in progress should be mailed electronically to wave2000@cs.utah.edu, to be received by 21 April 2000. Submissions should be formatted as a POSTSCRIPT FILE in Usletter or A4 size. Authors will be notified of acceptance or rejection by 21 May 2000. Final versions of accepted papers will be due by 21 June 2000. These papers will be collected and distributed in an INFORMAL proceedings to be made available at the workshop (i.e., it is anticipated that most of the contributions will appear later in more polished form in other refereed conferences and journals). DATES: Submissions: April 21, 2000 Notification: May 21, 2000 Final papers: June 21, 2000 Workshop: July 20, 2000 WEBSITE: www.cs.utah.edu/wave PROGRAM COMMITTEE: Rajeev Alur, Penn David Dill, Stanford Rob Gerth, Intel Patrice Godefroid, Bell Labs Ganesh Gopalakrishnan, Utah Mike Gordon, Cambridge Ken McMillan, Cadence Berkeley Labs Fabio Somenzi, Colorado ORGANIZING COMMITTEE: E. Allen Emerson A. Prasad Sistla --- From concurrency.cwi.nl Thu Apr 20 00:00:00 2000 From: Marta Z Kwiatkowska To: concurrency@cwi.nl (moderated) Subject: Lectureships in Computer Science at Birmingham THE UNIVERSITY OF BIRMINGHAM SCHOOL OF COMPUTER SCIENCE Lectureship in Computer Science (3 posts) *** Closing date: 16th May 2000 *** Applications are invited for THREE Lectureships in Computer Science at the University of Birmingham. All areas will be considered, but preference will be given to candidates who are research active in areas listed below: Vision Computational Linguistics Commonsense Reasoning Robotics Agents Advanced Interaction Technology & Software Systems Verification Bioinformatics Evolutionary and Natural Computation For more information see http://www.bham.ac.uk/personnel/s35434.htm Informal enquiries to Prof Achim Jung (Head of School), Email A.Jung@cs.bham.ac.uk, tel +44 121 414 4776. From concurrency.cwi.nl Thu Apr 20 00:00:00 2000 From: Pascal van Eck To: concurrency@cwi.nl (moderated) Subject: VACANCIES: 15 researchers in the area of E-commerce Dear colleagues, I would like to draw your attention to the following vacancies at the Centre for Telematics and Information Technology (CTIT) of the University of Twente, Enschede, the Netherlands. 15 RESEARCHERS ============== to participate in multidisciplinary research that pushes the boundaries of e-commerce infrastructures and applications The research is carried out in the Computer Science faculty, the Technology & Management faculty and the Dinkel Institute. The research is organized around two themes, viz. contracts and transactions. Contracts in electronic commerce -------------------------------- This concerns the whole trajectory of searching for suitable providers, matchmaking between providers and consumers, negotiation of conditions, establishment of service contracts, service provisioning and service monitoring. Topics studied within this theme: - negotiation between software agents - information search patterns of consumers - components and automated support for contract handling - specification of QoS and level of control in contracts - monitoring of QoS and security in contract execution - business-to-consumer agents - models for innovative mediation in electronic contracts - legal frameworks for electronic contracts Transactions in electronic commerce ----------------------------------- This concerns the infrastructure for virtual organisations, which must be able to support the dynamics and variety of organisations as well a their long-lasting transaction-type interactions. Topics studied within this theme: - models, architectures and standards for transactions - security frameworks for distributed transactions - adaptive middleware support for distributed transactions - component-based frameworks for transaction applications - transactions with mobile partners - verification of correctness of distributed transactions - the virtual shop: agents in business-to-consumer e-commerce - evolution from message- to transaction-based interactions - business models to match transaction-based collaboration More information can be found at http://www.ctit.utwente.nl/vacancies/ad_ec_uk.html Please feel free to circulate this information further to interested colleagues. Many thanks, Roel Pieper Marten van Sinderen Robert Stegwee Roel Wieringa -- Pascal van Eck - University of Twente - Faculty of Computer Science Information Systems Group - P.O. Box 217 - 7500 AE Enschede Email: vaneck@cs.utwente.nl - URL http://www.cs.utwente.nl/~patveck Tel: +31 (053) 4894648 - Fax: +31 (020) 8708189 (delivered via email) From concurrency.cwi.nl Thu Apr 20 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: IFIP TCS2000 INFORMATION From: Shinya MIYAKAWA IFIP TCS2000 PRELIMINARY PROGRAM AND REGISTRATION INFORMATION ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ -------------------------------------------------------------------------- IFIP International Conference on Theoretical Computer Science (IFIP TCS2000) --- Exploring New Frontiers of Theoretical Informatics --- August 17 - 19, 2000 Aoba Memorial Bldg., Tohoku University, Sendai, Japan Further Information about IFIP TCS2000 can be obtained on the Web, at http://tcs2000.ito.ecei.tohoku.ac.jp/tcs2000/ Any inquiry on IFIP TCS2000 Program and Registration may be directed to TCS2000@ito.ecei.tohoku.ac.jp -------------------------------------------------------------------------- PRELIMINARY PROGRAM ^^^^^^^^^^^^^^^^^^^ [Outline] AUGUST 16: 15:00 Registration at Sendai Tokyu Hotel till 20:00 18:00 Welcome at Sendai Tokyu Hotel till 19:00 AUGUST 17: 9:30 Opening Session 10:00 Keynote Plenary Talk 1 ----------------------------------------- 11:10 - 17:30 TRACK (1) || TRACK (2) ----------------------------------------- AUGUST 18: 9:10 Keynote Plenary Talk 2 ----------------------------------------- 10:20 - 15:30 TRACK (1) || TRACK (2) ----------------------------------------- 15:50 Panel Discussion till 17:10 ----------------------------------------- 18:30 Banquet at Sendai Tokyu Hotel AUGUST 19: 9:10 Keynote Plenary Talk 3 ----------------------------------------- 10:20 - 14:20 TRACK (1) || TRACK (2) ----------------------------------------- 14:30 Closing Session till 14:40 ----------------------------------------- 15:00 Open Lectures till 17:00 ----------------------------------------- 18:30 Japanese Dinner Party till 20:00 ----------------------------------------- AUGUST 16 WEDNESDAY ^^^^^^^^^^^^^^^^^^^ 15:00 REGISTRATION at Sendai Tokyu Hotel till 20:00 18:00 WELCOME with light snack at Sendai Tokyu Hotel till 19:00 AUGUST 17 THURSDAY ^^^^^^^^^^^^^^^^^^ 9:30 OPENING SESSION Giorgio Ausiello (TC1 Chair and IFIP TCS2000 Co-Chair) Takayasu Ito (IFIP TCS2000 Co-Chair) 10:00 KEYNOTE PLENARY TALK Reconciling Two Views of Cryptography Martin Abadi (Bell Labs, Lucent) 10:50 Break [TRACK (1)] SESSION (1.1), 11:10 - 12:00 11:10 Approximation Algorithms for String Folding Problems Giancarlo Mauri, Giulio Pavesi 11:35 An Index for Two Dimensional String Matching Allowing Rotations Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen 12:00 Lunch Break SESSION (1.2), 13:30 - 14:20 13:30 Parallel Edge Coloring of a Tree on a Mesh Connected Computer Chang-Sung Jeong, Sung-Up Cho, Mi-Young Choi 13:55 Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs Ryuhei Uehara, Zhi-Zhong Chen 14:20 Break 14:40 TRACK (1) INVITED TALK It is on the Boundary: Complexity Considerations for Polynomial Ideals Ernst Mayr (TU Muenchen) 15:30 Break SESSION (1.3), 15:50 - 17:30 15:50 An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks Yoojin Chung, Kunsoo Park 16:15 Task Distributions on Multiprocessor Systems Evgeny V. Shchepin, Nodari Vakhania 16:40 Fast Interpolation using Kohonen Self-Organizing Neural Networks Olivier Sarzeaud, Yann Stephan 17:05 Steganography Using Modern Arts Galdi Clemente, Blundo Carlo 17:30 Break -----------// [TRACK (2)] SESSION (2.1), 11:10 - 12:00 11:10 Ambient Groups and Mobility Types Luca Cardelli, Giorgio Ghelli, Andrew D. Gordon 11:35 An Asynchronous, Distributed Implementation of Mobile Ambients Cedric Fournet, Jean-Jacques Levy, Alan Schmitt 12:00 Lunch Break 13:30 TRACK (2) INVITED TALK Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness Naoki Kobayashi (U. Tokyo) 14:20 Break SESSION (2.2), 14:40 - 15:30 14:40 Local pi-Calculus at Work: Mobile Objects as Mobile Processes Massimo Merro, Josva Kleist, Uwe Nestmann 15:05 An Interpretation of Typed Concurrent Objects in the Blue Calculus Silvano Dal-Zilio 15:30 Break SESSION (2.3), 15:50 - 17:30 15:50 A Higher-Order Specification of the pi-Calculus Joelle Despeyroux 16:15 Open Ended Systems, Dynamic Bisimulation, and Tile Logic Vladimiro Sassone 16:40 Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems Marcelo Fiore 17:05 On the Complexity of Bisimulation Problems for Pushdown Automata Richard Mayr 17:30 Break AUGUST 18 FRIDAY ^^^^^^^^^^^^^^^^ 9:10 KEYNOTE PLENARY TALK Theory and Construction of Molecular Computers Masami Hagiya (U. Tokyo) 10:00 Break [TRACK (1)] SESSION (1.4), 10:20 - 12:00 10:20 Trade-offs between Density and Robustness in Random Interconnection Graphs P. Flajolet, K. Hatzis, S. Nikoletseas, P. Spirakis 10:45 The ($\sigma$+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges Satoshi Taoka, Toshimasa Watababe 11:10 On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem Sounaka Mishra, Kripasindhu Sikdar 11:35 Maximum Clique and Minimum Clique Partition in Visibility Graphs Stephan Eidenbenz 12:00 Lunch Break SESSION (1.5), 13:30 - 14:20 13:30 Real-Time Language Recognition by Alternating Cellular Automata Thomas Buchholz, Andreas Klein, Martin Kutrib 13:55 Damage Spreading and $\mu$-Sensitivity on CA Bruno Martin 14:20 Break 14:40 TRACK (1) INVITED TALK Discrepancy Theory and its Applications to Finance Shu Tezuka (IBM Tokyo Research Lab) 15:30 Break -----------// [TRACK (2)] SESSION (2.4), 10:20 - 12:00 10:20 A Type-theoretic Study on Partial Continuations Yukiyoshi Kameyama 10:45 Partially Typed Terms between Church-Style and Curry-Style Ken-etsu Fujita, Aleksy Schubert 11:10 Alternating Automata and Logics over Infinite Words Christof Loeding, Wolfgang Thomas 11:35 Hypothesis Support for Information Integration in Four-Valued Logics Yann Loyer, Nicolas Spyratos, Daniel Stamate 12:00 Lunch Break 13:30 TRACK (2) INVITED TALK A Compositional Model of Time and Uncertainty Thomas Henzinger (UC Berkeley) 14:20 Break SESSION (2.5), 14:40 - 15:30 14:40 A Single Complete Refinement Rule for Demonic Specifications Karl Lermer, Paul Strooper 15:05 Reasoning about Composition using Property Transformers and their Conjugates Michel Charpentier, K. Mani Chandy 15:30 Break ----------------------- 15:50 PANEL DISCUSSION on "New Challenges for TCS" Panelists: Giorgio Ausiello (U. Roma "La Sapienza") Jozef Gruska (Masaryk U.) Ugo Montanari (U. Pisa) Takao Nishizeki (Tohoku U.) Yoshihito Toyama (Tohoku U.) Jiri Wiedermann (Inst. Informatics, Prague) 17:10 Break 18:30 BANQUET at Sendai Tokyu Hotel till 20:45 BANQUET SPEECH Non-Random Thoughts about Randomization Michael O. Rabin (Harvard U.) AUGUST 19 SATURDAY ^^^^^^^^^^^^^^^^^^ 9:10 KEYNOTE PLENARY TALK List Decoding: Algorithms and Applications Madhu Sudan (MIT) 10:00 Break [TRACK (1)] SESSION (1.6), 10:20 - 12:00 10:20 Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits Endre Boros, Toshihide Ibaraki, Kazuhisa Makino 10:45 Characterization of Optimal Key Set Protocols Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki 11:10 On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model Valentin E. Brimkov, Stefan S. Dantchev 11:35 On Logarithmic Simulated Annealing A. Albrecht, C.K. Wong 12:00 Lunch Break 13:30 TRACK (1) INVITED TALK Hierarchical State Machines Mihalis Yannakakis (Bell Labs, Lucent) 14:20 Break -----------// [TRACK (2)] 10:20 TRACK (2) INVITED TALK Some New Directions in the Syntax and Semantics of Formal Languages Gordon D. Plotkin (Edinburgh U.) 11:10 Break 11:20 DEMO SESSION (1) on Verification Tools 12:00 Lunch Break 13:30 DEMO SESSION (2) on Verification Tools 14:20 Break ------------------------ 14:30 CLOSING SESSION till 14:40 Giorgio Ausiello (TC1 Chair and IFIP TCS2000 Co-Chair) Takayasu Ito (IFIP TCS2000 Co-Chair) ------------------------ [OPEN LECTURES] 15:00 On the Power of Interactive Computing Jan van Leeuwen (U. Utrecht) 16:00 The Varieties of Programming Language Semantics Peter D. Mosses (U. Aarhus) 17:00 Break ------------------------ 18:30 JAPANESE DINNER PARTY till 20:00 ========================================================================== GENERAL INFORMATION ^^^^^^^^^^^^^^^^^^^ IFIP TCS2000 is the first International Conference on Theoretical Computer Science organized by IFIP TC1 on Foundations of Computer Science, and it consists of two tracks: TRACK (1) on Algorithms, Complexity and Models of Computation, and TRACK (2) on Logic, Semantics, Specification, and Verification. The conference proceedings will be published as a volume of Lecture Notes in Computer Science, Springer-Verlag. IFIP TCS2000 will be held on the campus of Tohoku University, Sendai, Japan. The invited talks and contributed talks will be presented at the Aoba Memorial Building and Engineering Conference Hall, Faculty of Engineering located on the Aoba Hill about 3 km west of downtown Sendai. The conference welcome reception and banquet will be held at Sendai Tokyu Hotel, located at downtown Sendai. Please, register and make reservations by returning the completed form by email and fax, following the instructions below. There will also be on-site registration at: * Sendai Tokyu Hotel, 15:00 - 20:00, August 16 * Aoba Memorial Bldg., Tohoku Univ., 9:00 - 17:00 on August 17 - 19. Transportation Conference participants arriving at the new Tokyo International (Narita) Airport are advised to take the JR Narita Express train from Narita Airport to Tokyo Station. Then, take the Yamabiko super express train of Tohoku Shinkansen (Tohoku Bullet Train) to Sendai from Tokyo Station. The Yamabiko runs every 20 - 30 min. and takes about 2 hours from Tokyo to Sendai. Making reservation at Narita Station for the Yamabiko is recommended, since it will be the summer tourist season. Those arriving at the new Osaka International Airport (Kansai Airport) can fly to Sendai Airport, and take Limousine Bus service to Sendai Station. The bus takes about 30 min. to go from the Airport to Sendai Station. You can also take a shuttle bus service from Kansai Airport to the Osaka-Itami Airport to fly from there to Sendai Airport. Alternatively, you can take a local train from the Kansai Airport to JR Shin Osaka Station, then take the Tokaido Shinkansen from Osaka to Tokyo Station and change at Tokyo Station to Tohoku Shinkansen. Some details on transportation will be available on the TCS2000 Web page, at http://tcs2000.ito.ecei.tohoku.ac.jp/tcs2000/ Note: (1) In Japan, mid-August is the busiest tourist time during summer, including domestic and international flights. (2) No flight service is available from Narita to Sendai Airport, since the train service is convenient. There is another train service from Narita Airport to downtown Tokyo (Ueno) by Skyliner of the Keisei-Narita Line. At Ueno you can take the Yamabiko super express of Tohoku Shinkansen to Sendai, but you have to walk about 10 min. from Keisei-Ueno Station to JR Ueno Station to take Tohoku Shinkansen. (3) If you are going to travel in Japan by JR lines before/after the IFIP TCS2000 conference, it will be convenient and economical to get a JR PASS before your departure. Contact your travel agent for more information on JR PASS (Japan Rail Pass). Hotels Two hotels are arranged to offer special discount rates to IFIP TCS2000 participants: Sendai Tokyu Hotel and Sendai Washington Hotel. They are 1.2 km west of Sendai Station and about 800 Yen by taxi from the station. These hotels are located within 5 min. walk from each other. The conference welcome reception and banquet will be held at Sendai Tokyu Hotel. Sendai and Climate Sendai is the largest city in the northern part of the Honshu Island of Japan, with a population of about a million. The City is known in Japan as "City of Trees". Sendai is a modern, safe city with a temperate climate blessed by four distinct seasons; even in mid August it is quite seldom that the highest temperature exceeds 30 C (86 F). Usually, the weather in mid August would be mostly sunny with temperatures ranging from 20 C (68 F) to 30 C (86 F), and rain, if any, would rarely be heavy. Note: Average temperatures in August at Sendai, Tokyo and Osaka are about 23.5 C, 26.5 C and 27.5, respectively. REGISTRATION AND RESERVATION INFORMATION ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ REGISTRATION FEES Registration fees cover attendance in all sessions, a copy of the proceedings, refreshments, the welcome reception and banquet, but not the Japanese dinner party on August 19. The reduced author rate applies to all authors of the accepted papers, and the reduced committee member rate applies to all TC1 members and to all members of the Program Committee and the Organizing Committee. The student rate applies to full time students. Registrants paying reduced rates have full privileges at the conference. The companion rate covers the reception and banquet only. Through July 1st, 2000 From July 2nd, 2000 Regular 40,000 Yen 50,000 Yen Author 30,000 Yen 40,000 Yen Committee Member 30,000 Yen 40,000 Yen Student 25,000 Yen 30,000 Yen Companion 5,000 Yen 7,000 Yen HOTELS Two convenient Western Style hotels offer special IFIP TCS2000 discount rates. Rates are per person, per night, and include service charge and tax (not including breakfast). Single Room Twin Room Sendai Tokyu Hotel 10,500 Yen 8,400 Yen Sendai Washington Hotel II 8,400 Yen 7,350 Yen Sendai Washington Hotel I 7,350 Yen --------- Note: Twin room reservations are available for two persons. No roommate matching service is available, so that twin room reservations remain the registrant's responsibility. JAPANESE DINNER PARTY A Japanese dinner party for participants from abroad will be arranged at SHOZANKAN in the evening of August 19. The invited speakers, some Steering Committee members, PC members and conference organizers will attend. A limited number of reservations will be available for this dinner party. The rates are as follows. Conference registrant: 10,000 Yen Companion: 7,000 Yen ============================================================================= Cut here to send your registration form after filling in the required items. ============================================================================= IFIP TCS2000 REGISTRATION AND RESERVATION FORM ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Please register and make reservations by completing the form below and returning it by email to tcs02@thk.jtb.co.jp Registrants are advised to email a copy of their completed form to TCS2000@ito.ecei.tohoku.ac.jp They are also encouraged to send a signed, printed copy of their completed form by fax to 022-262-5002 (domestic) +81-22-262-5002 (from abroad) which is the fax number of the following agent to take care of the conference registration and reservation. JTB (Japan Travel Bureau) Tohoku Communications Inc. Kotsukosha Bldg 3F, 3-6-Chuo Aoba-Ku, Sendai 980-0021, Japan (Fax) 022-262-5002 (domestic) +81-22-262-5002 (from abroad) (Phone) 022-262-5055 (domestic) +81-22-262-5055 (from abroad) (Email) tcs02@thk.jtb.co.jp Registration and reservations will be completed by your payment, whose method is described below. IMPORTANT NOTE: As described below, from the standpoint of the safety, registrants are advised to pay fees by Bank Transfer. When the payment is made by a credit card, they are advised to send the required information including Credit Card numbers by FAX; that is, do NOT send Credit Card numbers by email. REGISTRATION FOR IFIP TCS2000 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Last (Family) Name: First (Given) Name: Middle: Affiliation: Postal Address: City/State/Zip: Country: Phone: Fax: Email: Registration Status : Number of Companions: Companions' names (if applicable): (A) Total Registration Fee(s) in Yen: HOTEL RESERVATION Hotel First Choice: Hotel Second Choice: Number of Single Room(s): Number of Twin Room(s): Roommate's Name(s) for Twin Room(s): Check-in Date: Check-out Date: Number of Nights: Special Room or other Request: JAPANESE DINNER PARTY A limited number of reservations are available for the Japanese dinner party at SHOZANKAN on August 19 to be arranged for participants from abroad. (B) 10,000 Yen x [ ] conference registrant(s): (C) 7,000 Yen x [ ] companion(s): TOTAL FEE IN YEN (A) + (B) + (C): Signature (not needed for email): METHOD OF PAYMENT FOR IFIP TCS2000 From the standpoint of the safety and security, participants are encouraged to pay via Bank Transfer. When they pay via credit card, they are advised to send the required information (in particular, Credit Card numbers) by FAX; that is, do NOT send your Credit Card numbers by email. In credit card payment Visa card, MasterCard, and Diners card will be accepted. Personal checks cannot be accepted. All payments must be made in Japanese Yen. Indicate method of payment below: [ ] Bank Transfer to Bank: Tokyo Mitsubishi Bank, Sendai Branch Account Name: IFIP TCS2000 Chair Takayasu Ito Account No. 1108671 From : Date of transfer: Payer's name: Note: In Japan the bank number of Tokyo Mitsubishi Bank is 0005, and the number of its Sendai Branch is 320. [ ] Payment by Credit Card Credit Card Type : Card Number: Expiration Date: Signature (not needed for email): : When your payment is via Credit Card, send the above information by FAX to +81-22-262-5002, the fax no. of JTB Communications Inc. Even when you send the above form by fax, send it by EMAIL without filling in Credit Card number for safety. ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Registration and reservations will be confirmed upon receipt of payment. Refunds will be made upon written request received through July 31st, 2000 by JTB Tohoku Communications Inc. From concurrency.cwi.nl Mon Apr 17 00:00:00 2000 From: "A. Rennoch" To: concurrency@cwi.nl (moderated) Subject: FMICS proceedings online Dear colleagues, two weeks ago the International ERCIM Workshop on Formal Methods for Industrial Critical Systems (FMICS) has been held in Berlin, Germany. We like to inform you that the workshop proceedings of FMICS'2000 now are available via the workshop homepage http://www.fokus.gmd.de/tip/fmics/ We thank you for your interest in FMICS and hope to see you at future FMICS events. Best regards Ina Schieferdecker and Axel Rennoch From concurrency.cwi.nl Tue May 2 00:00:00 2000 From: Flavio Corradini To: concurrency@cwi.nl (moderated) Subject: Last Call for Papers - MTCS 2000 First Workshop on Models for Time-Critical Systems MTCS 2000 Co-Located with CONCUR 2000 Pennsylvania State University, Pennsylvania, USA August 26 2000 http://univaq.it/~mtcs2000/ AIMS OF THE WORKSHOP: To validate the more promising proposals on models for time-critical systems. Advances which involve dialects of process algebras, logics, Z-specifications, Petri nets, automaton, software architectures, UML ... for the specification, verification, formal reasoning of time-critical systems will be considered. Papers with a clear impact on application fields such as web, multimedia systems, distributed information systems, knowledge-based systems, such as any general paper on the topic, are welcome. To promote interaction between different research areas in the field of time-critical systems in order to exchange and to transfer techniques, analytic concepts and developed tools from a model to another one. Papers contrasting models from (as far as possible) different application fields are welcome. These include papers reporting results on the expressiveness of the models, relations between informal and formal reasoning and, more in general, relations among different systems abstractions... SUBMISSIONS: Send a self-contained .ps version of the paper, up to 12 pages, to mtcs2000@univaq.it Send also Title, Authors and Abstract of the paper (in ASCII format) in a separate e-mail. IMPORTANT DATES: Deadline for Submission: May 14 2000 Notification to Authors: June 22 2000 Final Version of Accepted Papers due: July 15 2000 PROGRAM CO-CHAIRS: Flavio Corradini (University of L'Aquila) Paola Inverardi (University of L'Aquila) PROGRAM COMMITTEE: Rajeev Alur (University of Pennsylvania) Frank de Boer (University of Utrecht) Flavio Corradini (University of L'Aquila) Colin Fidge (University of Qeensland) Roberto Gorrieri (University of Bologna) Paola Inverardi (University of L'Aquila) Amir Pnueli (The Weizmann Institute of Science, Israel) Bran Selic (Rational Software Inc.) Joseph Sifakis (Verimag Laboratory) Walter Vogler (University of Augsburg) From concurrency.cwi.nl Mon May 1 00:00:00 2000 To: concurrency@cwi.nl (moderated) From: Carron Shankland Subject: Job advert University of Stirling Department of Computing Science and Mathematics Developing Implementation and Extending Theory (DIET): A Symbolic Approach to Reasoning about LOTOS Research Assistant Applications are invited for a Research Assistant post at the University of Stirling available under the EPSRC-funded DIET project. This is a fixed term post (12 months starting as soon as possible) for a project combining practical tool development with research in formal methods for concurrent systems. The main objective of the project is the design and implementation of a verification tool for model checking modal formulae against symbolic transition systems. Additional objectives are to carry out evaluative case studies, and to further develop the theoretical basis of symbolic transition systems. The ideal candidate will have experience of one or more of: process algebra, modal logic, verification tools especially model checkers, and programming. A PhD (or research experience) is desirable but the post would also suit an experienced programmer with an interest in formal approaches to software engineering. See http://www.cs.stir.ac.uk/~ces/DIET/diet.html for further information or contact Carron Shankland, Department of Computing Science and Mathematics, telephone: 01786 467444, e-mail: carron@cs.stir.ac.uk. Salary will be within the Research and Analogous Staff Salary Scale 1A, up to point 7 (=A316,286 - =A318,915 p.a.). =46urther particulars and application forms are available from the Personnel Office, University of Stirling, Stirling, FK9 4LA, tel: (01786) 467028, fax (01786) 466155 or email personnel@stir.ac.uk. (Ref: 240) Closing date for applications: Monday 17th May 2000. ______________________________________________________________ | | | Dr Carron Shankland Computing Science & Mathematics | | Email: ces@cs.stir.ac.uk University of Stirling | /) http://www.cs.stir.ac.uk/~ces Stirling (\ / ) Tel: 01786-467444 FK9 4LA ( \ _( (___ ________________________________________________________) )_ (((\ \) /,) / ) / /))) (\\\\ \_/ / \ \_/ ////) \ / \ / \ _/ \_ / ---/ /------------------------------------------------------------\ \--= -- From concurrency.cwi.nl Thu Apr 27 00:00:00 2000 From: Frits Vaandrager To: concurrency@cwi.nl (moderated) Subject: PhD position in Nijmegen Within the Informatics for Technical Applications (ITA) research group of the University of Nijmegen, the Netherlands, there is an opening for a PhD Research Studentship (AiO position) The position will be funded by Philips Research Laboratories in the context of the HaaST research project. HaaST (Verification of Hard and Softly Timed System) is a project supported by PROGRESS, the Dutch Program for Research on Embedded Systems & Software. The project is a joint effort of the Formal Methods & Tools chair at the University of Twente and the ITA group in Nijmegen, in collaboration with Philips Research Laboratories. Distributed algorithms and protocols have become of vital importance for consumer electronics. Over the last years there has been an enormous effort by the industry to develop various protocol stacks, such as IEEE 1394 `Firewire' and HAVi, and to incorporate these into consumer products. Even though these products are mostly not safety-critical, the financial implications of errors or bad performance can be enormous, simply because of their mass replication. This implies that the verification of the correctness of such systems is of great practical importance. The very high complexity of the protocol stacks, however (specifications typically take up several hundreds of pages), turn their verification into a major challenge. In addition to the problems of size, the analysis of the time dependent features is an important source of problems because of the rather subtle complications that they may cause. The project aims at: - Extension of existing verification methods for timed systems with features for stochastic properties. - Development of a verification tool environment for the analysis of timed and stochastic systems. - Application of state-of-the-art methods and tools to case studies of representative complexity (which will be provided by Philips). For more information, see http://fmt.cs.utwente.nl/HaaST/. The ITA group in Nijmegen (see http://www.cs.kun.nl/ita/) is well-known for its work on formal models and logics for specification and verification of state based systems, and the successful application of this work on real-world problems. Unique about the group is that it brings together specialists on three different and important approaches in this area: I/O automata, Hoare's logic, and coalgebras. Requirements: We seek a motivated individual with an MSc degree in computer science or mathematics (or comparable qualifications). Conditions of employment: The contract is for 4 years. Monthly salary: NLG 3098,-- in the first year, increasing to NLG 4077,-- in the fourth year (including supplementary premiums). The candidate will also be enrolled in the programme of the national Dutch graduate school IPA (Institute for Programming Research and Algorithmics). The research has to lead to a PHD thesis. Information: Information can be obtained from prof. Frits Vaandrager, telephone +31 24-362216, email frits.vaandrager@cs.kun.nl. Application: Applications should reach us before 1st June and should include a curriculum vitae and the names and addresses of two references. You should send your application either to frits.vaandrager@cs.kun.nl or via surface mail to KUN, faculty of sciences, Personele Zaken, attn. Drs. D. Reinders, Toernooiveld 1, 6525 Nijmegen, The Netherlands, referring to number 35-00=20. From concurrency.cwi.nl Mon May 8 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: HLCL 00 -- call for papers -- reminder From: Peter Sewell -- Reminder: deadline 17th May -- HLCL'00 2nd Call For Papers 4th International Workshop on High-Level Concurrent Languages Montreal, Canada, September 20, 2000 Affiliated with PLI 2000, September 18 - 23, 2000 http://www.cl.cam.ac.uk/users/pes20/hlcl00/ Scope This workshop, a continuation of three previous meetings, is intended to bring together active researchers involved in the design, development, foundations, and applications of high-level concurrent (and distributed) programming languages and models. The theme of the workshop is that such programming models should be simple, practical, high-level, and well-founded. These qualities allow rigorous language specifications and support both formal and informal reasoning about programs. For concurrent and distributed systems, research on programming models has driven the design of several recent programming languages including Erlang, CML, Facile, and Haskell, as well as languages explicitly designed for concurrency or distribution such as HACL, JoCaml, Obliq, Oz, (Nomadic) Pict, and TyCO. Although the motivations behind the design of these languages are diverse (ranging from the development of graphical user interfaces and multi-agent systems to constraint, real-time, and distributed programming), suitable foundations have turned out to be quite similar in style and technique, often based on variants of well-known calculi for mobile processes. Program Committee Cedric Fournet (Microsoft Research UK) Alan Jeffrey (DePaul University, USA) Trevor Jim (AT&T Labs, USA) Naoki Kobayashi (University of Tokyo, Japan) Uwe Nestmann (Aalborg University, Denmark) John Reppy (Co-Chair) (Bell Labs, USA) Aleta Riccardi (Bell Labs, USA) Peter Sewell (Co-Chair) (University of Cambridge, UK) Gert Smolka (Universitat des Saarlandes, Germany) HLCL Organizing Committee Uwe Nestmann (Aalborg University, Denmark) Benjamin Pierce (University of Pennsylvania, USA) Previous meetings Previous HLCL Workshops have been held at the Isaac Newton Institute for Mathematical Sciences, University of Cambridge (1995), Dagstuhl, Germany (1997), and Nice, France (1998), in conjuction with CONCUR 98. Details can be found at http://www.cs.auc.dk/hlcl98/. Invited Talk There will be an invited talk by Suresh Jagannathan of the NEC Research Institute. Submission and Publication Submissions should be 6-12 pages excluding bibliography, typeset 11 points with reasonable margins. They should be in postscript format, viewable by ghostscript, and printable both on usletter and a4 size paper. Submissions should be sent to Peter.Sewell@cl.cam.ac.uk, with a covering email including a 100-200 word ASCII abstract. The Proceedings will appear as part of a volume in Electronic Notes in Theoretical Computer Science, Elsevier Science Publishers. Timing Deadline for submission: 17 May 2000 Notification of acceptance: 3 July 2000 Final version due: 14 August 2000 From concurrency.cwi.nl Thu May 4 00:00:00 2000 From: J Strother Moore To: concurrency@cwi.nl (moderated) Subject: ACL2 Workshop 2000 ACL2 Workshop 2000 University of Texas at Austin Austin, Texas Oct 30-31, 2000; brief tutorial afternoon of Oct 29. The next workshop on the ACL2 theorem prover and its applications will be held at the University of Texas on Monday and Tuesday, October 30-31, 2000. Immediately after the ACL2 workshop, Austin hosts the Formal Methods in Computer-Aided Design (FMCAD) conference. It will be easy to attend both. ACL2 is described at http://www.cs.utexas.edu/users/moore/acl2. Last year's workshop produced two books, * Computer-Aided Reasoning: An Approach, Kaufmann, Manolios, Moore, Kluwer, (May, 2000) * Computer-Aided Reasoning: ACL2 Case Studies, Kaufmann, Manolios, Moore (eds), Kluwer, (May, 2000) and includes articles by a number of contributors on topics ranging from real analysis and first-order logic to the mechanical verification of designs of industrial interest like an RTL description of a floating-point multiplier and the verification of a safety- critical component of a compiler. This year's ACL2 workshop is open to all. If you would like to attend, please let us know by filling out and returning the pre-registration form below, so we can arrange for an appropriately large meeting room. For those who don't know ACL2 but wish to learn enough to listen to the talks and see what's going on in the ACL2 community, we will present a brief tutorial on Sunday afternoon before the meeting. There will be a nominal registration fee to cover the cost of food, the meeting room and, we expect, the proceedings, to be produced and mailed after the meeting. We anticipate the fee being around $100 and will give full details when the details have been finalized. The fee will be collected by check or cash at the workshop. CALL FOR PAPERS We invite papers on any topic related to ACL2, including but not limited to: * applications of the theorem prover * improvements and extensions to the theorem prover * comparisons of ACL2 to other theorem provers, programming languages, or specification languages * solved challenge problems for ACL2 users (especially challenges that help newcomers learn the system) * implementations connecting ACL2 and other systems You should assume that the audience has a working knowledge of ACL2, including familiarity with the syntax, the basic commands, and modeling techniques used. We are looking for two kinds of papers. * Full papers: no more than about 20 pages in length. * Short papers: at most five pages, these may report on work in progress, challenge problems, clever tricks, etc. Full papers will be reviewed by the program committee (below); short papers will be reviewed by a subset of the committee. Submissions should be sent by email in Postscript format, when possible. Papers that describe successful uses of ACL2 should be accompanied by ordinary text files containing the appropriate ACL2 input and instructions for how to process them with ACL2, although the papers themselves should be self-contained. We expect that accepted papers (both full and short) will be presented at the workshop and published in a conference proceedings format. Final copies of the papers will be collected shortly after the October meeting. Where applicable, we encourage authors of accepted papers to provide ACL2 script files or ``books'' to provide full details, which can be mirrored on the ACL2 home page (above) and included in future ACL2 distributions. PROGRAM COMMITTEE: Bob Boyer (CS Department, University of Texas, Austin, Texas) John Cowles (CS Department, University of Wyoming, Laramie, Wyoming) Wolfgang Goerigk (IIPM, Christian-Albrechts-Universitat zu Kiel, Germany) Matt Kaufmann (Advanced Micro Devices, Inc., Austin, Texas) Pete Manolios (CS Department, University of Texas, Austin, Texas) William McCune (MCS, Argonne National Laboratory, Argonne, Illinois) J Moore (CS Department, University of Texas, Austin, Texas) David Russinoff (Advanced Micro Devices, Inc., Austin, Texas) Jun Sawada (IBM Austin Research Laboratory, Austin, Texas) Matt Wilding (ATC, Rockwell Collins, Inc., Cedar Rapids, Iowa) ORGANIZING COMMITTEE: Matt Kaufmann (matt.kaufmann@amd.com) J Moore (moore@cs.utexas.edu) DATES: Pre-Registration as soon as possible Submission Deadline: July 15, 2000 Acceptance Notification: September 1, 2000 Workshop: October 30-31, 2000 (brief tutorial on Oct 29) --------------------------------------------------------------------------- ACL2 Workshop 2000 -- Pre-Registration Form Please fill out and return this form to jomoore@cs.utexas.edu. By doing so you can help us make suitable arrangements for the workshop. Fees will be collected only if you attend the workshop. Name: ________________________ email: ________________________ Address: ________________________ ________________________ Check those that apply. [] I hope to submit a long paper. [] I hope to submit a short paper. [] I plan to attend the ACL2 tutorial session, Sunday afternoon, October 29, 2000. [] I plan to attend the workshop dinner, Sunday evening, October 29, 2000 (and pay for it at the time). [] I plan to attend the workshop, Monday and Tuesday, October 30-31, 2000. [] I would like a UT parking permit October 30-31, 2000. [] I am a student at ____________. I understand that if I attend the workshop I will be expected to pay a registration fee (by cash or check) during the workshop to cover workshop costs. The exact amount of the fee will be announced to the registrants several weeks before the workshop. Students will receive a 25% discount. You will be responsible for your own hotel/accommodation arrangements. FMCAD 2000 is being held at the Austin Marriot Hotel at the Capitol, Nov 1-3. Expecting overlap between those attending our workshop and FMCAD, the hotel has agreed to give us some ``early arrival'' rooms starting Saturday, October 28, at the FMCAD rate. Please contact the hotel directly (512 478-1111) and mention ``FMCAD.'' The rate is $149 per night (for a single or for a double). Tee-Shirts: The ACL2 Workshop tee-shirt has the ACL2 ``infinity'' logo on the front and ``ACL2 Workshop 2000'' and a slogan on the back. I will probably buy some ACL2 Workshop 2000 tee-shirts. Each will cost about $11, payable by cash or check at the workshop. Number in each size: Small Med Large X-Large XX-Large ___ ___ ___ ___ ___ Preference Poll: We will produce a fixed number of shirts in each of one or two colors. What is your preference? [] a dark color (e.g., black, navy) [] a light color (e.g., white, light blue) [] a bright color (e.g., red, yellow) Slogan suggestion: ________________________ (Last year's slogan was: ``It ain't over til the last Q.E.D.'') From concurrency.cwi.nl Thu May 4 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: Postdoc - wide area programming From: Peter Sewell Postdoctoral Research Associate Wide-area programming: Language, Semantics and Infrastructure Design Computer Laboratory, University of Cambridge We are seeking applicants for a Postdoctoral Research Associate on the EPSRC-funded project Wide-area programming: Language, Semantics and Infrastructure Design The project is studying the foundations of distributed programming, looking at problems of distributed infrastructure, security, failure, mobility and modularity in the context of language design, implementation and semantics. Experience in semantics, distributed systems and/or language implementation would be advantageous -- the possible work can range from theoretical innovation to design and implementation, according to the interests and abilities of the successful candidate. See http://www.cl.cam.ac.uk/users/pes20/advert-ra.html for further pointers. The project is associated with the Theory and Semantics group and the Opera (Distributed Systems) group of the University of Cambridge Computer Laboratory. For general information about the Computer Laboratory and its research see http://www.cl.cam.ac.uk/. The post is available for up to 3 years, to start on 1 October 2000 or shortly thereafter. The initial salary will be in the range 16286 - 24479 pounds per annum, depending on age and experience. Informal inquiries may be addressed to Dr P Sewell at Peter.Sewell@cl.cam.ac.uk. Applications, with curriculum vitae, a statement of research interests, and the names and addresses of two referees, should be sent to Dr P Sewell, University of Cambridge Computer Laboratory, Pembroke Street, Cambridge, CB2 3QG. To be sure of full consideration, they should be received by 28 May 2000. Peter Sewell Robin Milner From concurrency.cwi.nl Wed May 3 00:00:00 2000 From concurrency.cwi.nl Wed May 3 00:00:00 2000 From: Jos Baeten To: concurrency@cwi.nl (moderated) Subject: advertentietekst ENG In the department of Computing Science (http://www.win.tue.nl/inf/english/) of the faculty of Mathematics and Computing Science of Eindhoven University of Technology there are several vacancies for a Lecturer of Computing Science V 32844 and also several vacancies for a Scientific programmer V 32846 General The faculty of Mathematics and Computing Science (http://www.win.tue.nl/) offers the engineering degrees of Mathematics and Computing Science, in addition to Master of Technological Design degrees (http://www.sai.tue.nl/) in Software Technology and Mathematics in Industry. The faculty has numerous research projects with other universities and companies, both nationally and on a European scale. The department of Computing Science has three major application areas. The first is Embedded Systems, represented by the Eindhoven Embedded Systems Institute, in cooperation with the faculty of Electrical Engineering (http://www.eesi.tue.nl/). Second, Business Information Systems, in cooperation with the faculty of Technology Management, en third, Bio-Informatics, in cooperation with the faculty of BioMedical Engineering. The faculty has about 200 employees and over 600 students. The department of Computing Science focuses in research and education on the development of methods and techniques for the design of information systems. A distinctive feature is the fundamental approach, the use of mathematical techniques as effective design tools. Currently, the scientific staff of the department consists of 29 lecturers, 6 senior lecturers and 5 full-time professors. Following a large increase of the student population, we are looking to expand at all levels. What we look for A lecturer (universitair docent) in Computing Science has duties in teaching, research and management. We are looking for people with a Ph.D. in Computer Science that combine an interest in applications with a solid formal background. You can work well in a group. You have experience in teaching and are willing to take courses to enhance your didactical skills. A scientific programmer (systeemdeskundige) participates in research and educational projects with the scientific staff. We are looking for people with an M.Sc. in Computer Science (or comparable degree) that can develop and realise a software-based system on their own, and that can develop, integrate, implement and test a piece of software. You can work well in a group. Employment These are tenure-track positions. This means that you get a temporary position for two years, after which tenured permanent employment is considered. Salary for a lecturer is dependent upon education and experience, with a maximum of Dfl. 8769 monthly, before taxes. For a scientific programmer, the maximum is Dfl. 7694 (Dfl. 8769 in exceptional cases). Besides this, there is a good package of employee benefits. Information Concerning the positions: prof.dr. J.C.M. Baeten, chairman of the selection committee, tel. +31 40 2475155, j.c.m.baeten@tue.nl. Other information: W.C.J. Verhoef, personnel department, tel. +31 40 2474315, w.c.j.verhoef@tue.nl. How to react You can send a written application, together with a CV and list of publications, before the end of May, 2000, to drs. S. Udo, managing director of the faculty of Mathematics and Computing Science, Eindhoven University of Technology, HG 6.19, P.O.Box 513, 5600 MB Eindhoven, mentioning the number of the vacancy, V 32844 for lecturer, V 32846 for programmer. Content-Description: Card for Baeten, Jos C.M. From concurrency.cwi.nl Tue May 16 00:00:00 2000 From: Marco Bernardo To: concurrency@cwi.nl (moderated) Subject: PAPM 2000: call for participation & short contributions *************************************************************************** * * * PAPM 2000 * * 8th INTERNATIONAL WORKSHOP ON PROCESS ALGEBRA AND PERFORMANCE MODELLING * * http://www.cs.unibo.it/~bravetti/papm2000/ * * * * 15th July 2000 - Geneva (Switzerland) * * Satellite Workshop of ICALP 2000 * * * * CALL FOR PARTICIPATION * * CALL FOR SHORT CONTRIBUTIONS * * * *************************************************************************** The aim of the workshop is to bring together researchers and practitioners interested in the development and application of process algebras to performance modeling and evaluation. The programme of PAPM 2000 is appended below. The programme may vary in order to include a few short presentations on ongoing work. Whoever interested is kindly requested to submit a short paper to Roberto Gorrieri (gorrieri@cs.unibo.it) by June 1. For registration see: http://cui.unige.ch/~icalp/registration.html For accommodation and general information see: http://cui.unige.ch/~icalp/gi.html ------------------------------------------------------------------------------- 9.00-10.00: "Are Stochastic Process Algebras Good for Performance Evaluation?" B. Haverkort 10.00-10.30: Coffee break. 10.30-11.00: "Amalgamation of Transition Sequences in the PEPA Formalism" J. Hillston, J. Tomasik 11.00-11.30: "A Matrix-based Method for Analysing Stochastic Process Algebras" J. Bradley, N. Davies 11.30-12.00: "Temporal Rewards for Performance Evaluation" J. Voeten 12.00-12.30: "Approximating Variance in Non-Product Form Decomposed Models" N. Thomas, J. Bradley 12.30-14.00: Lunch. 14.00-15.00: "A Branching-Time Theory for Probabilistic Model Checking" R. Cleaveland 15.00-15.30: Coffee break. 15.30-16.00: "An Asynchronous Calculus for Generative-Reactive Probabilistic Systems" A. Aldini, M. Bravetti 16.00-16.30: "A Tool for Quantitative Analysis of pi-calculus Processes" L. Brodo, P. Degano, C. Priami 16.30-17.00: "Integrating TwoTowers and GreatSPN" M. Bernardo, N. Busi, M. Ribaudo 17.00-17.30: "Modelling and Performance Analysis of Resource Allocation Strategies for Real-Time Services in UMTS using TIPPTool" L. Deotto, F. Babich From concurrency.cwi.nl Tue May 16 00:00:00 2000 From: Colin Stirling To: concurrency@cwi.nl (moderated) Subject: Lectureship at Edinburgh University of Edinburgh Division of Informatics Lectureship in Software Engineering/Application of Theoretical Computer Science The focus for research in Software Engineering is the Software Engineering Programme. This spans all the research institutes in the Division and involves a wide range of other departments at Edinburgh. Our areas of interest include: dependability; the effects of organisational factors on software engineering; software architecture; cognitive aspects of software engineering; formal specification and development; systems reengineering; testing and verification; system modelling; safety-critical systems. Much of our work involves the interplay of practical problems arising in systems with theoretical work. This involves members of the Laboratory for Foundations Computer Science (LFCS); the Institute for Reasoning and Representation (IRR); the Institute for Computer Systems Architecture (ICSA); and the Institute for Communicating and Collaborating Systems (ICCS). Following the recent success of Dr Perdita Stevens in obtaining a five year EPSRC Advanced Research Fellowship we seek to appoint a Lecturer who will contribute to our research in either or both of the fields of: Software Engineering Applications of Theoretical Computer Science, broadly construed. Possible areas of research interest include, but are not limited to: model-checking; formal approaches to semi-structured databases and data mining; probabilistic modelling and reasoning and their relation to logical methods; agents and agent-based software; dependability of systems; processes and tools for object-oriented design. Candidates should be capable of making a strong contribution to our teaching of Software Engineering at undergraduate and graduate level. From concurrency.cwi.nl Tue May 16 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: PhD positions in Logics, Types, Rewriting adn Automation From: Fairouz Kamareddine The ULTRA group (Useful Logics, Types, Rewriting and Automation) HERIOT-WATT UNIVERSITY Department of Computing and Electrical Engineering EPSRC PhD Studentships The department has a number of studentships available for UK and EU nationals to undertake research leading to a PhD. We encourage the applications of those interested in any of the areas below: 1. the study and automation of logics, type theories, and rewriting theory 2. the logical/type theoretical foundations of programming languages, the formalization of mathematics, and theorem proving. 3. the design and implementation of programming langauges and theorem provers. 4. The Lambda calculus. Candidates should hold or expect to hold a good honours degree or the equivalent. Further information about applications and research projects we offer at the ULTRA group can be obtained by contacting Professor Fairouz Kamareddine (fairouz@cee.hw.ac.uk) Further details of the ULTRA group can be found on: http://www.cee.hw.ac.uk/ultra/ From concurrency.cwi.nl Fri May 12 00:00:00 2000 From: Omer F Rana Subject: Programme: W13@AA2K To: concurrency@cwi.nl (moderated) CALL FOR PARTICIPATION Infrastructure for Scalable Multi-Agent Systems Workshop at Autonomous Agents 2000 Barcelona, Spain Sunday, June 4 2000 The programme for workshop 13 (W13) is below. We thank all the people who submitted papers to this workshop, and all those who reviewed them over the busy Easter period. We received a very large number of papers, many more than we were expecting. The acceptance rate was 30%. We hope some of you will be able to attend the workshop. Given the other very interesting workshops/tutorials also scheduled on the same day, we hope that you will be able to atleast "sample" some of the papers. We thank the organisers for giving us the opportunity. Omer Rana and Tom Wagner ====================================================================== 9:00 Opening remarks MORNING: TOPIC A: "MAS Infrastructure and Requirements" ============================================== 9:10 Les Gasser, "MAS Infrastructure Definitions, Needs, and Prospects." 9:40 Keith Decker, "Tools for Developing and Monitoring Agents in Distributed Multi-Agent Systems." 10:00 Mihhail Matskin, "Agora: An infrastructure for cooperative work support in multi-agent systems." 10:20 Regis Vincent, "Issues in Simulation of Large-Scale (Intelligent) Agent Systems" 10:30 Coffee Break 11:00 K. Suzanne Barber, "Sensible Agent Testbed Infrastructure for Experimentation." 11:20 Olivier Gutknecht, Jacques Ferber, "The MADKIT Agent Platform Architecture." 11:40 Roberto Flores, Rob Kremer, Douglas Norrie, "An Architecture for Modeling Internet-based Collaborative Systems." 12:00 Leon Osterwiel, "Integrating High-Level and Detailed Agent Coordination into a Layered Architecture" combined with "Frameworks for Reasoning About Agent-based Systems." 12:20 Milind Tambe, "Adaptive infrastructures for agent integration." 12:40 Special grouping: Itsuki Noda and Peter Stone Nadir Ould-Khessal and Shamsudin Amin "RoboCup Infrastructure and Technology: Overview and Comparison With Other Agent Infrastructure / Research" 13:00pm - Lunch AFTERNOON: TOPIC B: "Infrastructure Scalability" ===================================== 14:00 Marios D. Dikaiakos and George Samaras, "A Performance Analysis Framework for Mobile-Agent Platforms" 14:20 Murray Woodside, "Scalability Metrics and Analysis of Mobile Agent Systems" 14:40 Giovanna Di Marzo Serugendo, "A formal Development and Validation Methodology Applied to Agent-Based Systems" 15:00 Khaled Nagi, "Scalability of a Transactional Infrastructure for Multi-Agent Systems" 15:20 In-Gyu Kim, Jang-Eui Hond, Doo-Hwan Bae and Cheong Youn, "Scalable Mobile Agents Supporting Dynamic Composition of Functionality" 15:40 P. J. Turner and N. R. Jennings, "Improving the Scalability of Multi-Agent Systems" 16:00 Coffee 16:30 Line Pouchard and David W. Walker, "A Community of Agents for User Support in a Problem Solving Environment" 16:50 Juan A. Botia, Antonio G. Skarmeta, Mercedes Garijo, Juan R. Velasco, "A Proposal for Meta-Learning Through Multi-Agent Systems" 17:10 Sam Joseph and Takahiro Kawamura, "Why Autonomy Makes the Agent" 17:20 Stefan Poslad, "Open Source, Standards and Scaleable Agencies" 17:45 - PANEL SESSION: The following have agreed to participate on the panel: * K. Suzanne Barber, University of Texas at Austin * Tim Finin, University of Maryland Baltimore County * Katia Sycara, Carnegie Mellon * David Wolpert, NASA Ames ------------------------------------------------------------------------ -- work:+44 (0)2920-875542 / otherwise:+44 0956-299981 / parallel and scientific computation / room S2.03 / dept of computer science / university of wales - cardiff / po box 916 / cardiff cf24 3xf / uk / email: o.f.rana@cs.cf.ac.uk From concurrency.cwi.nl Fri May 12 00:00:00 2000 From: "Jose N. Oliveira" To: concurrency@cwi.nl (moderated) Subject: FME 2001: Call for Papers FORMAL METHODS EUROPE FME 2001 "Formal Methods for Increasing Software Productivity" International Symposium and Tutorials 12-16 March 2001 Humboldt-Universitaet zu Berlin, Germany (http://www.informatik.hu-berlin.de/top/fme2001) Call for Submissions ******************** FME 2001 is the tenth in a series of symposia organised by Formal Methods Europe, an independent association whose aim is to stimulate the use of, and research on, formal methods for software development. These symposia have been notably successful in bringing together a community of users, researchers, and developers of precise mathematical methods for software development. The theme of FME 2001 is Formal Methods for Increasing Software Productivity. This theme recognizes that formal methods have the potential to do more for industrial software development than enhance software quality--they can also increase productivity at many different points in the software life-cycle. The symposium committee is particularly interested in papers on the use of formal methods to increase productivity, for example on: * Codifying domain knowledge * Re-using components * Automatically generating code and/or documentation * Improving the efficiency of software testing * Enhancing analysis techniques for validation and verification * Exploiting commonalities within product families * Improving the maintainability and modifiability of software * Empirical studies of effects on productivity SCOPE The scope of the symposium, as always in its distinguished history, also includes all other aspects of the use of formal methods, for development of software in all application areas. The scope of the symposium covers the entire range from fundamental theory of description and reasoning to particulars of practice and experience. In addition to presentations of submitted papers, the symposium will also offer tutorials, workshops, invited speakers, and tool demonstrations. PAPERS The symposium committee solicits full-length papers in two broad categories: 1. Use of formal methods, including reports on industrial use, substantial case studies, comparisons among methods, education, and technology transfer. 2. Development of formal methods, including motivating factors, theoretical foundations, extensions, manual procedures, and tool support. Authors are requested to mention the category (1 or 2) of their papers when they submit. Full papers should be submitted in Postscript or PDF format by E-mail to reach fme2001sub@di.uminho.pt by 25th August, 2000. There are no fixed page limits on submissions but authors are warned that papers exceeding twenty A4 pages will be regarded as long, and that the content must justify the length. TUTORIALS Tutorials will be held on 12-13th March. Each tutorial will last one-half or one day. Proposals for tutorials are welcome, and should be directed to the programme chairs. WORKSHOPS Proposals for parallel workshops are welcome, and should be directed to the programme chairs. TOOL DEMONSTRATIONS Tool demonstrations will take place during the symposium, with the opportunity for presentations to be made about each tool. Proposals for tool demonstrations are welcome and should be made to the organising chairs, with whom provision of necessary computing facilities should be discussed. PEOPLE Organising Co-Chairs Stefan Jaehnichen Wolfgang Reisig Organising Committee BWO Marketing Service Birgit Heene Adrianna Foremniak Axel Martens Programme Co-Chairs Jose Oliveira, Dept. Informatica, Universidade do Minho, Campus de Gualtar, 4700-320 Braga, Portugal Tel: +351 253 604 470 E-mail: jno@di.uminho.pt Pamela Zave, AT&T Laboratories, 180 Park Avenue, Florham Park, NJ 07932, USA Tel: +1 973 360 8676 E-mail: pamela@research.att.com Programme Committee Eerke Boiten University of Kent at Canterbury Rick Butler NASA Langley Research Center Lars-Henrik Eriksson Industrilogik L4i AB John Fitzgerald Centre for Software Reliability, Newcastle, UK Peter Gorm Larsen IFAD Yves Ledru Universite Joseph Fourier - Grenoble Dominique Mery Universite Henri Poincare - Nancy Jayadev Misra University of Texas at Austin Richard Moore United Nations University IIST Friederike Nickl F.A.S.T. GmbH Tobias Nipkow Technische Universitaet Muenchen Jose Oliveira (co-chair) Universidade do Minho Paritosh Pandya TIFR Mumbai, India Nico Plat Cap Gemini Amir Pnueli Weizmann Institute Augusto Sampaio Universidade Federal de Pernambuco Steve Schneider Royal Holloway, University of London Jim Woodcock Oxford University Pamela Zave (co-chair) AT&T Laboratories IMPORTANT DATES Deadline for submission of papers, tutorial proposals, and workshop proposals: 25th August, 2000 Notification of acceptance/rejection: 17th November, 2000 Camera ready final version of papers due: 5th January, 2001 From concurrency.cwi.nl Thu May 11 00:00:00 2000 From: Arend Rensink To: concurrency@cwi.nl (moderated) Subject: CFP: YOO (Why Object-Orientation), satellite to CONCUR 2000 YOO (Why Object-Orientation) http://www.cs.utwente.nl/Workshops/yoo Half-day satellite workshop of CONCUR 2000 (http://www.cse.psu.edu/concur2000/) Pennsylvania State University, USA, August 26, 2000 (morning) Topic ===== Object-orientation is pervading computer science practice and therefore naturally attracts computer science researchers. For some it may be merely a new buzzword to attach to what they do best; to others the concepts of object-orientation (OO) pose new and relevant research questions. Yet others may be unfamiliar with the principles that lie behind OO -indeed even among those that consider themselves familiar there is no consensus about these principles. Within the theory of concurrency, OO is the subject of much debate. Many seem to feel that even though OO may have its uses in other fields of computer science, it does not bring new problems to or shed new light upon their favourite subject area. Others find in the concepts of OO precisely the elements that they think of as most important for a successful design or verification method. Aim of the workshop =================== This workshop aims to bring together OO sceptics and enthusiasts in identifying (or at least openly discussing) ways in which OO has relevance to the theory of concurrency. Questions that can be addressed are: - What (if any) are the advantages of OO in the theory of concurrency? - What difference does OO make to specific fields, such as specification, testing, model checking or compositional system design (to name just a few)? - What are the research questions that most urgently need to be answered? Specifically, it is *not* the aim of the workshop to present theoretical novelties that purport to encapsulate, obviate or improve upon OO; rather, the interest should be directed towards the motivation for investigating such matters: either YOO? or Y, OO! Organisation ============ The workshop will consist of two invited 30 minute presentation and a larger number of 10 minute position statements, followed by a free-for-all discussion. Position statements for the 10-minute presentations are hereby invited (see below); they will be made available both over the internet and in the form of a technical report of the University of Twente, distributed during the workshop. A summary of the discussion will be published at a later date, in a form yet to be decided. No formal proceedings are planned. The number of participants is envisaged at no more than 25, so as to ensure a lively discussion. All participants should submit a position statements; the 10-minute presentations will be solicited on the basis of the submissions. The workshop will end at lunchtime. Submission and participation ============================ To participate in this workshop please send your position statement in ASCII, LaTeX, Word or postscript format to rensink@cs.utwente.nl. Position papers should be 1-4 pages and express the authors' opinion on the benefits (or lack of them) of OO to the theory of concurrency or vice versa, open research areas in the intersection of OO and concurrency, or other issues germane to the topic of the workshop. Explicit statements of opinion are encouraged. Important dates =============== Submission deadline: June 14, 2000 Notification: July 14, 2000 Workshop: August 26, 2000 (morning) Organisation ============ Arend Rensink Dept. of Computer Science, University of Twente P.O.Box 217, NL-7500 AE Enschede, The Netherlands Email: rensink@cs.utwente.nl From concurrency.cwi.nl Thu May 11 00:00:00 2000 From: Bjorn Victor To: concurrency@cwi.nl (moderated) Subject: MSCS special issue Mathematical Structures in Computer Science (MSCS) Joint Special Issue(s) devoted to "The Difference between Concurrent and Sequential Computation" and to selected papers from EXPRESS'00: 7th International Workshop on Expressiveness in Concurrency (Giuseppe Longo editor in chief, Luca Aceto and Bjorn Victor guest editors) CALL FOR PAPERS Computer Science has witnessed the emergence of a plethora of different logics, models and paradigms for the description of computation. Yet, the classic Church-Turing thesis may be seen as indicating that all models of general model of computation are equivalent. Alan Perlis referred to this as the "Turing tarpit": some of the most crucial distinctions in computing methodology, such as sequential versus parallel, determinate versus nondeterministic, local versus distributed disappear if all one sees in computation is pure symbol pushing. How can we express formally the difference between these models of computation? This double issue of MSCS aims at addressing this fundamental question by focusing on the dichotomy between sequential and concurrent computation. In particular, on ways to capture formally that any translation from an expressive approach to concurrency to a formalism like that of Turing Machines would miss "what really matters". By way of example, in Physics, people know very well that non-Euclidean geometries can be "embedded" into the Euclidean one (and conversely), but they know that the equivalence, an interesting equicoeherence, misses what really matters, e.g. the geometric structure of physical (relativistic) space. Similarly, one can surely give an "isomorphism" (as sets) between the real line and the plane (or any finite dimensional space), but this misses all what matters in the notion of Cartesian space, e.g. the dimension (which is a topological invariant, not a set-theoretic one). Are there theorems or rigorous arguments as to confirm the view that translating concurrency in sequential computation misses some important aspect of concurrency? Which is the peculiar role played by space (and time) in distributed, concurrent systems? This special issue of MSCS is devoted to papers addressing this issue in a creative and novel way. Broad surveys on this topic are also welcome. In addition, if the quality of submitted papers warrants it, a companion issue of the journal will be devoted to selected papers from EXPRESS'00, the 7th International Workshop on Expressiveness in Concurrency. Authors who plan to submit a paper should kindly inform one of the editors (as soon as possible and) not later than October 30, 2000. The deadline for submissions is January 15, 2001. All submitted papers will be refereed according to the MSCS refereeing process. Information on MSCS and EXPRESS may be found at the URLs: MSCS: http://www.cup.cam.ac.uk/Journals/JNLSCAT95/msc/msc.html EXPRESS'00: http://www.docs.uu.se/~victor/Express/express00.shtml From concurrency.cwi.nl Thu May 11 00:00:00 2000 From: CATS 01 Conference Subject: Call for Papers: CATS 2001 To: concurrency@cwi.nl (moderated) Call for Papers CATS 2001 - Computing: The Australasian Theory Symposium Computing: The Australasian Theory Symposium (CATS) is the premier theoretical computer science conference in Australasia. It is held annually as part of Australasian Computer Science Week (ACSW). CATS 2001 will be the seventh in the series. The symposium will consist of invited speakers and research paper presentations. DATE AND LOCATION CATS 2001 will be held over two days during Australasian Computer Science Week. ACSW 2001 will take place at Bond University, Gold Coast, Queensland, Australia, from 29th January to 2nd February 2001. SCOPE CATS covers all aspects of theoretical computer science. Some representative, but not exclusive, topics include the following: - logic, reasoning and verification - formal specification techniques and program semantics - formal development methods, program refinement, synthesis and transformation - concurrent, parallel and distributed system theory - theory of algorithms and data structures - complexity and computability - automata, number and category theory - tools for automated reasoning, and program analysis and development KEYNOTE ADDRESSES Prof Mathai Joseph, Tata Research Development and Design Centre, Pune, India Prof Carroll Morgan, Software Engineering Research Group, Department of Computer Science and Engineering, University of New South Wales CALL FOR PAPERS Research paper submissions to CATS 2001 should be prepared according to the formatting requirements below and sent to the Programme Chair, to arrive no later than August 4, 2000. Submissions must be original work, not published or submitted elsewhere. All submissions will be refereed. PROCEEDINGS The proceedings of CATS 2001 will be published by Elsevier Science in their series Electronic Notes in Theoretical Computer Science. ENTCS is an electronic series associated with the journal Theoretical Computer Science, and published by Elsevier Science B. V. (Institutions subscribing to TCS can access full papers in ENTCS on-line.) ENTCS offers rapid, worldwide dissemination of research results, an absence of page limits, and long-term accessibility through the electronic archives that Elsevier maintains. (The proceedings of last year's CATS 2000 conference appeared as ENTCS Volume 31.) A hardcopy preliminary proceedings will be provided to conference attendees. Authors of selected papers from the CATS 2001 proceedings will be invited to submit extended versions of their papers to a Special Issue of the journal Theoretical Computer Science. FORMATTING REQUIREMENTS To ensure a uniform format for papers, all submissions to CATS 2001 must be prepared in LaTeX using the ENTCS macros. Papers in other formats cannot be accepted. Further information is available via the ENTCS home page: http://www.elsevier.nl/locate/entcs/. (Follow the links for "Instructions for Submissions" and "Technical Requirements".) Complete papers should be e-mailed as PostScript files, preferably as MIME attachments. Although there is no strict page limit on submissions to CATS 2001, authors are strongly encouraged to be as concise as possible. Papers between 10 and 15 pages are considered ideal. If necessary, definitions and proofs not essential to understanding the paper should be relegated to appendices to appear only in the electronic version. CALL FOR POSTERS A poster session will be arranged to give CATS attendees the opportunity to give informal presentations of their work. Expressions of interest, briefly outlining the poster's topic, should be e-mailed to the Programme Chair by November 10, 2000. IMPORTANT DATES Friday 4 August 2000: Deadline for submissions Friday 6 October 2000: Notification of acceptance Friday 27 October 2000: Final versions of accepted papers due Friday 10 November 2000: Deadline for author registrations Monday 29 January to Friday 2 February 2001: Australasian Computer Science Week, incorporating CATS 2001 PROGRAMME COMMITTEE Mariangiola Dezani-Ciancaglini, Universita di Torino, Italy Rod Downey, Victoria University of Wellington, New Zealand Colin Fidge (Chair), The University of Queensland, Australia Lance Fortnow, NEC Research Institute, USA Joseph Goguen, University of California at San Diego, USA Andrew Martin, Oxford University, United Kingdom Ian Mason, University of New England, Australia Janos Pach, New York University, USA Igor Shparlinski, Macquarie University, Australia Mark Utting, University of Waikato, New Zealand Emo Welzl, ETH Zurich, Switzerland ACSW GENERAL CHAIR Gopal Gupta, Bond University UPDATES AND NEWS Up to date information about the CATS 2001 conference can be found at its web site: http://www.csee.uq.edu.au/~cats01/ ENQUIRIES AND SUBMISSIONS Dr Colin Fidge (CATS 2001 Programme Chair) Software Verification Research Centre The University of Queensland Queensland 4072 Australia Fax: +61 7 3365 1533 Email: cats01@svrc.uq.edu.au From concurrency.cwi.nl Thu May 11 00:00:00 2000 From: "Heike Wehrheim" Subject: Extended Deadline and Final Call: Integrated Formal Methods To: concurrency@cwi.nl (moderated) Final Call for Papers: IFM2000 (with apologies for duplicate transmissions) Extended Deadline: Monday 22nd May Guest Speakers: Tony Hoare, Microsoft Research, Cambridge, UK Wolfram Schulte, Microsoft Research, USA The Second International Workshop on Integrated Formal Methods will be held at the 18th century chateau of Schloss Dagstuhl, Saarland, Germany, from the 1st to the 3rd of November 2000. Proceedings will be published in the series "Lecture Notes in Computer Science". Applying formal methods may involve the modelling of different aspects of a system that are expressed through different paradigms. This motivates us to research the combination of different viewpoints of a system, either by the creation of hybrid notations, by extending existing notations, by translating between notations, or by incorporating a wider perspective by innovative use of an existing notation. The integration of formal methods promises great benifits formal for systems modelling and software development. Whichever approach is taken however, significant issues can arise in areas such as semantic integration, the tractability of our notations, the integration of tool support, the integration of proof systems, consistency and completeness. Issues arise equally in our conceptualisation of systems at different levels of abstraction and the development of these conceptualisations through the process of refinement. The stated theme of IFM'99 was the integration of state based and behavioural formalisms. For IFM2000 this has been widened to include all aspects pertaining to the integration of formal methods and formal notations. The conference also welcomes contributions in related areas such as: hybrid systems, the embedding of one formalism within another, and the integration of formal methods with informal or semi-formal diagram notations and structuring techniques. Location Schloss Dagstuhl is a beautiful 18th century ch=E2teau converted for dedicated use as a computer science conference centre but retaining many original features including a chapel and music room. It is set in the wooded hills of Saarland, Germany, close to the French border. Its many facilities include a world class computer science library, extensive computing facilities, and accomodation for conference participants. For further details and travel information see the Dagstuhl web site at: www.dagstuhl.de IFM2000 Web Site On line conference information may be found at http://uebb.cs.tu-berlin.de/ifm00 Submissions and Publication Submissions should be original work, not published or submitted elsewhere. Submissions may be up to 20 pages in length and should prepared with LaTeX, preferably using the Springer lncs style package: www.springer.de/comp/lncs/authors . Conference proceedings will be published by Springer Verlag in the series "Lecture Notes in Computer Science". Completed submissions should be emailed to IFMPapers@tees.ac.uk Each submission should have two attachments, these being the draft paper and a cover sheet. They should be in postscript format. The cover sheet should contain the title, abstract, and key words, the postal and email addresses of all authors, and the telephone and fax numbers of the contact author. In case of difficulty with submissions please contact one of the organisers: Wolfgang Grieskamp; wg@cs.tu-berlin.de Thomas Santen; santen@cs.tu-berlin.de Bill Stoddart; bill@tees.ac.uk All submissions will be acknowledged within three days. Due to recent virus problems we recommend that IF YOUR SUBMISSION IS NOT ACKNOWLEDGED YOU SHOULD RE-SEND TO ONE OF THE ORGANISERS Important Dates May 15th submission deadline (now extended to 22nd May) June 25th notification of acceptance July 18th submission of final copy. Nov 1st-3rd workshop Programme Committee Keijiro Araki, Univ of Kyushu, Japan Didier Bert, Univ of Grenoble, France Egon Boerger, Univ of Pisa, Italy Jonathan Bowen, Southbank University, London, UK Michael Butler, Univ of Southampton, UK Jim Davies, Oxford University, UK John Derrick, Univ of Kent, UK Heiko Doerr, Daimler Chrysler, Germany Jin Song Dong, National Univ of Singapore Clemens Fischer, Univ of Oldenburg, Germany John Fitzgerald, Univ of Newcastle, UK Andy Galloway, Univ of York, UK Chris George, United Nations University, Macao Wolfgang Grieskamp, Technical University of Berlin, Germany Henri Habrias, Univ of Nantes, France Susumu Hayashi, Kobe University, Japan Maritta Heisel, Univ of Magdeburg, Germany Mike Hinchey, Univ of Omaha, USA Bernd Krieg-Brueckner, Univ of Bremen, Germany Michel Lemoine, ONERA, Toulouse, France Shaoying Liu, Hiroshima City Univ, Japan John McDermid, Univ of York, UK Dominique Mery, LORIA, France Thomas Santen, Technical Univ of Berlin, Germany Steve Schneider, Royal Holloway, UK Wolfram Schulte, Microsoft Research, USA Jane Sinclair, Warwick University, UK Graeme Smith, Software Verification Centre, Queensland, Australia Bill Stoddart, University of Teesside, UK Kenji Taguchi, Chikushi Jogakven Univ, Japan W J (Hans) Toetenel, University of Delft, Holland Heike Wehrheim, University of Oldenburg, Germany Jim Woodcock, Oxford University, UK Organising Committee Wolfgang Grieskamp, Thomas Santen, Bill Stoddart Local Organisation: Nicole Probst From concurrency.cwi.nl Wed May 24 00:00:00 2000 From: "E. Allen Emerson" To: concurrency@cwi.nl (moderated) Subject: CAV 2000 advance program and registration info ********************************************************************* COMPUTER AIDED VERIFICATION (CAV 2000) July 15-19, 2000 Chicago, IL, USA ADVANCE PROGRAM and REGISTRATION INFORMATION home page: http://www.cs.utexas.edu/users/cav2k/ ********************************************************************* CAV 2000 is the 12th in a series dedicated to the advancement of the theory and practice of computer-assisted formal analysis methods for software and hardware systems. The conference covers the spectrum from theoretical results to concrete applications, with an emphasis on verification tools and the algorithms and techniques that are needed for their implementation. The technical program of CAV 2000 will start on Sunday, July 16 and will continue until Wednesday, July 19. The contributed presentations of CAV 2000 include 35 regular papers and 9 short presentations on tools. The program also includes invited talks by Amir Pnueli and Catherine Meadows. Two pre-conference tutorials will be given Saturday, July 15 on Boolean Satisfiability Algorithms and on Verification of Infinite State Systems. The conference is also followed by three satellite workshops/symposia: Advances in Verification and Formal Methods in Securty on July 20, and Symbolic Trajectory Evaluation on July 21st. For the advance program, registration/lodging, and travel information see the CAV 2000 home page at: http://www.cs.utexas.edu/users/cav2k/ For additional information, please contact the co-chairs: E. Allen Emerson (emerson@cs.utexas.edu) A. Prasad Sistla (sistla@surya.eecs.uic.edu) From concurrency.cwi.nl Mon May 22 00:00:00 2000 From: Catuscia Palamidessi To: concurrency@cwi.nl (moderated) Subject: CONCUR 2000: list of accepted papers List of papers accepted at CONCUR 2000 -------------------------------------- The abstracts of these papers are available on the web at the address http://www.cse.psu.edu/concur2000/AccptAbstr.html - Catuscia Palamidessi ------------------------------------------------------------------------------- An Implicitly-Typed Deadlock-Free Process Calculus by Naoki Kobayashi, Shin Saito, Eijiro Sumii ------------------------------------------------------------------------------- A Theory of Testing for Markovian Processes by Marco Bernardo, Rance Cleaveland ------------------------------------------------------------------------------- Action Abstraction by Arend Rensink ------------------------------------------------------------------------------- Emptiness is decidable for asynchronous cellular machines by Dietrich Kuske ------------------------------------------------------------------------------- A Decomposition Theorem for Regular MSC Languages by Madhavan Mukund, K Narayan Kumar, Milind Sohoni ------------------------------------------------------------------------------- Model Checking with Finite Complete Prefixes is PSPACE-complete by Keijo Heljanko ------------------------------------------------------------------------------- Failure Semantics for the Exchange of Information in Multi-Agent Systems by Frank S. de Boer, Rogier M. van Eijk, Wiebe van der Hoek and John-Jules Ch. Meyer ------------------------------------------------------------------------------- LP Deadlock Checking Using Partial Order Dependencies by Victor Khomenko, Maciej Koutny ------------------------------------------------------------------------------- Proof-Outlines for Threads in Java by E. Abraham-Mumm, F.S. de Boer ------------------------------------------------------------------------------- Secrecy and Group Creation by Luca Cardelli, Giorgio Ghelli, Andrew D. Gordon ------------------------------------------------------------------------------- Pomsets for Local Trace Languages: Recognizability, Logic & Petri Nets by D. Kuske, R. Morin ------------------------------------------------------------------------------- Deriving Bisimulation Congruences for Reactive Systems by James J. Leifer, Robin Milner ------------------------------------------------------------------------------- Optimizing Buchi Automata by Kousha Etessami, Gerard Holzmann ------------------------------------------------------------------------------- Weak Bisimulation for Probabilistic Systems by Anna Philippou, Insup Lee and Oleg Sokolsky ------------------------------------------------------------------------------- Reachability Analysis for Some Models of Infinite-State Transition Systems by Oscar H. Ibarra, Tevfik Bultan, Jianwen Su ------------------------------------------------------------------------------- Revisiting safety and liveness in the context of failures by Bernadette Charron-Bost, Sam Toueg, Anindya Basu ------------------------------------------------------------------------------- A Unifying Approach to Data-independence by Ranko Lazic, David Nowak ------------------------------------------------------------------------------- Nondeterminism and Probabilistic Choice: Obeying the Laws by Michael W. Mislove ------------------------------------------------------------------------------- The Impressive Power of Stopwatches by Franck Cassez, Kim Larsen ------------------------------------------------------------------------------- The Control of Synchronous Systems by Luca de Alfaro, Thomas A. Henzinger, Freddy Y.C. Mang ------------------------------------------------------------------------------- Process spaces by Radu Negulescu ------------------------------------------------------------------------------- On the reachability problem in cryptographic protocols (extended abstract) by Roberto Amadio, Denis Lugiez ------------------------------------------------------------------------------- Secure information flow for concurrent processes by J"urjens Jan ------------------------------------------------------------------------------- Process Languages for Rooted Eager Bisimulation by Irek Ulidowski, Shoji Yuen ------------------------------------------------------------------------------- Generalized Model Checking: Reasoning about Partial State Spaces by Glenn Bruns, Patrice Godefroid ------------------------------------------------------------------------------- Open Systems in Reactive Environments: Control and Synthesis by Orna Kupferman, P. Madhusudan, P.S. Thiagarajan, Moshe Y. Vardi ------------------------------------------------------------------------------- Well-Abstracted Transition Systems by Alain Finkel, Purushothaman Iyer, Gregoire Sutre ------------------------------------------------------------------------------- Typing Non-Uniform Concurrent Objects by Antonio Ravara, Vasco T. Vasconcelos ------------------------------------------------------------------------------- Reasoning about probabilistic lossy channel systems by Parosh Abdulla, Christel Baier, Purushothaman Iyer, Bengt Jonsson ------------------------------------------------------------------------------- Functorial Concurrent Semantics for Petri Nets with Read and Inhibitors arcs by Paolo Baldan, Nadia Busi, Andrea Corradini, Michele Pinna ------------------------------------------------------------------------------- Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic by Roberto Bruni, David de Frutos-Escrig, Narciso Marti-Oliet, Ugo Montanari ------------------------------------------------------------------------------- Chi Calculus with Mismatch by Yuxi Fu, Zhenrong Yang ------------------------------------------------------------------------------- Verifying Quantitative Properties of Continuous Probabilistic Timed Automata by Marta Kwiatkowska, Gethin Norman, Roberto Segala, Jeremy Sproston ------------------------------------------------------------------------------- Typed Mobile Objects by M. Bugliesi, G. Castagna, S. Crafa ------------------------------------------------------------------------------- ------------------------------------------------------------------------------- From concurrency.cwi.nl Thu May 18 00:00:00 2000 From: Alan Jeffrey To: concurrency@cwi.nl (moderated) Subject: HOOTS Call For Papers - Deadline June 22 HOOTS 2000 Call For Papers for The Fourth International Workshop on Higher Order Operational Techniques in Semantics A satellite workshop of PLI 2000 Montreal, September 21-22 HOOTS 2000 home page: http://hoots.cs.depaul.edu/ HOOTS home page: http://www.cl.cam.ac.uk/users/amp12/hoots PLI 2000 home page: http://www.cs.yorku.ca/pli-00/ SCOPE The fourth workshop on Higher Order Operational Techniques in Semantics (HOOTS 2000) will address fundamental principles and important innovations in the definition, analysis, and application of operational semantics for higher order languages and calculi. Techniques addressed in the HOOTS series include operational equivalences, type systems, program logics and relationships with other forms of semantics. Application areas include the specification and implementation of programming languages, security, and mobility. Languages discussed include both high-level and low-level languages, and a variety of calculi, including calculi of functions, objects, and processes. Deadline for submission: June 22, 2000 Notification of acceptance: July 29, 2000 Final version due: August 26, 2000 HOOTS 2000, Montreal: September 21-22, 2000 PROGRAMME COMMITTEE Andrew Gordon, Microsoft Research; Robert Harper, Carnegie Mellon University; Alan Jeffrey, DePaul University (Chair); Andrew Pitts, Cambridge University; Julian Rathke, Sussex University; David Sands, Chalmers University; Davide Sangiorgi, INRIA Sophia Antipolis; Carolyn Talcott, Stanford University. PREVIOUS MEETINGS The first HOOTS workshop was organised by Andrew Gordon and Andrew Pitts on October 28-30, 1995 as one of the events within the 6-month research programme on Semantics of Computation at the Isaac Newton Institute for Mathematical Sciences, University of Cambridge, UK. A book based on presentations at the workshop appeared in the Publications of the Newton Institute series published by Cambridge University Press. The second HOOTS workshop was organised by Andrew Gordon, Andrew Pitts, and Carolyn Talcott on December 8-11, 1997 at the Center for the Study of Language and Information, Stanford University, USA. The third HOOTS workshop was organized by Andrew Gordon and Andrew Pitts on September 30 and October 1, 1999 in Paris, France, as part of the Principles, Logics, and Implementations of high-level programming languages conference. Elsevier published an electronic proceedings of the second workshop as Volume 10 of Electronic Notes in Theoretical Computer Science, and the proceedings of the third workshop as Volume 26. SUBMISSION & PUBLICATION PostScript submissions of up to 12 pages should be sent by email to Alan Jeffrey ajeffrey@cs.depaul.edu by June 22, 2000. Simultaneous submission to other conferences or journals is not allowed. Papers should be formatted for USLetter or A4 paper. Elsevier will publish the proceedings as a volume of Electronic Notes in Theoretical Computer Science. Hardcopies will be distributed at the workshop. From concurrency.cwi.nl Wed May 17 00:00:00 2000 From: Marta Z Kwiatkowska To: concurrency@cwi.nl (moderated) Subject: Project PhD studentship available at Birmingham ========================================================================= The University of Birmingham School of Computer Science PROJECT STUDENTSHIP in Verification of Quality of Service Properties in Timed Systems ========================================================================= A PhD studentship is available for three years starting September 2000 to work on this EPSRC funded project which aims to address the foundations of the verification of quality of service properties of real-time systems. Examples of such properties are soft deadlines such as "there is a 90% chance that the message will be delivered within 10 time units". Familiarity with modelling and verification of concurrent systems (CSP and FDR) and/or real-time systems (UPPAAL) would be an advantage. More information about the project can be found at: http://www.cs.bham.ac.uk/~mzk/realtime/ Applicants must have or be about to gain at least an upper second class honours degree or an overseas equivalent in Computer Science or Mathematics. The studentship is open to UK and European Union applicants, and includes tuition fees and maintenance award above the level of standard EPSRC maintenance awards. The School of Computer Science has an active group researching in the Theory of Computation, which consists of 8 academics and 15 research staff and PhD students. For more information about research and research degrees offered by the School see the URLs: http://www.cs.bham.ac.uk/research/research.html http://www.cs.bham.ac.uk/studentinfo/form_mailer.html The successful applicant will be offered an opportunity to join the Midlands Graduate School in the Foundations of Computing Science aiming to provide broader educational experience for doctoral students, see the URL: http://www.cs.nott.ac.uk/MGS/ Informal enquiries are welcome and should be directed to (preferably by 31st May): Marta Kwiatkowska Email M.Z.Kwiatkowska@cs.bham.ac.uk Tel +44 121 414 7264 FAX +44 121 414 4281 URL http://www.cs.bham.ac.uk/~mzk ========================================================================= From concurrency.cwi.nl Wed May 17 00:00:00 2000 To: concurrency@cwi.nl (moderated) Subject: IFIP TCS2000 From: Shinya MIYAKAWA IFIP TCS2000 PROGRAM AND REGISTRATION INFORMATION ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ -------------------------------------------------------------------------- IFIP International Conference on Theoretical Computer Science (IFIP TCS2000) --- Exploring New Frontiers of Theoretical Informatics --- August 17 - 19, 2000 Aoba Memorial Bldg., Tohoku University, Sendai, Japan Further Information about IFIP TCS2000 can be obtained on the Web, at http://tcs2000.ito.ecei.tohoku.ac.jp/tcs2000/ Any inquiry on IFIP TCS2000 Program and Registration may be directed to TCS2000@ito.ecei.tohoku.ac.jp -------------------------------------------------------------------------- PRELIMINARY PROGRAM ^^^^^^^^^^^^^^^^^^^ [Outline] AUGUST 16: 15:00 Registration at Sendai Tokyu Hotel till 20:00 18:00 Welcome at Sendai Tokyu Hotel till 19:00 AUGUST 17: 9:30 Opening Session 10:00 Keynote Plenary Talk 1 ----------------------------------------- 11:10 - 17:30 TRACK (1) || TRACK (2) ----------------------------------------- AUGUST 18: 9:10 Keynote Plenary Talk 2 ----------------------------------------- 10:20 - 15:30 TRACK (1) || TRACK (2) ----------------------------------------- 15:50 Panel Discussion till 17:10 ----------------------------------------- 18:30 Banquet at Sendai Tokyu Hotel AUGUST 19: 9:10 Keynote Plenary Talk 3 ----------------------------------------- 10:20 - 14:20 TRACK (1) || TRACK (2) ----------------------------------------- 14:30 Closing Session till 14:40 ----------------------------------------- 15:00 Open Lectures till 17:00 ----------------------------------------- 18:30 Japanese Dinner Party till 20:00 ----------------------------------------- AUGUST 16 WEDNESDAY ^^^^^^^^^^^^^^^^^^^ 15:00 REGISTRATION at Sendai Tokyu Hotel till 20:00 18:00 WELCOME with light snack at Sendai Tokyu Hotel till 19:00 AUGUST 17 THURSDAY ^^^^^^^^^^^^^^^^^^ 9:30 OPENING SESSION Giorgio Ausiello (TC1 Chair and IFIP TCS2000 Co-Chair) Takayasu Ito (IFIP TCS2000 Co-Chair) 10:00 KEYNOTE PLENARY TALK Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption) Martin Abadi (Bell Labs, Lucent)*, Phillip Rogaway (UC Davis) (*: speaker) 10:50 Break [TRACK (1)] SESSION (1.1), 11:10 - 12:00 11:10 Approximation Algorithms for String Folding Problems Giancarlo Mauri, Giulio Pavesi 11:35 An Index for Two Dimensional String Matching Allowing Rotations Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen 12:00 Lunch Break SESSION (1.2), 13:30 - 14:20 13:30 Parallel Edge Coloring of a Tree on a Mesh Connected Computer Chang-Sung Jeong, Sung-Up Cho, Sun-Chul Whang, Mi-Young Choi 13:55 Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs Ryuhei Uehara, Zhi-Zhong Chen 14:20 Break 14:40 TRACK (1) INVITED TALK It is on the Boundary: Complexity Considerations for Polynomial Ideals Ernst Mayr (TU Muenchen) 15:30 Break SESSION (1.3), 15:50 - 17:30 15:50 An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks Yoojin Chung, Kunsoo Park, Hyuk-Chul Kwon 16:15 Task Distributions on Multiprocessor Systems Evgeny V. Shchepin, Nodari N. Vakhania 16:40 Fast Interpolation using Kohonen Self-Organizing Neural Networks Olivier Sarzeaud, Yann Stephan 17:05 Steganography Using Modern Arts Carlo Blundo, Clemente Galdi 17:30 Break -----------// [TRACK (2)] SESSION (2.1), 11:10 - 12:00 11:10 Ambient Groups and Mobility Types Luca Cardelli, Giorgio Ghelli, Andrew D. Gordon 11:35 An Asynchronous, Distributed Implementation of Mobile Ambients Cedric Fournet, Jean-Jacques Levy, Alan Schmitt 12:00 Lunch Break 13:30 TRACK (2) INVITED TALK Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness Naoki Kobayashi (U. Tokyo) 14:20 Break SESSION (2.2), 14:40 - 15:30 14:40 Local pi-Calculus at Work: Mobile Objects as Mobile Processes Massimo Merro, Josva Kleist, Uwe Nestmann 15:05 An Interpretation of Typed Concurrent Objects in the Blue Calculus Silvano Dal Zilio 15:30 Break SESSION (2.3), 15:50 - 17:30 15:50 A Higher-Order Specification of the pi-Calculus Joelle Despeyroux 16:15 Open Ended Systems, Dynamic Bisimulation, and Tile Logic Roberto Bruni, Ugo Montanari, Vladimiro Sassone 16:40 Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems Marcelo P. Fiore 17:05 On the Complexity of Bisimulation Problems for Pushdown Automata Richard Mayr 17:30 Break AUGUST 18 FRIDAY ^^^^^^^^^^^^^^^^ 9:10 KEYNOTE PLENARY TALK Theory and Construction of Molecular Computers Masami Hagiya (U. Tokyo) 10:00 Break [TRACK (1)] SESSION (1.4), 10:20 - 12:00 10:20 Trade-offs between Density and Robustness in Random Interconnection Graphs P. Flajolet, K. Hatzis, S. Nikoletseas, P. Spirakis 10:45 The ($\sigma$+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph Satoshi Taoka, Toshimasa Watababe 11:10 On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem Sounaka Mishra, Kripasindhu Sikdar 11:35 Maximum Clique and Minimum Clique Partition in Visibility Graphs Stephan Eidenbenz, Christoph Stamm 12:00 Lunch Break SESSION (1.5), 13:30 - 14:20 13:30 Real-Time Language Recognition by Alternating Cellular Automata Thomas Buchholz, Andreas Klein, Martin Kutrib 13:55 Damage Spreading and $\mu$-Sensitivity on Cellular Automata Bruno Martin 14:20 Break 14:40 TRACK (1) INVITED TALK Discrepancy Theory and its Applications to Finance Shu Tezuka (IBM Tokyo Research Lab) 15:30 Break -----------// [TRACK (2)] SESSION (2.4), 10:20 - 12:00 10:20 A Type-theoretic Study on Partial Continuations Yukiyoshi Kameyama 10:45 Partially Typed Terms between Church-Style and Curry-Style Ken-etsu Fujita, Aleksy Schubert 11:10 Alternating Automata and Logics over Infinite Words Christof Loeding, Wolfgang Thomas 11:35 Hypothesis Support for Information Integration in Four-Valued Logics Yann Loyer, Nicolas Spyratos, Daniel Stamate 12:00 Lunch Break 13:30 TRACK (2) INVITED TALK Masaccio: A Formal Model for Embedded Components Thomas A. Henzinger (UC Berkeley) 14:20 Break SESSION (2.5), 14:40 - 15:30 14:40 A Single Complete Refinement Rule for Demonic Specifications Karl Lermer, Paul Strooper 15:05 Reasoning about Composition using Property Transformers and their Conjugates Michel Charpentier, K. Mani Chandy 15:30 Break ----------------------- 15:50 PANEL DISCUSSION on "New Challenges for TCS" Panelists: Giorgio Ausiello (U. Roma "La Sapienza") Jozef Gruska (Masaryk U.) Ugo Montanari (U. Pisa) Takao Nishizeki (Tohoku U.) Yoshihito Toyama (Tohoku U.) Jiri Wiedermann (Inst. Informatics, Prague) 17:10 Break 18:30 BANQUET at Sendai Tokyu Hotel till 20:45 BANQUET SPEECH Non-Random Thoughts about Randomization Michael O. Rabin (Harvard U.) AUGUST 19 SATURDAY ^^^^^^^^^^^^^^^^^^ 9:10 KEYNOTE PLENARY TALK List Decoding: Algorithms and Applications Madhu Sudan (MIT) 10:00 Break [TRACK (1)] SESSION (1.6), 10:20 - 12:00 10:20 Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits Endre Boros, Toshihide Ibaraki, Kazuhisa Makino 10:45 Characterization of Optimal Key Set Protocols Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki 11:10 On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model Valentin E. Brimkov, Stefan S. Dantchev 11:35 On Logarithmic Simulated Annealing A. Albrecht, C. K. Wong 12:00 Lunch Break 13:30 TRACK (1) INVITED TALK Hierarchical State Machines Mihalis Yannakakis (Bell Labs, Lucent) 14:20 Break -----------// [TRACK (2)] 10:20 TRACK (2) INVITED TALK Some New Directions in the Syntax and Semantics of Formal Languages Gordon D. Plotkin (Edinburgh U.) 11:10 Break 11:20 DEMO SESSION (1) on Verification Tools 12:00 Lunch Break 13:30 DEMO SESSION (2) on Verification Tools 14:20 Break ------------------------ 14:30 CLOSING SESSION till 14:40 Giorgio Ausiello (TC1 Chair and IFIP TCS2000 Co-Chair) Takayasu Ito (IFIP TCS2000 Co-Chair) ------------------------ [OPEN LECTURES] 15:00 On the Power of Interactive Computing Jan van Leeuwen (U. Utrecht)*, Jiri Wiedermann (Acad. Sciences, Czech) (*: speaker) 16:00 The Varieties of Programming Language Semantics Peter D. Mosses (U. Aarhus) 17:00 Break ------------------------ 18:30 JAPANESE DINNER PARTY till 20:00 ========================================================================== GENERAL INFORMATION ^^^^^^^^^^^^^^^^^^^ IFIP TCS2000 is the first International Conference on Theoretical Computer Science organized by IFIP TC1 on Foundations of Computer Science, and it consists of two tracks: TRACK (1) on Algorithms, Complexity and Models of Computation, and TRACK (2) on Logic, Semantics, Specification, and Verification. The conference proceedings will be published as a volume of Lecture Notes in Computer Science, Springer-Verlag. IFIP TCS2000 will be held on the campus of Tohoku University, Sendai, Japan. The invited talks and contributed talks will be presented at the Aoba Memorial Building and Engineering Conference Hall, Faculty of Engineering located on the Aoba Hill about 3 km west of downtown Sendai. The conference welcome reception and banquet will be held at Sendai Tokyu Hotel, located at downtown Sendai. Please, register and make reservations by returning the completed form by email and fax, following the instructions below. There will also be on-site registration at: * Sendai Tokyu Hotel, 15:00 - 20:00, August 16 * Aoba Memorial Bldg., Tohoku Univ., 9:00 - 17:00 on August 17 - 19. Transportation Conference participants arriving at the new Tokyo International (Narita) Airport are advised to take the JR Narita Express train from Narita Airport to Tokyo Station. Then, take the Yamabiko super express train of Tohoku Shinkansen (Tohoku Bullet Train) to Sendai from Tokyo Station. The Yamabiko runs every 20 - 30 min. and takes about 2 hours from Tokyo to Sendai. Making reservation at Narita Station for the Yamabiko is recommended, since it will be the summer tourist season. Those arriving at the new Osaka International Airport (Kansai Airport) can fly to Sendai Airport, and take Limousine Bus service to Sendai Station. The bus takes about 30 min. to go from the Airport to Sendai Station. You can also take a shuttle bus service from Kansai Airport to the Osaka-Itami Airport to fly from there to Sendai Airport. Alternatively, you can take a local train from the Kansai Airport to JR Shin Osaka Station, then take the Tokaido Shinkansen from Osaka to Tokyo Station and change at Tokyo Station to Tohoku Shinkansen. Some details on transportation will be available on the TCS2000 Web page, at http://tcs2000.ito.ecei.tohoku.ac.jp/tcs2000/ Note: (1) In Japan, mid-August is the busiest tourist time during summer, including domestic and international flights. (2) No flight service is available from Narita to Sendai Airport, since the train service is convenient. There is another train service from Narita Airport to downtown Tokyo (Ueno) by Skyliner of the Keisei-Narita Line. At Ueno you can take the Yamabiko super express of Tohoku Shinkansen to Sendai, but you have to walk about 10 min. from Keisei-Ueno Station to JR Ueno Station to take Tohoku Shinkansen. (3) If you are going to travel in Japan by JR lines before/after the IFIP TCS2000 conference, it will be convenient and economical to get a JR PASS before your departure. Contact your travel agent for more information on JR PASS (Japan Rail Pass). Hotels Two hotels are arranged to offer special discount rates to IFIP TCS2000 participants: Sendai Tokyu Hotel and Sendai Washington Hotel. They are 1.2 km west of Sendai Station and about 800 Yen by taxi from the station. These hotels are located within 5 min. walk from each other. The conference welcome reception and banquet will be held at Sendai Tokyu Hotel. Sendai and Climate Sendai is the largest city in the northern part of the Honshu Island of Japan, with a population of about a million. The City is known in Japan as "City of Trees". Sendai is a modern, safe city with a temperate climate blessed by four distinct seasons; even in mid August it is quite seldom that the highest temperature exceeds 30 C (86 F). Usually, the weather in mid August would be mostly sunny with temperatures ranging from 20 C (68 F) to 30 C (86 F), and rain, if any, would rarely be heavy. Note: Average temperatures in August at Sendai, Tokyo and Osaka are about 23.5 C, 26.5 C and 27.5, respectively. REGISTRATION AND RESERVATION INFORMATION ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ REGISTRATION FEES Registration fees cover attendance in all sessions, a copy of the proceedings, refreshments, the welcome reception and banquet, but not the Japanese dinner party on August 19. The reduced author rate applies to all authors of the accepted papers, and the reduced committee member rate applies to all TC1 members and to all members of the Program Committee and the Organizing Committee. The student rate applies to full time students. Registrants paying reduced rates have full privileges at the conference. The companion rate covers the reception and banquet only. Through July 1st, 2000 From July 2nd, 2000 Regular 40,000 Yen 50,000 Yen Author 30,000 Yen 40,000 Yen Committee Member 30,000 Yen 40,000 Yen Student 25,000 Yen 30,000 Yen Companion 5,000 Yen 7,000 Yen HOTELS Two convenient Western Style hotels offer special IFIP TCS2000 discount rates. Rates are per person, per night, and include service charge and tax (not including breakfast). Single Room Twin Room Sendai Tokyu Hotel 10,500 Yen 8,400 Yen Sendai Washington Hotel II 8,400 Yen 7,350 Yen Sendai Washington Hotel I 7,350 Yen --------- Note: Twin room reservations are available for two persons. No roommate matching service is available, so that twin room reservations remain the registrant's responsibility. JAPANESE DINNER PARTY A Japanese dinner party for participants from abroad will be arranged at SHOZANKAN in the evening of August 19. The invited speakers, some Steering Committee members, PC members and conference organizers will attend. A limited number of reservations will be available for this dinner party. The rates are as follows. Conference registrant: 10,000 Yen Companion: 7,000 Yen ============================================================================= Cut here to send your registration form after filling in the required items. ============================================================================= IFIP TCS2000 REGISTRATION AND RESERVATION FORM ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Please register and make reservations by completing the form below and returning it by email to tcs02@thk.jtb.co.jp Registrants are advised to email a copy of their completed form to TCS2000@ito.ecei.tohoku.ac.jp They are also encouraged to send a signed, printed copy of their completed form by fax to 022-262-5002 (domestic) +81-22-262-5002 (from abroad) which is the fax number of the following agent to take care of the conference registration and reservation. JTB (Japan Travel Bureau) Tohoku Communications Inc. Kotsukosha Bldg 3F, 3-6-Chuo Aoba-Ku, Sendai 980-0021, Japan (Fax) 022-262-5002 (domestic) +81-22-262-5002 (from abroad) (Phone) 022-262-5055 (domestic) +81-22-262-5055 (from abroad) (Email) tcs02@thk.jtb.co.jp Registration and reservations will be completed by your payment, whose method is described below. IMPORTANT NOTE: As described below, from the standpoint of the safety, registrants are advised to pay fees by Bank Transfer. When the payment is made by a credit card, they are advised to send the required information including Credit Card numbers by FAX; that is, do NOT send Credit Card numbers by email. REGISTRATION FOR IFIP TCS2000 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Last (Family) Name: First (Given) Name: Middle: Affiliation: Postal Address: City/State/Zip: Country: Phone: Fax: Email: Registration Status : Number of Companions: Companions' names (if applicable): (A) Total Registration Fee(s) in Yen: HOTEL RESERVATION Hotel First Choice: Hotel Second Choice: Number of Single Room(s): Number of Twin Room(s): Roommate's Name(s) for Twin Room(s): Check-in Date: Check-out Date: Number of Nights: Special Room or other Request: JAPANESE DINNER PARTY A limited number of reservations are available for the Japanese dinner party at SHOZANKAN on August 19 to be arranged for participants from abroad. (B) 10,000 Yen x [ ] conference registrant(s): (C) 7,000 Yen x [ ] companion(s): TOTAL FEE IN YEN (A) + (B) + (C): Signature (not needed for email): METHOD OF PAYMENT FOR IFIP TCS2000 From the standpoint of the safety and security, participants are encouraged to pay via Bank Transfer. When they pay via credit card, they are advised to send the required information (in particular, Credit Card numbers) by FAX; that is, do NOT send your Credit Card numbers by email. In credit card payment Visa card, MasterCard, and Diners card will be accepted. Personal checks cannot be accepted. All payments must be made in Japanese Yen. Indicate method of payment below: [ ] Bank Transfer to Bank: Tokyo Mitsubishi Bank, Sendai Branch Account Name: IFIP TCS2000 Chair Takayasu Ito Account No. 1108671 From : Date of transfer: Payer's name: Note: In Japan the bank number of Tokyo Mitsubishi Bank is 0005, and the number of its Sendai Branch is 320. [ ] Payment by Credit Card Credit Card Type : Card Number: Expiration Date: Signature (not needed for email): : When your payment is via Credit Card, send the above information by FAX to +81-22-262-5002, the fax no. of JTB Communications Inc. Even when you send the above form by fax, send it by EMAIL without filling in Credit Card number for safety. ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Registration and reservations will be confirmed upon receipt of payment. Refunds will be made upon written request received through July 31st, 2000 by JTB Tohoku Communications Inc. From concurrency.cwi.nl Wed May 24 00:00:00 2000 Date: Wed, 24 May 2000 15:31:17 +0200 From: rusu Organization: IRISA/INRIA To: concurrency@cwi.nl (moderated) Subject: Phd Position at INRIA Rennes Phd Position at INRIA Rennes (France) on Symbolic Test Generation The Pampa group (http://www.irisa.fr/pampa) at IRISA/INRIA Rennes has an open PhD position on the topic of Symbolic Test Generation. The position will be funded by an INRIA grant (9150 FF/month). The contract is for 3 years. Test case