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.
On a Method of Multiprogramming
Here, the authors propose a method for the formal development of parallel programs - or multiprograms as they prefer to call them. They accomplish this with a minimum of formal gear, i.e. with the predicate calculus and the well- established theory of Owicki and Gries. They show that the Owicki/Gries theory can be effectively put to work for the formal development of multiprograms, regardless of whether these algorithms are distributed or not.
Beauty Is Our Business
More than anything else, this book is a tribute to Edsger W. Dijkstra, on the occasion of his sixtieth birthday, by just a few of those fortunate enough to be influenced by him and his work and to be called his friend or relation, his master, colleague, or pupil. This book contains fifty-four technical contributions in different areas of endeavor, although many of them deal with an area of particular concern to Dijkstra: programming. Each contribution is relatively short and could be digested in one sitting. Together, they form a nice cross section of the discipline of programming at the beginning of the nineties. While many know of Dijkstra's technical contributions, they may not be aware o...
Control Flow and Data Flow: Concepts of Distributed Programming
In a time of multiprocessor machines, message switching networks and process control programming tasks, the foundations of programming distributed systems are among the central challenges for computing sci enti sts. The foundati ons of di stributed programming compri se all the fasci nating questions of computing science: the development of adequate com putational , conceptual and semantic model s for distributed systems, specification methods, verification techniques, transformation rules, the development of suitable representations by programming languages, evaluation and execution of programs describing distributed systems. Being the 7th in a series of ASI Summer Schools at Marktoberdorf,...
On the Shape of Mathematical Arguments
This book deals with the presentation and systematic design of mathematical proofs, including correctness proofs of algorithms. Its purpose is to show how completeness of argument, an important constraint especially for the correctness of algorithms, can be combined with brevity. The author stresses that the use of formalism is indispensible for achieving this. A second purpose of the book is to discuss matters of design. Rather than addressing psychological questions, the author deals with more technical questions like how analysis of the shape of the demonstrandum can guide the design of a proof. This technical rather than psychological view of heuristics together with the stress on exploiting formalism effectively are two key features of the book. The book consists of two independently readable parts. One part includes a number of general chapters discussing techniques for clear exposition, the use of formalism, the choice of notations, the choice of what to name and how to name it, and so on. The other part consists of a series of expositional essays, each dealing with a proof or an algorithm and illustrating the use of techniques discussed in the more general chapters.
Beauty Is Our Business
More than anything else, this book is a tribute to Edsger W. Dijkstra, on the occasion of his sixtieth birthday, by just a few of those fortunate enough to be influenced by him and his work and to be called his friend or relation, his master, colleague, or pupil. This book contains fifty-four technical contributions in different areas of endeavor, although many of them deal with an area of particular concern to Dijkstra: programming. Each contribution is relatively short and could be digested in one sitting. Together, they form a nice cross section of the discipline of programming at the beginning of the nineties. While many know of Dijkstra's technical contributions, they may not be aware o...
Program Design Calculi
The development of information processing systems requires models, calculi, and theories for the analysis of computations. It is well understood by now that more complex software systems cannot and should not be constructed in one step. A careful, systematic, and disciplined structuring of the development process is most adequate. It should start from basic requirement specifications in which aU the relevant details of the problem to be solved are formalized. The envisaged solution should be developed step by step by adding more and more details and giving evidence-in the best case by formal proof-to show the correctness of the developed steps. The development ends if a description of a solu...
A Practical Theory of Programming
There are several theories of programming. The first usable theory, often called "Hoare's Logic", is still probably the most widely known. In it, a specification is a pair of predicates: a precondition and postcondition (these and all technical terms will be defined in due course). Another popular and closely related theory by Dijkstra uses the weakest precondition predicate transformer, which is a function from programs and postconditions to preconditions. lones's Vienna Development Method has been used to advantage in some industries; in it, a specification is a pair of predicates (as in Hoare's Logic), but the second predicate is a relation. Temporal Logic is yet another formalism that in...
Programming Concepts and Methods PROCOMET ’98
This book constitutes the Proceedings of the IFIP Working Conference PRO COMET'98, held 8-12 June 1998 at Shelter Island, N.Y. The conference is organized by the t'wo IFIP TC 2 Working Groups 2.2 Formal Description of Programming Concepts and 2.3 Programming Methodology. WG2.2 and WG2.3 have been organizing these conferences every four years for over twenty years. The aim of such Working Conferences organized by IFIP Working Groups is to bring together leading scientists in a given area of computer science. Participation is by invitation only. As a result, these conferences distinguish themselves from other meetings by extensive and competent technical discus sions. PROCOMET stands for Programming Concepts and Methods, indicating that the area of discussion for the conference is the formal description of pro gramming concepts and methods, their tool support, and their applications. At PROCOMET working conferences, papers are presented from this whole area, reflecting the interest of the individuals in WG2.2 and WG2.3.
Advances in Petri Nets 1991
The main idea behind the series of volumes Advances in Petri Nets is to present to the general computer science community recent results which are the most representative and significant for the development of the area. Thepapers for the volumes are drawn mainly from the annual International Conferences on Applications and Theory of Petri Nets. Selected papers from the latest conference are independently refereed, and revised and extended as necessary. Some further papers submitted directly to the editor are included. Advances in Petri Nets 1991 covers the 11th International Conference on Applications and Theory of Petri Nets held in Paris, France in June 1991. The volume contains the Bibliography of Petri Nets 1990 prepared by H. Pl}nnecke and W. Reisig, with over 4000 entries.
CONCUR '91
CONCUR'91 is the second international conference on concurrency theory, organized in association with the NFI project Transfer. It is a sequel to the CONCUR'90 conference. Its basic aim is to communicate ongoing work in concurrency theory. This proceedings volume contains 30 papers selected for presentation at the conference (from 71 submitted) together with four invited papers and abstracts of the other invited papers. The papers are organized into sections on process algebras, logics and model checking, applications and specification languages, models and net theory, design and real-time, tools and probabilities, and programming languages. The proceedings of CONCUR'90 are available asVolume 458 of Lecture Notes in Computer Science.
