This monograph is a revised version of the author's Ph.D. thesis, submitted to the University of Liège, 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.
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem (Lecture Notes in Computer Science, 1032)
📄 Viewing lite version
Full site ›
Book Details
Author(s)Godefroid, Patrice
PublisherSpringer
ISBN / ASIN3540607617
ISBN-139783540607618
AvailabilityIn Stock.
Sales Rank7,623,835
CategoryComputers
MarketplaceUnited States 🇺🇸
Description ▲
More Books in Computers
Windows XP, Vol. 1 (SELECT Series)
View
Internet Searching and Indexing: The Subject Approach
View
Control Problems in Industry: Proceedings from the SIA…
View
Open Source Systems Security Certification
View
Java: Data Structures and Programming
View
User-Centered Web Development
View
Query Processing in Database Systems (Topics in Inform…
View
Fundamentals of SQL Server 2005
View
Dreamweaver CS4: The Missing Manual (Spanish Edition)
View