Welcome to our book review site go-pdf.online!
You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
TAPSOFT '91 - Volume 2
TAPSOFT '91 is the Fourth International Joint Conference on Theory and Practice of Software Development. It was held in Brighton, April 8-12, 1991, and was organized by the Department of Computing, Imperial College, London. The proceedings of TAPSOFT '91 are organized into three parts: - Advances in Distributed Computing (ADC) - Colloquium on Trees in Algebra and Programming (CAAP) - Colloquium on Combining Paradigms for Software Development (CCPSD) The proceedings are published in two volumes. The first volume (LNCS, Vol. 493) contains the papers from CAAP. The second volume (LNCS, Vol. 494) contains the papers from the ADC and CCPSD. The ADC talks by distinguished invited speakers surveys current developments in distributed computing, including the integration of different paradigms for concurrency, algebraic, logical and operational foundations, and applications to software engineering and formal methods. The CCPSD papers address aspects of the trend in software enginering towards unification and synthesis combining theory and practice, and merging hitherto diverse approaches.
Ten Years Of Concurrency Semantics: Selected Papers Of The Amsterdam Concurrency Group
This collection of reprints describes a unified treatment of semantics, covering a wide range of notions in parallel languages. Included are several foundational and introductory papers developing the methodology of metric semantics, studies on the comparative semantics of parallel object-oriented and logic programming, and papers on full abstraction and transition system specifications. In addition, links with process algebra and the theory of domain equations are established. Throughout, a uniform proof technique is used to relate operational and denotational models. The approach is flexible in that both linear time, branching time (or bisimulation) and intermediate models can be handled, as well as schematic and interpreted elementary actions. The reprints are preceded by an extensive introduction surveying related work on metric semantics.
Report CS-R
None
Compositionality: The Significant Difference
This book originates from the International Symposium on Compositionality, COMPOS'97, held in Bad Malente, Germany in September 1997. The 25 chapters presented in revised full version reflect the current state of the art in the area of compositional reasoning about concurrency. The book is a valuable reference for researchers and professionals interested in formal systems design and analysis; it also is well suited for self study and use in advanced courses.
Mathematical Foundations of Computer Science 1996
This book constitutes the refereed proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science, MFCS '96, held in Crakow, Poland in September 1996. The volume presents 35 revised full papers selected from a total of 95 submissions together with 8 invited papers and 2 abstracts of invited talks. The papers included cover issues from the whole area of theoretical computer science, with a certain emphasis on mathematical and logical foundations. The 10 invited presentations are of particular value.
CONCUR '94: Concurrency Theory
This volume constitutes the proceedings of the Fifth International Conference on Concurrency Theory, CONCUR '94, held at Uppsala, Sweden in August 1994. In total, 29 refereed research papers selected from 108 submissions for the conference are presented together with full papers or abstracts of the 5 invited talks by prominent speakers. The book contains recent results on all relevant aspects of concurrency research and thus competently documents the progress of the field since the predecessor conference CONCUR '93, the proceedings of which are published as LNCS 715.
Introduction to Process Algebra
Automated and semi-automated manipulation of so-called labelled transition systems has become an important means in discovering flaws in software and hardware systems. Process algebra has been developed to express such labelled transition systems algebraically, which enhances the ways of manipulation by means of equational logic and term rewriting. The theory of process algebra has developed rapidly over the last twenty years, and verification tools have been developed on the basis of process algebra, often in cooperation with techniques related to model checking. This textbook gives a thorough introduction into the basics of process algebra and its applications.
