Contributions are welcome!
_ _ _ _ _ _ _ _ _ _ _ _ _ _
date: 21 June 1995
e-mail to: amast@cs.utwente.nl
________________________
e-mailed to: 717 subscribers
Update of information in [AL0204M1] .
The up-to-date Call for Participation is available .
The up-to-date Call for Participation contains the following new information, w.r.t. the previous version stored under the same URL, that relates to the Conference Programme:
Monday, July 3, 1995 08:30-08:50 : Registration
Tuesday, July 4, 1995 08:00-08:45 : Registration
Update of [AL0201C1] .
The full version of the workshop program is available.
Update of information in [AL0103CD] .
The full version of the 2nd Call for Participation is available in
two forms: plain-text and LaTeX respectively.
Note: extended deadline for registration is the 1st of July 1995
Update of [SIAN04p2-3] .
The CAV'95 Program and other information about the conference and
Belgium is available through the WWW .
Update of information in [AL0202C7] .
The full version of this announcement, including Registration Form,
is available .
Update of information in [AL0204MF] .
The Program and Registration Information is available.
Update of [AL0202M7] .
Three announcements containg further information on CT'95
and on the Summer School are available .
The full version of this Call for Participation is available.
Reynold's Syntactic Control of Interference (SCI) and Girard's Linear Logic (LL) appear to be connected, but the precise nature of the connection remains elusive. Outstanding mysteries include:
The goal of this workshop is to get together some of the main developers of these ideas, in an attempt to bring out the relationships between them. It is proposed to have few participants and plenty of time in order that the `work' in `workshop' can be taken seriously! The focus will be on building understanding, and we hope new analyses and syntheses will emerge.
Participation is by invitation only. If you are interested in actively exploring the interaction between SCI, LL, and state, please ask to be invited. Or let us know if there is someone we should invite.
There is a SCILL home page .
The full version of this announcement is available.
The 1995--96 DIMACS Special Year topic is Logic and Algorithms. To launch this Special Year, DIMACS will hold a Summer School on Applied Logic and Algorithms during August 1995. The Summer School is intended to expose industry, graduate students, postdocs, and experienced researchers from other fields to the three focus areas of the Special Year --- Finite-Model Theory, Proof Complexity, and Computer-Aided Verification. The courses will provide students with a deep understanding of these research areas and will point out connections with applications.
The Summer School will consist of three successive one-week tutorial courses, one for each topic. Each week, 3-5 experts will lecture for a total of approximately 20 hours, and time and space will be provided for informal discussion as well.
The DIMACS Conference Center at Rutgers can accommodate about 80 participants. Subject to this capacity constraint, courses are open to all researchers; there is no registration fee. Although registration at the door is permitted, we ask that you register by June 30, 1995, to give us some idea of attendance. Pre-registrants will be given priority in case of capacity constraints. In addition, information on local housing will be sent to people who pre-register.
DIMACS is represented on the WWW .
The full version of this announcement is available.
A course in hazard analysis for software systems will be presented by John McDermid, Tim Kelly, Mark Nicholson and David Pumfrey from the High Integrity Systems Engineering Group, University of York, UK, in Brisbane: 19-23 June 1995 at The University of Queensland, and in Sydney: 26-30 June 1995 at the University of New South Wales.
Registration fee: $2300 ($2100 for each of two or more participants from the same organisation) includes lunch, refreshments, course notes.
With the increasing use of computers in safety-critical applications have come new problems of designing, implementing and certifying systems to meet the high standards necessary. The consequences of failure can be catastrophic - especially since many systems are employed in areas such as aviation, where a single accident can cause significant numbers of deaths or injuries.
Occasionally, faulty systems can be shown to be the most major cause of harm - for example, the deaths caused by faulty software in Therac-25 radiation therapy machines. Other incidents, such as the problems experienced with the London Ambulance Service control system, suggest that the entire process of specifying, developing and employing is capable of improvement.
For most safety-critical systems, it is not sufficient to build a safe system; the system must be shown to be safe. This generally involves the preparation of some sort of safety case, and a process of certification with a licensing authority. The ability to assess the safety of a system, from initial identification of potential hazards through to detailed evaluation of the safety of an implementation, is an essential prerequisite for development and certification.
This course will address the issues of hazard analysis and safety assessment, presenting both `tried and tested' methods currently employed in a variety of industries, and novel concepts and techniques developed in the latest research. The course will take a `whole lifecycle' approach, emphasising the integration of safety assessment at all stages of system specification and implementation.
Update of information in [SIAN02p3-3] .
The Program and Registration Information is available.
The full version of this information is available.
The aim of the workshop is to provide the general research community, and in particular postgraduate students and postdoctoral researchers, with an in-depth view of parallel computing from the more theoretical foundations through the emerging technologies to current and future applications. Experts in these areas of parallel computing will present intensive lectures over a two day period. The program of the workshop consists of:
See the full version of this announcement for the workshop fees and for the registration form.
Limited funds are available to support student attendance.
More information can be obtained on the WWW .
Or contact S.Ravindran, E-Mail: s.ravindran@swansea.ac.uk
If you wish to attend, please send the registration with a cheque or money order payable to "Department of Computer Science (CSD 345)" to:
Dr. S. Ravindran
Department of Computer Science
University of Wales Swansea
Swansea, SA2 8PP Wales, UK
Update of [AL0201C2] .
Preliminary Program and Call for Registration available.
Update of [AL0204MA] .
LICS'95 Conference Information is available.
The full conference program and registration information can be obtained by visiting the LICS'95 home page .
That information may also be obtained by anonymous ftp from the LICS directory .
Update of information in [AL0204ME] .
CPM'95 Program and CPM Summer School Information available.
Update of [AL0203CC] .
This workshop is to allow Isabelle users to exchange techniques and results. Both finished work and work in progress can be reported. There will be a programme of short talks and possibly demonstrations. A printed proceedings will be produced provided enough papers are submitted. There will be no formal refereeing; within reason, all talks and papers will be accepted. There will also be time for informal discussions.
Administration will be minimal in order to keep the costs down. However, we expect to be able to arrange College accommodation for participants at a cost of less than #50 (UK) per day, inclusive of all meals. As an alternative, we can supply a list of hotels. There will be a small registration fee.
The workshop immediately preceeds HOA '95 and LOPSTR '95.
For information on how to get to the Computer Laboratory, please see the WWW .
If you are interested in attending, please let me know. Send your title and abstract if you would like to give a talk or demo. We hope to compile the proceedings electronically from papers submitted in Postscript format; please suppress page numbering.
The deadline for abstracts is 1 June 1995, and the deadline for proceedings papers is 1 July.
Lawrence C Paulson, University Lecturer
Computer Laboratory, University of Cambridge,
Pembroke Street, Cambridge CB2 3QG, England
Tel: +44(0)21223 334623; Fax: +44(0)1223 334678
Update of information in [AL0202M3] .
The list of accepted contributions is available.
Update of [AL0204MC] .
The LaTeX version of the STOC'95 programme is available.
Update of [AL0201C4] .
PODC'95 Program and Registration information is available.
Update of [AL0204C8] .
The SIROCCO'95 Program is available.
Update of information in [AL0202MC] .
The Second Call for Registration is available.
The full version of this Call for Registration is available.
The workshop will be part of the Newton Institute programme on the Semantics of Computation. The general aims of the programme are twofold. First, to refine the current framework for the semantics of computation so that it is capable of dealing with the more subtle computational features present in the programming languages of today and tomorrow. Secondly, to provide a framework for interaction between such fundamental research and the issues confronted by language designers and software engineers. We particularly have in mind current developments such as object-based concurrent programming, and projects to develop the next generation of advanced programming languages, such as ML 2000. The range of technical and conceptual challenges involved in this work requires active collaboration and flow of information between overlapping communities of mathematicians, computer scientists and computer practitioners.
The workshop is intended to open up some of the themes to be pursued during the Semantics of Computation research programme, with some emphasis on the interplay between theory and practice. Apart from the invited talks and accompanying sessions, there will also be scope for contributed talks.
Invited speakers will include: Tony Hoare (Oxford), Cliff Jones (Manchester), Gilles Kahn (INRIA), Robin Milner (Cambridge), John Reynolds (CMU), Akinori Yonezawa (Tokyo).
Other speakers will include: David Benson (Washington) Stephen Brookes (Carnegie-Mellon) John Mitchell (Stanford) Laurence Paulson (Cambridge) Benjamin Pierce (Cambridge) Michel Sintzoff (Louvain) Alan Stewart (Belfast) Mads Tofte (DIKU) Philip Wadler (Glasgow) David Walker (Warwick) Peter Wegner (Brown).
Update of information in [AL0203CD] .
The X-SLALM'95 Second Announcement is available.
Update of information in [AL0203C5] .
The SEGRAGRA'95 Program and other Information is available in two
forms: plain-text and LaTeX respectively.
Update of information in [AL0203C3] .
The CP'95 Preliminary Program & other Information is available in
two forms: plain-text and LaTeX respectively.
The full version of this announcement is available.
The EURO Working Group on Project Management and Scheduling (EURO WG-PMS) has been established during the EURO VIII Conference in Lisbon, September 1986. It was then decided to have a workshop every two years with the objective of bringing together world-wide experts in the field of project management and scheduling in order to exchange and discuss recent research findings and generate viable and promising areas for future research. Contributions are solicited in the field of project management (project planning, project scheduling, project control) and machine scheduling (single and parallel processor problems, flow shops, job shops, open shops). The selection of the papers for presentation at the workshop will be based on a one page abstract which will be reviewed by the Program Committee. Extended abstracts of all accepted papers will be published in the workshop proceedings which will be available at the workshop. It is the purpose to publish selected high quality papers in a special issue of an internationally refereed journal. There will be both demonstrations of commercial software packages and a software olympics on resource-constrained scheduling, the objective of which is to run in competition a number of software packages supplied by workshop participants.
Workshop Location: The Workshop will be held at ON PAN (Osrodek Nauki Polskiej Akademii Nauk) - Centre of the Polish Academy of Sciences, at 17/19, Wieniawskiego St.
Dates: Abstract deadline: June 10, 1995; Notification of acceptance: October 10, 1995; Workshop and hotel registration deadline: January 15, 1996; Extended abstract and software olympics deadline: February 29, 1996
Registration Fee: will be zl 300 (approximately $100).
Workshop secretariat: Izabela Tkocz; Institute of Computing Science; Poznan University of Technology; ul. Piotrowo 3a, 60-965 Poznan (Poland); Tel. 48-61-790790; Fax 48-61-771525; e-mail: office_ics@pozn1v.tup.edu.pl
Guest Editor: Maurice Margenstern
Important Dates:
Topics:
Submission: Send 4 copies of a full paper to:
Maurice Margensternor a PostScript version of your full paper to:
TCS special issue "Universal Machines and Computations"
LITP, 55-56, b.119; Universite' Paris 7
2, place Jussieu; F-75251 Paris Cedex 05
(Phone +33 1 44 27 28 40)
Maurice.Margenstern@litp.ibp.fr subject: TCS/UMCbefore September, 15. Please clearly indicate that your submission is to the special issue of TCS.
Previous Conference: a conference devoted to these topics was held in Paris, in March 1995. The abstracts of the lectures presented at the conference are available by anonymous ftp .
The full version of this announcement is available.
Scope: In his revolutionary experiments of 1895, Marconi achieved transmission of coded radio signals over distances up to 2 km. Six years later, he succeeded in the first transmission of telegraphic signals across the Atlantic from Cornwall to Newfoundland. The century that followed has seen the introduction of many new electronic communications services. In order to celebrate the 100th anniversary of Marconi's remarkable achievement, and to open the second century of electronic communication, the New York State Center for Advanced Technology in Telecommunications is organizing a symposium devoted to the technology of multimedia communications.
Topics: Multimedia transport; Video-on-demand and other interactive multimedia services; Low bit rate video coding: motion estimation; Source and channel coding for video transmission over special channels such as ATM and wireless networks Audio-visual interaction; Multimedia databases and digital libraries.
Paper Submission: Prospective authors are invited to submit an extended summary (not to exceed two single-space typewritten pages). Please send one camera-ready original and three copies of the summary and a cover page stating the i) paper title, ii) authors and their affiliations, iii) contact author's name, address, telephone number, fax number and email address to: Ms. Ameena Mustafa; Polytechnic University, 6 Metrotech Center, Brooklyn, NY 11201; Tel: (718)-260-3841; Fax: (718)-260-3074, Email:ameena@catt.poly.edu.
Registration: $250 prior Sept. 15 and $290 thereafter.
Deadlines: June 1, 1995: Paper summary due July 15, 1995: Notification of acceptance Sept. 15, 1995: Early registration Oct. 11--13, 1995: Camera-ready manuscript due from authors upon arrival at the meeting.
Web information is available .
The full version of this announcement is available.
The fifth of a series of workshops on hybrid systems will be organized at Rutgers University in New Brunswick, New Jersey, from October 22 to October 25, 1995. The purpose of the workshop is to bring together researchers from both computer science and control theory, and to advance the theory of hybrid systems and its applications to real-life problems.
The 1995 workshop will be organized as a part of the DIMACS 1995-96 Special Year on Logic and Algorithms.
Submissions are invited in all areas pertaining to the formal verification and control of hybrid systems, that is, systems in which digital devices interact with continuous objects. We are especially interested in methods that bring together in creative ways concepts from computer science and control theory. Topics include, but are not limited to, formal models and specification languages, algorithmic and deductive verification, control and optimization, simulation and testing, design and synthesis, complexity and decidability issues, probabilistic systems, automatic and interactive tools, experimental results and applications.
Authors are requested to submit an extended abstract not exceeding twelve pages, either six hard-copies or a postscript file, to the address below. The abstract should start with a title page containing the title of the paper, each author's name and affiliation, the contact author's physical and e-mail addresses, and a one- or two-paragraph summary. The full versions of selected submissions will be published after the workshop as a volume of the Springer-Verlag Lecture Notes in Computer Science series.
There will be no registration fee for the workshop.
Important Dates: Submission deadline: July 26, 1995; Notification to acceptance: September 1, 1995
Submission Address: Rajeev Alur; 2D-144, AT&T Bell Laboratories; 600 Mountain Avenue; Murray Hill, NJ 07974; USA; Email: alur@research.att.com (postscript only)
This announcement is available in HTML and PostScript format.
Research in formal methods has been going on for more than twenty years now in various areas such as mathematical verification, formal specification, transformation, prototyping, and testing. Recently, several flavors of formal methods have been gaining industrial acceptance and production quality software tools have begun emerging.
The purpose of this workshop is to bring together experts in formal methods technology and the early innovators in industry who have adopted formal methods. Discussions will focus on the impact of formal methods on software practice, as well as on strategies to further this impact in the future. This workshop is being co-located with ISSTA (International Symposium on Software Testing and Analysis) to encourage the cross-pollination of ideas between the formal methods and the testing communities.
Authors are invited to submit extended abstracts not longer than 4000 words. Submissions must be original and should not have been published previously or be under consideration for publication while being evaluated for this workshop. Extended abstracts accepted for presentation will also be published in the workshop proceedings. Please send five copies of your submissions to the general chair by August 14 (submissions received after the deadline will be disregarded).
Submissions should focus on the application of formal methods to software practice.
Important Dates: Submission: August 14, 1995; Notification of acceptance: October 13, 1995; Final versions due: November 13, 1995
Program Committee: M. Ardis; M. Broy; B. Krieg-Brueckner; D. Detlefs; P. Frankl; D. Kapur; P. Krishnan; D. Luckhamy; S. Meldal D. Parnas; D. Richardson; R. Platek; D. Rosenblum; S. Sankar; W. Scherlis; A. Wasserman; J. Wing.
General Chair: Sriram Sankar, Sun Microsystems Laboratories 2550, Garcia Avenue, UMTV29-112 Mountain View, California - 94043-1100 USA phone: 415-336-6230, e-mail: sriram.sankar@sun.com
More information is available .
The third FME Symposium will be held at St Hugh's College in Oxford from 18 to 22 March 1996. It will be organised by Formal Methods Europe, as the successor of the last previous VDM symposia, FME'93 and FME'94, and co-sponsored by the IFIP Working Group 14.3 (Foundations of Systems Specifications). The theme of FME'96 will be "The Application and Demonstrated Industrial Benefit of Formal Methods, Their New Horizons and Strengthened Foundations."
Three kinds of full-length paper are solicited:
Proposals for tutorials and tool demonstrations are welcome.
Topics: Practical use, case studies; Comparisons of existing formal methods, extensions, improvement; Theoretical foundations; Tools; Specification and refinement techniques; Proof and test; Development process; Linking formal and informal methods; Concurrency, real-time and reactive systems; Secure or/and safety-critical systems; Object orientation; Education and technology transfer.
Programme Chair:
Marie-Claude Gaudel, LRI-CNRS,
Universite' de Paris-Sud, Bat. 490, F-91405 Orsay cedex, France
tel: +33 1 69416629, fax: +33 1 69416586, email: mcg@lri.lri.fr
Important Dates: Deadline for Submission: September 11, 1995; Notification of acceptance sent to authors: November 24, 1995; Camera-ready copy due to publisher: January 8, 1996 (to be received in Orsay).
The full version of this announcement is available.
The Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), jointly sponsored by ACM-SIGACT and the SIAM Activity Group on Discrete Mathematics, will be held January 28-30, 1996, in Atlanta, Georgia.
Subjects: Combinatorial Structures; Computational Biology; Computational Geometry; Databases and Information Retrieval; Discrete Optimization; Graphs and Networks; Machine Learning; Number Theory and Algebra; On-line Problems; Pattern Matching and Data Compression; Random Structures; Symbolic Computation.
The program committee especially encourages submissions which report on experimental and applied research. Special consideration will be given to work that is motivated by real-world problems. Experimental and applied papers are expected to show convincingly that the algorithms or data structures discussed are useful and efficient in a practical setting.
Papers will be selected for presentation based on extended abstracts. Authors wishing to submit a paper should send twelve copies of an extended abstract (not a full paper) to:
SIAM Conference Coordinator
3600 University City Science Center
Philadelphia, PA 19104-2688, U.S.A.
Abstracts must be received at the SIAM office by July 14, 1995 (or postmarked by July 12, 1995 and sent airmail). This is a firm deadline; submissions after the deadline will not be considered. Letters of acceptance/rejection will be sent by September 20, 1995.
More information is available .
Full information is available .
Executable temporal logics have been proposed in order to provide system developers with access to these, more powerful, logical techniques. Just as the development of sophisticated, and relatively efficient, theorem-proving techniques for first-order logic led to executable forms, such as Prolog, so the development of executable methods for temporal logics has often been based on temporal theorem-proving techniques. However, each particular executable temporal logic combines not only a logical perspective, but also an operational model, drawn from its intended application areas. Thus a wide range of languages have appeared, exhibiting a variety of characteristics and execution mechanisms. Consequently, such languages have a variety of application areas, such as temporal databases, temporal planning, animation of temporal specifications, hardware simulation, and distributed AI.
The Journal of Symbolic Computation is planning a special issue on Executable Temporal Logics, scheduled to appear in 1996. High quality original research papers are solicited on all aspects relating to the foundations, implementation techniques and applications of languages based upon temporal logic.
Topics: theoretical issues in executable temporal logics;design of executable temporal logics; relationship between execution and temporal theorem-proving; operational models and implementation techniques; programming support and environments; comparative studies of languages; relationship of executable temporal logics to (temporal) databases; applications and case studies.
Electronic submission is strongly encouraged (either as self-contained LaTeX, or postscript). Submissions, either electronic or a paper copy of the full paper, should arrive no later than October 15th 1995, Michael Fisher; Department of Computing; Manchester Metropolitan University; Manchester M1 5GD; United Kingdom; Tel: +44 161 247 1488; Fax: +44 161 247 1483; Email: M.Fisher@doc.mmu.ac.uk
The full version of this announcement is available.
The Xmas Workshop of the Formal Aspects Special Interest Group of the British Computer Society is a well-established event, which has traditionally served to the FACS community a varied and interesting diet of topics related to formal aspects of computing.
The aim of this workshop is to cover a wide range of current work in Semantics, including reviews, tutorials, amd reports of work in progress. The two principal foci are Semantics of Computation, and Semantics as Meaning. Understanding computation could be seen as the longest or largest endeavour in real-world semantics in computing, and this provides a strong connection between the two aspects of the programme.
Semantics and Logic of Computation is of course currently very active and fruitful, especially with the input from CLiCS and other European funded projects. Keynote presentations will convey to the FACS audience substantial aspects of current work, and this will be complemented by shorter presentations on more specialized areas and work in progress. We invite abstracts of presentations which are reviews, tutorials, or reports of work in progress, and hope to have all these kinds in the programme.
To complement this focus, we invite contributions from a wide range of semantic enterprises concerned in some way with meaning in real world or system development terms. Examples include work concerned with data, interaction, real-time, application domain concepts etc.
Abstracts should be submitted the organizer to arrive not later than end of July. Selected speakers will be informed early September.
Schedule: End July: Closing date for submitted abstracts; Early September: Invite selected abstractors to prepare paper for workshop. 20 November: Closing date for CRC for proceedings; 18/19 December: Workshop, at Imperial College.
Kevin Lano; Department of Computing; Imperial College of Science
Technology and Medicine; 180 Queen's Gate; London; SW7 2BZ; UK
Tel: 0171 594 8246; Fax: 0171 581 8024; Email: kcl@doc.ic.ac.uk
The full version of this announcement is available.
Many interesting problems studied in the area of constraint programming are NP-hard. The canonical example is the Boolean satisfiability problem (SAT), which provides an efficient encoding for all other NP-complete problems. Despite the fact that these problems are inherently intractable (unless P=NP), a large number of methods have been proposed in recent years to solve such problems in practice, such as Stochastic Search, Simulated Annealing, Genetic Algorithms, Tabu search, Heuristics, Local Propagation etc. In order to evaluate these methods, there has been much recent activity on identifying the hardest problem instances of the various problem classes. These hardest instances are often located in a phase transitions region in the problem space. Further insights into the hardest problem instances also come from the study of tractable sublasses of intractable problems, such as, Horn theories, acyclic CSPs, etc.
This workshop tries to explore new advances in these domains. So, the topics of interests include the folowing (non exhaustive list) : complete versus incomplete algorithms, probabalistics algorithms, heuristics, polynomial classes of instances, transition phase on random problems.
Authors are invited to submit papers not exceeding 18 pages, printed in 12pt, to the address below. Shorter papers (around 4 pages) are also acceptable. We encourage authors to submit by electronic mail, preferably in self-contained Postscript printable files. However, a printed reference copy should be sent anyway by express / courier mail. Each submission, by ordinary mail or by e-mail, should be accompanied by a separate message to jegou@gyptis.univ-mrs.fr with a single postal and e-mail address for communication, complete title, author(s), affiliation(s) and 200 word abstract.
Address:
Jihad Jaam; LIM - URA CNRS 1787; Faculte des Sciences de Luminy
163, avenue de Luminy, Case 901; F-13288 Marseille Cedex 9; France
Applications are invited for a one-year (renewable) Fellowship to work in one of the following areas:
Candidates should have a PhD in Computer Science, Discrete Mathematics, or equivalent, and will be required to carry out research of high quality. Previous research excellence and strong productivity in addition to good computing background is essential.
Applications in the form of a C.V. plus the names of 2-3 academic references should be sent no later than June 1, 1995 to:
Prof. Martin Charles Golumbic
Dept. of Mathematics and Computer Science
Bar-Ilan University
Ramat Gan, Israel
e-mail: golumbic@vm.biu.ac.il
Applications are invited from students with good undergraduate or MSc degrees in computer science or mathematics to study for a PhD degree. EPSRC research studentship is available for a suitably qualified candidate for the October 1995 entry. It covers tuition fees and maintenance for three years. The level of the maintenance grant is linked to the standard grant offered by EPSRC which for 1994/95 was set at 4910 pounds per annum.
The successful candidate is expected to work on a project closely related to computer-assisted reasoning, program specification and development, or application of logics and type theories.
Enquiries may be made to and application forms can be obtained from
Dr. Zhaohui Luo
Dept. of Computer Science
Durham University
South Road
Durham DH1 3LE
U.K.
Email: Zhaohui.Luo@durham.ac.uk
Fax: +44 (0)191 374 2560
Phone: +44 (0)191 374 3657
Applications are invited for both doctoral and postdoctoral research fellowships to the MEIJE research group of INRIA (FRANCE).
Our team has conducted active research for over a decade in concurrency theory, verification methodologies, and synchronous reactive formalisms. This led us to the development of the synchronous reactive language Esterel and the verification tools Auto/Graph, which both enjoy wide academic recognition while slowly emerging to industry.
Applicants are expected to combine a good theoretical background in concurrency and/or synchronous hardware modeling with a dedication to turn their ideas into realistic, up-to-date software applications.
The positions are to be funded by ongoing national or international programmes, ensuring large collaboration with various academic and industrial partners. While flexible, starting time will typically be around Oct. 1st 1995.
Applications and enquiries are to be addressed electronically with a comprehensive C.V. to one of:
Gerard Berry <berry@cma.cma.fr>or by surface mail to the following address:
Robert de Simone <rs@cma.cma.fr>
Projet Meije
I.N.R.I.A. Sophia-Antipolis
B.P. 93
F-06902 Sophia-Antipolis Cedex
France
There are several postdoctoral positions at BRICS for a period of one to two years starting this year, 1995. Applications by researchers are welcome in the areas of logic, semantics, algorithms and complexity theory. Applications for positions should preferably be sent by e-mail and include curriculum vitae and two or three names of referees for recommendations as well as the referees' regular mail addresses and, if possible, e-mail addresses, and an URL to your WWW home directory if available. The various parts of the application (application letter, CV, etc.) can be sent by e-mail as e.g. uuencoded PostScript, clear ASCII text or as an URL.
BRICS, a Centre for Basic Research in Computer Science, is funded by the Danish National Research Foundation for the period 1994-1999. Its aim is to establish in Denmark important areas of basic research in the mathematical foundations of Computer Science, notably Algorithmics and Mathematical Logic. The Centre is to develop these areas as a joint effort between the theoretical-computer-science groups at Aarhus University and Aalborg University. The research plan is based on a committment to develop Algorithmics and Logic integrated with strong activities in Semantics of Computations.
Further information on BRICS can be accessed through WWW and anonymous FTP. BRICS WWW entry .
Addresses:
Uffe Henrik Engberg
BRICS
Department of Computer Science
University of Aarhus
Ny Munkegade, building 540
DK - 8000 Aarhus C
Denmark
Telephone: +45 8942 3360
Telefax: +45 8942 3255
Internet: BRICS@brics.aau.dk, engberg@daimi.aau.dk
Le Centre de Recherche Europeen de Rank Xerox propose un poste en informatique, au sein de son equipe de traitement automatique du langage naturel.
Le travail se situera initialement dans le domaine des techniques a etats finis. Par la suite, d'autres aspects du traitement automatique du langage naturel pourront etre abordes: nos activites couvrent, entre autres, la recherche documentaire multilingue, la traduction et la generation, soit en recherche fondamentale, soit en conception de prototypes.
Les candidats doivent etre titulaires d'un doctorat en informatique ou posseder une experience de haut niveau en recherche.
Une solide connaissance des langages formels et des compilateurs, une parfaite maitrise de C et C++ sont indispensables. La connaissance de LISP ou PROLOG serait un atout. Il est essentiel pour ce poste de faire preuve de creativite, d'ouverture, d'interet pour les langues naturelles et d'avoir la capacite d'interagir avec des collegues chercheurs de cultures differentes. La maitrise de l'anglais est indispensable, la connaissance d'une autre langue souhaitable.
Il n'y a pas de date limite pour les candidatures, mais le poste devrait etre pourvu d'ici a septembre 1995.
Pour plus d'informations sur nos recherches, voir .
Les candidatures sont a envoyer a:
Annie Zaenen
RXRC
6 chemin de Maupertuis
F-38240 Meylan
France
fax: +33 76 61 50 99
e-mail: annie.zaenen@xerox.fr
The newly formed European Language Resources Association (ELRA) invites applications for the position of Chief Executive.
ELRA was established in 1995 to promote the development and exploitation of Language Resources (LR) for the European languages. Language Resources include all data necessary for language engineering, such as monolingual and multilingual lexica, text corpora, speech databases and terminologies.
The Association is seeking a Chief Executive to manage its activities
Responsibilities:
Qualifications:
For further information contact: Sarah Houston, Tel: +352 469161, Fax: +352 469161, Email:100126@1262@compuserve.com
Applicants should send a cover letter addressing the points listed above, together with a current Curriculum Vitae, to:
Brian Oakley, Chairman of the Steering CommitteeClosing date for applications: 7 June 1995.
120 Reigate Road, Ewell, Epsom, Surrey, KT17 3BX, UK
Tel: + 44 181 393 4096, Fax: + 44 181 393 0547
The Department of Electrical and Computer Engineering at the University of Waterloo seeks candidates for appointment to the Bell Canada/NSERC Industrial Research Chair in Telecommunication Software System Reliability Engineering. The two chairholders will be appointed as tenured or tenure-track faculty members in the Department of Electrical and Computer Engineering. They should have a doctoral degree in Computer Engineering, Electrical Engineering or Computer Science and a strong commitment to research and teaching.
The candidate for one of the two positions should be qualified at the level of full professor. He/she must have background and experience relevant to the research orientation and activities of the Chair including research record in software reliability engineering or closely related area of expertise in software reliability/quality, telecommunication industry experience or software systems development experience and good understanding of the assumptions underlying telecommunication software (or a willingness to work with the industrial sponsor to acquire these). Analytical capability in reliability modeling is viewed to be equally important to the background in the telecommunication industry.
The candidate for the other position should be qualified for a tenured academic position. He/she must have background and experience relevant to the research orientation and activities of the Chair including substantial industrial experience in development of telecommunication software and research record in the field of software reliability engineering.
Candidates should send their resumes to:
Professor B. R. Preiss, TSSRE Chair Search Committee
Department of Electrical and Computer Engineering
University of Waterloo, Waterloo, ON N2L 3G1, Canada
brpreiss@despot.uwaterloo.ca
In accordance with Canadian immigration requirements, this advertisement is primarily directed to Canadian citizens and permanent residents. However, other applicants will be considered.
The Department of Computer Science at Rice University announces an opening for a non-tenure track, full-time, 9-month Lecturer position.
This is a one-year position, starting with the 1995-6 academic year with the strong possibility of renewal for up to three years, depending on performance and availability of funds.
Duties consist of teaching a variety of courses in computer science including an introductory course using Scheme, as well as interacting with students outside the classroom.
Qualifications include a PhD in Computer Science or an MS in Computer Science and substantial teaching experience. Demonstrated commitment to teaching is essential. Candidates should be interested in the research programs already active at Rice. For information about the department see the WWW page .
Applicant should send a resume, and have at least 3 reference letters sent to:
Faculty Search, Department of Computer Sciencebefore June 15, 1995. If there are any questions, please contact
Rice University, P.O. Box 1892, Houston, Texas 77251-1892
Iva Jean Jorgensen, ivy@cs.rice.edu
Rice University is an Equal Opportunity/Affirmative Action employer.
The School of Computer Science, currently growing in three areas (Theory of Computation, Artificial Intelligence, and Software Engineering) offers a number of PhD studentships each year.
The Theory of Computation group, headed by recently appointed Professor Achim Jung, concentrates on the development of logics and semantics for programming languages. The overall aim is to provide intuitive conceptual tools for the everyday practice of programming. Within this framework, the activities range from abstract mathematics to issues of implementation and software development. Current research projects include probabilistic computation, temporal and modal logics, specification languages, logics for AI, process calculi, semantics for concurrency, algebraic data types and semantics of databases.
Current members of the Theory group are: Professor Achim Jung, Dr Marta Kwiatkowska, Dr David Murphy, Dr Mark Ryan, and Dr Michael Huth. An additional Lectureship and a Research Fellowship are currently being filled.
Applicants should possess a good honours degree (equivalent to an upper second class degree in a UK university) in Mathematics or Computer Science, or a closely related title. Applicants willing to undertake research related to building software systems are also welcome.
Informal enquiries should be directed to Marta Kwiatkowska (tel +44 121 414 7264; email M.Z.Kwiatkowska@cs.bham.ac.uk) or Mark Ryan (tel +44 121 414 7361; email M.D.Ryan@cs.bham.ac.uk).
Additional information about the School of Computer Science and the University of Birmingham is accessible via WWW .
This includes current research, courses, pictures of the campus, individual pages of members of staff, as well as application forms for research degrees.
Royal Holloway, as part of the University of London, exists to promote education and scholarship to the public benefit.
Applications are invited for the above post from candidates with an outstanding research record in Computer Science. Existing research specialities of the department include: Probabilistic Inference and Computational Learning, Formal Methods, and Information Security.
The expanding Department of Computer Science is part of the Science Faculty of one of the five science sites of London University, and was rated as 4A in the most recent Research Assessment Exercise. The location at Egham provides an attractive environment and opportunities for close industrial collaboration.
Applications are particularly welcome from candidates with research interests relating to one of the two following fields, in which the department wishes to expand its existing research activity.
Candidates with outstanding research experience in related disciplines, who are interested in expanding their research into one of the above areas, are encouraged to apply.
The appointment will be made on Lecturer A or B scales 16,890 to 27,869 pounds a year inclusive. Informal enquiries may be made to the Head of Department (Tel. 01784 443421, email HoD@dcs.rhbnc.ac.uk).
Applications should be submitted to the Personnel Office, Royal Holloway, University of London, Egham, Surrey TW20 0EX, from whom further particulars and an application form should be obtained. Tel. 01784 443030, Fax 01784 473527.
The closing date for receipt of applications is 9th June 1995.
The full version of this announcement is available.
Featuring contributions from more than 60 of the world's top experts in the field, this state-of-the-art handbook offers engineers and scientists the most comprehensive treatment available of the theory and applications of parallel and distributed computing.
Readers will find 41 well-organized chapters covering the full range of key issues relating to system design and operation, including models and algorithms, architectures and technologies, development tools, and current and future uses of this exciting technology in science and industry. Please see the full version of this announcement for further details.
I am pleased to announce the availability of the subject paper.
The main results are:
These imply that the category of dI-domains is the largest cartesian closed category within Scott domains, with the exponential being the stable function space.
The postscript file can be obtained by anonymous ftp .
Guo-Qiang Zhang
Department of Computer science
University of Georgia
Athens, Georgia 30602
U.S.A.
The full version of this announcement is available.
The following concurrency related CWI reports are now available via the web page .
They are also available via anonymous ftp in the ftp directory .
Short abstracts of these reports can be found in the full version of this announcement.
N.A. Lynch and F.W. VaandragerAction Transducers and Timed Automata
Technical report CS-R9460, CWI Amsterdam, 1994.
C. Bonini, W.J. Fokkink and A. LeschA reference model for teleconferencing systems
Technical report CS-R9502, CWI Amsterdam, 1995.
J.J.M.M. RuttenA Calculus of Transition Systems (towards universal coalgebra)
Technical report CS-R9503, CWI Amsterdam, 1995.
F.W. VaandragerVerification of a distributed summation algorithm
Technical report CS-R9505, CWI Amsterdam, 1995.
J.J.M.M. RuttenElements of Generalized Ultrametric Domain Theory
Technical report CS-R9507, CWI Amsterdam, 1995.
Table of contents:
Editor-in-Chief:
Martin Charles Golumbic
Department of Mathematics and Computer Science
Bar Ilan University, Ramat Gan, Israel
E-mail: golumbic@vm.biu.ac.il or golumbic@haifasc3.vnet.ibm.com
Fax: +972 3 535 3325
Associate Editor:
A. Nerode
Mathematical Sciences Research Institute
Cornell University, Ithaca, NY 14853, USA
Submissions of articles and proposals for special issues are to be addressed to the Editor-in-Chief.
Requests for free specimen copies and orders for Annals of Mathematics and Artificial Intelligence are to be sent to:
E-mail: publish@baltzer.nl
This note is the announcement of an addendum for the December 1994 technical report "New Notions of Reduction and Non-Semantic Proofs of Beta Strong Normalization in Typed Lambda Calculi" by myself and A. J. Kfoury.
The contents of this addendum represent changes some of which have already been incorporated into the LICS '95 conference version of the paper, based on comments we have received. If you have read the technical report, you may want to read the addendum since it contains only changes from the original report. The addendum clarifies some statements, adds information on some related research, includes a comparison with research by de Groote, and fixes two minor mistakes in a proof.
The addendum is Boston University Computer Science Dept. Technical Report number 95-007 and it is available via anonymous ftp (115K).
Joe Wells <jbw@cs.bu.edu>
Member of the League for Programming Freedom---send email for details
Paper submitted for publication. Comments are welcome. Available as a preprint RIMS-1013, RIMS, Kyoto Univ., 1995, by anonymous ftp .
Abstract:
Motivation of this work is to provide a type theoretical basis for developing a practical polymorphic programming language with labeled records and labeled variants. Our goal in this paper is to establish both a polymorphic type discipline and an efficient compilation method for a calculus with those labeled data structures. We define a second-order polymorphic record calculus as an extension of Girard-Reynolds polymorphic lambda calculus. We then develop an ML style type inference algorithm for a predicative subset of the second-order record calculus, which extends Milner's type inference algorithm and Damas and Milner's account of ML's let polymorphism. The soundness of the type system and the completeness of the type inference algorithm are shown. To establish an efficient compilation method for the polymorphic record calculus, we first define an implementation calculus, where records are represented as vectors whose elements are accessed by direct indexing, and variants are represented as values tagged with a natural number indicating the position of the code in a switch statement. We then develop an algorithm to translate the polymorphic record calculus into the implementation calculus using type information obtained by the type inference algorithm. The correctness of the compilation algorithm is proved, that is, the compilation algorithm is shown to preserve both typing and the operational behavior of a program. Based on these results, Standard ML has been extended with labeled records and its compiler has been implemented.
(A preliminary summary of some of the results of the paper appeared in A. Ohori, A compilation method for ML-style polymorphic record calculi, POPL'92)
Atsushi Ohori, Research Inst. for Mathematical Sciences, Kyoto Univ.
Sakyo-ku, Kyoto 606-01, Japan. Email: ohori@kurims.kyoto-u.ac.jp
Lincoln, Scedrov and Shankar have shown second order intuitionistic multiplicative linear logic to be undecidable, by an embedding of LJ2 into it using 2nd order formulae to recover the lost structural rules of weakening and contraction. In the paper available by anonymous ftp . it is shown how in a similar way on can obtain an embedding into the non-commutative version, so-called polymorphic lambek calculus, and thereby show undecidability of this calculus.
The full version of this contribution is available.
In referring to linear logic fragments let N stand for noncommutative versions (with "\" and "/" being left and right implications, respectively, and "*" being non-commutative product),
M for multiplicatives,
A for additives,
E for exponentials,
2 for second order quantifiers, and
I for ïntuitionistic" version of linear logic fragments.
Lincoln, Scedrov, and Shankar showed the undecidability of IMLL2 and IMALL2 by embedding of LJ2 (announced in the Types forum, to appear in LICS'95).
Lafont has proved the undecidability of MALL2 (announced in the Types forum, to appear in the Journal of Symbolic Logic).
Recently, Lafont & Scedrov proved that MLL2 is undecidable (announced in the Types forum).
As for non-commutative linear logic,
Here (see full version of the contribution) we prove that classical N-MLL2 is also undecidable.
The full version of this announcement is available.
The theory of traces employs techniques and tackles problems from quite diverse areas which include formal language theory, combinatorics, graph theory, algebra, logic, and the theory of concurrent systems. In all these areas the theory of traces has led to interesting problems and significant results. It had especially big impact in formal language theory and the theory of concurrent systems. In both these disciplines it is a well-recognized and dynamic research area. Within formal language theory it yields the theory of partially commutative monoids, and provides an important connection between languages and graphs. Within the theory of concurrent systems it provides an important formal framework for the analysis and synthesis of concurrent systems. This monograph covers all important research lines of the theory of traces -- each chapter is devoted to one research line and is written by leading experts. It is organized in such a way that each chapter can be read independently -- and hence is very suitable for advanced courses/seminars on formal language theory and the theory of concurrent systems. The monograph includes an extensive bibliography. At present, there is no other book of this type on trace theory.
The book is a result of a joint work between the ESPRIT BRA working groups ASMICS 2 and CALIBAN. The Table of Contents is listed in the full version of this announcement.
The following reports of the Research group Theoretical Computer Science at the Vrije Universiteit Amsterdam (VUA) are now available via the web page . Or by ftp in directory .
The full version of this information is available.
The book is on data structures and algorithms specialized in the domain of text processing. It takes a distinctive approach to other more general books as it goes deeply into a more specific domain. It contains both classical algorithms and recent results of research on the subject. The basic aim of the book is to provide the first text containing the collection of a wide range of text algorithms.
The Contents are listed in the full version of this announcement.
Oxford University Press, 1995, ISBN 0-19-508591-4
This book is now available. The price is believed to be $55.00 US.
A WWW page has been set up.
There you may take a look at the:
You can examine the same excerpt by ftp from the directory.
The full version of this announcement is available.
The latest issue of the Bulletin of the Interest Group in Pure and Applied Logics (IGPL), i.e. Volume 3, Number 1, March 1995, is now available electronically by FTP .
You may obtain the whole issue (over 500K) or individual articles separately. See the full version of this announcement for details.
With many thanks to all those who contributed to this issue.
Table of Contents
Editorial
Original Articles:
On the Logic of Information Flow, J. Barwise, D. Gabbay, C. Hartonas
Situated Modeling of Epistemic Puzzles, M. Ersan and V. Akman
Completely Representable Relation Algebras, R. Hirsch
Undecidability of the Equational Theory of Some Classes of Residuated Boolean Algebras with Operators, I. Nemeti, I. Sain, A. Simon
The Essential Inadequacy of Deduction in Logic Programming, H. C. Wasserman, K. Yukawa, Z. Shen
Some Completeness Results for Propositional Conditional Logics, K. Schlechta
Reviews
`Logic: Mathematics, Language, Computer Science and Philosophy' (Vol. I) reviewed by A. Avron
Conferences
Workshop on Logic, Language, Information and Computation (WoLLIC '94)
Acknowledgements
Books Received
Forthcoming Papers
This paper is available on the author's ftp-guest account at Imperial College under smc.dvi.Z
In it it is shown that Linear Domains and Linear Maps [MFPS'93] are the greatest symmetric monoidal closed category of Scott-Domains such that linear implication is modeled by the space of all linear maps in the extensional order.
I would like to announce the availability of the following papers via anonymous ftp from science.csc.ncsu.edu. The files may be found in subdirectory pub/papers/ after gaining ftp access to this machine.
1 . Title : Divergence and Fair Testing Bib : To appear in Proceedings of ICALP '95
Abstract
This paper develops a new testing-based semantic theory of processes that aims to circumvent difficulties that traditional testing/failures theories have in dealing with divergent behavior. Our framework incorporates a notion of fairness into the determination of when a process passes a test; we contrast this definition with existing approaches and give characterizations of the induced semantic preorders. An example highlights the utility of our results.
2 . Title : Efficient On-the-Fly Model Checking for CTL* Bib : To appear in Proceedings of LICS '95
Abstract
This paper gives an on-the-fly algorithm for determining whether a finite-state system satisfies a formula in the temporal logic CTL*. The time complexity of our algorithm matches that of the best existing ``global algorithm'' for model checking in this logic, and it performs as well as the best known global algorithms for the sublogics CTL and LTL. In contrast with these approaches, however, our routine constructs the state space of the system under consideration in a need-driven fashion, and will therefore perform better in practice.
Update of information in [AL0202T4] .
A new update of Isabelle, Isabelle94-3, is now available on the Cambridge ftp site . in the file /ml/Isabelle94-3.tar.gz. It is also at the Munich site.
Here is a summary of the changes from Isabelle94-2.
This still performs depth-first search, and so differs from using setsolver to make the simlifier call the classical reasoner.
In CHOL, pattern matching on tuples is now available in all abstractions. It translates to proper split. A new theory of integers is available.
Thanks to everyone who provided theories or examples. Their names are acknowledged on the individual files.
Larry Paulson
The Meije Verification Toolset is connected to the Lotosphere environment and can be used for Lotos programs. It contains tools for:
Further information may be obtained on the WWW . The Minilite Lotosphere environment for Lotos is also distributed.
One possible very concise definition of Grothendiek topos is as an elementary topos E such that:
One knows that a lex category B satisfies 1. and 2. iff the global sections functor Gamma:B -> Set has a lex left adjoint Delta.
For an elementary topos E satisfying 1. and 2. the condition 3. is equivalent to the existence of an S in E such that any X of E is a Subquotient of Delta(I) x S for some I in Set.
Now the question is:
What is the status of Locally Small CoComplete Elementary Toposes?Are there natural examples?
Locally small cocomplete elementary toposes are sufficient for interpreting set theory. Can they - maybe - be characterised via this property? Do there exist models of set theory giving rise to cocomplete topoi which don't have a small set of generators?
The background of my question is that elementary toposes as such don't provide models of IZF (how should one simulate the Goedel-Bernays-Neumann hierarchy?). It would be nice if cocomplete topoi were the precise analogon of IZF!
Grateful for any hints,
Thomas Streicher
Last summer we posted a message requesting material and suggestions for a planned graduate course on Algorithms for Molecular Biology. We received many replies; most of them were requests for our material, when we had it.
We taught the course in the department of Computer Science at Tel Aviv University last Fall semester. A summary of the course notes can be accessed via the web .
In that webpage we plan to provide additional information and pointers in the future, when we learn about new sources, class notes bibliographies etc.
Please send all questions, additional information and feedback to shamir@math.tau.ac.il or dnaor@math.tau.ac.il .
Ron Shamir and Dalit Naor.
The DiPrima Prize
SIAM will present the award at the SIAM annual general meeting in July 1996. The award honors the memory of Richard C. DiPrima, long time chair of the Department of Mathematical Sciences at Rensselaer Polytechnic and past-president and energetic supporter of SIAM. The award, to be given to a young scientist, will be based on an outstanding doctoral dissertation in applied mathematics.
Nominations
Nominations, along with a copy of the dissertation (in English) should be sent by 31 December 1995 to:
Richard C. DiPrima Prize
c/o Donna Blackmore
Society for Industrial and Applied Mathematics
Philadelphia, PA 19104-2688
Eligibility
The award based on Ph.D. research in applied mathematics (defined as those topics covered by SIAM journals or series) is made to a young scientist. The Ph.D. thesis and all other Ph.D. requirements should have been completed in the period July 1, 1993 to June 30, 1995. The Ph.D. degree must be awarded by December 31, 1995.
Description of the Award
The award will consist of a certificate and a cash prize of $1000, which will be awarded when the paper based on the Ph.D. is accepted for publication by the editors of a SIAM journal or series. The president will notify the recipient of the award in advance of the award date and invite the recipient to attend the annual general meeting to receive the award.
I would like to bring to your attention a new bibliography on linear logic. This bibliography stems from a seminar on linear logic and applications held this semester at Carnegie Mellon University and supervised by Frank Pfenning, Carsten Schuermann and myself.
We believe it is a valuable contribution since
We plan to maintain this bibliography and enhance its interface in the future. It is available on WWW as well as from the linear logic WWW page maintained by Pat Lincoln.
We are aware of the incompleteness of this bibliography. We suspect that it currently contains numerous imprecisions and even errors. Therefore, we would appreciate very much any corrections, suggestions, comments, additional references, etc. Feel free to contact me.
Sincerely yours,
Iliano Cervesato
email: iliano@cs.cmu.edu
This is to announce some WWW-pages initiated by the Dagstuhl-Seminar
Computer Aided Design and Test (13.-17.02.1995)which was organized by
Bernd Becker, Randy Bryant, Oliver Coudert and Christoph Meinel
This time the workshop focussed on Binary Decision Diagrams (BDDs) and related data structures in practical applications as well as in theoretical research.
Up to now the WWW pages include:
We appreciate (links to) additional material which is relevant to this area.
ISSN 0945-9103
The Bulletin is published several times per year by the Max Planck Institut für Informatik, Saarbrücken, and Imperial College, London.
The Bulletin is an attempt to solve a problem in the logic (in particular, IGPL) community:
Papers in the final form should be in LaTeX. The review process is quick, and is usually made by other IGPL members.
The Bulletin is available as an electronic journal as well as a hard copy journal.
For more information see the Bulletin's WWW page .
Interested in Communication and Topics of Mathematics in Industry and Commerce?
IM-Net is an electronic newsletter for mathematics in science and industry. In it you will find:
To place a message in the IM-Net newsletter, e-mail it to
im-net-digest@iwr.uni-heidelberg.de
To receive the IM-Net newsletter send e-mail to
im-net-request@iwr.uni-heidelberg.dePlease write "subscribe" in the body of the mail.
<location> := http://www.cs.utwente.nl/data/amast/
<location> := ftp://ftp.cs.utwente.nl/pub/doc/amast/
Date: 19/06/1995
Contents: Index.html, README, amast95/, info/, links/, sigala/,
pstv95/, amast93/, amast91/
full/
[M1] Terry Czernienko <terry@cs.concordia.ca>
[M2] Didier Begay <begay@labri.u-bordeaux.fr>
[M3] Magne Haveraen <Magne.Haveraaen@ii.uib.no>
[M4] Pierre Wolper <pw@montefiore.ulg.ac.be>
[M5] Frank Dehne <dehne@scs.carleton.ca>
[M6] Richard Gerber <rich@cs.umd.edu>
[M7] CT'95 Organizing <Comm. ct95@cs.dal.ca>
[M8] Philip Wadler <wadler@dcs.gla.ac.uk>
[M9] Steve Mahaney <mahaney@dimacs.rutgers.edu>
[MA] Susan Dowrie <dowrie@cs.uq.oz.au>
[MB] Ewa Gasiorowska-Wirpszo <gasior@IPIPAN.Waw.PL>
[MC] S. Ravindran <s.ravindran@swansea.ac.uk>
[MD] Scott Smolka <sas@CS.SunySB.EDU>
[ME] Amy Felty <felty@research.att.com>
[MF] Jorma A. Tarhio <Jorma.Tarhio@cs.Helsinki.FI>
[MG] Lawrence C Paulson <Larry.Paulson@cl.cam.ac.uk>
[MH] Marcel Hunting <M.M.G.Hunting@math.utwente.nl>
[MI] Ian Parberry <ian@hercule.csci.unt.edu>
[MJ] Vassos Hadzilacos <vassos@db.toronto.edu>
[MK] Lefteris M. Kirousis <kirousis@cti.gr>
[ML] Andrew Pitts <Andrew.Pitts@cl.cam.ac.uk>
[MM] Andrew Pitts (see [ML])
[MN] X-SLALM Organizing Committee <xslalm@uniandes.edu.co>
[MO] Ugo Montanari <ugo@di.unipi.it>
[MP] Ugo Montanari (see [MO])
[C1] Jacek Bblazewic <blazewic@pozn1v.tup.edu.pl>
[C2] Maurice Margenstern <Maurice.Margenstern@capella.ibp.fr>
[C3] Joel Wein <wein@mem.poly.edu>
[C4] Tom Henzinger <tah@CS.Cornell.EDU>
[C5] Sriram Sankar <sankar@anchor.Eng.Sun.COM>
[C6] Marie-Claude Gaudel <Marie-Claude.Gaudel@lri.fr>
[C7] Eva Tardos <eva@CS.Cornell.EDU>
[C8] Mehmet Orgun <mehmet@macadam.mpce.mq.edu.au>
[C9] Roger Stone <R.G.Stone@lut.ac.uk>
[CA] Jihad <gil@lim.univ-mrs.fr>
[J1] Martin Golumbic <golumbic@vm.biu.ac.il>
[J2] Zhaohui Luo <Zhaohui.Luo@durham.ac.uk>
[J3] Robert de Simone <rs@dance.cma.fr>
[J4] Uffe Engberg <engberg@daimi.aau.dk>
[J5] Jean Pierre Chanod <Jean.Pierre.Chanod@xerox.fr>
[J6] Colin Brace <colinb@ibm.net>
[J7] Stefan Leue <sleue@swen.uwaterloo.ca>
[J8] Moshe Vardi <vardi@cs.rice.edu>
[J9] Marta Z Kwiatkowska <M.Z.Kwiatkowska@cs.bham.ac.uk>
[JA] Steve Schneider <steve@dcs.rhbnc.ac.uk>
[L1] Luigi Logrippo <luigi@csi.uottawa.ca>
[L2] Guo-Qiang Zhang <gqz@pollux.cs.uga.edu>
[L3] Frits Vaandrager <Frits.Vaandrager@cwi.nl>
[L4] Baltzer Science Pu. <publish@baltzer.nl>
[L5] Joe Wells <jbw@cs.bu.edu>
[L6] Atsushi Ohori <ohori@kurims.kyoto-u.ac.jp>
[L7] Martin Emms <emms@cis.uni-muenchen.de>
[L8] Max Kanovitch <maxk@ito.ecei.tohoku.ac.jp>
[L9] Holger Petersen <Petersen@informatik.uni-stuttgart.de>
[LA] Marcello M. Bonsangue <marcello@cs.vu.nl>
[LB] Ian Parberry (see [MI])
[LC] Jim Hoover <hoover@cs.ualberta.ca>
[LD] Ruy de Queiroz <ruy@di.ufpe.br>
[LE] Michael Huth <huth@mathematik.th-darmstadt.de>
[LF] Rance Cleaveland <rance@science.csc.ncsu.edu>
[T1] Lawrence C Paulson (see [MG])
[T2] Eric Madelaine <Eric.Madelaine@sophia.inria.fr>
[P1] Thomas Streicher <streicher@mathematik.th-darmstadt.de>
[S1] Ron Shamir <shamir@math.tau.ac.il>
[S1] Dalit Naor <dnaor@math.tau.ac.il>
[S2] Zvi Galil <galil@cs.columbia.edu>
[S3] Iliano Cervesato <iliano@cs.cmu.edu>
[S4] Christoph Meinel <meinel@penthesilea.uni-trier.de>
[S5] Ruy de Queiroz (see [LD])
[S6] H.G. Bock <im-net-request@iwr.uni-heidelberg.de>
This issue of AMAST Links is available in four forms:
(+) within the AMAST directory of the Twente WWW server, at URLwhere `<pp>' is either `-ToC' (for the ToC-page),or the 2-character page identifier (for one-page files), or empty (whole-issue file).
http://www.cs.utwente.nl/data/amast/links/v02/i05/AL0205<pp>.txt
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 .