|
![]() |
|||
|
||||
OverviewThis monograph is a revised version of the author's Ph.D. thesis, submitted to the University of Liege, Belgium, with Pierre Wolper as thesis advisor.The general pattern of this work, is to turn logical and semantic ideas into exploitable algorithms. Thus, it perfectly fits the modern trend, viewing verification as a computer-aided activity, and as algorithmic as possible, not as a paper and pencil one, dealing exclusively with semantic and logical issues. Patrice Godefroid uses state-space exploration as the key technique, which, as such or elaborated into model checking, is attracting growing attention for the verification of concurrent systems. For most realistic examples, the methods presented provide a significant reduction of memory and time requirements for protocol verification. Full Product DetailsAuthor: Patrice GodefroidPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Edition: 1996 ed. Volume: 1032 Dimensions: Width: 15.50cm , Height: 0.80cm , Length: 23.50cm Weight: 0.510kg ISBN: 9783540607618ISBN 10: 3540607617 Pages: 143 Publication Date: 24 January 1996 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: In Print ![]() This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsConcurrent systems and semantics.- Using partial orders to tackle state explosion.- Persistent sets.- Sleep sets.- Verification of safety properties.- Model checking.- Experiments.- Conclusions.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |