Directed Algebraic Topology and Concurrency

Directed Algebraic Topology and Concurrency

Author: Lisbeth Fajstrup

Publisher: Springer

Published: 2016-03-02

Total Pages: 171

ISBN-13: 3319153986

DOWNLOAD EBOOK

This monograph presents an application of concepts and methods from algebraic topology to models of concurrent processes in computer science and their analysis. Taking well-known discrete models for concurrent processes in resource management as a point of departure, the book goes on to refine combinatorial and topological models. In the process, it develops tools and invariants for the new discipline directed algebraic topology, which is driven by fundamental research interests as well as by applications, primarily in the static analysis of concurrent programs. The state space of a concurrent program is described as a higher-dimensional space, the topology of which encodes the essential properties of the system. In order to analyse all possible executions in the state space, more than “just” the topological properties have to be considered: Execution paths need to respect a partial order given by the time flow. As a result, tools and concepts from topology have to be extended to take privileged directions into account. The target audience for this book consists of graduate students, researchers and practitioners in the field, mathematicians and computer scientists alike.


Non-Hausdorff Topology and Domain Theory

Non-Hausdorff Topology and Domain Theory

Author: Jean Goubault-Larrecq

Publisher: Cambridge University Press

Published: 2013-03-28

Total Pages: 499

ISBN-13: 1107328772

DOWNLOAD EBOOK

This unique book on modern topology looks well beyond traditional treatises and explores spaces that may, but need not, be Hausdorff. This is essential for domain theory, the cornerstone of semantics of computer languages, where the Scott topology is almost never Hausdorff. For the first time in a single volume, this book covers basic material on metric and topological spaces, advanced material on complete partial orders, Stone duality, stable compactness, quasi-metric spaces and much more. An early chapter on metric spaces serves as an invitation to the topic (continuity, limits, compactness, completeness) and forms a complete introductory course by itself. Graduate students and researchers alike will enjoy exploring this treasure trove of results. Full proofs are given, as well as motivating ideas, clear explanations, illuminating examples, application exercises and some more challenging problems for more advanced readers.


The Formal Semantics of Programming Languages

The Formal Semantics of Programming Languages

Author: Glynn Winskel

Publisher: MIT Press

Published: 1993-02-05

Total Pages: 388

ISBN-13: 9780262731034

DOWNLOAD EBOOK

The Formal Semantics of Programming Languages provides the basic mathematical techniques necessary for those who are beginning a study of the semantics and logics of programming languages. These techniques will allow students to invent, formalize, and justify rules with which to reason about a variety of programming languages. Although the treatment is elementary, several of the topics covered are drawn from recent research, including the vital area of concurency. The book contains many exercises ranging from simple to miniprojects.Starting with basic set theory, structural operational semantics is introduced as a way to define the meaning of programming languages along with associated proof techniques. Denotational and axiomatic semantics are illustrated on a simple language of while-programs, and fall proofs are given of the equivalence of the operational and denotational semantics and soundness and relative completeness of the axiomatic semantics. A proof of Godel's incompleteness theorem, which emphasizes the impossibility of achieving a fully complete axiomatic semantics, is included. It is supported by an appendix providing an introduction to the theory of computability based on while-programs. Following a presentation of domain theory, the semantics and methods of proof for several functional languages are treated. The simplest language is that of recursion equations with both call-by-value and call-by-name evaluation. This work is extended to lan guages with higher and recursive types, including a treatment of the eager and lazy lambda-calculi. Throughout, the relationship between denotational and operational semantics is stressed, and the proofs of the correspondence between the operation and denotational semantics are provided. The treatment of recursive types - one of the more advanced parts of the book - relies on the use of information systems to represent domains. The book concludes with a chapter on parallel programming languages, accompanied by a discussion of methods for specifying and verifying nondeterministic and parallel programs.


Perspectives in Concurrency

Perspectives in Concurrency

Author: Kamal Lodaya

Publisher: CRC Press

Published: 2009-04-15

Total Pages: 0

ISBN-13: 9781439809433

DOWNLOAD EBOOK

Concurrency theory is an important research area within theoretical computer science, with applications in parallel and distributed computing. This book provides an overview of current research in concurrency through state-of-the-art contributions from worldwide experts. Covering contemporary topics, including Petri Nets, Temporal Logics, Program Verification with concurrent threads, Computational Trust, and more, this book presents emerging research in this important field.


The Origin of Concurrent Programming

The Origin of Concurrent Programming

Author: Per Brinch Hansen

Publisher: Springer Science & Business Media

Published: 2013-06-29

Total Pages: 532

ISBN-13: 1475734727

DOWNLOAD EBOOK

An essential reader containing 19 important papers on the invention and early development of concurrent programming and its relevance to computer science and computer engineering. All of them are written by the pioneers in concurrent programming, including Brinch Hansen himself, and have introductions added that summarize the papers and put them in perspective. The editor provides an overview chapter and neatly places all developments in perspective with chapter introductions and expository apparatus. Essential resource for graduates, professionals, and researchers in CS with an interest in concurrent programming principles. A familiarity with operating system principles is assumed.


Principles of Blockchain Systems

Principles of Blockchain Systems

Author: Antonio Fernández Anta

Publisher: Morgan & Claypool Publishers

Published: 2021-08-22

Total Pages: 235

ISBN-13: 1636391699

DOWNLOAD EBOOK

This book is the first to present the state of the art and provide technical focus on the latest advances in the foundations of blockchain systems. It is a collaborative work between specialists in cryptography, distributed systems, formal languages, and economics, and addresses hot topics in blockchains from a theoretical perspective: cryptographic primitives, consensus, formalization of blockchain properties, game theory applied to blockchains, and economical issues. This book reflects the expertise of the various authors, and is intended to benefit researchers, students, and engineers who seek an understanding of the theoretical foundations of blockchains.


Applications of Process Algebra

Applications of Process Algebra

Author: J. C. M. Baeten

Publisher:

Published: 1990

Total Pages: 344

ISBN-13:

DOWNLOAD EBOOK

This book gives applications of the theory of process algebra, or Algebra of Communicating Processes (ACP), that is the study of concurrent or communicating processes studied using an algebraic framework. The approach is axiomatic; the authors consider structures that are some set of mostly equational axioms, which are equipped with several operators. Thus the term 'algebra' is used in the model-theoretic sense. The axiomatic approach enables one to organize the field of process theories. The theory is applied systematically to a number of situations, including systolic algorithms, semantics of an object-oriented language, and protocols. It will be welcomed by computer scientists working in parallel programming.


Advances in Linear Logic

Advances in Linear Logic

Author: Jean-Yves Girard

Publisher: Cambridge University Press

Published: 1995-06-22

Total Pages: 401

ISBN-13: 0521559618

DOWNLOAD EBOOK

This volume gives an overview of linear logic that will be useful to mathematicians and computer scientists working in this area.