Comments are welcome!
_ _ _ _ _ _ _ _ _ _ _ _ _ _
date: 23 December 1994
e-mail to: amast@cs.utwente.nl
________________________
e-mailed to: 334 subscribers
The full version of this announcement, that contains the Programme and Registration Information, is available .
The Symposium on Theoretical Aspects of Computer Science is held annually, alternating between Germany and France. STACS is organized jointly by the Special Interest Group for Theoretical Computer Science of Gesellschaft für Informatik (GI) and the Special Interest Group for Applied Mathematics of AFCET. STACS '95, the 12th in this series, will be held in Munich, March 2-4, 1995.
The symposium will feature invited talks and the presentation of original research papers. The proceedings will be published by Springer in Lecture Notes in Computer Science.
180 papers have been submitted from all over the world, e.g. United States, Australia, Japan, Russia and nearly every European country. They discuss new results from many areas of computer science, including algorithms and data structures, automata and formal languages, computational complexity, computational geometry, cryptography, learning theory, logic in computer science, parallel algorithms, semantics of programming languages, theory of data bases, theory of parallel and distributed computation, and VLSI structures.
53 papers have been selected for presentation in this symposium, giving you an overview on outstanding research results in computer science. We encourage you to participate in what promises to be an exciting and important event.
For up-to-date information, see the WWW . or use anonymous ftp .
A preliminary Call for Participation, including Registration and Accommodation Information and the Conference Program, is available .
Further information can be obtained from:
LATIN'95 Symposium
Universidad de Chile
Blanco Encalada 2120
Santiago, Chile
Tel: + 56 2 689 2736, Fax: + 56 2 689 5531
E-mail: latin95@dcc.uchile.cl
Gopher
WWW
For further information on local arrangements (student accommodation, special presentation requirements, etc.) contact:
LATIN'95 Symposium
Mar'ia Isabel Ovando
UTFSM, Avda. Espa~na 1680,
Casilla 110-V, Valpara'iso, Chile
Tel: + 56 32 626 364, x. 431; Fax: + 56 32 625-217
E-mail: latin95@inf.utfsm.cl
The Conference Programme (in LaTeX) is available.
The registration form is included in the full version of this
announcement (in plain TeX), which is available .
As usual, talks on topics in logic, category theory and related areas in mathematics and computer science are welcome. Please publicize this meeting amongst your colleagues. At the time of the meeting, Jiri Rosicky will be a guest at the university Francois Rabelais.
The meeting will be supported by the university for a fixed amount (not known yet), so that what the fees are to be is not even known by the organizer. At this time of the academic year, housing in the halls of residence is impossible. However, the Centre Regional des Oeuvres Universitaires has now a splendid petit hotel particulier, (this is the modest local name for private small chateaux that rich families owned along the Loire river) where we will have the 57th PSSL. It has 33 bedrooms, lecture rooms, a nice and huge garden for mathematical meditation... Meals will be served on the site. The cost is 210FF per night with breakfast, plus 85FF per meal. The place is rated ***; the cost is however inferior to a plain **-hotel. The fees will be equal to (total cost - money from the university)/(number of participants). If more than 33 bedrooms are needed, arrangements will be made for a hotel. So registering as early as possible (if you intend to come) is going to make the organisation easier.
As usual, participants will arrive on friday night or on saturday morning. Lectures will start (probably) at 9.30 on staurday and will finish on sunday morning at noon. It will be possible to have diner there on friday and lunch on sunday. I will send all registered mathematicians complete details on the location of La croix montoire, the name of this `petit hotel particulier'. It is in Tours on the north shore of the Loire river, and can be reached by urban busses from the train station.
Pierre Damphousse (e-mail: damphous@univ-tours.fr)
Departement de Mathematiques, Faculte' des Sciences
Parc de Grandmont, F-37200 Tours, France
Directors: M. Broy, W. Brauer, R. L. Constable, H. Schwichtenberg, S. S. Wainer, and F. L. Bauer (honorary),
The `Marktoberdorf Summer School' is a course of two weeks duration for young computer scientists and mathematicians working in the field of computational aspects of proof and new programming paradigms. The course aims at the dissemination of advanced scientific knowledge and the promotion of international contacts among scientists. Limited funds from the NATO Science Committee and from other sources will be available. The 1995 Summer School at Marktoberdorf, a small town 100 km southwest from Munich, will deliver a comprehensive spectrum of lectures on the major topics in the area.
Topics and Lectures:
Computational Type Theory
Logic Programming
Proving Techniques
Semantics and Algebraic Specification
Symbolic Computation
Application Deadline: March 20, 1995. Application forms are in WWW and in Internet News under news.announce.conferences or obtainable from
Institut für Informatik, Technische Universität München
Summer School 95, D-80290 München, Germany
The modeling and verification of real-time and concurrent systems are very important research topics in Computer Science. The increasing number of industrial applications relying on embedded software where safety criteria are critical makes it necessary to develop formal theories for modeling such systems as well as methods, techniques, and tools to ensure the validity and the correctness of the modeled system. This is the second AMAST workshop dedicated to this topic; it focusses on the theme Models and proofs for concurrent and real-time systems, and is joint with the French research project `Modeles et Preuves'.
9-12 invited lectures and 9 communications selected by the Program Committee will be presented at this workshop. Each talk will last 40 mn followed by 15 mn discussions. Proceedings available before workshop.
Program Committee: V. S. Alagar (Concordia U., Montreal), A. Arnold (LaBRI, Bordeaux), J. Beauquier (LRI, Orsay), D. Begay (LaBRI, Bordeaux), M. Mislove (Tulane U., New-Orleans), M. Nivat (LITP, Paris), T. Rus (Iowa U., Iowa City), G. Scollo (U. Twente, Enschede), J. Sifakis (Verimag, Grenoble).
Invited Lectures: G. Berry (Ecole des Mines de Paris, Sophia), O. Grumberg (Technion, Haifa), N. Halbwachs (Verimag, Grenoble), E. Cerny (U. Montreal, Montreal), G. Milne (South-Australia U., Adelaide), A. Pnueli (Stanford U., Stanford), F. Vaandrager (CWI, Amsterdam), T. Wilke (Christian-Albrecht U., Kiel).
Organizing Committee: A. Arnold, J. Beauquier, D. Begay, M. Nivat, T. Rus, G. Scollo.
Submissions: We invite authors to submit papers (10 pages maximum) on whatever is their topic of interest in this area of research. Papers should be self-contained, (LaTeX preferred, uuencoded postscript accepted) and sent by e-mail to: m+p-contribution@labri.u-bordeaux.fr .
Dates: subm: Jan 15 Jan 95; notif: 15 Feb 95; final: 15 Apr 95
Registration: The fee is 3000 FF (US $ 500), including proceedings, hotel in Bordeaux downtown (4 nights), all meals and conference dinner.
Local arrangements and further information: Contact the organizing committee: fax +33 56848412, email m+p-registration@labri.u-bordeaux.fr
The full version of this announcement (in LaTeX) is available.
Scope and Format Research contributions to the theory, design, specification or implementation of distributed systems are solicited. Topics of interest include, but are not limited to: distributed algorithms and complexity, network protocols and architectures, multiprocessor algorithms and architectures, distributed operating systems, concurrency control and synchronization, fault tolerance, specification, semantics and verification, cryptography and security.
The conference will consist of two tracks of presentations.
Long presentations will be given slots of approximately 25 minutes and will be accompanied by papers of up to 10 pages in the proceedings.
Brief Announcements will be given slots of approximately 10 minutes and will be accompanied by 1-page abstracts in the proceedings.
Submissions: Long presentation track: extended abstract no longer than 4,500 words (roughly 10 pages). If the authors believe that more details are essential to substantiate the main claims of the paper, they may include a clearly marked appendix that will be read at the discretion of the program committee. Brief announcement track: one-page abstract, that includes problem statement, results and implications. Authors are invited to send 14 copies of an abstract and a cover letter to the program chair:
Vassos Hadzilacos
Computer Systems Research Institute, University of Toronto
6 King's College Rd, Toronto, Ontario, Canada M5S 1A1
e-mail: vassos@cs.utoronto.ca
Dates Subm: Feb 10, 1995; notif: Apr 14, 1995; final: May 20, 1995.
Best Student Paper Award: A paper is eligible if at least one of its authors is a full-time student at the time of submission. This must be indicated in the submission cover letter.
Conference Chair: Jim Anderson (North Carolina)
Treasurer: Jim Burns (Bellcore)
Local Arrangements Co-Chairs: Evangelos Kranakis and Danny Krizanc
The full version of this Preliminary Call for Papers is available, both in plain-text form and in LaTeX form.
LOPSTR'95, the fifth in a series of annual workshops, will take place in Utrecht (the Netherlands) and will be run in parallel with PLILP'95, the 7th Int'l Symp. on Programming Languages, Implementations, Logics and Programs. LOPSTR and PLILP will share invited lectures and sessions of common interest. The two meetings will be organized by the Computer Science Department of Utrecht University.
The aim of the workshop is to present recent work (including work in progress) and discuss new ideas and trends in the following fields: program synthesis, program transformation, program specialization, partial deduction, all in the context of logic programming. Papers pointing out relationships of the above topics with other topics in the field of automated program development are welcome. Papers describing automated systems for program development and overviews of recent work on the topics of interest are also solicited.
Submissions: 5 copies of an extended abstract to:
Maurizio Proietti, IASI-CNR, Viale Manzoni, 30, I-00185 Roma, Italy
Tel +39 6 7716426, Fax +39 6 7716461, E-mail proietti@iasi.rm.cnr.it
Submission by e-mail is also accepted (LaTeX or Postscript). Abstract should be 5-8 page long (excluding references and appendices). Relevant evaluation criteria: originality, clarity, significance, correctness.
Dates: Abstract subm: May 25, 1995; notif: Jul 20, 1995.
Proceedings: Accepted abstracts will be collected into preliminary proceedings which will be available at the workshop. Extended abstracts can be completed into full papers and submitted after the workshop. Submitted papers will be reviewed for publication in final proceedings, expected to be published by Springer-Verlag, according to the following
Dates: subm: Oct 15, 1995; notif: Dec 1, 1995; final: Jan 15, 1996.
Organizing Committee: Swierstra, Fokker, Meijer, Punt (Utrecht U.)
For more information please contact Maurizio Proietti or see WWW
Held by the Kurt Gödel Society and the Italian Association of Logic and its Applications. The meeting coincides with the Gödel Society's 4th Kurt Gödel Colloquium and will be affiliated to the International LMPS-IUHPS Symposium on Logic, Methodology and Philosophy of Science, held August 19-25 in Florence.
Program Committee: Maurice Boffa (Co-chair), Mons, Belgium; Gregory Cherlin, Rutgers, U.S.A.; Ulrich Felgner, Tuebingen, Germany; Wilfrid Hodges, London, U.K.; Annalisa Marcja (Co-chair), Florence, Italy; Daniele Mundici (Chair), Milan, Italy; Gabriel Sabbagh, Paris, France.
Invited Speakers: Zoe Chatzidakis, David Evans, Ehud Hrushovski, Angus MacIntyre, Dave Marker, Francis Oger, Mike Prest, Anand Pillay, Zachary Robinson, Philipp Rothmaler, Carlo Toffalori.
Submissions: Three copies of a full paper, preferably in LaTeX format, before February 1, 1995, to the program committee chairman, Daniele Mundici, at the address below. All papers should be original, and in their final form. The Proceedings will be published in a special issue of the Annals of Pure and Applied Logic. All papers shall be refereed.
Program Chair:
Daniele Mundici
Department of Computer Science, University of Milan,
via Comelico 39-41, I-20135 Milan, Italy.
Phone: +39 2 55006247. Fax: +39 2 55006253.
E-mail: mundici@imiucca.csi.unimi.it.
LMPS-IUHPS Information:
LMPS, Centro Servizi di Segreteria,
via A. Lapini, 1, I-50136 Florence, Italy.
Phone: +39 55 670369, Fax: +39 55 660236.
The Workshop, which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. We invite submissions of papers presenting original research on algorithms and data structures in all areas, including combinatorics, computational geometry, databases, graphics, as well as parallel and distributed computing. Contributors are invited to send 5 copies of a full paper (not exceeding 12 pages) to
Workshop on Algorithms and Data Structures
School of Computer Science
Herzberg Physics Building
Carleton University
1125 Colonel By Drive
Ottawa, Canada K1S 5B6
tel: 613 7884333, fax: 613 7884334
email: wads95_pc@scs.carleton.ca
Submissions: hardcopy, no electronic versions.
Dates: Subm: Feb 17, 1995; notif: Apr 14, 1995; final: May 12, 1995
Proceedings will be published in the Springer-Verlag LNCS series and will be available at the conference.
Invited Speakers: Kurt Mehlhorn, Franco P. Preparata, Micha Sharir, Godfried T. Toussaint, Paul Vitanyi.
Conference Chair:
H. Meijer, Dep't Computing & Information Science,
Queen's University, Kingston, Ont. K7L 3N6, Canada
tel 613-545-6057, fax 613-545-6513, email WADS95_LA@qucis.queensu.ca
Program Committee: co-chairs: S. Akl, F. Dehne, J.-R. Sack, and N. Santoro. A. Apostolico, R. Baetz-Yates, C. Bajaj, B. Bhattacharya, J.-D. Boissonnat, P. Eades, F. Fich, D. Gries, S. Hambrusch, D. Kirkpatrick, R. Klein, S. R. Kosaraju, D. Krizanc, M. Li, A. Lingas, R. Lins, H. Lodi, M. Loui, E. Mayr, J. Peters, G. Plaxton, ArnoldJL.JRosenberg, P. Shor, J. Stolfi, S. Sung, R. Tamassia, R. Tan, S. Whitesides, P. Widmayer, S. Zaks, N. Ziviani.
The full version of this preliminary announcement is available.
Aims of the Conference The interdisciplinary area of constraint programming and constraint-based systems has recently developed an appreciable identity, and needs an international forum to compare the results and discuss the new lines of development.
Topics of interest include the following. Constraint programming languages, including constraint logic programming and concurrent constraint programming. Constraint programming as a unifying paradigm for functional, logic, concurrent and imperative languages, including applications to OO programming and coordination languages. Semantics, compilation and programming environments for constraint programming, including static analysis and optimization. Constraint systems and constraint problems, including constraints for knowledge representation and processing, numerical constraints, symbolic constraints, set constraints. Algorithms for constraint satisfaction and entailment. Mathematical programming and combinatorial optimization via constraint programming. Constraint-related aspects of computational logics, deduction, rewriting. Constraints in applications, including those in AI, automated reasoning, model-based reasoning; in operations research, decision support systems; in data bases; in human-computer interaction, graphics and robotics; in scientific computing, symbolic computation; in hardware verification and software engineering.
Conference Chair:
Alain Colmerauer (E-mail: alain.colmerauer@lim.univ-mrs.fr)
Lab. d'Informatique de Marseille, Faculte' des Sciences de Luminy,
163, Avenue de Luminy, F-13288 Marseille CEDEX 9, France
Program Chair:
Ugo Montanari (E-mail: ugo@di.unipi.it)
Dipartimento di Informatica, Universita' di Pisa
Corso Italia, 40, I-56100 Pisa, Italy
Submissions: full papers (in English, up to 18 pages, 12 pt) to the PC chairman. Submission via e-mail (to cp95@di.unipi.it) is encouraged. See the full version of this announcement for further details.
Dates Subm: Mar 15, 1995; notif: May 15, 1995; final: Jun 26, 1995.
Proceedings will be published by Springer in the LNCS series and will be available at the conference. A special issue of the journal Theoretical Computer Science is planned dedicated to the conference.
More information: please write to cp95@di.unipi.it .
The full version of this Call for Papers is available, both in plain-text form and in LaTeX form.
Concurrent Constraint Programming is a new paradigm that emerged at the end of the eighties and which generalizes both Concurrent and Constraint Logic Programming. The key idea underlying this merger is to use Constraints to extend the synchronization and communication mechanisms of Concurrent Logic languages. CCP'95 is intended to cover all aspects of this new paradigm:
Theoretical foundations and semantics, Language design,
Parallel and distributed implementations, Compilation techniques,
Relations with other paradigms, Constraint solving,
Distributed artificial intelligence, Practical systems,
Static analysis and program transformation, Applications.
The program will include invited talks by Ugo Montanari (Pisa, Italy) Vijay Saraswat (Xerox PARC, USA) and Pascal van Hentenryck (Brown, USA) and presentation of refereed papers.
Submissions: Papers, in English, not exceeding 15 pages (including references and figures) and not previously published or submitted to any journals or conferences. Send four copies by January 6, 1995 to:
Ph. Codognet, INRIA-Rocquencourt, BP 105, F-78153 Le Chesnay, Francetogether with an email to Philippe.Codognet@inria.fr containing title authors and abstract of the paper. Notification of the decision by the beginning of March, 1995. A selection of the papers accepted for presentation will appear in a special issue of a major journal.
Conference Chair: A. Cortesi (Venezia, Italy)
Program Chair: P. Codognet (INRIA, France)
Program Committee: K. Clark (Imperial College, UK), C. Codognet (LIENS, France), M-M. Corsini (Bordeaux, France), R. Giacobazzi (LIX, France), S. Haridi (SICS, Sweden), J-L. Imbert (Clermont-Ferrand, France), M. Maher (IBM Yorktown, USA), C. Palamidessi (Genova, Italy), A. Porto (Lisboa, Portugal), F. Rossi (Pisa, Italy), G. Smolka (DFKI, Germany), K. Ueda (Tokyo, Japan).
Termination or halting of computer processes was shown undecidable by Turing in the general case. However proof of termination plays a fundamental role in many applications, and challenges are theoretical as well as practical. In theoretical issues termination, especially termination of rewrite systems, is strongly connected to mathematical logic and proof theory and it inherits many concepts developed in established ordinal theory started by Cantor. However, termination of rewrite systems renews considerably the theory of ordinals, bringing new problems and new insights. In practical domains automated deduction systems integrate some tools for termination proofs, but usually they are rather poor. Towards wider use the development and integration of new, more friendly, more general and easier algorithms are required.
In May 1993, a workshop on termination was organised at St Andrews, where around forty researchers in the field met for the first time.
We are organising a second workshop which will take place in the mountain resort of La Bresse in les Vosges. We hope that this congenial location will offer the same friendly environment as at St Andrews and create the same fruitful exchanges. The scheduled date is just before the Rewriting Techniques and Applications conference (Kaiserslautern).
Topics: Here is a non limitative list of topics that could be presented at the workshop: well-quasi orders, Kruskal's theorem, recursive path order, lexicographic path order, multiset path order, length of derivation and orders, order hierarchies, ordinals and termination, proofs by interpretation, study of hard termination problems, design and implementation of new algorithms, integration in theorem provers and experiments, applications of termination.
People who wish to present a communication are invited to submit a one page abstract by January 2nd 1995 by e-mail at termination@loria.fr
Other Deadlines: Jan 30: program announcement, Mar 2: registration.
Francoise Bellegarde (U. de Franche-Comte, Besancon, France)
Adam Cichon (U. Henry Poincare, Nancy, France)
Isabelle Gnaedig (INRIA-Lorraine. Nancy, France)
Pierre Lescanne (CRIN-CNRS, Nancy, France)
Ursula Martin (U. St Andrews, Scotland)
Eindhoven University of Technology, The Netherlands, 17-18 May 1995
The full version of this Call for Papers is available.
The workshop ACP'95 is dedicated to the Algebra of Communicating Processes (ACP). ACP'95 is meant to provide an overview of the current research, design and application activities related to ACP. It is also the appropriate workshop to present and discuss open problems in, or particular views on the ACP area. ACP'95 aims at all people working or interested in the field of ACP. Topics of the workshop may include: research and design issues in ACP, e.g., extensions with real-time or data; issues tailored to the application of ACP such as case studies or tools; open problems concerning ACP or particular views on ACP.
Invited Speakers: J.A. Bergstra (UvA, Amsterdam, & UU, Utrecht), M.A. Bezem (UU, Utrecht), C.A. Middelburg (UU, Utrecht, & PTT Research, Leidschendam), G.J. Veltink (DeTeWe Kommunikationssysteme, Berlin).
Submissions: Preferably, a submission comprises approx. 15 pages. The proceedings will contain two classical, introductory papers on ACP: `The algebra of communicating processes with empty process' by J.L.M. Vrancken, and `On the methodology of CCS and CSP' by R.J. van Glabbeek. Submissions need only introduce concepts not included in these papers. Please send your submission, preferably a PS-file, by email to acp@fwi.uva.nl, or 4 hard copies to the ACP'95 secretariat, see below.
Proceedings: handed out at the workshop they will contain the above mentioned papers and the accepted submissions. These will be made available by anonymous ftp as soon as possible. It will be considered to publish a commercial edition of the proceedings afterwards.
Dates: Subm: 3 Mar 1995, notif: 27 Mar 1995, final: 21 Apr 1995.
Organizers: A. Ponse, C. Verhoef and S.F.M. van Vlijmen.
More information can be obtained by e-mail or by anonymous ftp .
ACP'95 Secretariat: Mrs. Alda Bouten
Dep't of Mathematics & Computing Science, Eindhoven Univ. of Techn.
P.O. Box 513, 5600 MB Eindhoven, The Netherlands
E-mail: acp@fwi.uva.nl, Tel: +31-40-474124 Fax: +31-40-463992
Aim and Scope The aim of this workshop is to bring together researchers and ASF+SDF users with an interest in the further development of ASF+SDF, and to provide a platform for sharing experiences, for explaining relations with other areas, and for discussing future directions.
Topics include but are not limited to:
Tool Demonstration proposals are welcome.
Proceedings: Full papers for all presentations will appear in the participants proceedings (also available on WWW). If there are sufficiently many submissions of high quality, publication of the workshop proceedings by a publishing company will be considered. This will involve a second round of external reviewing.
Important Dates: Subm: 24 Feb 95; Notif: 20 Mar 95; Final: 1 May 95
Submissions: Extended abstracts of up to four pages, to the address below. E-mail submissions in ASCII or PostScript format are preferred.
Organization Mark van den Brand (Amsterdam), Arie van Deursen (Eindhoven), T.B. Dinesh (CWI), Jasper Kamperman (CWI), Eelco Visser (Amsterdam).
Address: ASF+SDF'95, Arie van Deursen / Alda Bouten
TU Eindhoven, Department of Computing Science, Formal Methods Group
P.O. Box 513, NL-5600 BM Eindhoven, The Netherlands
Fax: +31 40 463992, Email: arie@win.tue.nl
WWW .
This workshop is organized as a satellite activity of the TAPSOFT'95 conference, May 22--26, University of Aarhus.
Aim of the workshop is to bring together researchers and practitioners interested in the development and application of tools and algorithms for specification, verification, analysis and construction of distributed systems. The overall goal of the workshop is to compare the various methods and the degree to which they are supported by interacting or fully automatic tools. Special sessions for demonstration of verification tools will be planned.
Topics of the workshop include (but are not limited to):
Submissions: extended abstract, max. 15 pages, by March 1, 1995. Authors will be notified of acceptance by April 10, 1995. A final version of selected papers may be published after the workshop. Electronic submission is encouraged via email. The submission should be sent to Arne Skou (ask@iesd.auc.dk) in two seperate files:
Arne Skou, Aalborg University, Dep't Mathematics & Computer Science
Fredrik Bajersvej 7, DK-9220 Aalborg, Denmark
Organization Committee: Arne Skou, BRICS, Aalborg Univ., Denmark
Programme Committee: Ed Brinksma (Univ. Twente, NL), Kim Larsen (BRICS, Aalborg Univ., DK), Bernhard Steffen (Univ. Passau, D), Rance Cleaveland (North Carolina State Univ., USA).
The full version of this Call for Papers and information about SPAA can be respectively obtained via the WWW or by anonymous ftp .
SPAA'95 is collocated with the ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPoPP'95), which will be held July 19-21, 1995. A discounted registration fee will be offered to those attending both conferences.
Contributed papers are sought that present original, fundamental advances in parallel algorithms and architectures, whether analytical or experimental, theoretical or practical. A major goal of SPAA is to foster communication and cooperation among the diverse communities involved in the practice and theory of parallel computing, including those involved in systems, languages, and applications. The Symposium especially encourages contributed papers that offer novel approaches to parallel computing, conceptual advances in parallel architectures, or algorithmic and application work that enhances / exploits architectural features of parallel systems. It is expected that every accepted paper will be presented. The symposium has no parallel sessions.
Submissions: Authors are invited to send draft papers (15 copies, double-sided, max. 10 pages, 11pt or larger) to:
Marc Snir, SPAA'95 Program Chair
IBM T.J. Watson Research Center
Route 134, Yorktown Heights, NY 10598, USA
See the full version of this Call for other submission requirements.
Inquiries should be addressed to Ms. Kristen Kovacs, phone: 914 9452944; fax: 914 945 4425; e-mail: c1kovacs@watson.ibm.com.
Dates: Subm: Feb 8 1995, notif: Mar 30, 1995, final: Apr 27, 1995.
Conference Chair: Charles E. Leiserson, MIT.
Local Arrangements Chair: M. Rinard, K.s E. Schauser, and Tao Yang.
Conference Treasurer: Bruce Maggs, CMU.
Conference Secretary: Robert Cypher, Johns Hopkins.
The full version of this Call for Participation is available, both in plain-text form and in LaTeX form.
The two joint events will take place at Holmenkollen in Oslo. The workshop starts just after lunch-time Tuesday September 19, and lasts till Saturday evening September 23. Before the workshop a meeting of the IFIP WG 14.3 (Foundations of Systems Specifications) will be held at the same place starting just after lunch-time Monday September 18. The workshop will provide an opportunity to meet colleagues, to present recent and ongoing work and to discuss new ideas and future trends.
The workshop is organized by Olaf Owe and Ole-Johan Dahl from the University of Oslo, and Magne Haveraaen from the University of Bergen.
Topics of the workshop include, but are not limited to: algebraic specification; other approaches to formal specification; specification languages and methods; term rewriting and proof systems; specification development systems (concepts, tools, etc.).
It is planned to have a small number of invited talks.
Proceedings, consisting of a selection of the presented talks through the usual referee process, will be published after the workshop probably in the Lecture Notes series of Springer-Verlag -- see e.g. the Recent Trends in Data Type Specification series, n. 332, 534, 655, 785.
Please note the number of slots for talks is limited, register now! We accept speakers in the order of arrival of registrations, so if you plan to have a talk please let us know asap (best via e-mail or WWW).
Details concerning location, accommodation, registration, prices, travel, and the registration form are in the full version of this announcement. Updated information will also be available on the WWW .
As the number of places is limited, register early! We will accept participants in the order of arrival of the registration form, at:
ADT'95 Organization, Institutt for informatikk
Postboks 1080 Blindern, 0316 Oslo, Norway
e-mail: adt95@ifi.uio.no, tel: +47 22 85 24 10, fax: +47 22 85 24 01
Character The workshop series looks back on a remarkable tradition. Predecessors were organized at various places in Central Europe. For many years now, the proceedings have been published in the LNCS series of Springer-Verlag. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts apply to various areas in Computer Science, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions of future research. The workshop is well-balanced w.r.t. established researchers and young scientists.
Topics Papers are solicited describing original results on all aspects of graph-theoretic concepts in Computer Science, eg. structural graph theory, sequential, parallel, and distributed algorithms and their complexity, graph grammars & graph rewriting systems, graph-based modelling, graph-drawing and layout, diagram methods, and support of these concepts by suitable implementations. Various applications have been covered in previous workshops, like data structures, data bases, programming languages, tools for software construction, communications, concurrency, computer architectures, VLSI, artificial intelligence, graphics, CAD, operations research, or pattern recognition.
Submission: 7 copies of draft paper (~10 pages) to the PC chairman:
Manfred Nagl, Lehrstuhl Informatik III, RWTH Aachen, Ahornstr. 55,
D-52074 Aachen, Germany, email: nagl@i3.informatik.rwth-aachen.de
Tel. +49 241 8021300, Fax +49 241 8888218.
Dates: Subm: March 1, 1995; notif: May 1, 1995; final: Aug 1, 1995.
Program Committee: G Engels (NL), J v Leeuwen (NL), L Kucera (CR), A Marchetti-Spaccamela (I), E Mayr (D), R Moehring (D), M Nagl (D), H Noltemeier (D), G Schmidt (D), P Spirakis (GR), G Tinhofer (D), P Widmayer (CH), J Winkowski (PL).
Further Information The workshop will be held at Haus Eich in the City of Aachen. The registration fee will be approx. DM 400,-- incl. lodging, meals, registration, and a copy of the proceedings to be sent out later. The number of participants is limited (65). This restriction and the type of the workshop facility guarantee an intensive exchange of ideas. For further information please contact the PC chairman.
The full version of this Call for Participation is available, both in plain-text form and in LaTeX form.
Topics: all aspects of logic programming, including but not limited to: Analysis and transformation, Applications, Architecture, Artificial intelligence, Concurrency, Constraints, Databases, Higher-order programming, Implementation, Natural language processing, Non-monotonic reasoning, Parallelism, Programming environments, Programming language design, Programming methodology, Meta-programming, Semantics and foundations, Theorem proving, Types and objects.
The conference theme will be Declarative Systems, particularly the integration of the logic programming, functional programming, and object-oriented programming paradigms. Papers from researchers in other communities on interdisciplinary research involving logic programming and functional and/or object-oriented programming will be especially welcomed. A panel discussion on the integration of logic and functional programming will be a special event at the conference.
Submissions: must be in English and not exceed 15 pages. See the full version of this Call for opther submission requirements. Send 6 copies of your submission to:
John Lloyd, Department of Computer Science, University of Bristol
Bristol, BS8 1TR, UK. Email: jwl@compsci.bristol.ac.uk
Phone: +44-272-287953 Fax: +44-272-251154
Dates: Subm: Apr 24, 1995; notif: Jul 17, 1995; final: Aug 25, 1995
Proceedings: will be published by MIT Press.
General Chair: Evan Tick (University of Oregon)
Program Chair: John Lloyd (University of Bristol)
Workshop Chair: David Maier (Oregon Graduate Institute)
Publicity Chair: Vikram Saletore (Oregon State University)
Organizing Committee: Sergio Antoy (Portland State), David Maier (Oregon Graduate Institute), Vikram Saletore (Oregon State University), Evan Tick (University of Oregon).
Local Organization: Sergio Antoy (Portland State University)
The (LaTeX) full version of this Call for Papers is available.
The meeting will run in parallel with LoPSTr95, the 5th International Workshop on Logic Program Synthesis & Transformation. LoPSTr and PLILP will share invited lectures and sessions of general interest. The event is organized by the Computer Science Department of Utrecht University.
Topics: Typical, but not exclusive topics of interest are: Implementation of declarative concepts, Compiler specification and construction, Program analysis, Program transformation techniques, Programming environments, Implementation issues (system demonstration), Executable specifications, Reasoning about language constructs, Integration of different paradigms, Relation between declarative paradigms, Term rewriting, narrowing, resolution, Experiences in constructing applications, Typing and structuring systems.
Invited talks, as well as possibly a selection of accepted papers, will be scheduled for plenary sessions. Other accepted contributions will be scheduled for parallel LoPSTr and PLILP sessions. We anticipate the PLILP proceedings to be published by Springer Verlag in the LNCS series. A limited number of scholarships may be available for those participants who are unable to obtain support from other sources.
Submissions: five copies to PLILP'95, at Utrecht University, at the address mentioned below. Papers must describe original, previously unpublished research, be written and presented in English, not exceed 15 pages, and not simultaneously submitted for publication elsewhere. See the full version of this Call for further requirements. Additional information (e.g. re. email submission) will be available on the WWW .
Dates: Subm: Mar 6, 1995; notif: May 17, 1995; final: Jun 28, 1995.
Program Co-Chairs: D. Swierstra (Utrecht), M. Hermenegildo (Madrid)
Local organisers: J. Fokker, E. Meijer, M. Punt
Information: PLILP'95, Vakgroep Informatica, Utrecht University
P.O.Box 80.089, NL-3508 TB Utrecht, The Netherlands
Tel.: +31 30 531454, Fax: +31 30 513791, email: plilp-info@cs.ruu.nl
Held jointly with 5th CSESAW, 3rd IEEE RTAW and 20th IFAC/IFIP WRTP
The full version of this Call for Papers is available.
Complex computer systems are becoming common in many sectors, such as manufacturing, communications, defense, transportation, aerospace, hazardous environments, energy, and health care. In practice many engineering disciplines must contribute to the construction of complex computer systems. Moreover, such systems cannot be based on a single technique. Different paradigms and methods are necessary for different parts of the system. The goal of this conference is to bring together industrial, academic and government experts from various disciplines, to determine how the disciplines' problems and solution techniques interact within the whole system. Researchers, practitioners, tool developers & users, and technology transition experts are all welcome.
Keynote Speaker: David Lorge Parnas, McMaster University.
A number of tracks/mini-tracks are anticipated, chaired by PC members. See the full version of this announcement for more details.
Submissions: Both long (under 5000 words) and short (under 2500 words) are welcome, including presentations of complete work, summaries of work in progress, position statements, exhibit proposals, tutorial proposals. Submissions should be made in 5 copies by April 30, 1995 to:
Alexander Stoyenko (alex@vulcan.njit.edu)
Real-Time Computing Laboratory, Dep't Computer & Information Science
New Jersey Inst. of Technology, University Heights, Newark, NJ 07102
+1-201-596-3366 (office) +1-201-596-5777 (fax)
Suggestions and questions concerning exhibits of research prototypes and commercially available tools and technology should be directed to:
Thomas Bihari (teb@amt.columbus.oh.us)
AMT Systems Engineering, 1218 Kinnear Road, Columbus, Ohio 43212
+1-614-486-7741 (office) +1-614-486-9459 (fax)
ICECCS'95 General Chair: Alexander Stoyenko (alex@vulcan.njit.edu)
Local Arrangements Chair: Borko Furht (borko@cse.fau.edu)
Publicity Chair: Michael Hinchey (Mike.Hinchey@cl.cam.ac.uk)
The full version of this Call for Papers is available.
There is a growing interest in computational models and programming languages and systems based on intensional logics such as temporal logic, interval logic, modal and intuitionistic logics. In fact, a whole new programming model called intensional programming has begun.
The symposium will include, but will not be limited to, the following topics of interest (as they relate to intensional programming):
Programming paradigms: dataflow computation, connectionist models, logic programming, real-time programming, languages such as Lucid and GLU
Semantics: non-determinism, extended Kahn principle, intensional concepts, termination issues
Software Engineering: version control, visual user interfaces, parallel programming, fault-tolerant systems, program verification
Applications: signal processing, image processing, hardware synthesis, graphics, data models
Submission: either a full paper or an extended abstract of approx. 5000 words (10-15 double spaced pages), preferably by email, to:
ed.ashcroft@asu.edu or mehmet@mpce.mq.edu.au .
Symposium Chair: Edward A. Ashcroft (Arizona State University)
Program Committee: Seiki Akama (Teikyo University of Technology), Edward A. Ashcroft (Arizona State), Weichang Du (New Brunswick), Tony A. Faustini (Arizona State), Jan Hext (Macquarie), Tom Hintz (UTS), R. Jagannathan (SRI), Michael Johnson (Macquarie), Steve Matthews (Warwick), Mehmet A. Orgun (Macquarie), John Potter (Microsoft), John Plaice (Laval), William W. Wadge (Victoria), Andrew L. Wendelborn (Adelaide), Kang Zhang (Macquarie).
Dates: Submission: Feb 15, Notification: Mar 20, Revised: Apr 12
Latest information about the Symposium will be made available.
Update of information in [AL0101C4] .
The full version of this announcement is available.
**Note on Jan. 6 Extended Deadlines**
All December deadlines for DAGS'95 are extended to January 6, 1995. A large number of requests for extensions have alerted us to problems with distribution of our printed call for papers and some conflicts with other conference deadlines. Because of these requests we are making a general extension of the submission deadlines for all papers and panels to January 6, 1995. Please inform any colleagues who may be interested in DAGS'95 about these new submission deadlines.
The full version of this Call for Papers is available.
A responsive computing system is one which responds to internal programs or external inputs in a timely, dependable and predictable manner. These systems are a hybrid of real-time, distributed, secure, safety-critical, and fault-tolerant systems. In such a system, any failure can cause catastrophes ranging from financial loss and loss of privacy to physical damage and loss of life. Thus, it is important to ensure that the system is not only correct, but remains correct at run time, under abnormal circumstances. Formal methods of logic can be used to rigorously synthesize, specify, verify, debug, and model responsive computing systems. However, formal methods of logic are usually dismissed as the domain of academicians and viewed as irrelevant or not applicable to the design and implementation of large-scale software projects due to their mathematical complexity.
Work that emphasizes and reinforces the point that formal methods can, and should, be used in practical construction of high quality, reliable distributed software is of interest. This special issue will bring together papers in the following areas that support the use of formal methods of logic in the construction of responsive computing systems: Formal Specification/Verification/Refinement Techniques, Requirements Specification, Assertional Reasoning and Executable Assertions, Model Checking, Testing & Debugging (Predicate Detection), Tool Support, Formal Semantics of Concurrency/Recovery, Compositional Proof Systems, Distributed Systems Security, Experience Reports.
Submission: 6 copies of your manuscript to the guest editor:
Bruce McMillin (e-mail: bruce@cs.sunysb.edu)
Computer Science Department, State Univ. New York at Stony Brook
Room 1420 Computer Science Building, Stony Brook, NY 11794-4400 USA
fax: 516-6328334, tel: 516-6328218 (Office), 516-6328471 (Secr).
Submission instructions are in the full version of this announcement.
Dates: Subm: June 1, 1995; notif: Sep 1, 1995; final: Oct 15, 1995. The special issue will be published in the 2nd Quarter 1996.
Typical processing needs found today in industrial, medical, and military applications routinely involve handling extremely large volumes of data. The amount of data involved in these applications, combined with real-time processing requirements have suggested massively parallel architectures as the only way to achieve the level of performance required for many time- and safety-critical tasks.
Recently, high-performance massively parallel machines have been enhanced by the addition of various bus systems. We are planning to edit a special issue of the PAA that will focus on the design and analysis of algorithms for enhanced mesh architectures.
Specific topics of interest include, but are not limited to:
Publication is scheduled for Fall 1995. Please submit five copies of your manuscript to the guest editor by February 15, 1994:
Professor Stephan Olariu
Department of Computer Science, Old Dominion University
Norfolk, VA 23529-0162, USA. Email: olariu@cs.odu.edu
Instructions for submitting papers: Papers should not exceed 30 double-spaced pages including figures, tables etc. Papers should not have been previously published, nor currently submitted elsewhere for publication. Papers should include a title page containing title, authors' names and affiliations, postal and email addresses, phone and fax numbers. All submissions should include a 500-word abstract. All submitted papers will be refereed under the usual criteria of PAA.
(Note: If you are willing to review papers for this special issue, please send a note with research interest to Professor Olariu.)
The full version of this announcement is available.
The Mathematical Sciences Department of the IBM Thomas J. Watson Research Center invites applications for its 1995-1996 Postdoctoral Fellowship for research in mathematical and computer sciences. On-going research in the department includes work on sequential and parallel algorithms, computational complexity, coding theory, cryptography, numerical analysis, differential equations, mathematical optimization, high-performance computation, logic design, computer algebra, statistics, dynamical systems, continuous complexity, computational linguistics, computer music, user interface technology, and knowledge-based systems.
Each candidate must have a doctorate and not more than five years of postdoctoral professional experience when the fellowship commences. The fellowship has a period of one year, and may be extended by another year on mutual agreement. The stipend will be generally in the range of $63,000 to $65,000 per year, depending on experience. In addition, there will be an allowance for moving expenses.
To apply, please submit the following by January 13, 1995: resume, including thesis summary; reprints of publications based on thesis and other research; a research proposal; and visa status. Citizens of countries defined as restricted by the U.S. Department of Commerce are required to have a green card or an equivalent visa status. Applicants are responsible for requesting that three or more letters of reference, including one from the thesis advisor, arrive before January 13. Direct all material to:
Committee on Postdoctoral Fellowships, Dept of Math Sc.,
IBM Research Division, T. J. Watson Research Center,
PO Box 218, Yorktown Heights, NY 10598
One fellowship will be awarded. Each applicant will be notified individually as soon as the committee has reached a decision on the application, no later than March 13, 1995.
Applications are invited for academic positions in the Department. PhD in CS is required. Well-qualified applicants in all areas of the subject will be considered, but research/teaching experience in the following areas are specially sought:
Areas: Hardware & Architecture, Performance Evaluation, Graphics, Computer Networking, Security & Reliability, Operating Systems, Distributed Computing, Real-time Systems, Software Engineering.
Salaries: (US$1.00 = S$1.50 approximately)
Rank and salary will depend on qualifications and experience. Benefits provided to expatriates include:
subsidized housing or a housing allowance, return airfare,
children's education allowance and end-of-contract gratuity.
Information about Singapore, NUS and DISCS can be found on WWW .
Inquiries may be sent to chongct@iscs.nus.sg .
The Department of Mathematics and Information Sciences at Bellcore currently plans to fill several positions and is interested in attracting outstanding candidates in the areas of security and cryptography, network design and optimization, and distributed systems.
The department currently consists of over thirty researchers working mainly in the following broad areas:
Work responsibilities include a broad range of activities from fundamental research into the underlying theory to implementations of state-of-the-art solution approaches to applied modeling and problem solving.
Position and salary will be commensurate with qualifications. Available positions include contract appointments, postdocs, limited-term positions, as well as permanent positions. Some positions are currently available while others may start as late as summer/fall of 1995. Minimum requirements include an M.S. or Ph.D. degree in mathematics, computer science or a closely related field. A proven track record of significant achievements will be an important factor in selecting potential candidates.
Send a vita with a statement of qualifications and four references to:
Clyde Monma, Bellcore, Room 2L-387
445 South Street, Morristown, New Jersey 07960
Email: clyde@bellcore.com, Phone: (201) 829-4428 Fax: (201) 829-2645
Bellcore is an Equal Opportunity/Affirmative Action Employer. Women and minority applicants are encouraged to apply.
The Network Design and Security Department at Bellcore plans to expand its growing research program in security and cryptography by making several new appointments. The department currently has two groups of researchers working on cryptography, computer and network security, fraud prevention, and applications to electronic commerce and the National Information Infrastructure.
Positions and salary levels will be commensurate with qualifications.A mix of junior and senior candidates will be considered for the available positions which range from permanent appointments to limited-term positions to contract work.
Interested candidates should send their vita with a statement of qualifications and the name of four references to:
Hiring Committee, Network Design and Security Department
Bellcore, Room 2P391
445 South Street, Morristown, New Jersey 07960
Bellcore is an Equal Opportunity/Affirmative Action Employer. Women and minority applicants are encouraged to apply.
The full version of this announcement is available.
Within the scope of the ``Graduiertenkolleg'' two scholarships will be granted, starting February, 1, 1995.
Topics: complexity and efficiency of algorithms and computers: computeralgebra and cryptology; VLSI-design; semantics and verification, specification methods; efficient algorithms; computer architecture; distributed systems; artificial intelligence; programming languages and microelectronics.
For postgraduates resp. post doctoral fellows the monthly scholarship allowance is 2440 resp. 2540 DM plus 200 DM per month for educational related costs. The scholarship is tax free according to article 3 Nr.44 ESTG. Married graduates will receive an additional 400 DM per month. For the time being, the duration of the scholarship will be 2 years; prolongation up to one year can be applied for.
A maximum of 3 years is allocated to each student for completion and subsequently receiving a Ph.D. The first 6 months will be dedicated to the selection of individual fields of study and faculty advisors. The program is made up of seminars and further compulsory lectures.
Prerequisite for admission to the program is a university diploma (M.S. and in exceptional cases B.S.) in either computer science, mathematics or another scientific or engineering field.
Application: letter of introduction, research objective, letter of recommendation. Deadline: 7.01.1995
The department of Computer Science of the Universität des Saarlandes expressively calls upon female scientists to apply.
Information:
Prof. Dr. J. Buchmann (email: fromm@cs.uni-sb.de)
Fachbereich Informatik, Universität des Saarlandes
Gebäude 36.1, Postfach 151150, D-66041 Saarbrücken
phone: +49-681-302-4156, fax: +49-681-302-4164
We invite applications for a postdoctoral position within the Institute for Algorithms and Scientific Computing (SCAI) in the German National Research Center for Computer Science (GMD), St. Augustin.
In the SCAI institute, Prof. Thomas Lengauer heads a group that is concerned with discrete models and algorithms for applications in scientific disciplines such as chemistry and molecular biology, as well as for technical applications such as circuit design, leather and textile cutting, and three-dimensional packing. Prof. Ulrich Trottenberg heads a group that engages in numerical algorithms, especially on parallel computers, for applications such as weather prediction, fluid dynamics, and computational chemistry.
The objective of the position is to perform basic research on discrete algorithms that can be the basis for molecular modeling procedures. This work encompasses deterministic as well as stochastic models on the basis of algorithmic graph theory. The programming work inside the group happens on workstations (Sun and SGI) as well as on parallel computers, such as the CM-5 and the IBM SP-2.
We are looking for applicants with a recent Ph.D. in computer science or mathematics, that specialize in the analysis of discrete structures and algorithms. Especially, we are interested in people with extensive knowledge of graph theory and graph algorithms, including the analysis of random graphs. We are expecting contributions both in theoretical analysis and in experimental work on the computer. The applicants should have sufficient programming practise, especially in C and Unix.
The position can be filled immediately. The term of employment is up to three years. The salary is according to the German public service tariff, level BAT IIa. Applications should provide a resume', list of publications, statement of research interest, and two references. Applications and requests for further information can be addressed to:
Prof. Dr. Thomas Lengauer (Email: lengauer@gmd.de)
GMD-SCAI, Schloss Birlinghoven, D-53754 St. Augustin, Germany
Tel: +49 2241 14 2777, Fax: +49 2241 14 2656
WWW
GMD is an affirmative action/equal opportunity employer.
The Swiss Federal Institute of Technology in Zurich (ETH Zurich) invites applications for the position of
Professor of Computer Science (Theoretical Computer Science)
Theory of algorithms, in particular parallel algorithms
Logic and logic programming in the Department of Computer Science (Informatics).
The new professor is expected to promote his/her speciality in teaching and research and to share in the responsibility for teaching introductory CS courses.
Candidates are asked to send a curriculum vitae, a list of publications, the names of at least three references, and a brief description of research plans no later than February 15, 1995 to the
President of ETH Zurich, Prof. J. Nuesch,
ETH Zentrum, CH-8092 Zurich, Switzerland.
ETH Zurich specifically encourages female candidates to apply. For further information please contact
Prof. C.A. Zehnder (e-mail: zehnder@inf.ethz.ch)
Head Departement Informatik
ETH Zentrum, CH-8092 Zurich, Switzerland.
Applications are invited for an expected tenure-track position at the assistant or associate professor level. Candidates from all applied areas of Computer Science, especially those with expertise in telecommunications will be considered. A Ph.D. in Computer Science or a related field at the time of appointment and a demonstrated commitment to both research and teaching is required. Salary is competitive.
With approximately 800 faculty and 27,000 students (1/3 graduate students), UNT is one of the largest universities in north Texas. Located 40 miles north of the Dallas/Fort Worth metroplex and surrounded by high-tech industry, Denton combines a small town atmosphere with the advantages of a major metropolitan area. The department consists of 17 faculty and offers BS/MS/Ph.D. programs to approximately 128 graduate and 450 undergraduate majors.
Applicants should send their resumes including the names of three references to:
Faculty Search Chair
Department of Computer Sciences
University of North Texas
Denton, TX 76203-6886
UNT is an Affirmative Action/Equal Opportunity employer.
The Department of Computer Science invites applications for a tenure track position in Computer Science. Candidates are required to have completed a Ph.D. degree in Computer Science by the date of appointment and must show exceptional potential in teaching and research.
Midwestern State University ha approximately 6,000 students and offers both BS and MS degrees in Computer Science. The teaching load is 12 hours of ungergraduate courses or 3 hours graduate and 6 hours undergraduate and will include a variety of courses in the computer science curriculum. Rank and salary are negotiable.
Applicants should send a letter of application, vita, statement of teaching philosophy, statement of research interests, and names and addresses of 3 references to:
Dr. Tim Donovan
Coordinator of Computer Science
Midwestern State University
3410 Taft Blvd
Wichita Falls, TX 76308-2099
Applications from women and minority groups are especially encouraged.
Applications are invited for a permanent position as senior lecturer at the department of Computing Science, Uppsala University, Sweden. The department has two chairs in computer science, one in computing science and one in applied computing science. The senior lectureship is with the computing science group.
Virtually all research being conducted in the group is related to computational logic and other declarative programming paradigms. However, many different aspects are studied, ranging from topics such as efficient execution on sequential and parallel computers to AI-oriented questions, for example, about automated reasoning.
Requirements: PhD in computer science. Applicants should have strong research and teaching records.
Applications Close: January 9, 1995.
General Information: For information on the application procedure, call Christina Lindberg, telephone +46-18-181867, fax +46--18-181999.
For information about the computing science research group contact:
Jonas Barklund (jonas@csd.uu.se) tel +46-18-181050 fax +46-18-511530
Hakan Millroth (hakanm@csd.uu.se)tel +46-18-181056 fax +46-18-511925
The full version of this announcement is available.
We invite applications for visiting and postdoctoral positions at the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS). DIMACS is a Science and Technology Center, funded by the NSF, with long-term participation from Rutgers University, Princeton University, AT&T Bell Laboratories, and Bellcore. Research and education activities at DIMACS focus on such areas as analysis of algorithms, combinatorics, complexity, computational algebra, discrete and computational geometry, discrete optimization and graph theory. A primary activity of the center is to sponsor year-long research programs on specific topics of current interest, such as the 1995-96 Special Year on Logic and Algorithms.
DIMACS Postdoctoral fellowships go almost exclusively to people who have completed a Ph.D. in Mathematics, Computer Science, or an allied field, within the last three years. These fellowships all provide a $40,000 stipend, plus a $2000 allowance usable for travel, publication costs, and other research-related expenses. Applications for all postdoctoral fellowships must be submitted by Jan. 15, 1995, and will be processed by the appropriate program committee.
Deadlines: January 15, 1995 for all fellowship applications except the University-Industry Research Fellowships. Visitors should apply at least six months before the proposed visit.
Submit applications by email (Postscript or plain ASCII only) to:
application@dimacs.rutgers.edu or by mail to
DIMACS Center, Rutgers University,
P.O. Box 1179, Piscataway, NJ 08855-1179
More information is available on the WWW .
The Janos Bolyai Mathematical Society has launched a new mathematical series called the Bolyai Society Mathematical Studies series. The aim is that it be a continuation of the old series ``Colloquia Mathematica Societatis Janos Bolyai'' published jointly with North-Holland. The scope of the volumes has been widened: they are not restricted any more only to conference proceedings, but rather aim to publish survey volumes or books and more up-to-date and higher quality materials. Keeping this in mind, the first three books of the series are the following:
A special discount price is offered for purchase orders referring to DMANET. For shipping and handling add $5 or $8/copies of book for surface/air mail to the purchase price in the table below.
Price table (US dollars) Vol 1 Vol 2 Vol 1+Vol 2 Vol 3
(A) List price 100 100 175 100
(B) Special discount price 64 64 109 64
(purchase order must refer to this advertisement)
To receive an order form or detailed information please write to:
J. Bolyai Mathematical Society
1371 Budapest, PF. 433, Hungary, H-1371
E-mail: H3341SZA@ella.hu
I am happy to announce that my ``Lectures on Polytopes'' finally do exist in print, and want to thank everyone for all the support I received with this project.
Günter M. Ziegler
ziegler@math.tu-berlin.de
============================================================
Günter M. Ziegler: ``Lectures on Polytopes''
Graduate Texts in Mathematics 152,
Springer-Verlag New York Berlin Heidelberg 1995, 370 pages.
Europe: hardcover DM 108,00 ISBN 3-540-94329-3 softcover DM 48,00 ISBN 3-540-94365-X
US: hardcover $ 59.00 ISBN 0-387-94329-3 softcover $ 29.00 ISBN 0-387-94365-X
============================================================
Based on a graduate course given at the Technische Universität Berlin, these lectures present a wealth of material on the modern theory of convex polytopes. The clear and straightforward presentation features many illustrations, and provides complete proofs for most theorems. The material requires only linear algebra as a prerequisite, but takes the reader quickly from the basics to topics of recent research, including a number of unanswered questions. The lectures
This PhD Thesis (University of Paris XI, Centre d'Orsay, defence date: July 1st 1994) is now available upon request from the author Dr. M. Debabi (Bull Corporate Research Center, Clayes-Sous-Bois, France). Also please notice that the thesis is written in French. For those interested in getting a copy, please send your request by e-mail to:
debabi@frcl.bull.fr
The aim of this work is to provide theoretical foundations for the unification of three paradigms. More accurately, the aim is to experiment with some ideas in an ML-like language extended with concurrency features. Thus, the language considered may be viewed as a sugared version of the call-by-value typed lambda-calculus that safely incorporates imperative and concurrent extensions. The language is polymorphic, implicitly typed and supports both functional and process abstractions. The language embodies a CSP-like process algebra which provides a set of concurrency combinators (internal choice, external choice, parallel composition and sequencing) used to compose expressions. A set of imperative aspects are also included in order to support mutable data.
To sum up, the main contributions are:
Distinguished Dissertations in Computer Science.
Cambridge University Press, 1994. ISBN 0 521 47103 6 hardback.
Publication date 29 September. UK net price 25 pounds.
Ring +44 1223 325970 or fax +44 1223 325959 at any time to order
by credit card.
Table of Contents
A summary of the book is available on the WWW .
The book studies the semantics of I/O in functional languages. Perhaps the most original aspect is its use of a typed form of Abramsky's applicative bisimulation together with co-induction to yield an entirely operational theory of a functional language and its I/O mechanism. It is a revised version of the author's PhD dissertation but Chapter 8, on monadic I/O, is largely new, and in a Preface the author discusses developments since submission of the dissertation. There is also an extensive bibliography of I/O mechanisms for functional languages.
FANCY is a BDD-based tool for formal hardware verification. It's a collection of new and known FSM equivalence and inclusion check algorithms with a graphical user interface. The finite state machines (FSMs) can be of Mealy type or Moore type and must be given in the format of the ISCAS'89 benchmark or in the blif format (Berkeley Logic Interchange Format). Such a collection is useful because no equivalence/inclusion checking algorithm works well for all examples. Every one has its favorite examples and its bad examples.
FANCY 1.1 is now available by anonymous ftp from ftp.loria.fr in directory /pub/loria/eureca/FANCY/ as compiled or source code .
FANCY runs under Unix with the X window system (X11) and the Tcl/Tk interpreter `wish' (version Tcl/7.3, Tk/3.6, available by anonymous ftp on harbor.ecn.purdue.edu) for the GUI.
There are compiled versions of FANCY for SUN 4, HP 9000, DEC 5000 (due Laurence Pierre), and a Linux version for PC 486 (for the moment only version 1.0).
FANCY 1.1 includes several new algorithms as well as a number of technical improvements over FANCY 1.0.
The full version of this announcement is available.
Release 3R5 of TOPO tool set is available from the Lotos Tools Development Team, topo@dit.upm.es, Dept. Ingenieria Telematica, Technical University of Madrid & E.T.S.I. Telecomunicacion, Ciudad Universitaria, E-28040 Madrid, SPAIN, by anonymous ftp .
TOPO is distributed as free software for non-profit use, or may by special arrangement be obtained commercially.
TOPO, the toolset: TOPO is really a bunch of tools to help in design with LOTOS. Every tool is conformant to IS 8807, the ISO standard, and most deal with full LOTOS.
Applications
Tool summary:
The tools may be accessed individually or under a shell interface that may be customized to concrete user needs. There is also a number of tools provided by other organisations.
For the upcoming 6th International Conference on Rewriting Techniques and Applications (Kaiserslautern, April 5-7), there may be another attempt to collect open problems in term rewriting, string and graph rewriting, semantic matching and unification, and allied fields, as well as solutions and updates to the collections of problems in the previous two proceedings (back of LNCS 488 and 690).
Copies of those previous collections may be found on the WWW: respectively LNCS 488 and LNCS 690 .
Please send any contribution to me at
nachum@cs.uiuc.edu
Thank you
Nachum Dershowitz
The full version of this paper is available.
Abstract J.UCS -- the Journal for Universal Computer Science -- is an electronic hypermedia journal. This paper is a guide for authors who want to submit articles to J.UCS. Since J.UCS has to be able to deal with articles of many different wordprocessing systems, we accept PostScript as primary format, but further interfaces for HTF, LaTeX and DVI are provided. A special style sheet for J.UCS authors was designed to ensure a uniform layout of articles published in J.UCS and to make the task of automatic creation of hyperlinks easier.
Note: The first test issue of J.UCS (vol. 0, no. 0) will appear November 94. Regular service -- for which submissions are solicited as of now -- will start January 95.
Key Words: J.UCS, Hyper-G, style sheet, file formats, electronic journals, electronic publishing
Category: A.0
Acknowledgements: We acknowledge the kind permission of ACM to use their classification system and the fact that ACM is actively encouraging J.UCS by operating a foundation server.
The industrial use of formal methods is limited and the experience gained with that industrial use is not available to the outside world. That is a pity, considering the fact that such experience can be very useful in avoiding the pitfalls one may encounter when starting to use formal methods in a `serious' way. It is with this thought that some people active in FME (Formal Methods Europe) have come up with the idea to start a database with examples of applications of formal methods, accessible through ftp and WWW on a public site. The intention of the database is to give concise descriptions of - either successful or unsuccessful - application of formal methods / specification languages that will allow users to assess:
If you know of any applications of formal methods / specification languages worth considering for inclusion in the database (i.e. were involved yourself or you know someone who was) then it would be appreciated if you would fill in the information form available from the sites listed below and send it to (e-mail preferred):
Nico Plat, Cap Volmac, Dolderseweg 2 3712 BP Huis ter Heide.
The Netherlands. Fax: +31-3404-31174, E-mail: Nico.Plat@ACM.org.
An electronic copy of the form can be obtained by sending an e-mail message containing only the line:
send vdm-forum fm-appl-db-form.txt to mailbase@mailbase.ac.uk, and the form will be sent back to you. Alternatively, you can pick it up on the WWW or by anonymous ftp (IP address: 130.225.136.3).
<location> := ftp://ftp.cs.utwente.nl/pub/doc/amast/
<location> := http://www.cs.utwente.nl/data/amast/
Date: 11/11/1994
...
Ernst W. Mayr [M1], Ricardo Baeza-Yates [M2],
Gordon Plotkin [M3], Pierre Damphousse [M4],
Oscar Slotosch [M5], Didier Begay [C1],
Vassos Hadzilacos [C2], Maurizio Proietti [C3],
Daniele Mundici [C4], WADS'95 [C5],
Francesca Rossi [C6], Philippe Codognet [C7],
Pierre Lescanne [C8], ACP'95 [C9],
Arie van Deursen [CA], Arne Skou [CB],
Robert Cypher [CC], Magne Haveraaen [CD],
Ernst W. Mayr [CE], COLIBRI 48 [CF],
Jeroen Fokker [CG], Hans Toetenel [CH],
Michael Johnson [CI] Panagiotis Metaxas [CJ],
Bruce McMillin [CK], Stephan Olariu [CL],
TheoryNet [J1], [J7] DMANet [J2],
Clyde Monma [J3], [J4] Monika Fromm-Weber [J5],
Thomas Lengauer [J6], Sajal Das [J8],
Ranette Halverson [J9], Hakan Millroth [JA],
Steve Mahaney [JB], J. Bolyai Math. Soc. [L1],
G"unter M. Ziegler [L2], Mourad Debabi [L3],
Andrew D. Gordon [L4], Stefan Krischer [T1],
Jose A. Manas [T2], Nachum Dershowitz [P1],
Cris Calude [S1], Edmund Kazmierczak [S2].
This issue of AMAST Links is available in four forms:
Note: This issue will also be available, in all of its four forms, by anonymous ftp from the AMAST repository at the University of Twente. File names will be the same as above, but under the ftp directory .