This monograph extends and generalizes the UNITY methodology, introduced in the late 1980s by K. Mani Chandy and Jayadev Misra as a formalism aiding in the specification and verification of parallel programs, in several directions.
This treatise further develops the ideas behind UNITY in order to explore and understand the potential and limitations of this approach: first UNITY is applied to formulate and tackle problems in parallelism such as compositionality; second, the logic and notation of UNITY is generalized in order to increase its range of applicability; finally, paradigms and abstractions useful for the design of probabilistic parallel algorithms are developed. Taken together the results presented reaffirm the promise of UNITY as a versatile medium for treating many problems of parallelism.

Bibliographic Information

Book Title: Extensions of the UNITY Methodology
Book Subtitle: Compositionality, Fairness and Probability in Parallelism
Editors: Josyula Ramachandra Rao
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-59173-7
Publisher: Springer Berlin, Heidelberg
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1995
Softcover ISBN: 978-3-540-59173-3Published: 06 April 1995
eBook ISBN: 978-3-540-49219-1Published: 01 July 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XI, 178
Topics: Computer System Implementation, Software Engineering/Programming and Operating Systems, Programming Techniques, Software Engineering, Programming Languages, Compilers, Interpreters, Logics and Meanings of Programs

Publish with us

Policies and ethics

Extensions of the UNITY Methodology

Overview

Access this book

Other ways to access

Table of contents (8 chapters)

Front Matter

Back Matter

Keywords

About this book

Bibliographic Information

Publish with us

Search

Navigation