The title of this book contains the words ALGORITHMIC LANGUAGE, in the singular. This is meant to convey the idea that it deals not so much with the diversity of program ming languages, but rather with their commonalities. The task of formal program develop It allows classifying ment proved to be the ideal frame for demonstrating this unity. concepts and distinguishing fundamental notions from notational features; and it leads immediately to a systematic disposition. This approach is supported by didactic, practical, and theoretical considerations. The clarity of the structure of a programming language de signed according to the principles of program transformation is remarkable. Of course there are various notations for such a language. The notation used in this book is mainly oriented towards ALGOL 68, but is also strongly influenced by PASCAL - it could equally well have been the other way round. In the appendices there are occa sional references to the styles used in ALGOL, PASCAL, LISP, and elsewhere.

The systematic development of software systems is a central task of computing science. A software system is the result of putting together knowledge about the application, the requirements and the structures of computing science. Under the heading CIP (Computer-aided Intuition-guided Programming), a group of researchers led by Prof. F.L. Bauer and Prof. K. Samelson started work in 1975 in the direction of formal program specification, transformational programming, and tool supportfor program development. The collection of papers in this volume presents examples of a formal approach to programming language concepts and program development based on algebraic specifications and program transformations. Examples are also presented of evolutions and modificationsof the original ideas of the CIP project. The topics range from descriptionsof the program development process to derivations of algorithms from specifications. The volume is dedicated to Prof. F.L. Bauer.

Sponsored by the "Österr. Fonds zur Förderung der Wissenschaftlichen Forschung", project nr. P4567

The final installment in this three-volume set is based on this maxim: "Before software can be designed its requirements must be well understood, and before the requirements can be expressed properly the domain of the application must be well understood." The book covers the process from the development of domain descriptions, through the derivation of requirements prescriptions from domain models, to the refinement of requirements into software architectures and component design.

Modern information processing systems show such complex properties as distribution, parallelism, interaction, time dependency, and nondeterminism. For critical applications, mathematical methods are needed to model the systems and to support their development and validation. Impressive progress in mathematical methods for programming software systems makes it possible to think about unifying the different approaches. This book gives a comprehensive overview of existing methods and presents some of the most recent results in applying them. The main topics are: advanced programming techniques, foundations of systems engineering, mathematical support methods, and application of the methods. The approaches presented are illustrated by examples and related to other approaches.

The art, craft, discipline, logic, practice, and science of developing large-scale software products needs a believable, professional base. The textbooks in this three-volume set combine informal, engineeringly sound practice with the rigour of formal, mathematics-based approaches. Volume 1 covers the basic principles and techniques of formal methods abstraction and modelling. First this book provides a sound, but simple basis of insight into discrete mathematics: numbers, sets, Cartesians, types, functions, the Lambda Calculus, algebras, and mathematical logic. Then it trains its readers in basic property- and model-oriented specification principles and techniques. The model-oriented concepts that are common to such specification languages as B, VDM-SL, and Z are explained here using the RAISE specification language (RSL). This book then covers the basic principles of applicative (functional), imperative, and concurrent (parallel) specification programming. Finally, the volume contains a comprehensive glossary of software engineering, and extensive indexes and references. These volumes are suitable for self-study by practicing software engineers and for use in university undergraduate and graduate courses on software engineering. Lecturers will be supported with a comprehensive guide to designing modules based on the textbooks, with solutions to many of the exercises presented, and with a complete set of lecture slides.

This book reflects the scientific program of the annual workshop on Graph-theoretic Concepts in Computer Science in 1987. The purpose of this conference is to be the "missing link" between theory and application of graphs in as many branches of computer science as a conference scheduled for three days without parallel sessions can permit. So the organizers of WG '87 addressed a selected group of people with a strong interest in theory and practice. The proceedings include latest results on "classical" graph-theoretic problems (including formal language theory applied to graphs) and how to apply those results to practical problems, e.g. data bases, layout of graph operating systems, software engineering, chemistry, and modelling with graphs.

powerful operations on them. An early step in this direction was the development of APl, and more recent examples have been SETl which enables a user to code in terms of mathematical enti ties such as sets and BDl which allows a user, presumably a businessman, to specify a computation in terms of a series of tabular forms and a series of processing paths through which data flows. The design and implementation of such languages are examined in chapters by P. GOLDBERG. Another extension to traditional methods is made possible by systems designed to automatically handle low level flow-of control decisions. All the above higher level languages do this implicitly with their built in operators. PROLOG is a language which does this with a theorem proving mechanism employing primarily unification and backtracking. The programmer specifies the problem to be solved with a set of formal logic statements including a theorem to be proved. The theorem proving system finds a way to combine the axioms to prove the theorem, and in the process, it completes the desired calculation. H. GAllAIRE has contributed a chapter describing PROLOG giving many examples of its usage.

Deformable objects are ubiquitous in the world surrounding us, on all levels from micro to macro. The need to study such shapes and model their behavior arises in a wide spectrum of applications, ranging from medicine to security. In recent years, non-rigid shapes have attracted growing interest, which has led to rapid development of the field, where state-of-the-art results from very different sciences - theoretical and numerical geometry, optimization, linear algebra, graph theory, machine learning and computer graphics, to mention several - are applied to find solutions. This book gives an overview of the current state of science in analysis and synthesis of non-rigid shapes. Everyday examples are used to explain concepts and to illustrate different techniques. The presentation unfolds systematically and numerous figures enrich the engaging exposition. Practice problems follow at the end of each chapter, with detailed solutions to selected problems in the appendix. A gallery of colored images enhances the text. This book will be of interest to graduate students, researchers and professionals in different fields of mathematics, computer science and engineering. It may be used for courses in computer vision, numerical geometry and geometric modeling and computer graphics or for self-study.