Verification Sequential Concurrent Programs by Apt Krzysztof (40 results)

Hardcover. Condition: Good. It's a preowned item in good condition and includes all the pages. It may have some general signs of wear and tear, such as markings, highlighting, slight damage to the cover, minimal wear to the binding, etc., but they will not affect the overall reading experience.

hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!

Hardcover. Condition: Very Good. 3rd ed. 2009, Corr. 3rd printing. Hardcover book with no markings in good condition.Good clean pages-minor wear.Good clean cover.

Condition: 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.

Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.

Hardcover. Condition: Near Fine. 3rd Edition. Hardcover, 3rd edition, xxiii + 502 pages, NOT ex-library. Shipping weight over 1kg. Signs of mild wear, book is clean and bright with unmarked text, free of inscriptions and stamps, firmly bound. Issued without a dust jacket. -- An in-depth exploration of the methodologies and techniques used for verifying the correctness of both sequential and concurrent programs. This comprehensive text delves into the theoretical foundations and practical applications of program verification. The book covers a range of topics, including formal methods, algorithmic analysis, and model checking, making it an essential resource for computer scientists, researchers, and students interested in ensuring software reliability and performance. With its detailed explanations and illustrative examples, the book equips readers with the knowledge needed to address complex verification challenges in modern computing systems.

Condition: New.

Condition: new.

Condition: New.

Condition: New.

Hardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condition: New.

Condition: New. pp. 528 3rd Printing Edition.

Condition: New.

Condition: Gut. Zustand: Gut | Seiten: 388 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Condition: New. pp. 528 3rd Printing Edition.

Taschenbuch. Condition: 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. Condition: 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.

Buch. Condition: 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.

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

Paperback. Condition: Like New. Like New. book.

Buch. Condition: 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.

Condition: As New. Unread book in perfect condition.

Hardcover. Condition: Like New. Like New. book.

Condition: As New. Unread book in perfect condition.

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

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

PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - 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. 528 pp. Englisch.