Verification of Sequential and Concurrent Programs

This book contains a most comprehensive text that presents syntax-directed and compositional methods for the formal verification 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 sequential and parallel, deterministic and non-deterministic, distributed and object-oriented programs. For each of the classes it presents the various criteria 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 considered, there exist a uniform underlying theory of verification which is syntaxoriented and promotes compositional approaches to verification, leading to scalability of the methods. The text strikes the proper balance between mathematical rigor and didactic 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 different levels and varying durations. It can also serve as a reference book for researchers in the theory of verification, in particular since it contains much material that never before appeared in book form. This is specially true for the treatment of object-oriented programs which is entirely novel and is strikingly elegant.

• View at Publisher
• View at Worldcat

Free Full Text ( Final Version , 2mb )