Bücher der Reihe Monographs in Computer Science

Presents an examination of the theory of super-recursive algorithms and its ramifications for the computer industry, networks, artificial intelligence, embedded systems, and the Internet. This book demonstrates how these algorithms are more appropriate as mathematical models for modern computers.

This monograph details several important advances in the direction of a practical proofs-as-programs paradigm, which constitutes a set of approaches to developing programs from proofs in constructive logic with applications to industrial-scale, complex software engineering problems.

This second edition of Grune and Jacobs' brilliant work presents new developments and discoveries that have been made in the field of parsing, or syntax analysis. Parsing has been and continues to be an essential part of computer science and linguistics.

An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking "k-slices" of the language, thus introducing readers to new classes of algorithms which may be analysed more precisely than was the case until now.

From the reviews: "This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry.

when we recognize the battle against chaos, mess, and unmastered complexity as one of computing sci- ence's major callings, we must admit that 'Beauty Is Our Business'."

By developing object calculi in which objects are treated as primitives, this title explains both the semantics of objects and their typing rules, and demonstrates how to develop various important concepts of object-oriented programming languages: self, dynamic dispatch, classes, inheritance, protected and private methods, prototyping, and more.

This theory is also more general than those just mentioned, applying to both terminating and nonterminating computation, to both sequential and parallel computation, to both stand-alone and interactive computation.

Illustrates by example the typical steps necessary in computer science to build a mathematical model of any programming paradigm . Presents results of a large and integrated body of research in the area of 'quantitative' program logics.

Describes how to design object-oriented code and accompanying algorithms that can be reverse engineered for greater flexibility in future code maintenance and alteration. Provides essential object-oriented concepts and programming methods for software engineers and researchers.

The topics presented in the book include conceptual modeling of application environments using the relational model, formal properties of that model, and tools such as relational languages which go with it, techniques for the logical and physical design of relational database systems and their imple mentations.

As well as providing an overview of the current state of science in the analysis and synthesis of non-rigid shapes, the authors include everyday examples to explain concepts. Practice problems follow at the end of each chapter, along with detailed solutions.

A timely survey of the field from the point of view of some of the subject's most active researchers. Divided into several parts organized by theme, the book first covers the underlying methodology regarding active rules, followed by formal specification, rule analysis, performance analysis, and support tools.

Provides an introduction to the geometric concepts that are important to applications in robotics. This title includes material that reflects important advances, connecting robotics back to mathematical fundamentals in group theory and geometry.

"Specification and transformation of programs" is short for a methodology of software development where, from a formal specification of a problem to be solved, programs correctly solving that problem are constructed by stepwise application of formal, semantics-preserving transformation rules.

In recent years, there has been a great surge of interest in asynchronous circuits, largely through the development of new asynchronous design methodologies. This book provides a comprehensive theory of asynchronous circuits, including modelling, analysis, simulation, specification, verification, and an introduction to their design.

Here, the authors propose a method for the formal development of parallel programs - or multiprograms as they prefer to call them. They show that the Owicki/Gries theory can be effectively put to work for the formal development of multiprograms, regardless of whether these algorithms are distributed or not.

Integrates computer vision, pattern recognition, and AI. Presents original research that will benefit researchers and professionals in computer vision, pattern recognition, target recognition, machine learning, evolutionary learning, image processing, knowledge discovery and data mining, cybernetics, robotics, automation and psychology

An up-to-date and comprehensive account of set-oriented symbolic manipulation and automated reasoning methods. This book is of interest to graduates and researchers in theoretical computer science and computational logic and automated reasoning.

Helps in the development of large software projects. Uses a well-known open-source software prototype system (Vesta developed at Digital and Compaq Systems Research Lab).

Topics * what this book is about, * its intended audience, * what the reader ought to know, * how the book is organized, * acknowledgements. The use of specifications as an integral part of a program opens up a whole new area of programming - progmmming with specifications.

Probabilistic Analysis of Algorithms begins with a presentation of the "tools of the trade" currently used in probabilistic analyses, and continues with an applications section in which these tools are used in the analysis ofr selected algorithms.

The mathematical principles underlying adaptive signal processing were initially fascinating and were my first experience in seeing applied mathematics work for a paycheck. Since that time, the application of even more advanced mathematical techniques have kept the area of adaptive signal processing as exciting as those initial days.

This book is written as an introduction to polynomial matrix computa tions. This book is intended for seniors and graduate students in computer and system sciences, and mathematics, and for researchers in the fields of computer science, numerical analysis, systems theory, and computer algebra.

The programming language SETL is a relatively new member of the so-called "very-high-level" class of languages, some of whose other well-known mem bers are LISP, APL, SNOBOL, and PROLOG.

The study of formal languages and of related families of automata has long been at the core of theoretical computer science.

The Synthesizer Generator is a system for automating the implementation of language-based editing environments. The Synthesizer Generator is a generalization of our earlier system, the Cor nell Program Synthesizer [Teitelbaum81], which was a programming environ ment for a specific small dialect of PL/I.