---

＜電子ブック＞
Partial-Order Methods for the Verification of Concurrent Systems : An Approach to the State-Explosion Problem / edited by Patrice Godefroid
(Lecture Notes in Computer Science. ISSN:16113349 ; 1032)

版	1st ed. 1996.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	1996
本文言語	英語
大きさ	IV, 143 p : online resource
著者標目	Godefroid, Patrice editor SpringerLink (Online service)
件　名	LCSH:Computer science LCSH:Software engineering LCSH:Computer systems LCSH:Computer networks  FREE:Computer Science Logic and Foundations of Programming FREE:Software Engineering FREE:Computer System Implementation FREE:Computer Communication Networks FREE:Theory of Computation
一般注記	Concurrent systems and semantics -- Using partial orders to tackle state explosion -- Persistent sets -- Sleep sets -- Verification of safety properties -- Model checking -- Experiments -- Conclusions 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 HTTP:URL=https://doi.org/10.1007/3-540-60761-7

 類似資料