Proceedings -- Parallel Computing.

This volume presents the proceedings of the 2nd International Workshop on Distributed Algorithms, held July 8-10, 1987, in Amsterdam, The Netherlands. It contains 29 papers on new developments in the area of the design and analysis of distributed algorithms. The topics covered include, e.g. algorithms for distributed consensus and agreement in networks, connection management and topology update schemes, election and termination detection protocols, and other issues in distributed network control.

This volume contains abridged versions of most of the sectional talks and some invited lectures given at the International Conference on Fundamentals of Computation Theory held at Kazan State University, Kazan, USSR, June 22-26, 1987. The conference was the sixth in the series of FCT Conferences organized every odd year, and the first one to take place in the USSR. FCT '87 was organized by the Section of Discrete Mathematics of the Academy of Sciences in the USSR, the Moscow State University (Department of Discrete Mathematics), and the Kazan State University (Department of Theoretical Cybernetics). This volume contains selected contributions to the following fields: Mathematical Models of Computation, Synthesis and Complexity of Control Systems, Probabilistic Computations, Theory of Programming, Computer-Assisted Deduction. The volume reflects the fact that FCT '87 was organized in the USSR: A wide range of problems typical of research in Mathematical Cybernetics in the USSR is comprehensively represented.

This volume gives the proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science. These conferences are organized and run by the computer science research community in India, and their purpose is to provide a forum for professional interaction between members of this research community and their counterparts in different parts of the world. The volume includes four invited papers on: - reasoning about linear constraints using parametric queries, - the parallel evaluation of classes of circuits, - a theory of commonsense visual reasoning, - natural language processing, complexity theory and logic. The 26 submitted papers are organized into sections on logic, automata and formal languages, theory of programming, parallel algorithms, geometric algorithms, concurrency, distributed computing, and semantics.

This volume is the proceedings of the 3rd Workshop on the Mathematical Foundations of Programming Language Semantics held at Tulane University, New Orleans, Louisiana, April 8-10, 1987. The 1st Workshop was at Kansas State University, Manhattan, Kansas in April, 1985 (see LNCS 239), and the 2nd Workshop with a limited number of participants was at Kansas State in April, 1986. It was the intention of the organizers that the 3rd Workshop survey as many areas of the Mathematical Foundations of Programming Language Semantics as reasonably possible. The Workshop attracted 49 submitted papers, from which 28 papers were chosen for presentation. The papers ranged in subject from category theory and Lambda-calculus to the structure theory of domains and power domains, to implementation issues surrounding semantics.

Parallel architectures are no longer pure research vehicles, as they were some years ago. There are now many commercial systems competing for market segments in scientific computing. The 1990s are likely to become the decade of parallel processing. CONPAR 90 - VAPP IV is the joint successor meeting of two highly successful international conference series in the field of vector and parallel processing. This volume contains the 79 papers presented at the conference. The various topics of the papers include hardware, software and application issues. Some of the session titles best reflect the contents: new models of computation, logic programming, large-grain data flow, interconnection networks, communication issues, reconfigurable and scalable systems, novel architectures and languages, high performance systems and accelerators, performance prediction / analysis / measurement, performance monitoring and debugging, compile-time analysis and restructurers, load balancing, process partitioning and concurrency control, visualization and runtime analysis, parallel linear algebra, architectures for image processing, efficient use of vector computers, transputer tools and applications, array processors, algorithmic studies for hypercube-type systems, systolic arrays and algorithms. The volume gives a comprehensive view of the state of the art in a field of current interest.

This book presents developments of a language independent theory of program structure. The theory features a simple, natural notion of control structure which is much broader than in other theories of programming languages such as denotational semantics and program schemes. This notion permits treatment of control structures which involve not only the denotation of programs (i.e., their input/output behavior), but also their structure, size, run times, etc. The theory also treats the relation of control structure and complexity properties of programming languages. The book focuses on expressive interdependencies of control structures (which control structures can be expressed by which others). A general method of proving control structures expressively independent is developed. The book also considers characterizations of the expressive power of general purpose programming languages in terms of control structures. Several new characterizations are presented and two compactness results for such characterizations are shown.

This original text provides comprehensive coverage of parallel algorithms and architectures, beginning with fundamental concepts and continuing through architectural variations and aspects of implementation. Unlike the authors of similar texts, Professor Parhami reviews the circuit model and problemdriven parallel machines, variants of mesh architectures, and composite and hierarchical systems, among other subjects. With its balanced treatment of theory and practical designs, classtested lecture material and problems, and helpful case studies, the book is suited to graduate and upperlevel undergraduate students of advanced architecture or parallel processing.

This book is the second of two volumes that present the main results which emerged from the project CIP - Computer-Aided, Intuition-Guided Programming - at the Technical University of Munich. Its central theme is program development by transformation, a methodology which is becoming more and more important. Whereas Volume I contains the description and formal specification of a wide spectrum language CIP-L particularly tailored to the needs of transformational programming, Volume II serves a double purpose: First, it describes a system, called CIP-S, that is to assist a programmer in the method of transformational programming. Second, it gives a non-toy example for this very method, since it contains a formal specification of the system core and transformational developments for the more interesting system routines. Based on a formal calculus of program transformations, the informal requirements for the system are stated. Then the system core is formally specified using the algebraic data types and the pre-algorithmic logical constructs of the wide spectrum language CIP-L. It is demonstrated how executable, procedural level programs can be developed from this specification according to formal rules. The extensive collection of these rules is also contained in the book; it can be used as the basis for further developments using this method. Since the system has been designed in such a way that it is parameterized with the concrete programming language to be transformed, the book also contains a guide how to actualize this parameter; the proceeding is exemplified with a small subset of CIP-L.