Comments are welcome!
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
date : 26 September 1994
e-mail to: amast@cs.utwente.nl
___________________________________
e-mailed to : 295 subscribers
Update of [SIAN04p1-7] : Program and Registration Information available
Important Deadlines:
Sept 20: reservations at Nassau Inn (likely to become full afterwards)
Sept 23: submissions for poster gallery
Sept 26: reservations at Hyatt (likely to become full afterwards)
Sept 26: reservations at Palmer Inn (likely to become full afterwards)
Sept 28: early registration
Organizers:
Final Program and Registration Information available
Static Analysis is increasingly recognized as a fundamental tool for high performance implementations and verification systems of high-level programming languages. The last two decades have witnessed substantial developments in this area, ranging from the theoretical frameworks to the design and implementation of analysers and their applications in optimizing compilers.
The First International Static Analysis Symposium is held in Namur, Belgium, from 28-30 September 1994. It follows the three previous international workshops JTASPEFL and WSA'92, which were held in Bordeaux (France), and WSA'93 which took place in Padova (Italy).
The aim of SAS'94 is to promote contacts and information exchange among scientists who share common interests in static analysis for different programming paradigms.
Researchers from the fields of concurrent, constraint, functional, imperative, logic and object-oriented programming constitute the audience of SAS.
Namur is a pleasant provincial town, 35 miles south of Brussels in Belgium, located in a scenic environment. Brussels and Paris are easily reached by train.
SAS'94 is hosted by:
Institut d'Informatique
Facultes Universitaires Notre-Dame de la Paix de Namur
Rue Grandgagnage, 21
B-5000 Namur
SAS'94 is sponsored by:
The behaviour of deterministic data flow networks of message communicating processes can be described by means of a set of recursive equations. Each equation gives the functional relation between the input and the output stream of a network component. Kahn (1974) showed that the fixed point solution based on such a set of equations represents the network behaviour.
This method of Kahn, however, cannot be applied directly in case of networks with non-deterministic components. The behaviour of such components cannot directly be described by one function, but it can be described by a set of (stream processing) functions.
In this presentation we show we can define a basic set of stream processing functions, and two basic operators on them with which we can build specifications. The operators are directly inspired by process algebraic operators. This approach therefore also shows a way to embed process algebra in a functional framework.
By choosing appropriate operators on sets of stream processing functions a notion of testing equivalence can be defined in a functional framework (based on streams) similar to testing equivalence in process algebra.
For further information about the seminar, please contact any member
of the board of FoReST. This board consists of the following people:
Wiebe van der Hoek Comp Sc, Utrecht wiebe@cs.ruu.nl Wim Koole Comp Sc, Nijmegen wimk@cs.kun.nl John-Jules Meyer Comp Sc, Utrecht jj@cs.ruu.nl Yao-Hua Tan AI, Rotterdam ytan@euridis.fbk.eur.nl Jan Treur AI, VU Amsterdam treur@cs.vu.nl Cees Witteveen Comp Sc, Delft witt@cs.tudelft.nl
The next MoP (Mathematics of Programming) meeting will be held on Wednesday September 28, 13.45h at Eindhoven University, Auditorium room 7.
The speakers at this meeting will be
Title: Refinement-oriented probability for CSP
Presented by: Carroll Morgan (Oxford University)
A non-operational approach to probabilistic computation is offered by the general technique of Jones and Plotkin [1,2], in which it is shown how a `probabilistic powerdomain' can be formed over any complete partial order.
The technique has been used to produce a semantics for probabilistic CSP, using its ``failures/divergences'' semantics [3] (a CPO) as a basis for the Jones/Plotkin construction.
The results are extensive, interesting, surprising and in some cases puzzling, treating probability, concurrency and nondeterminism together [4]. Lessons learnt from the CSP exercise could well be re-applied elsewhere, to (imperative) weakest-precondition-based CPOs for example.
In this talk I will give a (brief) introduction to the Jones/Plotkin method, and show (less briefly) how it may be used in the special case of CSP. Deep knowledge of CSP is not required (but shallow knowledge may well help).
For further information on this series of meetings please contact Paul Hoogendijk (paulh@win.tue.nl).
in Honor of the 60th Birthdays of Eli Goodman and Ricky Pollack
Room 109, Warren Weaver Hall
251 Mercer St., New York, NY 10012
For more information contact: János Pach (212)998-3184 pach@cims6.nyu.edu
ILPS'94 Conference Program and Registration Information available.
The International Logic Programming Symposium, ILPS'94, will take place in Ithaca, NY on November 14-17, 1994. The symposium, one of two major conferences sponsored annually by Association for Logic Programming, will be accompanied by a series of workshops, in effect miniconferences, to be held on November 17-18.
Ithaca, NY is a small city, the home of Cornell University, a leading research center in many branches of science, engineering, and the arts.
It is especially appropriate that ILPS'94 meets in Ithaca, since Cornell University has a long tradition in both its Computer Science and its Mathematics Departments of studies in logic and its manifold applications to computer science. The local host is the Cornell Mathematical Sciences Institute, an Army Research Office Center of Excellence, which itself has a strong research program in the mathematics and logic of computer science. The Computer Science Department and the Mathematical Sciences Institutes are cosponsors of ILPS'94. Additional support comes from ORA corporation of Ithaca, whose business is development and application of logical methods to software engineering.
The scientific program of the symposium was selected by an International Program Committee chaired by Maurice Bruynooghe. The proceedings will be published in the MIT Press Logic Programming series. A new feature of this year's Symposium will be a PROLOG competition, to be held on the first day of the Symposium. Logic Programming conferences have always blended practitioners and theoreticians. We hope that this competition will strengthen this blending. The Cornell Campus is famous for the beauty of its campus and its gorges, with many beautiful walks for a dark November day. It is also the home of the Johnson Museum of Art. There will be a classical concert Tuesday, and classical musical accompaniment at the conference banquet.
The Symposium is another milestone in the evolution of Logic Programming, a unique blend of logic and computer science. A mature science can only be built on the solid foundations provided by the research contributions encouraged by conferences such as this.
RTSS'94 Advance Program and Registration Information available.
The purpose of RTSS is to provide an annual forum for exchanging emerging principles and practices underlying real-time computing. As in recent years, this year also we continue to witness the increasing interest in the area because of the better appreciation for the need for formal and scientific solutions for the highly interrelated problems involved in developing systems that have demanding correctness, dependability and timeliness characteristics. Many of the ideas that were formulated in academia in the recent past are being deployed in mainstream applications. This has given a major impetus to the field in which we are seeing a substantial number of new researchers tackling the many challenging problems that remain. All of these, on a worldwide scale, have led to RTSS attracting a large international contingent, in the program committee, in terms of the submissions, as well as in the acceptance of papers. We hope to see this trend reflected in the attendance as well.
The technical program reflects recent developments in architecture, communication, databases, operating systems, performance, programming languages scheduling, and formal approaches for real-time applications. It also reflects an increased emphasis on system and tool implementation, evidencing a maturation of the underlying principles. To encourage the dissemination of findings in experimental development work, we have continued the synopses sessions from the previous three years.
The conference will be preceded by the Workshop on Composability of Fault-Resilient Real-Time Systems, to be held December 6, 1995. Topics for discussion include the basic issue of design for composability and lessons learned in developing complex computing systems. Advanced registration is encouraged, as attendance is limited to 50 active practitioners and researchers in the field. Contact Michelle Hugue (meesh@cs.umd.edu) for details.
We hope that you will join us in what promises to be a stimulating and important symposium.
More information is available.
Programming languages have been state-based since their inception. After a period of relative unpopularity, when research focused on declarative languages, interest in the treatment of state has been renewed. Research is increasingly devoted to finding a symbiotic relationship between the semantic foundations of declarative languages and the pragmatic handling of state in more conventional languages. This workshop brings together researchers from various areas, interested in the common issues of state manipulation in high-level programming languages.
The first workshop in this series (SIPL'93) was held in Copenhagen in conjunction with FPCA'93. The proceedings are available as a Yale technical report YALEU/DCS/RR-968. A special issue of the Journal of Lisp and Symbolic Computation is being published as a follow-up to SIPL'93. Submissions are invited for the second workshop to be held in conjunction with POPL'95 in San Francisco. The workshop addresses the fundamental issues of expressing, manipulating, and reasoning about state in high-level programming languages.
Topics include: operational and denotational models of state, assignment and references, semantics of object-oriented programming, calculi of state, methods to reason about state. Novel methods for expressing and controlling state-manipulation such as linear type systems, effect systems, and monads are also of interest. Formal presentations of results, research in progress, tutorials, and topical discussions are among the possible venues for interaction.
Program Committee:
S Brookes, K Bruce, J Launchbury, I Mason, P O'Hearn,
A Pitts, U Reddy (Chair), M Tofte.
POPL General Chair: R Cytron
Submission: original research not submitted or published elsewhere. 8 copies of a detailed summary not to exceed 5000 words (approx 10 pages) to the program chair. Cover page should include return postal and (possibly) e-mail address. Please follow the guidelines for writing summaries for the POPL conference (or here ).
Dates: Subm Sep 30, 1994. Notif Nov 15, 1994. Final Dec 22, 1995.
Accepted papers will appear in a technical report at the workshop.
Send correspondence to:
Prof Uday Reddy, SIPL'95, Dep't of Computer Science, University of Illinois
1304 W. Springfield Avenue, Urbana, IL 61801, USA. E-mail: sipl@cs.uiuc.edu
Full, plain-text version of the Last Call for Papers available.
Email paper submissions due: Oct. 1, 1994 (simsymp28@ani.univie.ac.at)
In cooperation with: Society for Computer Simulation (SCS), IEEE CS, ACM
The Annual Simulation Symposium is a forum for the interchange of ideas, techniques, and applications among practitioners of simulation in industry, government, and academia. This international Symposium is the oldest continuously operating conference/symposium dedicated to simulation. The paper sessions are designed to generate a discussion of concepts, methodology, and results between authors and the audience. The structure of the Symposium also provides for a degree of collegiality and continuity in the discussions on various topics presented during the week.
Topics:
Submission:
The 28th Annual Simulation Symposium highly encourages submissions
by electronic mail to simsymp28@ani.univie.ac.at. Submitted files must be
either in dvi or PostScript format with all figures and tables included, as eg.
created on Unix by:
cat paper.ps | compress | uuencode paper.ps.Z > paper.uue
Accepted papers appear in the Symposium's Proceedings to be published by the IEEE Computer Society. Authors of top papers are also encouraged to submit a follow-on paper to the International Journal in Computer Simulation.
Awards: The Ira M. Kay Prize of US$ 500 is awarded to best paper presented.
This information and more is also available on the WWW either here or via the CLIN Home Page .
We are happy to announce the fifth CLIN meeting, which will be hosted by the Parlevink Linguistic Engineering Group of the University of Twente, Enschede.
At CLIN meetings, computational linguistics researchers in the Netherlands gather and present their (possibly ongoing) research. Every year a well-known speaker is invited.
The program committee for the fifth CLIN meeting consists at least of: W. Daelemans (ITK KUB), G. van Noord (AI RUG), A. Nijholt (CS UT), J. van Eijck (CWI), T. Andernach (CS UT).
The local organisers of this year's meeting are A. Nijholt and T. Andernach.
Researchers are invited to present papers on all aspects of computational linguistics (morphology, syntax, semantics, pragmatics, computational lexicography, formal languages, grammar formalisms, natural language processing, generation, machine translation, knowledge representation, etc.). The default language of the meeting is English rather than Dutch.
Authors should submit an abstract to the local organisers. The abstract should contain (i) a title (ii) your name, address and affiliation (preferably also an e-mail address), (iii) your phone number and (iv) a short (10 - 20 lines) abstract.
There are three ways to send your abstract. In preference order:
Universiteit Twente, Secretariaat INF/SETI, P.O. Box 217,
7500 AE Enschede; tel: +31 53 893740, fax: +31 53 315283
Submissions by WWW or e-mail are strongly encouraged. Submission deadline is October 21, 1994. Notification of acceptance: November 1, 1994. If you include an e-mail address, you will be notified by e-mail.
A volume with proceedings of the CLIN'93 meeting should be available at this year's meeting. It is our intention that a volume of proceedings of CLIN'94 will be produced in due time.
The full, plain-text version of the Call for Papers is available.
The PAP conferences are the world's showcase for Prolog systems and applications. Outstanding examples of fielded industrial applications from all over the world formed the core of the two previous conferences.
The main focus of PAP'95 will be on Prolog applications that have shown clear benefits for industry, commerce or education.
The programme will include paper presentations, invited talks, plenary and panel sessions, tutorials and workshops.
PAP'95 will show that Prolog is a highly effective tool for the development and delivery of industrial strength applications. Sponsored by the Prolog Management Group, Compulog-Net, and the Association for Logic Programming, the PAP'95 conference and exhibition will provide a forum for technical exchange between all members of the world-wide logic programming community: academics, industrialists and Prolog systems vendors.
Papers are solicited describing fielded applications written in Prolog or other logic programming languages.
Pressure of time and competing priorities mean that details of industrial applications are often never written up as formal papers. In recognition of this, it will be possible to submit a brief report on a fielded application or activity.
The exhibition provides an opportunity for software developers to demonstrate Prolog applications.
Dates: Subm Nov 11 1994. Notif 31 Dec 1994. Final due 27 Jan 1995.
For more information about the conference please contact:
etc. contact:
contact address information
LaTeX version of the ICALP'95 (full) Call for Papers available.
The 22nd annual meeting of the European Association for Theoretical Computer Science will take place in Szeged. Papers presenting original contributions in any area of theoretical computer science are being sought.
Topics computability, automata, formal languages, term rewriting, analysis of algorithms, computational geometry, computational complexity, symbolic and algebraic computation, cryptography, data types and data structures, theory of data and knowledge bases, semantics of programming languages, program specification, transformation and verification, foundations of logic programming, theory of logical design and layout, parallel and distributed computation, theory of concurrency, theory of robotics.
Submission Seven copies of extended abstract not exceeding twelve pages to: Ferenc Gécseg, Attila József University, Department of Computer Science, Aradi vértanúk tere 1, H-6720 Szeged, Hungary Simultaneous submissions of to any other conference with published proceedings are not allowed. Authors from countries where access to copying machines is difficult may submit a single copy of the abstract.
Dates Subm. Nov 15, 1994. Notif. Feb 16, 1995. Final due Apr 1, 1995.
Program Committee S Abiteboul, A Apostolico, S Arnborg, C Calude, E Clarke, J Diaz, Z Fülöp, F Gécseg (Chair), R Gorrieri, J-P Jouannaud, J van Leeuwen, B Mahr, M Nivat, E-R Olderog, B Rovan, A Salomaa, E Shamir, U Vishkin, D Wood.
Organizing Committee T Csendes, J Csirik (Chair), T Gaizer, F Gécseg.
Location Szeged, located in the south of Hungary, has about 200000 inhabitants, two universities, and three colleges. Easily reachable from Budapest by train and bus - travelling time is less than 3 hours.
Further Information The final program will be sent to all those who have submitted a paper and to all EATCS members. To add your name to the mailing list or to obtain further information, please write to:
János Csirik, Attila József University, Department of Computer Science, Aradi vértanúk tere 1, H-6720 Szeged, Hungary (icalp95@inf.jate.u-szeged)
Text and LaTeX full versions of this Call for Papers are available.
The general theme of this series of conferences is the use of crisp, clear mathematics in the discovery and design of algorithms and in the development of corresponding software or hardware. The previous two conferences were held in 1989 at Twente, Netherlands, organised by the Rijksuniversiteit Groningen, and in 1992 at Oxford, United Kingdom. The conference theme reflects the growing interest in formal, mathematically based methods for the construction of software and hardware. The goal of the MPC conferences is to report on and significantly advance the state of the art in this area.
Topics: The emphasis is on the combination of conciseness and precision in calculational techniques for program construction. Typical areas are:
Proceedings will be published as Springer LNCS, ready at the conference.
Venue Kloster Irsee is a former Baroque monastery located in the Southwest of Bavaria, close to the Alps. Reached by train from Munich & Stuttgart airports.
Submission Full papers should be submitted in four hardcopies or, preferably, in compressed and uuencoded Postscript format by e-mail to reach B. Möller till December 1, 1994. Although there is no page limit, submissions should strive for brevity.
Programme Committee R-J Back, R Backhouse, G Dromey, D Gries, I Hayes, R Hehner, W Hesselink, G Huet, C Jones, A Kaldewaij, L Meertens, B Möller, O de Moor, C Morgan, H Partsch, R Paterson, C Paulin-Mohring, P Pepper, W Reif, B Sanders, F Schneider, M Sheeran, D Smith, W Turski
Schedule Subm.: Dec. 1, 1994; Notif.: March 1, 1995; Final version: May 1, 1995.
Correspondence
Prof. Dr. B. Möller (MPC '95)
Institut für Mathematik
Universität Augsburg
D-86135 Augsburg
Germany
E-mail: moeller@uni-augsburg.de
Fax: +49 821 598 2274
The full, plain-text version of the Call for Papers is available.
This is the third in the series of international meetings on the relationship between logic programming and non-monotonic reasoning. Two previous meetings were held in Washington, DC, in 1991, and in Lisbon, Portugal, in 1993. The series was started in response to the growing evidence of synergy between the two areas and was meant as a vehicle to facilitate interactions and interdisciplinary research.
Papers are invited on all aspects of logic programming and non-monotonic reasoning. Papers on the relationship between logic programming and non-monotonic reasoning are especially encouraged.
Topics: Semantics for logic programs, Default logic and its versions, Modal non-monotonic logics, Non-monotonic rule systems, Abduction, Diagnosis, Non-monotonic reasoning in databases, Theory of updates and belief revision, Constraint satisfaction, Algorithms and complexity, Implementations and applications.
General Co-Chairs:
Victor Marek and Miroslaw Truszczynski
Department of Computer Science, University of Kentucky
Lexington, KY 40506, USA
e-mail: {marek, mirek}@ms.uky.edu
tel: +1-606-257-3961, fax: +1-606-323-1971
Program Chair:
Anil Nerode
Mathematical Sciences Institute, Cornell University
407 College Ave., Ithaca, NY 14850, USA
e-mail: nerode@msiadmin.cit.cornell.edu
tel: +1-607-255-7752, fax: +1-607-255-9003
Program Committee: K Apt, H Blair, Ph M Dung, M Gelfond, G Gottlob, A Kakas, V Lifschitz, V Marek, A Nerode, L Pereira, T Przymusinski, Y Sagiv, V S Subrahmanian, M Truszczynski, D Warren.
Submission: Send four copies (double-spaced, 12 point font) of a full paper of 20 pages or less to Program Chair.
Dates: Subm Dec 6, 1994. Notif Jan 16, 1995. Final due: Feb 27, 1995.
Plain text, Postscript and LaTeX versions of the Call for Papers are available through the LICS WWW page and via anonymous ftp .
The LICS Symposium aims to attract original papers of high quality on theoretical and practical topics in computer science that relate to logic in a broad sense, including algebraic, categorical and topological approaches.
Topics: abstract data types, automated deduction, categorical models, concurrency, constraint programming, constructive mathematics, database theory, domain theory, finite model theory, hybrid systems, logics of knowledge, lambda and combinatory calculi, linear logic, logical aspects of computational compl- exity, logics in artificial intelligence, logic programming, modal and temporal logics, model checking, program logic and semantics, rewriting, logical aspects of symbolic computing, software specification, type systems, verification.
Dates: Subm.: Dec 7, 1994; Notif.: Feb 14, 1995; Final due: April 5, 1995.
Kleene Award for Best Student Paper: $500.
LICS General Chair:
M Y Vardi
Department of Computer Science, Rice University
Houston, Texas 77251-1892, USA
e-mail: vardi@cs.rice.edu
Program Chair:
D Kozen, Attn: LICS
Computer Science Department, Upson Hall, Cornell University
Ithaca, New York 14853-7501, USA
e-mail: lics95@cs.cornell.edu
Phone: (607) 255-9209, Fax: (607) 255-4428
Program Committee: M Abadi, L Bachmair, C Brown, E Clarke, E A Emerson, U Goltz, T Henzinger, Ph Kolaitis, D Kozen (chair), D Miller, C-H L Ong, A P Sistla, V Tannen, J Tiuryn.
Conference Co-Chairs:
S R Buss, J B Remmel
Department of Mathematics, U California
San Diego La Jolla, CA 92013-0112, USA
e-mail: {sbuss, jremmel}@ucsd.edu
Organizing Committee: M Abadi, S Abramsky, S Artemov, E Boerger, A Borodin, W Brauer, A Bundy, S Buss, E Clarke, R Constable, A Felty, U Goltz, D Howe, G Huet, J-P Jouannaud, D Kapur, C Kirchner, P Kolaitis, D Kozen, T Leighton, D Leivant, A R Meyer, D Miller, J Mitchell, Y Moschovakis, M Okada, P Panangaden, J Remmel, J Riecke, S Ronchi della Rocca, A Scedrov, D Scott, J Tiuryn, M Y Vardi (chair)
Publicity Co-Chairs:
A Felty and D Howe
AT&T Bell Laboratories
600 Mountain Avenue
Murray Hill, NJ 07974, USA
e-mail: {felty, howe}@research.att.com
A full version of this announcement is available, including Editors' addresses.
The aim of Multiple-Valued Logic---An International Journal---is to publish and disseminate knowledge internationally in the area of multiple-valued logic.
Specific topics include:
Papers should contain original results that have neither been submitted to, nor appeared in any journal. The journal will also publish survey papers. Contributions can be submitted to the Managing Editors or to any Member of the Editorial Board.
Managing Editors:
Dan A. Simovici
University of Massachusetts at Boston
Department of Mathematics and Computer Science
Boston, MA 02125, USA
tel.: (617) 287-6472, e-mail: dsim@cs.umb.eduIvan Stojmenovic
University of Ottawa, Department of Computer Science
Ottawa, K1N 9B4, CANADA,
tel.: (613) 564-5982, e-mail: ivan@csi.uottawa.ca
Editors of MVL-IJ: Joel Berman, Randal Bryant, Jon T Butler, K Wayne Current, Janos Demetrovics, Gerhard Dueck, George Epstein, Daniel Etiemble, Yutaka Hata, Tatsuo Higuchi, Mou Hu, Stanley L Hurst, Michitaka Kameyama, Robert A Melter, D Michael Miller, Claudio Moraga, Masao Mukaidono, Jon C Muzio, Marek A Perkowski, Corina Reischer, Ivo G Rosenberg, Elie Sanchez, Tsutomu Sasao, Charles B Silio, Kenneth C Smith, Helmut Thiele, Ratko Tosic, Lotfi A Zadeh
The Department of Linguistics at the State University of New York at Buffalo wishes to fill a tenure-track position, to begin in August 1995. We are seeking a person with a specialization in Semantics and secondary specialization in at least one other area of linguistics. Experience working with primary linguistic data, e.g. fieldwork, is highly desirable. The successful applicant will be expected to contribute to Cognitive Science at UB. He/she will be expected to teach introductory and advanced courses at the undergraduate and graduate levels. PhD must be completed no later than September 1, 1995. Please send application letter, CV and names of three references (including e-mail and phone numbers) to
Robert D. Van Valin, Jr.Additional materials will be requested as needed. Consideration of applications will begin December 1, 1994, and applications will continue to be accepted until the position is filled.
Chair, Dept. of Linguistics
685 Baldy Hall, SUNY at Buffalo
Buffalo NY 14260 USA
[phone: (716) 645-2177; fax: (716) 645-3825].
The School of Computer Science at the University of Birmingham has a three-year studentship available for EU resident students to work towards a PhD in Speech and Natural Language Processing.
Current work in this topic has focused on the development of a novel approach to text-to-speech conversion. It is envisaged that future work will expand the scope of the research to cover cognitive modelling, with speech recognition being used as a demonstration application. Relevant papers by William Edmondson and Jon Iles are included in the further particulars available from the admissions tutor, or can be obtained from either WWW or ftp .
Dr William Edmondson is keen to extend the work as described above and we seek a research student who is interested in these topics.
The novelty of the work lies in its use of a processing architecture which is based on a cognitive model. This is highly parallel and we expect the successful applicant to tackle issues in software engineering as well as speech processing and cognitive modelling.
Each studentship covers full registration fees and a contribution towards living expenses which is equivalent in value to a SERC/EPSRC research studentship.
For suitably qualified students there will be opportunities to do paid work helping with teaching or demonstrating.
Applicants will need either a first class or good upper second class degree, or equivalent. In some cases outstanding MSc performance can compensate for a lower first degree.
Anyone interested should request application forms and other information from the Research Student Admissions Tutor:
Dr. Peter Hancox
School of Computer Science, The University of Birmingham
Edgbaston, Birmingham B15 2TT, England
EMail: P.J.Hancox@cs.bham.ac.uk
Phone: +44 21-414-3819
Fax: +44 21-414-4281
Editors are sought for the production of AMAST Links, starting from the first issue, due to appear on October 10, 1994. Goal of this Call is to inform prospective Editors of AMAST Links about their task.
AMAST Links is an electronic newsletter, assembled every fortnight by a group of Editors, including a Coordinating Editor, for people interested in the use of algebraic and logical methods in the technology of software (as well as hardware) development.
AMAST Links is issued in two forms: (plain) text, and hypertext. The text form is distributed by e-mail, while both forms are available by anonymous ftp as well as on the World-Wide Web.
Each issue of AMAST Links consists of a number of pages, each displaying an abstract and possibly links to more detailed information. Pages are grouped into sections, which include: Meetings, Calls for Papers, Jobs, Literature, Problems, Services, Tools, Views, Archive. Each issue is opened by a Table of Contents (ToC) page, and is closed by a page which lists the Editors of, and Contributors to, that issue. ToC-only subscribers only receive first and last page, by e-mail.
A positive response to this Call does not entail a commitment to the editing of every issue of AMAST Links; readiness to perform editorial tasks for only some of the issues is welcome as well.
The task of an Editor of AMAST Links is twofold:
Should you have questions, please feel free to ask at any time.
anonymous ftp ,The WWW document is the master document, therefore the most up-to-date.
electronic mail, at the address stoc95-submit-info@cs.dartmouth.edu, and the
World-Wide-Web.
Computing Editor
Springer-Verlag London Ltd
Springer House
8 Alexandra Road
London SW19 7JZ,
England
Designing a new computer language is not an easy task. A document describing the language must be produced; an implementation allowing the use of the language is required; and experience with the use of the language must be gained. This thesis contributes to the area of "executable language definitions", where the steps of language description and implementation are integrated into a single phase, thus allowing experiments with the language as early as possible.
The thesis starts by explaining how algebraic specifications and term rewriting can be used for these purposes. The reader is made familiar with the algebraic specification formalism ASF+SDF, which is explained by discussing an example in full detail. ASF+SDF specifications are executed using term rewriting in the ASF+SDF Meta-environment.
The first part of this thesis aims at getting a clear picture of the opportunities and limitations of using algebraic specifications for writing executable language definitions. To that end, three case studies are discussed: the design of a language used to characterize financial products offered by a bank, the description of the static semantics of ISO Pascal, and the construction of tools for the MetaNotation formalism as used in the area of action semantics.
The second part tackles one particular problem revealed by the Pascal case study. The tools obtained by executing the specifications can be enhanced if they have a better understanding how initial values of a computation influence the outcome. A technique called "origin tracking" establishing this information automatically is covered in full detail.
The thesis has been submitted for publication to the AMAST Series in Computing.
More information is available .
Book by Lawrence C. Paulson, with contributions by Tobias Nipkow
Springer Lecture Notes in Computer Science 828
Price: DM 66.00
XVII+321 pages, 1994.
This book provides complete documentation of the theorem prover Isabelle. It includes an introduction, a general reference section, and documentation of the main logics provided with Isabelle.
The book is closely based on the three Isabelle manuals distributed electronically with Isabelle. But it is a single volume with a global index.
Mosaic users can call up a description of Isabelle .
A plain text version is available by ftp.
An errata list for the book is also available.
Lawrence C. Paulson
Computer Laboratory
University of Cambridge
Cambridge CB2 3QG
England
We are pleased to announce a new version of Isabelle. A generic theorem prover, Isabelle supports a classical set theory, a constructive type theory, higher-order logic, modal logics, etc.
Isabelle-94 is significantly faster than Isabelle-93. In its higher-order logic and set theory, you can easily make (co)inductive and datatype definitions. In higher-order logic, primitive recursive functions can now be defined directly. In set theory, you can define trees that are infinitely branching or infinitely deep.
Isabelle is available by ftp from host ftp.cl.cam.ac.uk, directory ml. Consult the file isabelle.txt for more information on Isabelle and ftp instructions.
For Mosaic users, the following URLs are relevant:
Lawrence C. Paulson Tobias Nipkow Computer Laboratory Institut fuer Informatik University of Cambridge TU Muenchen Cambridge CB2 3QG 80290 Muenchen England Germany Larry.Paulson@cl.cam.ac.uk Tobias.Nipkow@informatik.tu-muenchen.de
URL : ftp://ftp.cs.utwente.nl/pub/doc/amast/
Date : 13/09/1994
Contents : README, amast91/, amast93/, amast95/, info/, newsletter/,
/pstv95/, sigala/
Note : ... Starting from issue04/, each directory issuexx/ may contain a subdirectory full/, where more detailed information is stored that is referred to in the corresponding newsletter. Only the presence, not the contents, of full/ subdirectories is documented here; see the corresponding newsletters for more information about the contents.
was put together and edited by Giuseppe Scollo, thanks to contributions by:
Roberto Tamassia [1-1] ,
Baudouin Le Charlier [1-2] ,
Wiebe van der Hoek [1-3] ,
Paul Hoogendijk [1-4] ,
Boris Aronov [1-5] ,
Surya Mantha, Kannan Govindarajan [1-6] ,
Krithi Ramamritham [1-7] ,
Uday S. Reddy [2-1] ,
Alois Ferscha [2-2] ,
Toine Andernach [2-3] ,
COLIBRI 37 [2-4] , [2-7] ,
Gaizer Tamas [2-5] ,
Bernhard Möller [2-6] ,
Douglas Howe [2-8] ,
Ivan Stojmenovic [2-9] ,
COLIBRI 38 [3-1] ,
COLIBRI 36 [3-2] ,
Samuel A. Rebelsky [4-2] ,
V. S. Alagar [5-1] ,
Arie van Deursen [5-2] ,
Larry Paulson [5-3] , [6-1] .
This sixth sample issue of the AMAST newsletter is available in three forms:
(*) anonymous ftp from the AMAST ftp repository, in the directory for this issue (when uploaded).