STACS 88
STACS 88

Author: Robert Cori

Publisher: Springer Science & Business Media

Published: 1988-01-27

Total Pages: 420

ISBN-13: 9783540188346

DOWNLOAD EBOOK

This volume contains the presentations of the Fifth Symposium on Theoretical Aspects of Computer Science (STACS 88) held at the University of Bordeaux, February 11-13, 1988. In addition to papers presented in the regular program the volume contains abstracts of software systems demonstrations which were included in this conference series in order to show applications of research results in theoretical computer science. The papers are grouped into the following thematic sections: algorithms, complexity, formal languages, rewriting systems and abstract data types, graph grammars, distributed algorithms, geometrical algorithms, trace languages, semantics of parallelism.

ICDT '88
ICDT '88

Author: M. Gyssens (Marc)

Publisher: Springer Science & Business Media

Published: 1988-08-17

Total Pages: 420

ISBN-13: 9783540501718

DOWNLOAD EBOOK

This volume is the proceedings of the second International Conference on Database Theory (ICDT) held in Bruges, Belgium, August 31 - September 2, 1988. ICDT intends to provide a European forum for the international research community working on theoretical issues related to database and knowledge base systems. The proceedings of this conference contain all invited and accepted papers, which represent the latest results obtained in ongoing research in database theory worldwide. Most major themes of research in database theory are covered in ICDT '88: the relational model, logic and databases, object-oriented databases, deductive databases, conceptual models, analysis and design of data structures, query languages, concurrency control and updates and transactions.

Concurrency 88
Concurrency 88

Author: Friedrich H. Vogt

Publisher: Springer Science & Business Media

Published: 1988-10-12

Total Pages: 412

ISBN-13: 9783540504030

DOWNLOAD EBOOK

This volume contains the proceedings of CONCURRENCY 88, an international conference on formal methods for distributed systems, held October 18-19, 1988 in Hamburg. CONCURRENCY 88 responded to great interest in the field of formal methods as a means of mastering the complexity of distributed systems. In addition, the impulse was determined by the fact that the various methodological approaches, such as constructive or property oriented methods, have not had an extensive comparative analysis nor have they been investigated with respect to their possible integration and their practical implications. The following topics were addressed: Specification Languages, Models for Distributed Systems, Verification and Validation, Knowledge Based Protocol Modeling, Fault Tolerance, Distributed Databases. The volume contains 12 invited papers and 14 contributions selected by the program committee. They were presented by authors from Austria, the Federal Republic of Germany, France, Israel, Italy, the Netherlands, the United Kingdom and the United States.

Logic at Botik '89
Logic at Botik '89

Author: Albert R. Meyer

Publisher: Springer Science & Business Media

Published: 1989-06-07

Total Pages: 310

ISBN-13: 9783540512370

DOWNLOAD EBOOK

The present volume contains the proceedings of Logic at Botik '89, a symposium on logical foundations of computer science organized by the Program Systems Institute of the USSR Academy of Sciences and held at Pereslavl-Zalessky, USSR, July 3-8, 1989. The scope of the symposium was very broad; the topics of interest were: complexity of formal systems, constructive mathematics in computer science, denotational and operational semantics of programs, descriptive complexity, dynamic and algorithmic logics and schematology, formal tools to describe concurrent computations, lambda calculus and related topics, foundations of logic programming, logical foundations of database theory, logics for knowledge representation, modal and temporal logics, type theory in programming, and verification of programs. Thus, the papers in this volume represent many interesting trends in logical foundations of Computer Science, ranging from purely theoretical research to practical applications of theory.

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

Author: Llorenc Huguet

Publisher: Springer Science & Business Media

Published: 1989-06-14

Total Pages: 428

ISBN-13: 9783540510826

DOWNLOAD EBOOK

The present volume contains the proceedings of the AAECC-5 Conference held at Menorca (Balearic Islands), June 15-19, 1987. The annual International AAECC Conference covers a range of topics related to Applied Algebra, Error-Correcting Codes, Finite Algebraic Structures, Computational Methods and Complexity in Algebra and Geometry. For the AAECC-5 Conference 73 papers were presented. Out of these thirty papers were selected for publication in the proceedings. They deal with topics such as error correcting codes (concerning problems of covering radius, decoding methods, expert systems and general results in coding theory), computational algebra, Gröbner basis, complexity, finite algebra and graphs. The proceedings of the 6th conference are published as Vol. 357 of the Lecture Notes in Computer Science.

Database Machines
Database Machines

Author: Haran Boral

Publisher: Springer Science & Business Media

Published: 1989

Total Pages: 404

ISBN-13: 9783540513247

DOWNLOAD EBOOK

This volume contains 24 papers presented at the Sixth International Workshop on Database Machines. The papers cover a wide spectrum of topics including: system architectures, storage structures, associative memory architectures, memory resident systems, deduction and retrospectives on maturing projects. The nature of the papers is highly technical and presumes knowledge of database management systems and familiarity with database machines. The book is representative of the dual trend in the field towards (1) search for new functionability and (2) attention to detail, completeness and performance of prototype implementations.

Algorithms and Computations
Algorithms and Computations

Author: John Staples

Publisher: Springer Science & Business Media

Published: 1995-11-15

Total Pages: 470

ISBN-13: 9783540605737

DOWNLOAD EBOOK

This book presents the refereed proceedings of the 6th International Symposium on Algorithms and Computation, ISAAC '95, held in Cairns, Australia, in December 1995. The 45 revised full papers presented together with the abstracts of three invited talks were selected from a total of 130 submissions. The papers address many current aspects of research and advanced applications of algorithms and computations; among the topics covered are graph theory and graph algorithms, computational geometry, computational logics, searching and sorting, approximation and optimization, algebraic manipulation, and coding.

Algorithms and Computation
Algorithms and Computation

Author: Kam W. Ng

Publisher: Springer Science & Business Media

Published: 1993-11-26

Total Pages: 566

ISBN-13: 9783540575689

DOWNLOAD EBOOK

This volume presents the proceedings of the fourth annual International Symposium on Algorithms and Computation, held in Hong Kong in December 1993.Numerous selected papers present original research in such areas as design and analysis of algorithms, computational complexity, and theory of computation. Topics covered include: - automata, languages, and computability, - combinatorial, graph, geometric, and randomized algorithms, - networks and distributed algorithms, - VLSIand parallel algorithms, - theory of learning and robotics, - number theory and robotics. Three invited papers are also included.

Graph Grammars and Their Application to Computer Science
Graph Grammars and Their Application to Computer Science

Author: Hartmut Ehrig

Publisher: Springer Science & Business Media

Published: 1991-09-11

Total Pages: 724

ISBN-13: 9783540544784

DOWNLOAD EBOOK

This volume contains papers selected from the contributions to the 4th International Workshop on Graph Grammars and Their Application to Computer Science. It is intended to provide a rich source of information on the stateof the art and newest trends to researchers active in the area and for scientists who would like to know more about graph grammars. The topics of the papers range from foundations through algorithmic and implemental aspects to various issues that arise in application areas like concurrent computing, functional and logic programming, software engineering, computer graphics, artificial intelligence and biology. The contributing authors are F.-J. Brandenburg, H. Bunke, T.C. Chen, M. Chytil, B. Courcelle, J. Engelfriet, H. G|ttler, A. Habel, D. Janssens, C. Lautemann, B. Mayoh, U. Montanari, M. Nagl, F. Parisi-Presicci, A. Paz, P. Prusinkiewics, M.R. Sleep, A. Rosenfeld, J. Winkowski and others.

Introduction to Bisimulation and Coinduction
Introduction to Bisimulation and Coinduction

Author: Davide Sangiorgi

Publisher: Cambridge University Press

Published: 2011-10-13

Total Pages: 261

ISBN-13: 1139502832

DOWNLOAD EBOOK

Induction is a pervasive tool in computer science and mathematics for defining objects and reasoning on them. Coinduction is the dual of induction and as such it brings in quite different tools. Today, it is widely used in computer science, but also in other fields, including artificial intelligence, cognitive science, mathematics, modal logics, philosophy and physics. The best known instance of coinduction is bisimulation, mainly employed to define and prove equalities among potentially infinite objects: processes, streams, non-well-founded sets, etc. This book presents bisimulation and coinduction: the fundamental concepts and techniques and the duality with induction. Each chapter contains exercises and selected solutions, enabling students to connect theory with practice. A special emphasis is placed on bisimulation as a behavioural equivalence for processes. Thus the book serves as an introduction to models for expressing processes (such as process calculi) and to the associated techniques of operational and algebraic analysis.