This book presents a comprehensive catalogue of elementary data types like sets, maps, orders, trees and lists, written in Ada. Such data types are often used in systems programming. The major focus is on: - a uniform syntactic and semantic interface for all data types, - many implementation variants per data type, all ac cessible through a single interface, - a hierarchical system of the data types as a basis for data type selection and implementation. Meeting these goals is the main achievement of the book. The combination of efficient applicability and ease of learning and maintenance is achieved by the carefully elaborated interfaces of the catalogue's data types. These interfaces combine abstraction, which is necessary for easy learning and for leaving implementation freedom, and functional completeness, which is an essential prerequisite for high performance in different application contexts. The selection of the right data type implementation for a given context is supported by the data type hierarchy which imposes different abstraction levels, and an orthogonal scheme of implementation variants which can be freely combined. Together with the uniformity of interfaces, the hierarchical composition of the catalogue leads to a small code base, from which different implementation variants are generated using a macro processor.

Published in 1993. Software reuse has been shown to achieve improvements in productivity, quality and timeliness of software. The collection of papers in this book were given at a seminar organized by UNICOM and the British Computer Society Software Reuse Specialist Group. They address the reasons why software reuse can maximize an organization's return from past expenditure and ensure a good future expenditure. Increasing the automation of software development requires access to explicit knowledge about processes and products involved. The chapters examine the relationship between reuse and other aspects of software engineering, including management techniques and structures, CASE, methodologies and object orientation. In addition, the papers aim to provide a structures insight into new techniques which will become available through the 1990s. This text is suitable for software managers and directors, software engineers, software professionals, academics, and other involved in software engineering research.

Formality is becoming accepted as essential in the development of complex systems such as multi-layer communications protocols and distributed systems. Formality is mandatory for mathematical verification, a procedure being imposed on safety-critical system development. Standard documents are also becoming increasingly formalised in order to capture notions precisely and unambiguously. This FORTE '91 proceedings volume has focussed on the standardised languages SDL, Estelle and LOTOS while, as with earlier conferences, remaining open to other notations and techniques, thus encouraging the continuous evolution of formal techniques. This useful volume contains 29 submitted papers, three invited papers, four industry reports, and four tool reports organised to correspond with the conference sessions.

Is this book about patterns? Yes and no. It is about software reuse and representation of knowledge that can be reapplied in similar situations; however, it does not follow the classic Alexandine conventions of the patterns community--i.e. Problem- solution- forces- context- example, etc. Chapter 6 on claims comes close to classic patterns, and the whole book can be viewed as a patterns language of abstract models for software engineering and HCI. So what sort of patterns does it contain? Specifications, conceptual models, design advice, but sorry not code. Plenty of other C++ code pattern books (see PLOP series). Nearest relative in published patterns books are Fowler's (1995) Analysis Patterns: Reusable object models and Coad, North and Mayfield. What do you mean by a Domain Theory? Not domains in the abstract mathematical sense, but domains in the knowledge--natural language sense, close to the everyday meaning when we talk about the application domain of a computer system, such as car rental, satellite tracking, whatever. The book is an attempt to answer the question ' what are the abstractions behind car rental, satellite tracking' so good design solutions for those problems can be reused. I work in industry, so what's in it for me? A new way of looking at software reuse, ideas for organizing a software and knowledge reuse program, new processes for reusing knowledge in requirements analysis, conceptual modeling and software specification. I am an academic, should I be interested? Yes if your research involves software engineering, reuse, requirements engineering, human computer interaction, knowledge engineering, ontologies and knowledge management. For teaching it may be useful for Master courses on reuse, requirements and knowledge engineering. More generally if you are interested in exploring what the concept of abstraction is when you extend it beyond programming languages, formal specificati

The development of database technology has currently reached the stage of deductive database systems which use Horn clauses for defining relations. An important characteristic of these systems is the clear separation of logic and control. However, the programmer cannot affect the control part of a deductive database system. To eliminate this deficiency, this monograph presents a so-called expert deductive database system that allows explicit control of the deduction process. The system consists of an object-level describing the logical aspects of a problem and of a meta-level that contains application-specific control information affecting the object-level deduction process. For example, object-level rules can be disregarded, and some tuples deduced at the object-level can be preferred to others. Besides the architecture of this system, the book also identifies some important possibilities of deduction control which are explained by characteristic examples.

Proceedings

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. The papers 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 1990 covers the Tenth International Conference on Applications and Theory of Petri Nets held in Bonn, Germany, in June 1989. Additional highlights of this volume include a tutorial on refinements of Petri nets by W. Brauer, R. Gold, and W. Vogler, and a tutorial on analysis and synthesis of free choice systems by J. Esparza and M. Silva, both prepared in the framework of the ESPRIT Basic Research Actions Project DEMON.

Advances and problems in the field of compiler compilers are considered in this volume, which presents the proceedings of the third in a series of biannual workshops on compiler compilers. Selected papers address the topics of requirements, properties, and theoretical aspects of compiler compilers as well as tools and metatools for software engineering. The 23 papers cover a wide spectrum in the field of compiler compilers, ranging from overviews of new compiler compilers for generating quality compilers to special problems of code generation and optimization. Aspects of compilers for parallel systems and knowledge-based development tools are also discussed.

Annotation The Symposium on Theoretical Aspects of Computer Science is organized jointly by the Special Interest Group for Applied Mathematics of AFCET (Association FranAaise de CybernA(c)tique Economique et Technique) and the Special Interest Group for Theoretical Computer Sciences of GI (Gesellschaft fA1/4r Informatik). It is held alternately in France and in Germany. This volume contains two invited papers, on combinatorial methods in computer science, and on the complexity of local optimization, and 24 contributions on theoretical aspects of computer science. Some software systems are presented showing the possibilities of applying theoretical research to the realization of software tools.

This volume gives the proceedings of WG '90, the 16th in a series of workshops. The aim of the workshop series is to contribute to integration in computer science by applying graph-theoretic concepts. The workshops are unusual in that they combine theoretical aspects with practice and applications. The volume is organized into sections on: - Graph algorithms and complexity, - VLSI layout, - Multiprocessor systems and concurrency, - Computational geometry, - Graphs, languages and databases, - Graph grammars. The volume contains revised versions of nearly all the papers presented at the workshop. Several papers take the form of preliminary reports on ongoing research.