ID - 87292 TI - Partial-Order Methods for the Verification of Concurrent Systems : An Approach to the State-Explosion Problem PY - 1995 VL - 1032 SN - 3540607617 0387607617 3540494448 9783540607618 PB - Liège : Université de Liège, Faculté des sciences appliquées (ULg), DB - UniCat KW - Programming KW - Parallel processing (Electronic computers) KW - Parallelle verwerking (Computers) KW - Traitement parallèle (Ordinateurs) KW - Computer software KW - Logiciels KW - Parallélisme (Informatique) KW - Verification KW - Vérification KW - Verification. KW - Parallel processing (Electronic computers). KW - Parallélisme (Informatique) KW - Vérification KW - Logic design. KW - Software engineering. KW - Computer network architectures. KW - Computer Communication Networks. KW - Computer science. KW - Logics and Meanings of Programs. KW - Software Engineering/Programming and Operating Systems. KW - Computer System Implementation. KW - Software Engineering. KW - Computation by Abstract Devices. KW - Informatics KW - Science KW - Computer software engineering KW - Engineering KW - Design, Logic KW - Design of logic systems KW - Digital electronics KW - Electronic circuit design KW - Logic circuits KW - Machine theory KW - Switching theory KW - Architectures, Computer network KW - Network architectures, Computer KW - Computer architecture KW - Computer software - Verification. UR - https://www.unicat.be/uniCat?func=search&query=sysid:87292 AB - 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. ER -