By Jayadev Misra

ISBN-10: 0387952063

ISBN-13: 9780387952062

During this publication, a programming version is built that addresses the elemental problems with 'large-scale programming'. The method unifies numerous innovations from database thought, object-oriented programming and designs of reactive platforms. The version and the linked thought has been christened "Seuss." the main aim of Seuss is to simplify multiprogramming. To this finish, the fear of concurrent implementation is separated from the middle software layout challenge. A application execution is known as a unmarried thread of keep an eye on - sequential executions of activities which are selected in keeping with a few scheduling coverage. thus, it really is attainable to cause concerning the homes of a application from its unmarried execution thread.

Show description

Read or Download A Discipline of Multiprogramming: Programming Theory for Distributed Applications (Monographs in Computer Science) PDF

Similar computer science books

New PDF release: Lessons Learned in Software Testing: A Context-Driven

The world's prime software program checking out specialists lend you their knowledge and years of expertise that will help you stay away from the most typical blunders in checking out software program. each one lesson is an statement relating to software program checking out, through an evidence or instance that exhibits you the how, whilst, and why of the trying out lesson.

Extra resources for A Discipline of Multiprogramming: Programming Theory for Distributed Applications (Monographs in Computer Science)

Example text

Additionally, establishment of progress properties, such as that execution of each action achieves a certain goal -planning a meeting, for instance-- requires a theory that is more general than the study of invariants. We propose such a theory in this book. 5 Bibliographic Notes The programming model that most closely resembles the approach presented here is transaction processing. There is a vast amount of literature on that subject; we refer the reader to Gray and Reuter [78] for a comprehensive survey.

The declaration of a cat or box includes its name and possibly parameters. The ids of programs, cats, and boxes are simple identifiers. The parameters of a cat or box can be ordinary variables, cats or boxes (see program MutualExclusionl on page 47 for an example of cat declaration with parameters) . A cat consists of zero or more variable declarations followed by procedure declarations. A box is an instance of a cat. We adopt the convention that several boxes may be instantiated under one "box" declaration.

Let predicate bi hold in exactly those states where the execution of Si has no effect. Then Observe that FP holds in any state where all giS are false. It is easy to compute bi if Si is an assignment statement. For the assignment statement x := e the corresponding predicate is x = e. That is, execution of x := e has no effect exactly when x = e holds prior to the execution. 2 for details. 1, we compute! 1 for an explanation of the proof format used here. 18 2. Action Systems FP = = {from the definition of FP} (x < y ~ x = x + 1) /\ (y = max(x, y) {arithmetic and predicate calculus} (x 2: y) /\ (false) {predicate calculus} false + 1) That is, each state of small can potentially be changed.

Download PDF sample

A Discipline of Multiprogramming: Programming Theory for Distributed Applications (Monographs in Computer Science) by Jayadev Misra

by Mark

Rated 4.76 of 5 – based on 38 votes