000 05311cam a2200817 a 4500
001 ocn605245978
003 OCoLC
005 20250703151310.0
006 m o d
007 cr bn||||||abp
007 cr bn||||||ada
008 100406s1996 gw a ob 001 0 eng d
040 _aOCLCE
_beng
_epn
_cOCLCE
_dOCLCQ
_dOCLCO
_dGW5XE
_dOCLCQ
_dCUSER
_dOCLCQ
_dOCLCF
_dITD
_dOCLCQ
_dLIP
_dUAB
_dESU
_dOCLCQ
_dVT2
_dSHS
_dOCLCQ
_dCEF
_dDEHBZ
_dOCLCQ
_dAU@
_dOCLCQ
_dLEAUB
_dOL$
_dOCLCQ
_dKIJ
_dINARC
_dEUX
_dOCLCQ
_dOCLCO
_dOCLCQ
_dOCLCO
_dOCLCL
015 _a96,A25,0604
_2dnb
015 _a96,N05,0327
_2dnb
016 7 _a946226563
_2DE-101
019 _a326704941
_a608378119
_a990474006
_a993775657
_a1001488274
_a1005763415
_a1006391124
_a1009303831
_a1012877901
_a1014422282
_a1020026137
_a1036774840
_a1038496113
_a1039704007
_a1044451369
_a1060932996
_a1073082640
_a1081279583
_a1086466348
_a1119449747
_a1150999421
_a1162786901
_a1239211859
020 _a9783540494447
_q(electronic bk.)
020 _a3540494448
_q(electronic bk.)
020 _z3540607617
_q(Berlin ;
_qsoftcover ;
_qacid-free paper)
020 _z9783540607618
_q(Berlin ;
_qsoftcover ;
_qacid-free paper)
024 7 _a10.1007/3-540-60761-7
_2doi
029 1 _aAU@
_b000051697331
029 1 _aNZ1
_b14996759
029 1 _aNZ1
_b15300191
035 _a(OCoLC)605245978
_z(OCoLC)326704941
_z(OCoLC)608378119
_z(OCoLC)990474006
_z(OCoLC)993775657
_z(OCoLC)1001488274
_z(OCoLC)1005763415
_z(OCoLC)1006391124
_z(OCoLC)1009303831
_z(OCoLC)1012877901
_z(OCoLC)1014422282
_z(OCoLC)1020026137
_z(OCoLC)1036774840
_z(OCoLC)1038496113
_z(OCoLC)1039704007
_z(OCoLC)1044451369
_z(OCoLC)1060932996
_z(OCoLC)1073082640
_z(OCoLC)1081279583
_z(OCoLC)1086466348
_z(OCoLC)1119449747
_z(OCoLC)1150999421
_z(OCoLC)1162786901
_z(OCoLC)1239211859
042 _adlr
050 4 _aQA76.58
_b.G63 1996
072 7 _aUM
_2bicssc
072 7 _aUYF
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aCOM036000
_2bisacsh
072 7 _aUM
_2thema
072 7 _aUYF
_2thema
082 0 4 _a005.2
_220
_1https://id.oclc.org/worldcat/ddc/E37WrBVmGmMrM8rPcWBJy7RtXT
084 _a54.52
_2bcl
049 _aMAIN
100 1 _aGodefroid, Patrice.
_926956
245 1 0 _aPartial-order methods for the verification of concurrent systems :
_ban approach to the state-explosion problem /
_cPatrice Godefroid.
260 _aBerlin ;
_aNew York :
_bSpringer,
_c©1996.
300 _a1 online resource (142 pages) :
_billustrations
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
347 _bPDF
490 1 _aLecture notes in computer science ;
_v1032
504 _aIncludes bibliographical references (pages 133-142) and index.
505 0 _a1. Introduction -- 2. Concurrent Systems and Semantics -- 3. Using Partial Orders to Tackle State Explosion -- 4. Persistent Sets -- 5. Sleep Sets -- 6. Verification of Safety Properties -- 7. Model Checking -- 8. Experiments -- 9. Conclusions.
506 _3Use copy
_fRestrictions unspecified
_2star
_5MiAaHDL
533 _aElectronic reproduction.
_b[Place of publication not identified] :
_cHathiTrust Digital Library,
_d2010.
_5MiAaHDL
538 _aMaster and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
_uhttp://purl.oclc.org/DLF/benchrepro0212
_5MiAaHDL
583 1 _adigitized
_c2010
_hHathiTrust Digital Library
_lcommitted to preserve
_2pda
_5MiAaHDL
520 _aThis monograph is a revised version of the author's Ph. D. thesis, submitted to the University of Lige, 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.
588 0 _aPrint version record.
546 _aEnglish.
650 0 _aParallel processing (Electronic computers)
_912960
650 0 _aComputer software
_xVerification.
_91930
650 6 _aLogiciels
_xVérification.
_920690
650 6 _aParallélisme (Informatique)
_918914
650 7 _aComputer software
_xVerification
_2fast
_91930
650 7 _aParallel processing (Electronic computers)
_2fast
_912960
650 1 7 _aParallelle verwerking.
_2gtt
_914828
650 7 _aParallélisme (informatique)
_2ram
_918914
650 7 _aLogiciels
_xEssais.
_2ram
_937675
776 0 8 _iPrint version:
_aGodefroid, Patrice.
_tPartial-order methods for the verification of concurrent systems.
_dBerlin ; New York : Springer, ©1996
_w(DLC) 95051354
_w(OCoLC)33947067
830 0 _aLecture notes in computer science ;
_v1032.
856 4 0 _uhttps://link.springer.com/10.1007/3-540-60761-7
938 _aInternet Archive
_bINAR
_npartialordermeth0000gode
994 _a92
_bATIST
999 _c639858
_d639858