Comments are welcome!
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _
date: 21 February 1995
e-mail to: amast@cs.utwente.nl
________________________
e-mailed to: 597 subscribers
Update of [AL0201M1] .
The inclusion of paper #56 in the originally communicated list of accepted papers for AMAST'95 was caused by a regrettable error.
The correct list of accepted papers is available.
Update of information in [SIAN04p2-1]
Abbreviated version of the Preliminary Programme available.
Deadline for reduced fees: 15 March 1995
TAPSOFT brings together theoretical computer scientists and software engineers (researchers and practitioners) with a view to discussing how formal methods can usefully be applied in software development. Includes CAAP, FASE, TOOLS.
Satellite Meetings:
Invited Speakers: H. Ehrig, C. Floyd, M.-C. Gaudel, J. A. Goguen, D. Kozen, V. Pratt.
CAAP: Colloquium on Trees in Algebra and Programming
Programme Committee: A. Arnold, B. Courcelle, J. Diaz, V. Diekert, H. Ehrig, J. Karhumaki, J. W. Klop, U. Montanari, M. Nielsen (chair), C. Stirling, W. Thomas, S. Tison.
FASE: Colloquium on Formal Approaches in Software Engineering
Programme Committee: E. Astesiano, D. Basin, V. Donzeau-Gouge, M.-C.Gaudel, B. Jonsson, P. Klint, B. Mahr, F. Orejas, D. Sannella, M. I. Schwartzbach (chair), B. Steffen, R. Wilhelm.
TOOLS Demonstration of support tools for practical use of formal approaches.
Local organisation chair: P. D. Mosses.
Information: Preliminary programme, abstracts of talks, and registration form obtainable electronically .
FTP: ftp.brics.aau.dk, name: ftp, get pub/TAPSOFT/README
E-mail: tapsoft@brics.aau.dk . Fax: +45 8942 3255
BRICS - TAPSOFT '95, Dept. of Computer Science, Univ. of Aarhus
Ny Munkegade Bldg. 540, DK-8000 Aarhus C, Denmark
Update of information in [AL0101C6] .
The full version of this announcement is available.
This file contains registration information for the 4th Twente Workshop. General information on the workshop may be obtained from any of the local organizers (e-mail: faigle@math.utwente.nl, hoede@math.utwente.nl or hunting@math.utwente.nl).
In order to keep the number of lectures within the framework of a "workshop", we ask you to submit an extended abstract of about 3-4 pages (size A4) if you want to give a lecture. The accepted extended abstracts will be collected in a conference volume available at the beginning of the workshop.
Deadline for submission: 31 March, 1995. The programming committee will notify the authors about the acceptance of their extended abstracts at the beginning of May.
Proceedings Volume: Every participant of the workshop is invited to submit a contribution to a separate proceedings volume, which will appear as a special volume of Discrete Applied Mathematics. The contributions will undergo the serious refereeing process of Discrete Applied Mathematics. Deadline for submission is 1 September, 1995. (Separate information will be given to the participants).
Registration Fee: There is no registration fee.
Financial Support: Some restricted financial support toward local expenses may be available for particularly needy participants.
Housing We have reserved a number of rooms in local hotels and will fill them with participants on a first-come-first-served basis if you tell us your wish before 31 March, 1995. After that deadline, we will assume that you want to find your own accomodation. Prizes in the range Dfl 100-150 per room & night for double occupancy (1 Dfl ca. DM 0,90).
Registration: A registration form is attached in the full version of this announcement. Please send it back by either e-mail or regular mail to any of the local organizers. Postal address:
Department of Applied Mathematics, University of Twente
P.O. Box 217, NL-7500 AE Enschede, The Netherlands
The full version of this announcement is available.
Editors' Note: Although computational learning theory is not a traditional subject of interest within AMAST, we believe that the new developments in software technology which are arising in this area may raise that interest, hence we include this announcement in AMAST Links.
Conference Site: North Campus of the Universitat Politecnica de Catalunya (UPC): coming from downtown, take the subway line 3 (green), direction Zona Universitaria, to second last stop (Palau Reial), then follow the signs; total travel time ca. 30 min. Formal sessions will take place at the Aula Master of the North Campus. Rump sessions will be scheduled at the conference and may take place in a different room.
Invited Lectures Ray Solomonoff (Oxbridge Research), Jorma Rissanen (IBM Almaden), and Angus McIntyre (Oxford University)
Getting there Trains run every 30 minutes from the airport to Placa Catalunya, central square of Barcelona close to the conference hotels. Travel time is about 25 minutes. There is also an Airport Bus linking the airport terminals to Placa Catalunya. A taxi from the airport to the hotels should cost 2500--3000 Pta, on normal traffic conditions.
WWW Information is available.
History and Sponsors The previous and inaugural European Conference on Computational Learning Theory was held 20--22 December 1993 at Royal Holloway, University of London. The EuroCOLT'95 conference is sponsored by the EATCS, by the European Union through NeuroCOLT ESPRIT Working Group Nr. 8556, by IFIP through SSGFCS WG 14.2., and by Universitat Politecnica de Catalunya.
Program Committee: M. Anthony (LSE, Univ. London, UK), E. Baum (NEC Research Inst., Princeton, USA), N. Cesa-Bianchi (Univ. Milano, I), J. Koza (Stanford Univ., Palo Alto, USA), M. Li (Univ. Waterloo, CND), S. Muggleton (Oxford Univ., UK), W. Maass (TU Graz, A), J. Rissanen (IBM Almaden, USA), H.-U. Simon (Univ. Dortmund, D), K. Yamanishi (NEC R.I., Princeton, USA), L. Valiant (Harvard Univ, Cambridge, USA), P. Vitanyi (Chair, CWI/Univ. Amsterdam, NL), R. Freivalds (Univ. Riga, Latvia).
The Advance Program and Registration Information is available.
WIFT'95 will bring together software engineering professionals from North America, Europe, and Asia to report on, analyze, and synthesize experiences related to the industrial applications of formal specification techniques. The workshop has three major parts: tutorials, general technical sessions, and working group sessions. The tutorials cover some of the more established formal methods tools, techniques and methods that are currently used in industries and government agencies. Papers in the general technical session vary from those that report on experiences, to those that present novel approaches to, and/or perspectives on, the industrial applications of formal methods. The group sessions provide highly-focused and structured forums for analyzing and synthesizing experiences related to the industrial uses of formal methods. There will also be a tools session in which demonstrations of tools supporting the building and manipulation of formal specifications will be given.
Full information is available on the WWW .
The full version of this announcement is available.
Topics: frontiers between a decidable halting problem and an undecidable one: Turing machines, register machines, cellular automata, tiling of the plane, polyominoes, snakes, neural networks, other machines; minimal universal codes: size of such a code, namely, for Turing machines, register machines, cellular automata, tilings,... computation complexity of machines with a decidable halting problem as well as universal machines; self-reproduction and other tasks.
Program Committee Michel Cosnard, ENS Lyon; Joaquim Gabarro, U. Barcelona; Eric Goles, U. Chile, Santiago; Maurice Margenstern, U. Paris 11, LITP, IBP, Chair; Maurice Nivat, U. Paris 7, LITP, IBP.
Organizing Committee Maurice Margenstern, U. Paris 11, LITP, Chair; Jean-Baptiste Yunes, U. Paris 7, LITP.
Grants For Students: Fifteen grants are wished for allowing PhD or Postdoc students to attend the workshop. Presently, six grants can be actually given. The eventual number of grants which will actually be given will be announced, not later than March, 1st. Students or young reseachers wishing to apply for this grants must ask by e-mail a form to be received by fax and to be returned to the organizing committee mandatory by fax before February, 15 (no delay). They will be answered not later than March, 1st. Grants amount to at most 1450FF for applicants living in France and at most 1700FF for those living outside of France.
Registration: For attending the workshop, send your registration to our secretary or send it using the form in the full version of this announcement. You may use surface mail, fax or email. Registration fees amount to 300FF, but 150FF for participants whose institution has made grant to the workshop and 200FF for people granted by the organizing committee. In all cases, fees must be paid to the workshop organization before March 1st, 1995.
Preregistration If you have not already done so, and plan to attend the conference, please preregister by February 15, 1995.
To preregister and thus receive detailed information, please send e-mail to ct95@cs.dal.ca with subject `preregistration'. Please provide your name and a postal address in the body of the message. (If you do not have access to e-mail, you may write to RJ Wood, Mathematics, Statistics and Computing Science, Dalhousie University, Halifax, Nova Scotia, B3H 3J5, Canada.)
Registration fee The conference registration fee is $250(Canadian). Students may register for $125. The registration fee includes lunches during the days of the scientific program, an excursion and a banquet. Tickets for companions to attend the events will be available at cost.
Accommodation To request residence accommodation at Dalhousie please send e-mail to ATANNER@KILCOM1.UCIS.DAL.CA mentioning CT95. (If you do not have access to e-mail, write to Conference Administrator, Conference Services, Dalhousie University, Suite 410, Student Union Building, Halifax, Nova Scotia, B3H 4J2, Canada.) Rates, including taxes, are $35 nightly/$207 weekly for a single room, $51 nightly/$307 weekly for a double room. Breakfast is included with residence accommodation. Information on hotel accommodations will be included with a future mailing.
Scientific Programme Abstracts for talks should be sent to pare@cs.dal.ca (or R. Pare, Mathematics, Statistics and Computing Science, Dalhousie University, Halifax, Nova Scotia, B3H 3J5, Canada) before May 1, 1995.
Summer School In conjunction with CT95, Professors F.W. Lawvere and S. Schanuel will be offering a series of preparatory lectures for graduate students who plan to attend the conference. No registration fee for this Summer School. Student accommodation is $20 nightly/$110 weekly and should be requested from ATANNER@KILCOM1.UCIS.DAL.CA (or Conference Administrator, Conference Services, Dalhousie University, Suite 410, Student Union Building, Halifax, Nova Scotia, B3H 4J2, Canada).
Update of information in [SIAN03p2-1] .
The MFPS XI Program and Registration Information is available.
In addition to the scientific program, the following activities will take place during the meeting. On Tuesday evening, March 28, registration will take place at the Ramada St. Charles Hotel 7pm to 9pm. There also will be a reception on the Tulane campus at the end of the first day's program. A conference dinner will take place on Friday evening, March 31, at which attendance is optional. This dinner will be held at one of New Orleans better restaurants. The fee for the dinner is $45 per person.
Participants will be housed at the Ramada St. Charles Hotel, which is located on St. Charles Avenue some 3 miles from the University. Travel between the hotel and the University can be made by the streetcar line which runs in front of the hotel. We have arranged for a block of rooms at the Ramada St. Charles at greatly reduced prices. To take advantage of these rates, participants must book their hotel reservations through us, and payment must be received by March 7, 1995. After that date, there is an additional $50 late registration fee, and the hotel room rates revert to their normal levels, plus a 13% local tax. Participants should be advised that on the weekend preceding MFPS, there are major medical conventions taking place in the city. As a result, hotel rooms cannot be secured before Tuesday, March 28, 1995.
The registration fee for the meeting is $175 ($90 for graduate students). This fee includes a continental breakfast at the meeting each morning, refreshments at the breaks between talks, and lunch each day of the meeting. The reception for participants at the close of the first day's session also is included. The registration fee also entitles each participant to a copy of the Proceedings of the conference, which will be distributed at the meeting.
The IPPS'95 Advance Program (nearly 83 KB) is available.
Sponsorship The 9th International Parallel Processing Symposium is sponsored by the IEEE Computer Society Technical Committee on Parallel Processing (TCPP) and is held in cooperation with the ACM Special Interest Group on Computer Architecture (SIGARCH) and the Orange County chapter of the IEEE Computer Society. Additional support for IPPS'95 is being provided by the Department of Computer Science, University of California, Santa Barbara and the Institute for Advanced Computer Studies, University of Maryland, College Park.
IPPS'95 Proceedings The 1995 proceedings will be published by the IEEE Computer Society Press and made available to all registrants including students at the symposium.
IPPS'95 Program Schedule The customary IPPS events include contributed technical papers, keynote addresses, workshops, panels, vendor presentations, and tutorials. IPPS'95 will feature seven workshops, tutorials, and a commercial-industrial track. Workshop 1 will start on Monday the 24th, so registration will be open the evening of Sunday the 23rd to accommodate early arrivals. The other 6 workshops will be held on Tuesday; Workshop 1 will continue through Wednesday. The IPPS'95 tutorials will be conducted on Monday and Tuesday.
Wednesday through Friday will feature sessions for contributed papers along with panel discussions and industrial track presentations, and each day will open with a keynote address.
Contributed Papers: There will be 115 contributed technical papers to be presented in 20 technical sessions. Topics span the design, development, use, and analysis of parallel processing systems.
Additional information regarding IPPS'95 events may be obtained by anonymous ftp (replicant.csci.unt.edu) or on the WWW . or contact IPPS'95 General Chair V.K. Prasanna (ipps95@halcyon.usc.edu)
Update of [AL0103M3] .
The TLCA'95 conference programme and registration information are available in plain-text and in LaTeX versions.
Programme Committee H. Barendregt, M. Dezani (Chair), J.-Y. Girard, R. Hindley, F. Honsell, J.W. Klop, G. Longo, A. Meyer, G. Plotkin, P. Scott, J. Smith and J. Tiuryn.
Local Organizing Committee George Cleland, Philippa Gardner, Monika Lekuse and Gordon Plotkin.
TLCA'95 Conference Address
TLCA'95 Laboratory for Foundations of Computer Science
Department of Computer Science, University of Edinburgh
Edinburgh EH9 3JZ, Scotland. Phone: +44 131 650 5132;
Fax: +44 131 667 7209; E-mail: tlca@lfcs.ed.ac.uk
Registration The full registration fee covers coffee breaks, conference dinner, reception and proceedings, which will be published by Springer-Verlag in the Lecture Notes in Computer Science series. The student rate does not include the proceedings and the banquet. The conference will take place in the Reid Music Hall at Bristo Square, University of Edinburgh. The registration desk is open the evening before the conference (5pm--7pm at King's Buildings) and at intervals during the conference itself. Further instructions will be given with the acknowledgment for your conference registration.
Early registration and accommodation forms must be received by 10th March 1995. All cancellations received before 27th March 1995 will incur an administration charge of 20 pounds, plus any accommodation charges which are not recoverable. No refunds can be made for cancellations received after 27th March. Substitutions may be made at any time.
There are additional expenses for the associated events: 20 pounds for the Lambda-calculus meeting and 15 pounds for the Jumelage meeting.
Additional Information: See the TLCA'95 conference WWW page .
Update of [SIAN05p2-2]
Advance Program and Pre-Registration Information available.
The announcement contains:
A more detailed version of this announcement is available.
The Summer School on Semantics and Logics of Computation is being held as part of a six-month research programme on Semantics of Computation at the Isaac Newton Institute for Mathematical Sciences, a new international research centre in Cambridge UK. The Summer School is sponsored by the CEC ESPRIT research project "Categorical Logic in Computer Science, II" (CLICS-II).
The aim is to present a number of modern developments in semantics and logics of computation in a way that is accessible to graduate-level students. Registrations from postgraduate students will be given priority, but applications by interested academics and industrialists are also welcomed. The planned courses include:
Organizers: P. Dybjer (Chalmers) peterd@cs.chalmers.se && A. Pitts (Cambridge) ap@cl.cam.ac.uk
Fees: general rate: 400 pounds; student rate: 250 pounds. The fee covers registration, accommodation, meals (breakfast, lunch, supper, tea & coffee breaks), and lecture materials.
Registration: There are only a limited number of places available on the Summer School. Intending participants are advised to apply for registration as soon as possible, and in no case later than 31 May 1995. To apply, please send your name and address (including e-mail or fax number, if available) to: Florence Leroy (SEM Summer School), Isaac Newton Institute, 20 Clarkson Road, Cambridge CB3 0EH. Tel +44 1223 335984 Fax +44 1223 330508, Email f.leroy@newton.cam.ac.uk
Update of information in [AL0201CC] .
The deadline for submitting abstracts has changed.
The new deadline is March 15, 1995.
Note: The new deadline is earlier than the previous one.
This announcement including the Call for Papers is available.
We wish to inform you that the deadline for submissions to BISFAI-95 has been extended until February 27. We urge you to encourage your students and colleagues to take advantage of this extension and submit to BISFAI. The submissions thus far have been skewed very heavily towards natural language and we feel it is important to achieve a more representative distribution of papers in all areas of AI.
Please inform your students that a limited number of student stipends are available upon request.
Best Wishes,
BISFAI Program Committee
Update of [AL0103CC] .
Note: new conference dates !!! (July 17 -19)
The Call for Papers and information about SPAA can be obtained via Mosaic or anonymous ftp .
The full version of this Call is available.
The workshop on Advances In Type Systems For Computing is being held as part of a six-month research programme on Semantics of Computation at the Isaac Newton Institute for Mathematical Sciences, a new international research centre in Cambridge UK. The workshop programme will consist of a combination of invited and contributed talks presenting recent developments in the use of typing in computing, with particular emphasis on the following three related areas:
Invited speakers will include: M Abadi (DEC), K Bruce (Williams), L Cardelli (DEC), R Harper (CMU), X Leroy (INRIA), D MacQueen (AT&T), J Palsberg (Aarhus), B Pierce (Cambridge), V Saraswat (Xerox), S Smith (John Hopkins), M Tofte (DIKU), A Yonezawa (Tokyo).
Programme committee: S Abramsky (Imperial), L Cardelli (DEC), J Mitchell (Stanford) Chair, A Pitts (Cambridge), A Yonezawa (Tokyo).
Contributed talks will be selected by the programme committee on the basis of submitted abstracts. Five copies of an abstract in English (up to 2 pages) should be sent to the program committee chairman
John Mitchell (ATSC), Department of Computer Science,
Stanford University, Stanford, CA 94305-2140, USA
to arrive not later than 1 April, 1995. Notification of selection of contributed talks by 1 May, 1995. Registration deadline: 14 June 1995.
For further information and registration forms please contact:
Florence Leroy, Isaac Newton Institute, 20 Clarkson Road
Cambridge CB3 0EH. Tel: +44 1223 335984, Fax: +44 1223 330508
Email: f.leroy@newton.cam.ac.uk
Grants: The conference is sponsored by the European Union Human Capital and Mobility Programme and will provide grants to registration, travel and subsistence costs of selected young (under 35) participants. Grant application deadline 30 April 1995. See full version for details.
Following the successful Workshop on Self-Stabilizing Systems in MCC, Austin (1989), the Second Workshop on Self-Stabilizing Systems will be held in Las Vegas in 1995 (immediately before the 27th Annual ACM Symposium on Theory of Computing). The workshop provides a forum for the presentation of new research results and the identification of future results in this area. It is an opportunity to gather researcher interested in the rapidly growing area of self-stabilizing systems.
Topics Papers are solicited describing original results in all areas of self-stabilization including, but not restricted to:
Submissions 7 copies of papers to Program Chair, max. 15 pages (roughly 35 lines/page). Include e-mail, fax/phone number of contact author. Submission arrival will be acknowledged by e-mail.
Proceedings A Technical Report of the UNLV will be dedicated to the proceedings, and will be distributed at the Workshop (for a small fee). The Chicago Journal of Theoretical Computer Science will publish a special issue based on papers presented at the workshop.
Dates: subm: Mar. 3, '95; notif: Apr. 17, '95; final: May 11, '95.
Program Committee: J.E. Burns (Bellcore), S. Dolev (Texas A&M U, Program Chair), M.G. Gouda (U Texas), T. Herman (U Iowa), S.-T. Huang (Tsing Hua U Taiwan), J. Simon (U Chicago), J. Spinelli (Union College)
Further information. Contact either:
Shlomi Dolev (Program Chair), shlomi@cs.tamu.edu
Dep't of Computer Science, Texas A&M Univ. College Station
TX 77843-3112, USA. Phone: (409) 845-5469. Fax: (409) 847-8578
or Ajoy K. Datta (Local Arrangements Chair), datta@cs.unlv.edu
Dep't of Computer Science, UNLV, Las Vegas, NV 89154-4019, USA.
Phone: (702) 895-0870. Fax: (702) 895-4075
A LaTeX version of this Call for Papers is available.
Papers presenting original research in all areas of computational geometry are sought. Authors should send one camera-ready original and seven copies of an extended abstract of up to six pages by April 10, 1995 to the Program Committee Chair:
Jean-Marc Robert, Departement d'informatique et de mathematique
Universite du Quebec a Chicoutimi, 555 boul. de l'Universite
Chicoutimi (Quebec), Canada, G7H 2B1. jmrobert@uqac.uquebec.ca
Submissions should also include the fax number and email address of the sender. Submissions received past the deadline risk rejection without further consideration. Authors will be notified of acceptance or rejection by June 9, 1995. Accepted papers will appear as submitted in the conference proceedings. One author of each accepted paper should attend the conference and present the paper.
A special issue of Computational Geometry: Theory and Applications will be dedicated to this conference. Selected participants will be invited to submit their full papers by August 31, 1995 for possible publication in the journal. These papers will be subject to the normal refereeing process of Computational Geometry: Theory and Applications
Program Committee
Jurek Czyzowicz, Universite du Quebec a Hull,
Olivier Devillers, INRIA, Sophia-Antipolis,
Hazel Everett, Universite du Quebec a Montreal,
Christopher Gold, Universite Laval, Quebec City, conference chair
Henk Meijer, Queen's University, Kingston,
Jean-Marc Robert, Universite du Quebec a Chicoutimi, program chair
Rephael Wenger, Ohio State University, Columbus.
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, parallel and distributed computing.
Submissions 5 copies of a full paper (hardcopy, no electronic versions, max. 12 pages) to
Workshop on Algorithms & Data Structures (wads95_pc@scs.carleton.ca)
School of Computer Science, Herzberg Physics Building
Carleton University, 1125 Colonel By Drive, Ottawa, Canada K1S 5B6
tel.: (613) 788-4333, fax: (613) 788-4334
Dates: subm: Feb. 17, '95; notif: Apr. 14, '95; final: May 12, '95.
Proceedings will be published in the Springer Verlag series Lecture Notes in Computer Science, to 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 of Computing and Information Science
Queen's University, Kingston, Ont. K7L 3N6, Canada
tel: 613-545-6057, fax: 613-545-6513, WADS95_LA@qucis.queensu.ca
Program Committee:
co-chairs: S. Akl, F. Dehne, J.-R. Sack, and N. Santoro.
A. Apostolico, R. Baeza-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, E. Lodi, M. Loui, E. Mayr, J. Peters, G. Plaxton, A. L. Rosenberg, P. Shor, J. Stolfi, S. Song, R. Tamassia, R. Tan, S. Whitesides, P. Widmayer, S. Zaks, N. Ziviani.
Further information WADS'95 WWW home page .
The full (LaTeX) version of this announcement is available.
Hybrid systems, namely systems in which computers interact with the physical world, are becoming more and more common in all application domains. The analysis and design of such systems require a synthesis of ideas, concepts, mathematical theories and tools that are currently spread over distinct disciplines, most notably Computer Science and Control Theory. The goal of this meeting is to contribute to the reapproachment between those disciplines.
The workshop is sponsored by the ESPRIT-NSF project HYBRID EC-US-043.
Invited speakers:
Eugene Asarin (Russian Acad. Sci., Moscow, Russia)
Zvi Artstein (Dep't of Mathematics, Weizmann Inst., Rehovot, Israel)
Michel Fliess (Lab. of Signals and Systems, Gif-sur-Yvette, France)
Bud Mishra (Courant Inst., New York U., USA)
Anil Nerode (Math. Sciences Research Inst., Cornell U. Ithaca, USA)
Amir Pnueli (Dep't of Comp. Sci., Weizmann Inst., Rehovot, Israel)
Frits Vaandrager (CWI, Amsterdam, Holland).
Submissions The meeting will be rather informal. Those who wish to present their work are requested to send a short abstract (3-6 pages) to the selection committee. Others who wish to participate or to demonstrate a tool should send (pref. by e-mail) a short description of their interests and previous work on hybrid systems to the selection committee. The deadline is 15.3.95. Proceedings will be distributed only for the participants. The registration fees have not yet been determined but will not be prohibitive (ca. 1000 FF including lunches).
Organizing committee: Oded Maler, Ahmed Bouajjani.
Selection committee: Mats Andersson (Lund), Albert Benveniste (Rennes), Ahmed Bouajjani (Grenoble, co-chair), Oded Maler (Grenoble, co-chair), Amir Pnueli (Rehovot and Grenoble), Anders Ravn (Lyngby), Hans Rischel (Lyngby), Joseph Sifakis (Grenoble).
Further information Contact:
Oded Maler, VERIMAG, Miniparc ZIRST, F-38330 Montbonnot, France.
Phone: +33 76909635 Fax: +33 76413620 E-mail: Oded.Maler@imag.fr
The full Call For Papers and Referees is available.
This year, the Software Technology Track of HICSS-29 will focus on a broad selection of topics in the area of High Performance Distributed Systems: Design, Implementation, and Applications. This particular solicitation for the Software Track will provide a forum to discuss new advances in theory, design, implementation, use, application, and performance evaluation of high performance distributed systems. We invite papers that may be theoretical, conceptual, tutorial, or descriptive in nature. Those papers selected for presentation will appear in the Conference Proceedings, published by the IEEE CS. A collection of the accepted papers will be considered for inclusion in a separately bound volume, to be determined at a later time.
1995 Deadlines
Submissions See the full version for submission requirements. Specific topics are identified within the following eight Minitracks:
Submissions must be made to one of the Minitrack Coordinators (names and addresses in the full version), according to their areas. Persons interested in refereeing should contact the Minitrack Coordinators.
The full version of this Call for Papers is available.
The purpose of this symposium is to bring together researchers and developers from academia, industry, and government to advance the science and technology in real-time computing. Papers on all aspects of real-time computing are sought, including operating systems and scheduling, fault-tolerance, databases, programming languages, tools, communication networks, architectures, performance modeling, formal methods, case studies, and applications. Of particular interests are reports describing practical experiences and experimental results based on system building efforts, and real-time issues in applications such as avionics, multimedia, robotics, automated process control and manufacturing.
Submissions Papers should describe original work, and be 20 double-spaced pages (5,000 words) or less in length. Synopses (5 double-spaced pages or less in length) of real-time applications, experimental results and practical experiences in the design and development of real-time systems are also invited. Synopses should contain enough information for the program committee to understand the scope of the project and evaluate the novelty of the problem or approach. All accepted submissions will appear in the proceedings. Please send 5 copies of the manuscript to one of the program co-chairs (their addresses and further requirements are in the full version).
Dates: subm: May 1, '95; notif: Jul. 24, '95; final: Sep. 15, '95.
Tutorials and Exhibition: Tutorials on real-time communications, real-time posix, and formalisms, are being planned and will be held immediately before the symposium. In addition an exhibition of hardware and software products for real-time systems will be held in conjunction with the symposium. For more information contact Professor Alan Burns.
General Chair: Krithi Ramamritham, USA.
Program Co-Chairs: Alan Burns, UK, Yann-Hang Lee, USA.
Local Arrangements: Giorgio Buttazzo, I, Ettore Ricciardi, I.
More information See the RTSS'95 WWW home page .
The School of Computer Science-Carleton University, and Bell-Northern Research/Northern Telecom Secure Networks, in cooperation with the IACR hold the second in a series of annual workshops on selected areas in cryptography. Original papers are solicited on all practical aspects of
The first topic includes applications to authentication, broadcast encryption, conference keying, digital cash and secret sharing. The second includes hardware and software implementations, with an emphasis on fast, systematically designed ciphers with practical applications.
Submissions Authors should send 8 copies of an extended abstract of max 15 double-spaced pages, clearly indicating the results achieved, their significance, and their relation to other work in the area, to:
SAC95, c/o Evangelos Kranakis, School of Computer Science
Carleton University, Ottawa, Ontario, K1S 5B6, Canada
Authors should include their electronic address.
Dates: subm: March 10, 1995; notif: April 14, 1995.
Accepted abstracts will be distributed as a collection of workshop papers available during the conference. Authors are requested to send their original submissions in a correct and reproducible form. Also, a subset of the papers accepted for SAC'95 will be invited for submission to a special issue of Designs, Codes and Cryptography, to be refereed in accordance with the standard process for that journal.
Organizing Committee: C. Adams (BNR), J. Benaloh (Clarkson U.), E. Kranakis (Carleton U.), D. Krizanc (Carleton U.), H. Meijer (Queens U.), P. Van Oorschot (BNR), S. Tavares (Queens U.).
Registration (regular C$100; student C$40) includes collection of workshop papers, social event, lunches, dinners, breaks. Accommodation:
Further information. On the WWW (select News & Current Events).
tel (613) 788-4333, fax (613) 788-4334, email: sac95@scs.carleton.ca
Local Organizing Committee: M. Just, E. Kranakis, D. Krizanc.
Martigny, Valais, Switzerland, November 29th -- December 1st, 1995
The full version of this announcement is available.
Oz is a concurrent programming language providing for functional, object-oriented, and constraint programming. Its novel features bear a high potential of new solutions to problems requiring complex symbolic computation, such as natural language processing, spoken language processing, multi-agent systems, and constraint satisfaction problems.
Being developed at DFKI, Saarbrücken, the language Oz is currently being used in several research institutions. This workshop is intended to provide the researchers involved or interested in the language Oz an opportunity to discuss the following questions:
A one-day tutorial on programming in Oz covers the following areas:
Submissions This workshop will have two tracks of presentations. Long presentations follow a standard format, accompanied by 10-page papers in the proceedings. Brief presentations are accompanied by a short (max. 2-page) abstract in the proceedings. Your submission should be a max 2-page extended abstract, by e-mail (plain ASCII, LaTeX, or Postscript) to woz95@idiap.ch; see the full version for more details.
Dates: subm: Jul. 15, '95; notif: Sep. 1, '95; final: Oct. 15, '95.
Further information: E-mail to: woz95@idiap.ch
Information will be available on two WWW servers.
Organizers: Jean-Luc Cochard (IDIAP & U. Fribourg), Rolf Ingold (U. Fribourg), Philippe Froidevaux (IDIAP)
The full version of this announcement is available.
This is the 2nd international meeting on high performance computing to be organized in India, following the first one that was organized as a workshop on parallel processing. It will serve as a forum to present current work by researchers from around the world as well as highlight activities in India in the high performance computing area.
The meeting emphasizes both design and analysis of high performance computing systems and their scientific and engineering and commercial applications. In addition to technical sessions of contributed paper presentations, the conference offers invited presentations, tutorials, vendor presentations, and exhibits.
Tutorials Proposals are solicited for tutorials to be held at the meeting. Interested individuals should submit a proposal by June 30, 1995 to V. K. Prasanna.
Exhibits/Vendor Presentations Companies and R&D laboratories are encouraged to present their exhibits at the meeting. In addition, a full day of vendor presentations is planned. For details, companies are to contact the Exhibits/Vendor Presentations Chair by July 31, 1995.
Call for Papers Authors are invited to submit manuscripts that demonstrate current research in all areas of high performance computing including design and analysis of parallel and distributed systems and their applications in scientific and engineering and commercial areas. Original unpublished work as well as summaries of current work will be considered. See the full version for more details.
Dates: subm: Apr. 1, '95; notif: Jun. 1, '95; final: Aug. 1, '95.
Proceedings will be available at the meeting. Selected papers will appear in a special issue of J of Parallel and Distributed Computing. Selected papers will also be considered for possible publication in a special issue of the IEEE Parallel and Distributed Technology.
Meeting Information is updated and can be found on the WWW .
Information regarding places of interest in India can be found.
The full version of this Call for Contributions is available.
Contributions are invited in the form of 2-page abstract (600 words) in all areas related to logic, language, information and computation, including: pure logical systems, proof theory, model theory, type theory, category theory, constructive mathematics, lambda and combinatorial calculi, program logic & program semantics, nonclassical logics, nonmonotonic logic, logic & language, discourse representation, logic and AI, automated deduction, foundations of logic programming, logic and computation, and logic engineering.
Guest speakers include (so far preliminarily confirmed): C Alchourron (Buenos Aires), A Avron (Tel Aviv), N Belnap (Pittsburgh), J van Benthem (Amsterdam), P Freyd (Philadelphia), D Gabbay (London), I Hodkinson (London), P Lincoln (Stanford).
Submission 2-page abstracts (pref. by email to wollic95@di.ufpe.br) must be received by June 1, 1995. Authors will be notified by July 1, 1995. WoLLIC'95 is sponsored by the Interest Group in Pure and Applied Logics (IGPL) and by the European Foundation for Logic, Language and Information (FoLLI). Abstracts from IGPL members will be published in the Bulletin of the IGPL as part of the meeting report. Selected contributed papers will be invited for submission to a special issue of the Bulletin.
Programme Chair: Prof P A S Veloso, Dep'to de Informatica, PUC-Rio
Rua Marques de Sao Vicente, 225, Rio de Janeiro, RJ 22453-900
Brazil Tel +55 21 5299524, fax +55 21 5115645, veloso@inf.puc-rio.br
Programme Committee: W A Carnielli (UNICAMP, Campinas), M Costa (EMBRAPA, Brasilia), V de Paiva (Cambridge, UK), R de Queiroz (UFPE, Recife), A Haeberer (PUC, Rio), T Pequeno (UFC, Fortaleza), L C Pereira (PUC, Rio), A M Sette (UNICAMP, Campinas), P Veloso (Chair, PUC, Rio).
For further information contact the Chair of Organising Committee:
R de Queiroz, Dep'to de Informatica, Federal Univ. of Pernambuco at
Recife, P O Box 7851, Recife, PE 50732-970, Brazil.
e-mail: wollic95@di.ufpe.br, tel +55 81 2718430, fax +55 81 2714925.
CoChair: T Pequeno, LIA UFC, tarcisio@lia1.ufc.br, fax +55 85 2231333
The full version of this announcement (in French) is available.
Apres les precedentes Journees Francophones de Programmation en Logique qui se sont tenues a Lille (1992), Nimes (1993) et Bordeaux (1994), le groupe de travail Programmation en Logique de l'AFCET, chapitre francais de l'ALP, a choisi Dijon, capitale des Ducs de Bourgogne, comme site d'accueil pour son edition 1995. JFPL'95 sera organise conjointement par le Centre de Recherche en Informatique de Dijon (CRID) de l'Universite de Bourgogne et le Laboratoire d'Automatique de Besancon (LAB) de l'Universite de Franche-Comte.
Les themes abordes durant ces journees concerneront tous les domaines theoriques et experimentaux relevant de la programmation en logique, notamment (liste non exhaustive): Semantiques; Analyse et transformation de programmes; Conception, implantation et compilation de langages; Methodes et environnements de programmation; Parallelisme; Extensions de la programmation en logique; Satisfaction de contraintes; Bases de donnees deductives; Langage naturel; Representation des connaissances; Applications de la programmation en logique. Une session particuliere sera consacree aux applications industrielles de la Programmation en Logique avec Contraintes.
Comite d'organisation: Jean-Jacques Chabrier, CRID; Jacqueline Chabrier, CRID; Francois Jacquenet, CRID; Bruno Legeard, LAB.
Secretariat: Mme Dominique Belime, CRID-Faculte des Sciences Mirande
B.P. 138, F-21004 Dijon Cedex. Tel: +33 80395887, Fax: +33 80395815
e-mail: jfpl95@crid.u-bourgogne.fr
A LaTeX version of this Call for Papers is available.
Editor-in-Chief: M. Bruynooghe
Founding Editor: J.A. Robinson
Guest Editors: Gopal Gupta & Mats Carlsson
The Journal of Logic Programming is planning a special issue on High Performance Implementations of Logic Programming Systems, tentatively to appear in early 1996. High-quality original research papers are invited on all aspects of high performance sequential and parallel implementations of logic programming languages. Topics include, but are not limited to,
Short papers (5 to 8 pages) describing important past implementation efforts (which have not been published in archival journal papers) are also solicited. Revised and enhanced versions of papers published in conferences that have not appeared in archival journals are also eligible. Please send six copies of your paper, by March 1st, 1995, to:
Gopal Gupta, Guest co-editor
Laboratory for Logic, Databases, and Advanced Programming
Department of Computer Science, New Mexico State University
Box 30001/CS, Las Cruces, NM 88003, USA. Email: jlpspi@cs.nmsu.edu
JLP Latex style files are available by ftp in directory .
The style file is jlp.sty, instructions for using this latex style file are in file jlpsty.tex. Authors are encouraged to use them to speed the publication process. Postscript files over email will also be accepted. Authors are required to email a title and a four or five line abstract to arrive by February 20th, 1995, at jlpspi@cs.nmsu.edu to facilitate assignment of reviewers in advance.
The full version of this Call for Papers is available.
Important Note: Submission to this special issue is open to all and is not restricted to attendees of the post-ILPS'94 WUDDS Workshop
Objectives Most real-life applications require an ability to represent, manage and reason with uncertain knowledge. Examples include diagnostic applications; data mining; image, scientific, and genome databases; and legal and military applications. Numerous formalisms for dealing with uncertainty have been studied over the years, several of which are in the context of logic programming and deductive databases. A special issue of the Theoretical Computer Science Journal will be devoted to papers describing original research of very high quality, in all aspects of uncertainty in database systems and in deductive systems such as logic programming. The research described must have adequate theoretical depth together with a clear indication of the usefulness and applicability of the results to practice.
Topics See the full version of this Call for a detailed list.
Submissions should be no more than about 30 doublespaced pages (each page having about 40 lines of text with about 75 characters per line). Papers must be original and must not have been previously published or simultaneously submitted for publication elsewhere. The papers will be reviewed based on their merit, originality and technical quality, relevance to the special issue theme, and the extent to which they will advance the frontiers of knowledge in this area. In addition, the traditional standards of quality control refereeing for TCS will apply. The approximate publication date targeted is Spring 1996.
Submit 4 copies of a full paper no later than March 15, 1995, to:
Laks V.S. Lakshmanan -- TCS Special Issue
Department of Computer Science, Concordia University, LB 941 - 11,
1400 De Maisonneuve Blvd West, Montreal, Quebec, Canada H3G 1M8
laks@cs.concordia.ca - phone: +1 514 8483018; fax: +1 514 8482830
Dates: subm: Mar 15, '95; notif: Aug. 15, '95; final: Oct. 15, '95.
Guest Editors: Jean-Claude Bajard, Christiane Frougny, Jean-Michel Muller and Gilles Villard
Efficient manipulation of (some) real numbers in computers is a new frontier! Many interesting theoretical and algorithmic problems are linked with that topic, and belong to quite distant fields such as computer science, number theory, numerical analysis, computer algebra and logics. The aim of this special issue of TCS is to present the state of art in this increasing new domain, gathering contributions coming from these different areas. Researchers working on questions related to real computer arithmetic are encouraged to present the theoretical or algorithmic aspects of their results.
Submission Send 4 copies of a full paper (extended abstracts will be rejected) to:
Jean-Michel Muller
Laboratoire LIP, Ecole Normale Superieure de Lyon,
46 Allee d'Italie, F-69364 Lyon Cedex 07, France
(Phone +33 72728229, Fax +33 72728080)
or a PostScript or LaTeX version of your full paper to:
Jean-Michel.Muller@lip.ens-lyon.fr
(subject: TCS)
before May 15. Please clearly indicate that your submission is to the special issue of TCS. Electronic submissions are encouraged, but please make sure that your postScript files can be printed.
Language: English.
Dates: subm: May 15, '95; notif: Oct. 15, '95; final: Dec. 1, '95.
Important: A Conference devoted to the manipulation of real numbers will be held in Saint-Etienne, France, in April 1995. Information on that conference can be obtained by sending an electronic mail or by writing to Jean-Michel Muller, at the address given above.
The full version of this Announcement is available.
The Electronic Colloquium on Computational Complexity (ECCC) is a new forum for the rapid and widespread interchange of new ideas, techniques, and research in computational complexity. The purpose of this Colloquium is to use electronic media for scientific commnication and discussions in the computational complexity community. The ECCC welcomes papers, short notes, surveys, with relevance to the theory of computation, clear mathematical profile, strictly mathematical format.
Central topics are: models of computation and their complexity, trade-off results, complexity bounds (with emphasis on lower bounds).
Specific areas including complexity issues are: combinatorics, communication complexity, cryptography, combinatorial optimization, complexity of learning algorithms, logic. This is not meant as an exhaustive list. All submissions which are in the scope, look somewhat new and interesting, contain all proofs and are in a readable form, are stored as an ECCC Report and are immediately accessible to the reader.
Submissions Publication in ECCC provides the innovative feature of an ongoing public scientific discussion. Corrections, improvements, remarks etc. concerning an existing ECCC Report may be submitted by either author or reader and are kept with the original submission, thus being accessible to all. Submission to ECCC does not prevent future submission to any conference or journal. The submissions which appear in the archive have the status of technical reports.
Scientific board ECCC activity is supervised by a scientific board. The board makes sure that ECCC Reports, as well as the ongoing discussion, meet the minimal standards described above. In addition, the board may occasionally declare a ECCC Report as an important contribution which merits special attention. These declarations will be posted. (The members of the scientific board of ECCC are listed in the full version of this Announcement.)
Online access for ECCC
- FTP
- WWW
- Mail to ftpmail@ftp.eccc.uni-trier.de, subject "help eccc"
The full version of this announcement is available.
GMD offers young scientists the opportunity to work on innovative topics in a broad range of subjects. The emphasis is on Communication and Cooperation, Intelligent Multimedia Systems, Hardware/Software Co-Design, Parallel and Scientific Computing, which represent the four major research areas of GMD.
Each of the full-time positions will have a duration of up to two years. A single extension by one additional year is possible. Funding can commence in April 1995.
Applications must be sent before March 1, 1995.
Applicants must have a Ph. D. (or equivalent) and demonstrate research experience from projects in research institutions, universities or industry. Good knowledge of English or German is required.
A statement of research qualification and interest should accompany the application. The applications should include a Curriculum Vitae, copies of university degrees, letters of reference, and publication lists.
Please send applications to
GMD, Gilbert Kalb
Schloss Birlinghoven, D-53754 St. Augustin, Germany
email: kalb@gmd.de, Fax: +49 2241 14 2288
Stanford University's Department of Computer Science seeks applicants for a tenure track faculty position at the Assistant Professor level. Specific areas of interest include natural language, human-computer interaction, and adaptive and learning systems. In addition, the department is interested in strengthening its faculty in foundations (algorithms and formal methods) and in software systems.
Applicants should have a Ph.D. in a relevant field, and should have a strong interest in both teaching and research. The successful candidate will be expected to teach courses, both in the candidate's specialty area and in related subjects, and to build and lead a team of graduate students in Ph.D. research. Stanford University is an equal opportunity employer and welcomes nominations of women and minority group members and applications from them. Applications, including a resume, a publications list, and the names of five references, should be sent by March 1, 1995 to:
Search Committee Chair, Department of Computer Science
Margaret Jacks Hall, 210, Stanford University,
Stanford, CA 94305-2140
The Shape project is developing some exciting new ideas in the semantics of data types so that they can be incorporated into programming languages, especially a parallel language suitable for numerical analysis. The key concept is that data is stored in shapes (or containers, or structures) which can be described and manipulated separately from the data. Expected benefits are:
Further information about the theory of shape can be obtained by anonymous ftp from ftp.socs.uts.edu.au in the directory users/cbj in the file shapelyTypes.ps.Z and the sub-directory P2.
A prototype functional language is currently under development. When stable, it must be implemented so that it can run on the CM5. Shape information may help in optimisation.
The UTS team currently has two staff and three graduate students, with additional collaborators in Australia, Canada and Europe. Now, with funding from a large ARC grant, we are looking for a post-doctoral research fellow. The position is for up to three years at a salary range of $42,198 - $43,781.
A doctorate in computer science (or equivalent) is essential. The candidate must be able to make a significant contribution to the project. The ideal candidate will have experience in implementing languages on parallel computers, optimisation of programs for parallel computers, functional programming, or type theory.
Address initial enquiries to Barry Jay (cbj@socs.uts.edu.au). Applicants should send a curriculum vitae, before 24 Feb, 1995, to:
Dr C. Barry Jay, School of Computing Sciences
University of Technology, Sydney, PO Box 123 Broadway
2007, Australia
Ph (61 2) 330-1814, Fax (61 2) 330-1807
The position will remain open until it is filled.
Within the framework of the Human Capital and Mobility programme of the European Union we offer six positions as researchers (before or after PhD). The scientific background of the applicants should be in the area of automated deduction.
This project is conducted in close relationship with a nationwide German research programme funded by the DFG which brings together the leading German groups working on automated deduction and thus offers a unique opportunity to get in touch with state-of-the-art research covering a wide range of topics in the field.
The following sites participate in the HCM action: TU Berlin, TH Darmstadt, U. Kaiserlautern, U. Karlsruhe, TU Munchen, U. Saarlandes.
The duration of these positions is limited from a minimum of 6 to a maximum of 12 months. Please send your application with a CV (including a list of publications) and two letters of reference to the following address.
Prof. W. Bibel; Fachgebiet Intellektik; Technische Hochschule
Alexanderstr. 10; D-64283 Darmstadt
Tl +49 6151-162100 Fx +49 6151-165326
bibel@intellektik.informatik.th-darmstadt.de
Express your preferences concerning sites, duration and begin of the stay. If the application arrives before 16 March 1995 then it will be taken into account in the first round of selections which may or may not exhaust all available positions whereby in the latter case a second call for applications will be issued.
Juergen Avenhaus, Wolfgang Bibel, Stefan Ja'hnichen, Tobias Nipkow, Peter Schmitt, Jo'rg Siekmann
The full version of this announcement is available.
The chair in Computer Science resides in the Computer Science section of the department of Information Management. This section takes care of all Computer Science courses both for the program in Information Management as well as the other educational programs provided by the Faculty of Economics. Research in the Computer Science section is concentrated around Infolab, which provides excellent facilities for applied and fundamental research in Computer Science. Contract research is organized within the Economic Institute Tilburg (EIT). The Computer Science section currently employs one associate professor (UHD), five assistant professors (UD), and three trainee research assistants (AIO).
Area of Study: The Computer Science chair is concerned with models in Data and Knowledge Engineering, oriented towards applications in economics. Candidates should have a broad view on information technology.
Requirements: Outstanding researcher with experience in fundamental and applied research, as evidenced by a dissertation and publications in highly qualified international journals and proceedings of important international congresses in the area of Information Management and Technology; outstanding didactic capacities with broad and relevant educational experience on the doctoral and post-doctoral level; broad view of information technology; demonstrated administrative experience.
Information: Request further information about this vacancy from Professor F.A. van der Duyn Schouten, chairperson of the appointment commission, or from the secretariat of this commission, Ms. G.J.M. van den Maagdenberg, telephone +31-13-662420.
Applications: Please submit applications within three weeks of the appearance of this advertisement, with curriculum vitae and list of publications, to the secretariat of the Appointment Committee, attention: Ms. G.J.M. van den Maagdenberg, Faculty of Economics, Post Box 90153, 5000 LE Tilburg, The Netherlands.
More information about Infolab can be found on the Infolab WWW page
The project `Testing and Verification of Timed Systems' will be carried out jointly at the Tele-Informatics and Open Systems Group of the University of Twente and at the Department of Software Technology of CWI in Amsterdam.
The project aims at the development of a coherent methodological framework for the validation of real-time distributed systems. The work will support both empirical and formal validation methods, i.e. testing and verification, thus allowing for the application of complementary strategies. For inspiration and evaluation the project will apply its validation methods on realistic real-time applications in consumer electronics and the area of communication and application protocols.
In the context of this project, which is supported by NWO/SION (Netherlands Organization for Scientific Research), a postdoctoral position is available at CWI for a period of two years. Requirements are a strong background in concurrency theory and a serious interest in the use of formal methods on real world applications.
Applicants should send a vita and names+addresses of three references by surface mail to:
Personeelsdienst van de Stichting Mathematisch Centrum
Kruislaan 413
1098 SJ Amsterdam
The Netherlands
or via email to:
Frits Vaandrager
fritsv@cwi.nl
Faculty of Computer Science, University of Twente, The Netherlands
The Formal Methods and Tools research groups, which are part of the Department of Tele-Informatics and Open Systems at the Faculty of Computer Science at the University of Twente, are offering a PhD position in Verification of LOTOS Specifications.
This project is part of the research programme VALIDE, which aims at the study and development of formal methods for the design of distributed systems and supporting tool environments. There is a strong emphasis on the application of process-algebraic methods. The fundamental research themes in this programme are:
The PhD student is expected to carry out research in the design and development of verification-oriented tools that check equivalence between 2 models of LOTOS specifications, or check whether a given formula holds for a model of a specification.
Applicants are expected to have some experience in formal specification languages.
Suitable applicants are asked to contact:
Dr Henk Alblas
University of Twente, Faculty of Computer Science
P.O. Box 217, 7500 AE Enschede, the Netherlands,
Phone: +31 53 893685
Fax: +31 53 333815
E-mail: alblas@cs.utwente.nl
Applications close at 28 February 1995.
The PrimaVera group at Sun Microsystems Laboratories has summer internship opportunities for students at both the Masters and the PhD levels. We offer competetive compensation and a travel and relocation package.
At the Masters level, we are looking for students with a strong programming background in C/C++ and some rudimentary knowledge of logic. The job involves developing formal specifications for real systems and putting them to practical use.
At the PhD level, we are looking for students with an interest in formal methods and a strong programming background in C/C++. We would prefer the students to be at the advanced stage of searching for thesis topics. Ideally, they should identify a thesis topic by the end of the internship.
Interested candidates should send me to the address below a resume and a brief statement of purpose. There is no formal deadline, but we expect to start filling positions by early March.
The PrimaVera group's mission is to research and develop software engineering tools and technology based on formal methods aimed at improving software design, development, testing, and maintenance. We have developed a practical, easy to use specification language called ADL (Assertion Definition Language) and a supporting tool suite for software testing. We are currently establishing feasibility of our technology by applying it to significant real systems and demonstrating a cost savings in the process. One of our summer interns from last year is currently working on a thesis topic involving methodologies to automatically generate tests from specifications. Our work for the most part is freely available.
Sriram Sankar
Address:Sun Microsystems Laboratories
2550 Garcia Avenue, UMTV29-112
Mountain View, California - 94043-1100
U.S.A.
Phone: (415)336-6230
email: sriram.sankar@sun.com
The full version of this announcement is available.
The School of Electrical Engineering and Computer Science solicits applications for a permanent computer science faculty position at the Assistant Professor level. Responsibilities include initiation and supervision of research programs and instruction at undergraduate and graduate levels. Applicants should have an earned PhD degree in Computer Science or in a closely related field by Fall 1995.
We seek outstanding and accomplished candidates in specific areas of computer science which include computer systems, software engineering, database systems, networks and distributed systems.
Screening of applications will begin on March 15 and continue until the position is filled. Position starts on August 15, 1995.
The School of Electrical Engineering and Computer Science solicits applications for a permanent computer science faculty position at Associate or Full Professor level. Responsibilities include initiation and supervision of research programs and instruction at undergraduate and graduate levels. Applicants should have an earned PhD degree with proven records of accomplishment in their fields as evidenced by sponsored research programs and publications. We seek outstanding and accomplished candidates in specific areas of computer science which include software engineering, specification and verification, operating systems, database systems, and other related software areas.
Screening of applications began on December 15 and will continue until the position is filled. Position start on August 15, 1995.
Applicants should send a cover letter, a curriculum vita, and the names and addresses of three references qualified to comment on their research and teaching qualifications to
Chair, Computer Science Search Committee
School of Electrical Engineering and Computer Science
Washington State University
Pullman, WA 99164-2752
WSU is an EO/AA educator and employer. Protected group members are encouraged to apply.
The full version of this contribution is available.
This book by Jörg Desel and Javier Esparza, published by CUP, is now available. It is divided into 10 chapters. Chapters 1-5 present analysis techniques (place and transition invariants, siphons and traps), and classical results of the structure theory of Petri nets (results on marked graphs, Commoner's and Hack's theorems, etc.). Chapters 6-9 contain recent developments in the theory of free choice nets, like the rank theorem. In Chapter 10, some results of the former chapters are generalized to larger net classes.
Since a good part of the material was spread among different publications, many of them difficult to access (and sometimes containing mistakes), we have taken special care in making the book self-contained. Every notion is explained, and every result is proved. The material is organized along the lines of a course, and each chapter is followed by exercises.
The book has been available in UK bookshops since 12/01/95, for 25 pounds sterling, and it should also be available in all good bookshops in other countries. You may also order directly from CUP (they charge 2.50 pounds plus the local Mws/VAT/IVA within the European Union).
For more information about availability and delivery you may contact:
Customer Services
Cambridge University Press
The Edinburgh Building
Cambridge CB2 2RU
Tel: +44 223 325970
Fax: +44 223 325959
E-mail: science@cup.cam.ac.uk
This University of Waterloo Tech Report (CS-94-36, Dec 1994) has been submitted for publication.
Abstract: While static typing is widely accepted as being necessary for secure program execution, dynamic typing is also viewed as being essential in some applications. Dynamics have been proposed as a way of introducing dynamic typing into statically typed languages, with particular application to programming in distributed environments. However proposals for incorporating dynamics into ML-like polymorphic languages have serious shortcomings. A new approach is presented to extending ML-like languages with dynamic typing, with similar applications to dynamics. The approach is a refined notion of dynamics, with new introduction and elimination rules which overcome the problems with dynamics for polymorphic languages. This approach is extended to a model of objects and typing for ML-like languages. The resulting type system reflects functionality which is found in the Modula-3 monomorphic object-oriented distributed programming language. The semantics for this are expressed in a calculus with predicative effective polymorphism and impredicative existential types. A structural operational semantics is presented and used to verify a form of semantic soundness for the calculus, isolating all run-time type errors to well-formed run-time type checks due to narrowing. Combined with related work on providing objects with polymorphic methods, this demonstrates for the first time how effective polymorphism and first-class polymorphism may safely co-exist in the same language.
The report is available on the WWW and by anonymous ftp from a Canadian site or from a European site .
The full version of this contribution is available.
This is to announce two papers regarding cut elimination in intuitionistic, classical, and linear logic. They are summarized in: Structural Cut Elimination (extended abstract), Frank Pfenning, December 1994, which is available by anonymous ftp .
All papers are also accessible through WWW .
We present a new proof of cut elimination for linear logic which proceeds by three nested structural inductions, avoiding the explicit use of multi-sets and termination measures on sequent derivations. The computational content of this proof is a non-deterministic algorithm for cut elimination which is amenable to an elegant implementation in Elf. We show this implementation in detail.
We present new proofs of cut elimination for intuitionistic and classical sequent calculi. In both cases the proofs proceed by three nested structural inductions, avoiding the explicit use of multi-sets and termination measures on sequent derivations. This makes them amenable to elegant and concise representations in LF, which are given in full detail.
This paper by Clementino, Giuli and Tholen may be obtained by writing to:
Manuel Clementino
clementino@gemini.ci.uc.pt
In a category with a subobject structure and a closure operator, we provide a categorical theory of compactness and perfectness which yields a number of classical results of general topology as special cases, including the product theorems by Tychonoff and Frolik and the existence of Stone-Cech compactifications, both for spaces and maps. Applications to other categories are also provided.
The full version of this contribution is available.
This paper examines coherence for certain monoidal categories using techniques coming from the proof theory of linear logic, in particular making heavy use of the graphical techniques of proof nets. We define a two sided notion of proof net, suitable for categories like weakly distributive categories which have the two-tensor structure (times/par) of linear logic, but lack a negation operator. Representing morphisms in weakly distributive categories as such nets, we derive a coherence theorem for such categories. As part of this process, we develop a theory of expansion-reduction systems with equalities and a term calculus for proof nets, each of which is of independent interest. In the symmetric case the expansion reduction system on the term calculus yields a decision procedure for the equality of maps for free weakly distributive categories.
The main results of this paper are these. First we have proved coherence for the full theory of weakly distributive categories, extending similar results for monoidal categories to include the treatment of the tensor units. Second, we extend these coherence results to the full theory of *-autonomous categories - providing a decision procedure for the maps of free symmetric *-autonomous categories. Third, we derive a conservative extension result for the passage from weakly distributive categories to *-autonomous categories. We show strong categorical conservativity, in the sense that the unit of the adjunction between weakly distributive and *-autonomous categories is fully faithful.
The paper is available via the Seely home page .
from lambda calculus to information retrieval and language design by Roberto Di Cosmo (dicosmo@dmi.ens.fr) Progress in Theoretical Computer Science. Birkhauser, 1995 ISBN 0-8176-3763-X
The full version of this contribution is available.
This newly published book may be of interest. It is a study of the notion of type-isomorphisms in functional languages, both from a theoretical and a practical point of view.
It is based on my PhD dissertation, but has been extensively revised, updated and provided with a completely new introduction to the topic, that makes it accessible to a wide spectrum of readers. It tries hard to provide a complete reference and discussion of all research done in this area, from the definition of confluent rewriting systems for typed lambda calculi equipped with various extensionality rules, to the characterization of isomorphisms of types in different typed calculi, to the applications to extensions of ML-style type-inference algorithms and the design of library search tools based on types.
A summary of the book is available.
Author's address:
LIENS
Ecole Normale Superieure
45, Rue d'Ulm
75005 Paris FRANCE
These papers are available on the WWW , and also here , or by anonymous ftp from the directory.
The file revirrev.[dvi, ps].[Z, gz] is the paper
Reversible and Irreversible Computations
(GOI & Environment Machines)
We present a sequential reversible computation scheme for lambda-calculus coming from the geometry of interaction. The computation consists in pushing a token (finite list of symbols) along the term (adequately represented as a net), each traversal of a node acting reversibly (i.e., one-one'ly) on that token. Then we define an optimization of that scheme taking advantage of its ``call/return'' symmetry that was recently discovered (see the legality condition of Asperti and Laneve). Moves in this case are no longer reversible and correspond exactly to the transitions of a simple environment machine. This result provides a clearcut correspondence between reversible and irreversible means of computation (and it is fun also to know that GOI gives a simpler account of computations than environment machines).
The file pnh.[dvi, ps].[Z, gz] is the paper
Proof-nets and the Hilbert space
to appear in Proceedings of the Linear Logic Workshop, Cornell, 1993. Girard's execution formula is a decomposition of usual beta-reduction (or cut-elimination) in reversible, local and asynchronous elementary moves. It can easily be presented, when applied to a lambda-term or a net, as the sum of maximal paths on the lambda-term/net that are not cancelled by the algebra LS (as was done in Danos' and Regnier's theses). It is then natural to ask for a characterization of those paths, that would be only of geometric nature. We prove here that they are exactly those paths that have residuals in any reduct of the lambda-term/net. Remarkably, the proof puts to use for the first time the interpretation of lambda-terms/nets as operators on the Hilbert space.
Lecture notes introducing Binary Decision Diagrams and an implementation of a BDD package in Standard ML is freely available by World Wide Web and anonymous ftp at the addresses below. The lecture notes were used in a course at the Technical University of Denmark, autumn 1994. The BDD package is a solution to one of the projects proposed in the lecture notes. As an application of the package it is shown how to compute and count the reachable states of Milner's Scheduler for various numbers of cyclers. (For 40 cyclers the count is 65970697666560 !)
The BDD lecture notes and implementation are available (under Lecture Notes), or by anonymous ftp:
The files must be uncompressed by `gunzip' or `zip' and the .tar-file unpacked by `tar xf'.
Comments and bug reports are very welcome and can be directed to:
Henrik Reif Andersen
E-mail: hra@id.dtu.dk
WWW
Department of Computer Science, Bld. 344
Technical University of Denmark,
DK-2800 Lyngby, Denmark
The full version of this announcement is available.
We announce a new release of Concert/C, a programming tool for distributed programming in heterogeneous systems. Concert/C 4.0 is available for non-commercial use without charge. It runs on AIX, IRIX, OS/2, Solaris, and SunOS. Comprehensive documentation is available, including a Tutorial and User Guide, and a formal specification of the language. Concert/C systems are composed of communicating processes, which are written as sequential C programs. Concert/C provides primitives to create and terminate processes, connect them together, and communicate between them, so that programmers can explicitly express parallelization and distribution. Concert/C processes can run on a heterogeneous set of machine architectures and operating systems, and communicate over multiple RPC and messaging protocols.
(*) All trademarks are recognized trademarks of their respective companies.
LEDA version 3.1 is now released. It can be obtained by ftp.
The directory pub/LEDA/articles contains several articles concerning the library. Important:: Please read the files Changes, and INSTALL first!! Everyone who installs the new leda version, please send a mail to
leda@mpi-sb.mpg.de
Christian Uhrig
Update of information in [AL0101T1] .
A new update of Isabelle, Isabelle94-2, is now on the Cambridge and Munich ftp sites, available .
Here is a summary of changes from Isabelle94-1. Resolution is significantly faster. The different sections in a .thy file can now be mixed and repeated freely.
There is now a database of theorems for FOL, HOL and ZF. New commands including qed, qed_goal and bind_thm store theorems in the database. At present the database only allows simple queries: return a named theorem (get_thm) or all theorems of a given theory (thms_of), or find out what theory a theorem was proved in (theory_of_thm). The database could be useful to designers of user interfaces.
Bugs have been fixed in the inductive definition and datatype packages. The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs and HOL_dup_cs obsolete. Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1 have been removed.
ZF has a new definition of function space; it is equivalent but easier to use. ZF also has many new results about cardinal and ordinal arithmetic (some due to Krzysztof Grabczewski).
HOL now supports a 'subtype' facility for introducing new types as subsets of existing types.
We expect to release updates like this every couple of months, instead of waiting a year between releases as before. Many users will not need to pick up each update.
Larry Paulson and Tobias Nipkow
Update of the information in [AL0103T2] .
We have released a new version of TOPO, a bunch of tools for LOTOS. Last release, 3R5 (7 dec 94) had some flaws, that we have tried to repair in 3R6.
A brief overview of facilities may be found.
For further information contact
Jose A. Manas (jmanas@dit.upm.es)
dpt. Telematica, E.T.S.I. Telecomunicacion
Ciudad Universitaria, E-28040 Madrid, SPAIN
tel: +34 1 336 73 25, or 549 57 62 x. 436, or 549 57 00 x. 436
fax: +34 1 543 20 77
The Programming Systems Lab of the German Research Center for Artificial Intelligence (DFKI) is pleased to announce the release of D FKI Oz 1.0, an interactive compiler-based implementation of Oz.
Oz is a concurrent constraint programming language designed for applications that require complex symbolic computations, organization into multiple agents, and soft real-time control. It is based on a new computation model providing a uniform foundation for higher-order functional programming, constraint logic programming, and concurrent objects with multiple inheritance. From functional languages Oz inherits full compositionality, and from logic languages Oz inherits logic variables and constraints (including feature and finite domain constraints). Search in Oz is encapsulated (no backtracking) and includes one, best and all solution strategies.
DFKI Oz is an interactive implementation of Oz featuring a programming interface based on GNU Emacs, a concurrent browser, an object-oriented interface to Tcl/Tk, powerful interoperability features (sockets, C, C++), an incremental compiler, a garbage collector, and support for stand-alone applications. Performance is competitive with commercial Prolog and Lisp systems. DFKI Oz is available for many platforms running Unix/X, including Sparcs and 486 PCs.
Applications DFKI Oz has already been used for include simulations, multi-agent systems, natural language processing, virtual reality, graphical user interfaces, scheduling, placement problems, and configuration.
DFKI Oz is available by anonymous ftp , or through the WWW .
Tutorials, reference manuals, and research papers are available from the same sources. You may start with "A Survey of Oz" (8 pages) and continue with "An Oz Primer" (110 pages).
For specific questions you may mail to oz@dfki.uni-sb.de . To join the Oz users mailing list, contact oz-users-request@dfki.uni-sb.de .
Dear users of LOTOS, Open Distributed Processing, and Feature-Interaction: At the University of Ottawa, we have put together a home page which might be useful to others.
It provides:
This is just a beginning... suggestions on how to improve it can be sent to me or to Jacques Sincennes (jack@csi.uottawa.ca).
Luigi Logrippo (luigi@csi.uottawa.ca)
The TCS Virtual Rolodex is now available for public use. It contains links to the home pages of theoretical computer scientists on the web. I have primed it with a few dozen URLs that I could find with an hour of Web surfing, and provided an on-line form that you can use to automatically enter your URL on the list. Please feel free to browse it and enter your own URL (if not already present).
The main use that I imagine for the TCS Virtual Rolodex is locating colleagues who have moved, and getting email and snailmail addresses, and telephone numbers.
The rolodex is located here , and it can also be easily accessed through the SIGACT home page .
Ian Parberry (ian@hercule.csci.unt.edu)
ACM SIGACT, the Special Interest Group for Algorithms and Computation Theory, now has a page on the WWW .
In addition to useful information about SIGACT and its activities such as sponsored conferences and SIGACT News, you can access all kinds of information on topics such as journals, conferences, and bibliographies.
Post Scriptum: I've added AMAST to the SIGACT page, actually, to a sub-page listing other resources .
Ian Parberry (ian@cs.unt.edu)
The full version of this announcement is available.
We are pleased to announce the availability of our research reports from 1994 on the Internet. A list of the titles and abstracts of the reports and information on how to obtain them is in the full version.
The reports can be retrieved by anonymous FTP file transfer via the Internet (this is the preferred way), or they can be ordered by mail. To save printing and mailing costs we ask you to obtain the reports by FTP if possible.
The most recent versions of the reports can be retrieved via anonymous ftp (Internet address 129.27.2.4). Log in with ftp as user name and supply your own e-mail address when asked for the password. At least 26 reports are currently available and abstracts for them appear in the full version of the announcement.
The address for ordering the printed versions is
Prof. Dr. Rainer E. Burkard
Technische Universität Graz
Institut für Mathematik
Kopernikusgasse 24
A-8010 Graz, Austria
e-mail: reports@fmatbds01.tu-graz.ac.at
fax: (+43) 316-873-7239
I have set up a web page for materials supporting some of my books:
It presently includes materials for:
Browsing is welcome. If you have relevant class notes, exams, etc., that you are willing to make available publicly, I am happy to include a reference in the page.
Jeff Ullman
<location> := http://www.cs.utwente.nl/data/amast/
<location> := ftp://ftp.cs.utwente.nl/pub/doc/amast/
Date: 21/02/1995
...
V. S. Alagar [M1], Peter D. Mosses [M2],
U. Faigle & C. Hoede [M3], Paul Vitanyi [M4],
Robert France [M5], Maurice Margenstern [M6],
Bob Rosebrugh [M7], Michael W. Mislove [M8],
Sajal Das [M9], Philippa Gardner [MA],
Alois Ferscha [MB], Andrew Pitts [MC], [C4],
Hajime Ishihara [C1], Martin Golumbic [C2],
Robert Cypher [C3], Shlomi Dolev [C5],
Jean-Marc Robert [C6], Frank Dehne [C7],
Oded Maler [C8], Insup Lee [C9],
Azer Bestavros [CA], Evangelos Kranakis [CB],
Jean-Luc Cochard [CC], Ajay Gupta [CD],
Ruy de Queiroz [CE], Francois Jacquenet [CF],
Gopal Gupta [CG], Laks V.S. Lakshmanan [CH],
Jean-Michel Muller [CI], ECCC scientific board [CJ],
Thomas Lengauer [J1], John C. Mitchell [J2],
Barry Jay [J3], Tobias Nipkow [J4], [T4],
Lynn Packwood [J5], Frits Vaandrager [J6],
Henk Alblas [J7], Sriram Sankar [J8],
David B. Benson [J9], Javier Esparza [L1],
Dominic Duggan [L2], Frank Pfenning [L3],
Walter Tholen [L4], Robert A. G. Seely [L5],
Roberto Di Cosmo [L6], Laurent Regnier [L7],
Henrik Reif Andersen [T1], German Goldszmidt [T2],
Christian Uhrig [T3], Lawrence C. Paulson [T4],
Jose A. Manas [T5], Gert Smolka [T6],
Luigi Logrippo [S1], Ian Parberry [S2], [S3],
Bettina Klinz [S4], Jeff Ullman [S5].
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 .