Compositionality, Concurrency, and Partial Correctness PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Compositionality, Concurrency, and Partial Correctness PDF full book. Access full book title Compositionality, Concurrency, and Partial Correctness by Job Zwiers. Download full books in PDF and EPUB format.
Author: Job Zwiers
Publisher: Springer Science & Business Media
ISBN: 9783540508458
Category : Computers
Languages : en
Pages : 284
Get Book Here
Book Description
The hierarchical decomposition of programs into smaller ones is generally considered imperative to master the complexity of large programs. The impact of this principle of program decomposition on the specification and verification of parallel executed programs is the subject of this monograph. Two important yardsticks for verification methods, those of compositionality and modularity, are made precise. The problem of reusing software is addressed by the introduction of the notion of specification adaptation. Within this context, different methods for specifying the observable behavior with respect to partial correctness of communicating processes are considered, and in particular the contrast between the "programs are predicates" and the "programs are predicate transformers" paradigms is shown. The associated formal proof systems are proven sound and complete in various senses with respect to the denotational semantics of the programming language, and they are related to each other to give an in-depth comparison between the different styles of program verification. The programming language TNP used here is near to actual languages like Occam. It combines CCS/CSP style communication based programming with state based programming, and allows dynamically expanding and shrinking networks of processes.
Author: Job Zwiers
Publisher: Springer Science & Business Media
ISBN: 9783540508458
Category : Computers
Languages : en
Pages : 284
Get Book Here
Book Description
The hierarchical decomposition of programs into smaller ones is generally considered imperative to master the complexity of large programs. The impact of this principle of program decomposition on the specification and verification of parallel executed programs is the subject of this monograph. Two important yardsticks for verification methods, those of compositionality and modularity, are made precise. The problem of reusing software is addressed by the introduction of the notion of specification adaptation. Within this context, different methods for specifying the observable behavior with respect to partial correctness of communicating processes are considered, and in particular the contrast between the "programs are predicates" and the "programs are predicate transformers" paradigms is shown. The associated formal proof systems are proven sound and complete in various senses with respect to the denotational semantics of the programming language, and they are related to each other to give an in-depth comparison between the different styles of program verification. The programming language TNP used here is near to actual languages like Occam. It combines CCS/CSP style communication based programming with state based programming, and allows dynamically expanding and shrinking networks of processes.
Author: Willem-Paul de Roever
Publisher: Springer
ISBN: 3540492135
Category : Computers
Languages : en
Pages : 655
Get Book Here
Book Description
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.
Author: Marta Z. Kwiatkowska
Publisher: Springer Science & Business Media
ISBN: 1447138600
Category : Computers
Languages : en
Pages : 353
Get Book Here
Book Description
The semantics of concurrent systems is one of the most vigorous areas of research in theoretical computer science, but suffers from disagree ment due to different, and often incompatible, attitudes towards abstracting non-sequential behaviour. When confronted with process algebras, which give rise to very elegant, highly abstract and com positional models, traditionally based on the interleaving abstraction, some argue that the wealth of contribution they have made is partially offset by the difficulty in dealing with topics such as faimess. On the other hand, the non-interleaving approaches, based on causality, although easing problems with fairness and confusion, still lack struc ture, compositionality, and the elegance of the interleaving counter parts. Since both these approaches have undoubtedly provided important contributions towards understanding of concurrent systems, one should concentrate on what they have in common, rather than the way they differ. The Intemational Workshop on Semantics for Concurrency held at the University of Leicester on 23-25 July 1990 was organised to help overcome this problem. Its main objective was not to be divisive, but rather to encourage discussions leading towards the identification of the positive objective features of the main approaches, in the hope of furthering common understanding. The Workshop met with an excel lent response, and attracted contributions from all over the world. The result was an interesting and varied programme, which was a combi nation of invited and refereed papers. The invited speakers were: Prof. dr. E. Best (Hildesheim University) Prof. dr. A.
Author: Joseph M. Morris
Publisher: Springer Science & Business Media
ISBN: 1447137566
Category : Mathematics
Languages : en
Pages : 488
Get Book Here
Book Description
This volume contains the proceedings ofthe 4th Refinement Workshop which was organised by the British Computer Society specialist group in Formal Aspects of Computing Science and held in Wolfson College, Cambridge, on 9-11 January, 1991. The term refinement embraces the theory and practice of using formal methods for specifying and implementing hardware and software. Most of the achievements to date in the field have been in developing the theoretical framework for mathematical approaches to programming, and on the practical side in formally specifying software, while more recently we have seen the development of practical approaches to deriving programs from their speCifications. The workshop gives a fair picture of the state of the art: it presents new theories for reasoning about software and hardware and case studies in applying known theory to interesting small-and medium-scale problems. We hope the book will be Of interest both to researchers in formal methods, and to software engineers in industry who want to keep abreast of possible applications of formal methods in industry. The programme consisted both of invited talks and refereed papers. The invited speakers were Ib S0rensen, Jean-Raymond Abrial, Donald MacKenzie, Ralph Back, Robert Milne, Mike Read, Mike Gordon, and Robert Worden who gave the introductory talk. This is the first refinement workshop that solicited papers for refereeing, and despite a rather late call for papers the response was excellent.
Author: Krzysztof Apt
Publisher: Springer Science & Business Media
ISBN: 184882744X
Category : Computers
Languages : en
Pages : 512
Get Book Here
Book Description
HIS BOOK CONTAINS a most comprehensive text that presents syntax-directed and compositional methods for the formal veri?- T cation of programs. The approach is not language-bounded in the sense that it covers a large variety of programming models and features that appear in most modern programming languages. It covers the classes of - quential and parallel, deterministic and non-deterministic, distributed and object-oriented programs. For each of the classes it presents the various c- teria of correctness that are relevant for these classes, such as interference freedom, deadlock freedom, and appropriate notions of liveness for parallel programs. Also, special proof rules appropriate for each class of programs are presented. In spite of this diversity due to the rich program classes cons- ered, there exist a uniform underlying theory of veri?cation which is synt- oriented and promotes compositional approaches to veri?cation, leading to scalability of the methods. The text strikes the proper balance between mathematical rigor and - dactic introduction of increasingly complex rules in an incremental manner, adequately supported by state-of-the-art examples. As a result it can serve as a textbook for a variety of courses on di?erent levels and varying durations. It can also serve as a reference book for researchers in the theory of veri?- tion, in particular since it contains much material that never before appeared in book form. This is specially true for the treatment of object-oriented p- grams which is entirely novel and is strikingly elegant.
Author: Carl E. Landwehr
Publisher: Springer Science & Business Media
ISBN: 3709140099
Category : Computers
Languages : en
Pages : 380
Get Book Here
Book Description
This volume contains the papers presented. at the Third IFIP International Working Conference on Dependable Computing for Critical Applications, sponsored by IFIP Working Group 10.4 and held in Mondello (Sicily), Italy on September 14-16, 1992. System developers increasingly apply computers where they can affect the safety and security of people and equipment. The Third IFIP International Working Conference on Dependable Computing for Critical Applications, like its predecessors, addressed various aspects of computer system dependability, a broad term defined as the degree of trust that may justifiably be placed in a system's reliability, availability, safety, security, and performance. Because the scope of the conference was so broad, we hope the presentations and discussions will contribute to the integration of these concepts so that future computer-based systems will indeed be more dependable. The Program Committee selected 18 papers for presentation from a total of 7 4 submissions at a May meeting in Newcastle upon Tyne, UK. The resulting program represented a broad spectrum of interests, with papers from universities, corporations, and government agencies in eight countries. Much diligent work by the Program Committee and the quality of reviews from more than a hundred external referees from around the world, for which we are most grateful, significantly eased the production of this technical program.
Author: H. S. M. Zedan
Publisher: Butterworth-Heinemann
ISBN: 1483192326
Category : Computers
Languages : en
Pages : 320
Get Book Here
Book Description
Distributed Computer Systems: Theory and Practice is a collection of papers dealing with the design and implementation of operating systems, including distributed systems, such as the amoeba system, argus, Andrew, and grapevine. One paper discusses the concepts and notations for concurrent programming, particularly language notation used in computer programming, synchronization methods, and also compares three classes of languages. Another paper explains load balancing or load redistribution to improve system performance, namely, static balancing and adaptive load balancing. For program efficiency, the user can choose from various debugging approaches to locate or fix errors without significantly disturbing the program behavior. Examples of debuggers pertain to the ada language and the occam programming language. Another paper describes the architecture of a real-time distributed database system used for computer network management, monitoring integration, as well as administration and control of both local area or wide area communications networks. The book can prove helpful to programmers, computer engineers, computer technicians, and computer instructors dealing with many aspects of computers, such as programming, hardware interface, networking, engineering or design.
Author: Jozef Hooman
Publisher: Springer Science & Business Media
ISBN: 9783540549475
Category : Computers
Languages : en
Pages : 254
Get Book Here
Book Description
The research described in this monograph concerns the formal specification and compositional verification of real-time systems. A real-time programminglanguage is considered in which concurrent processes communicate by synchronous message passing along unidirectional channels. To specifiy functional and timing properties of programs, two formalisms are investigated: one using a real-time version of temporal logic, called Metric Temporal Logic, and another which is basedon extended Hoare triples. Metric Temporal Logic provides a concise notationto express timing properties and to axiomatize the programming language, whereas Hoare-style formulae are especially convenient for the verification of sequential constructs. For both approaches a compositional proof system has been formulated to verify that a program satisfies a specification. To deduce timing properties of programs, first maximal parallelism is assumed, modeling the situation in which each process has itsown processor. Next, this model is generalized to multiprogramming where several processes may share a processor and scheduling is based on priorities. The proof systems are shown to be sound and relatively complete with respect to a denotational semantics of the programming language. The theory is illustrated by an example of a watchdog timer.
Author: Krzysztof R. Apt
Publisher: Springer Science & Business Media
ISBN: 1475727143
Category : Computers
Languages : en
Pages : 371
Get Book Here
Book Description
A major challenge for computer science is to develop methods that ensure program correctness. This textbook provides a structured introduction to program verification using an assertional approach - so called because it relies on the use of assertions that are attached to program control points. Sequential programs in the form of deterministic and non-deterministic programs, and concurrent programs in the form of parallel and distributed programs are considered within the context of their partial and total correctness. The use of these proof systems is demonstrated with the help of case studies. In particular, solutions to classical problems such as mutual exclusion are formally verified. Each chapter concludes with exercises and bibliographic remarks for further reading. As a result, this text is suitable as either an introductory course on program verification for the upper division of undergraduate studies or for graduate studies. It can also be used as an introduction to operational semantics. Outlines of possible courses are presented in the preface of the book.
Author: Jacobus W. De Bakker
Publisher: Springer Science & Business Media
ISBN: 9783540164883
Category : Computers
Languages : en
Pages : 736
Get Book Here
Book Description
