{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T01:44:21Z","timestamp":1726451061577},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10059,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1986]]},"DOI":"10.1016\/0167-6423(86)90002-x","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T16:44:35Z","timestamp":1048610675000},"page":"1-22","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["State machines and assertions: An integrated approach to modeling and verification of distributed systems"],"prefix":"10.1016","volume":"7","author":[{"given":"Thomas A.","family":"Joseph","sequence":"first","affiliation":[]},{"given":"Thomas","family":"R\u00e4uchle","sequence":"additional","affiliation":[]},{"given":"Sam","family":"Toueg","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0167-6423(86)90002-X_BIB1","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357103.357110","article-title":"A proof system for communicating sequential processes","volume":"2","author":"Apt","year":"1980","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0167-6423(86)90002-X_BIB2","first-page":"17","article-title":"Formalization of properties of parallel programs","volume":"6","author":"Ashcroft","year":"1971"},{"issue":"4\/5","key":"10.1016\/0167-6423(86)90002-X_BIB3","article-title":"Finite state description of communicating protocols","volume":"2","author":"Bochmann","year":"1978","journal-title":"Comput. Networks"},{"key":"10.1016\/0167-6423(86)90002-X_BIB4","series-title":"Computer Network Architecture and Protocols","article-title":"A hybrid model and the representation of communication services","author":"Bochmann","year":"1982"},{"issue":"12","key":"10.1016\/0167-6423(86)90002-X_BIB5","article-title":"Formal methods in communication protocol design","volume":"28","author":"Bochmann","year":"1980","journal-title":"IEEE Trans. Comm."},{"issue":"2","key":"10.1016\/0167-6423(86)90002-X_BIB6","doi-asserted-by":"crossref","DOI":"10.1145\/322374.322380","article-title":"On communicating finite state machines","volume":"30","author":"Brand","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0167-6423(86)90002-X_BIB7","article-title":"A discipline for constructing multi-phase communication protocols","author":"Chow","year":"1983","journal-title":"Department of Computer Sciences, University of Texas at Austin, TR233"},{"year":"1976","series-title":"A Discipline of Programming","author":"Dijkstra","key":"10.1016\/0167-6423(86)90002-X_BIB8"},{"key":"10.1016\/0167-6423(86)90002-X_BIB9","first-page":"19","article-title":"Assigning meanings to programs","volume":"Vol. 19","author":"Floyd","year":"1967"},{"key":"10.1016\/0167-6423(86)90002-X_BIB10","article-title":"Protocol validation by maximal progress state exploration","author":"Gouda","year":"1982","journal-title":"Department of Computer Science, University of Texas at Austin, TR211"},{"issue":"10","key":"10.1016\/0167-6423(86)90002-X_BIB11","doi-asserted-by":"crossref","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis for computer programming","volume":"21","author":"Hoare","year":"1969","journal-title":"Comm. ACM"},{"year":"1982","series-title":"Verifying Concurrent Programs Using Temporal Logic","author":"Hailpern","key":"10.1016\/0167-6423(86)90002-X_BIB12"},{"key":"10.1016\/0167-6423(86)90002-X_BIB13","series-title":"The Correctness Problem in Computer Science","article-title":"Verification of concurrent programs: The temporal framework","author":"Manna","year":"1982"},{"key":"10.1016\/0167-6423(86)90002-X_BIB14","article-title":"A model and temporal proof system for networks of processes","author":"Nguyen","year":"1984","journal-title":"Cornell University, Technical Report 84-651"},{"key":"10.1016\/0167-6423(86)90002-X_BIB15","doi-asserted-by":"crossref","DOI":"10.1007\/BF00268134","article-title":"An axiomatic proof technique for parallel programs","volume":"6","author":"Owicki","year":"1976","journal-title":"Acta Informat."},{"key":"10.1016\/0167-6423(86)90002-X_BIB16","series-title":"Proc. 18th Symposium on Foundations of Computer Science","article-title":"The temporal logic of programs","author":"Pnueli","year":"1977"},{"key":"10.1016\/0167-6423(86)90002-X_BIB17","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0020-0190(85)90033-X","article-title":"Exposure to deadlock for communicating processes is hard to detect","volume":"21","author":"R\u00e4uchle","year":"1985","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/0167-6423(86)90002-X_BIB18","doi-asserted-by":"crossref","DOI":"10.1145\/579.583","article-title":"Using message passing for distributed programming: Proof rules and disciplines","volume":"6","author":"Schlichting","year":"1984","journal-title":"ACM TOPLAS"},{"issue":"4","key":"10.1016\/0167-6423(86)90002-X_BIB19","doi-asserted-by":"crossref","DOI":"10.1145\/357377.357384","article-title":"An HDLC protocol specification and its verification using image protocols","volume":"1","author":"Shankar","year":"1983","journal-title":"ACM Trans. Comput. Systems"},{"key":"10.1016\/0167-6423(86)90002-X_BIB20","doi-asserted-by":"crossref","DOI":"10.1109\/MC.1979.1658889","article-title":"Formal techniques for protocol specification and verification","volume":"12","author":"Sunshine","year":"1979","journal-title":"IEEE Comput."},{"year":"1981","series-title":"Computer Networks","author":"Tannenbaum","key":"10.1016\/0167-6423(86)90002-X_BIB21"},{"issue":"4","key":"10.1016\/0167-6423(86)90002-X_BIB22","doi-asserted-by":"crossref","DOI":"10.1109\/TCOM.1980.1094687","article-title":"Towards analyzing and synthesizing protocols","volume":"28","author":"Zafiropulo","year":"1980","journal-title":"IEEE Trans. Comm."}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764238690002X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764238690002X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T05:55:37Z","timestamp":1584510937000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016764238690002X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":22,"alternative-id":["016764238690002X"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(86)90002-x","relation":{},"ISSN":["0167-6423"],"issn-type":[{"type":"print","value":"0167-6423"}],"subject":[],"published":{"date-parts":[[1986]]}}}