verification sequential concurrent programs von apt krzysztof (15 Ergebnisse)

Zustand: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.

Zustand: Gut. Zustand: Gut | Sprache: Englisch | Produktart: Bücher.

Hardcover. Zustand: Good. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported.

Zustand: Good. Most items will be dispatched the same or the next working day. A copy that has been read but remains in clean condition. All of the pages are intact and the cover is intact and the spine may show signs of wear. The book may have minor markings which are not specifically mentioned. Ex library copy with usual stamps & stickers.

Zustand: New. In.

Taschenbuch. Zustand: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 528 pp. Englisch.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Zustand: New. In.

Buch. Zustand: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 528 pp. Englisch.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Zustand: New. In.

Zustand: New. pp. 528 26 Illus.

Springer 1991 cloth, 441 pp. ISBN (3540975322) (code Sc-60).

Hardcover. Zustand: Brand New. 3rd edition. 502 pages. 9.50x6.50x1.25 inches. In Stock.

Springer 1997 cltoh, 2nd edition, 364 pp. ISBN (9780387948966) (code Sc-36).