Tapsoft 91 Volume 2

TAPSOFT '91 is the Fourth International Joint Conference on Theory and Practice of Software Development. It was held in Brighton, April 8-12, 1991, and was organized by the Department of Computing, Imperial College, London. The proceedings of TAPSOFT '91 are organized into three parts: - Advances in Distributed Computing (ADC) - Colloquium on Trees in Algebra and Programming (CAAP) - Colloquium on Combining Paradigms for Software Development (CCPSD) The proceedings are published in two volumes. The first volume (LNCS, Vol. 493) contains the papers from CAAP. The second volume (LNCS, Vol. 494) contains the papers from the ADC and CCPSD. The ADC talks by distinguished invited speakers surveys current developments in distributed computing, including the integration of different paradigms for concurrency, algebraic, logical and operational foundations, and applications to software engineering and formal methods. The CCPSD papers address aspects of the trend in software enginering towards unification and synthesis combining theory and practice, and merging hitherto diverse approaches.

CONCUR'91 is the second international conference on concurrency theory, organized in association with the NFI project Transfer. It is a sequel to the CONCUR'90 conference. Its basic aim is to communicate ongoing work in concurrency theory. This proceedings volume contains 30 papers selected for presentation at the conference (from 71 submitted) together with four invited papers and abstracts of the other invited papers. The papers are organized into sections on process algebras, logics and model checking, applications and specification languages, models and net theory, design and real-time, tools and probabilities, and programming languages. The proceedings of CONCUR'90 are available asVolume 458 of Lecture Notes in Computer Science.

The main idea behind the series of volumes Advances in Petri Nets is to present to the general computer science community recent results which are the most representative and significant for the development of the area. Thepapers for the volumes are drawn mainly from the annual International Conferences on Applications and Theory of Petri Nets. Selected papers from the latest conference are independently refereed, and revised and extended as necessary. Some further papers submitted directly to the editor are included. Advances in Petri Nets 1991 covers the 11th International Conference on Applications and Theory of Petri Nets held in Paris, France in June 1991. The volume contains the Bibliography of Petri Nets 1990 prepared by H. Pl}nnecke and W. Reisig, with over 4000 entries.

This book constitutes the refereed proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development (TAPSOFT'97), held in Lille, France, in April 1997. The volume is organized in three parts: The first presents invited contributions, the second is devoted to trees in algebra in programming (CAAP) and the third to formal approaches in software engineering (FASE). The 30 revised full papers presented in the CAAP section were selected from 77 submissions; the 23 revised full papers presented in the FASE section were selected from 79 submissions.

This volume contains the papers which have been accepted for presentation atthe Third International Symposium on Programming Language Implementation andLogic Programming (PLILP '91) held in Passau, Germany, August 26-28, 1991. The aim of the symposium was to explore new declarative concepts, methods and techniques relevant for the implementation of all kinds of programming languages, whether algorithmic or declarative ones. The intention was to gather researchers from the fields of algorithmic programming languages as well as logic, functional and object-oriented programming. This volume contains the two invited talks given at the symposium by H. Ait-Kaci and D.B. MacQueen, 32 selected papers, and abstracts of several system demonstrations. The proceedings of PLILP '88 and PLILP '90 are available as Lecture Notes in Computer Science Volumes 348 and 456.

This volume contains papers which were contributed for presentation at the international conference "Fundamentals of Computation Theory - FCT '91" heldat Gosen, near Berlin, September 9-13, 1991. This was the eighth in the series of FCT conferences organized every odd year. The programme of theconference, including invited lectures and selected contributions, falls into the following categories: - Semantics and logical concepts in the theory of computing, formal specification, - Automata and formal languages, Computational geometry, - Algorithmic aspects of algebra and algebraic geometry, cryptography, - Complexity (sequential, parallel, distributed computing, structure, lower bounds, complexity of analytical problems, general concepts), - Algorithms (efficient, probabilistic, parallel, sequential, distributed), - Counting and combinatorics in connection with mathematical computer science. The proceedings of previous FCT meetings are available as Lecture Notes in Computer Science (Vols. 380, 278, 199, 158, 117, 56).

Logic programming refers to execution of programs written in Horn logic. Among the advantages of this style of programming are its simple declarativeand procedural semantics, high expressive power and inherent nondeterminism. The papers included in this volume were presented at the Workshop on Parallel Logic Programming held in Paris on June 24, 1991, as part of the 8th International Conference on Logic Programming. The papers represent the state of the art in parallel logic programming, and report the current research in this area, including many new results. The three essential issues in parallel execution of logic programs which the papers address are: - Which form(s) of parallelism (or-parallelism, and-parallelism, stream parallelism, data-parallelism, etc.) will be exploited? - Will parallelism be explicitly programmed by programmers, or will it be exploited implicitly without their help? - Which target parallel architecture will the logic program(s) run on?

This volume contains contributions to the 17th International workshop on Graph-Theoretic Concepts in Computer Science (WG '91) held in Southern Bavaria in June 1991. These annual workshops are designed to bring together researchers using graph-theoretic methods to discuss new developments relating to or emerging from a diversity of application fields. The topics covered in this volume include: tree-related problems, graph grammarsand rewriting, complexity, computational geometry, parallel algorithms, vertex orderings, path-oriented algorithms, applications to VLSI, and disjoint cycle problems.