{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T01:51:49Z","timestamp":1679881909563},"reference-count":29,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1016\/s0140-3664(96)01150-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:56:11Z","timestamp":1027637771000},"page":"97-105","source":"Crossref","is-referenced-by-count":6,"title":["Designing bug-free protocols with SPIN"],"prefix":"10.1016","volume":"20","author":[{"given":"Gerard J.","family":"Holzmann","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(96)01150-4_BIB1","series-title":"Proc. 4th International Computer Conference","first-page":"749","article-title":"Automatically verified data transfer protocols","author":"Hajek","year":"1978"},{"issue":"4","key":"10.1016\/S0140-3664(96)01150-4_BIB2","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1147\/rd.224.0393","article-title":"General technique for communications protocol validation","volume":"22","author":"West","year":"1978","journal-title":"IBM J. Research and Development"},{"key":"10.1016\/S0140-3664(96)01150-4_BIB3","series-title":"Proc. First IFIP\/WG6.1 Symp. on Protocol Specification, Testing, and Verification, PSTV81","article-title":"An algebra for protocol validation","author":"Holzmann","year":"1981"},{"key":"10.1016\/S0140-3664(96)01150-4_BIB4","series-title":"Proc. Logic of Programs: Workshop","article-title":"Synthesis of synchronization skeletons for branching time temporal logic","volume":"Vol 131","author":"Clarke","year":"1981"},{"key":"10.1016\/S0140-3664(96)01150-4_BIB5","series-title":"Proc. 5th Int. Symposium on Programmiong","first-page":"195","article-title":"Specification and verification of concurrent programs in Cesar","volume":"vol. 137","author":"Quielle","year":"1982"},{"issue":"2","key":"10.1016\/S0140-3664(96)01150-4_BIB6_1","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1002\/spe.4380180203","article-title":"An improved protocol reachability analysis technique","volume":"18","author":"Holzmann","year":"1988","journal-title":"Software, Practice and Experience"},{"key":"10.1016\/S0140-3664(96)01150-4_BIB6_2","series-title":"Proc. PSTV87 Conference","author":"Holzmann","year":"1981"},{"key":"10.1016\/S0140-3664(96)01150-4_BIB7","series-title":"Symbolic Model Checking","author":"McMillan","year":"1993"},{"key":"10.1016\/S0140-3664(96)01150-4_BIB8","series-title":"6th Int. Conf. on Computer Aided Verification","article-title":"Combining partial order reductions with on-the-fly model checking","author":"Peled","year":"1994"},{"key":"10.1016\/S0140-3664(96)01150-4_BIB9","series-title":"Proc. 7th FORTE Conference","article-title":"An improvement in formal verification","author":"Holzmann","year":"1994"},{"key":"10.1016\/S0140-3664(96)01150-4_BIB10","series-title":"Proc. 4th FORTE Conference","first-page":"83","article-title":"Formal methods at AT&T, an industrial usage report","author":"Chaves","year":"1991"},{"key":"10.1016\/S0140-3664(96)01150-4_BIB11","series-title":"Proc. 7th FORTE Conferernce","first-page":"35","article-title":"Modelization and verification of a multiprocessor realtime OS kernel","author":"Cattel","year":"1994"},{"key":"10.1016\/S0140-3664(96)01150-4_BIB12","series-title":"Proc. 13th IFIP World Computer Congress","first-page":"35","article-title":"The theory and practice of a formal method: NewCoRe","author":"Holzmann","year":"1994"},{"key":"10.1016\/S0140-3664(96)01150-4_BIB13","article-title":"Model checking in practice: an analysis of the ACCESS.bus(tm) protocols using SPIN","author":"Boigelot","year":"1995","journal-title":"Report Univ. of Liege, Belgium and AT&T Bell Laboratories"},{"key":"10.1016\/S0140-3664(96)01150-4_BIB14","first-page":"96","article-title":"Distributed Algorithms and Protocols","author":"Raynal","year":"1988"},{"issue":"2","key":"10.1016\/S0140-3664(96)01150-4_BIB15","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1145\/357094.357101","article-title":"Output guards and non-determinism in CSP","volume":"2","author":"Bernstein","year":"1980","journal-title":"ACM Toplas"},{"key":"10.1016\/S0140-3664(96)01150-4_BIB16","doi-asserted-by":"crossref","unstructured":"E.W. Dijkstra, Guarded commands, nondeterminacy and formal derivation of programs, Comm. ACM, 18(8) 453\u2013457.","DOI":"10.1145\/360933.360975"},{"key":"10.1016\/S0140-3664(96)01150-4_BIB17","doi-asserted-by":"crossref","unstructured":"C.A.R. Hoare, Communicating sequential processes, Comm. ACM, 21(8) 666\u2013677.","DOI":"10.1145\/359576.359585"},{"key":"10.1016\/S0140-3664(96)01150-4_BIB18","series-title":"Design and Validation of Computer Protocols","author":"Holzmann","year":"1991"},{"key":"10.1016\/S0140-3664(96)01150-4_BIB19","series-title":"Proc. CONCUR95 Conference","article-title":"On the complexity of branching modular model checking","author":"Bernholz (Kupferman)","year":"1995"},{"key":"10.1016\/S0140-3664(96)01150-4_BIB20","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0196-6774(82)90023-2","article-title":"An O(n log n) unidirectional distributed algorithm for extrema finding in a circle","volume":"3","author":"Dolev","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/S0140-3664(96)01150-4_BIB21","doi-asserted-by":"crossref","first-page":"2413","DOI":"10.1002\/j.1538-7305.1985.tb00010.x","article-title":"Tracing protocols","volume":"64","author":"Holzmann","year":"1985","journal-title":"AT&T Technical J."},{"key":"10.1016\/S0140-3664(96)01150-4_BIB22","series-title":"Proc. IFIP\/WG6.1 Symp. on Protocol Specification, Testing, and Verification, PSTV95","article-title":"An analysis of bitstate hashing","author":"Holzmann","year":"1995"},{"key":"10.1016\/S0140-3664(96)01150-4_BIB23","series-title":"Proc. 18th IEEE Symposium on Foundations of Computer Science","first-page":"46","article-title":"The temporal logic of programs","author":"Pnueli","year":"1977"},{"issue":"2","key":"10.1016\/S0140-3664(96)01150-4_BIB24","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1145\/5397.5399","article-title":"Automatic verification of finite-state concurrent systems using temporal logic specifications","volume":"8","author":"Clarke","year":"1986","journal-title":"Toplas"},{"key":"10.1016\/S0140-3664(96)01150-4_BIB25","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BF00121128","article-title":"Memory efficient algorithms for the verification of temporal properties","volume":"I","author":"Courcoubetis","year":"1992","journal-title":"Formal Methods in System Design"},{"key":"10.1016\/S0140-3664(96)01150-4_BIB26","series-title":"Proc. IFIP\/WG6.1 Symp. on Protocol Specification, Testing, and Verification, PSTV93","article-title":"On the verification of temporal properties","author":"Godefroid","year":"1993"},{"issue":"6","key":"10.1016\/S0140-3664(96)01150-4_BIB27","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1109\/TSE.1987.233206","article-title":"Automated protocol validation in Argos, assertion proving and scatter searching","volume":"13","author":"Holzmann","year":"1987","journal-title":"IEEE Trans. Software Engineering"},{"key":"10.1016\/S0140-3664(96)01150-4_BIB28","series-title":"Proc. IFIP\/WG6.1 Symp. on Protocol Specification, Testing, and Verification, PSTV95","article-title":"Simple on-the-fly automatic verification of linear temporal logic","author":"Gerth","year":"1995"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366496011504?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366496011504?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T00:56:28Z","timestamp":1580864188000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366496011504"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["S0140366496011504"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(96)01150-4","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}