乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T16:48:44Z","timestamp":1693327724631},"reference-count":24,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"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":5921,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,5]]},"DOI":"10.1016\/s0304-3975(96)00256-3","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"459-486","source":"Crossref","is-referenced-by-count":15,"title":["Formal verification of a leader election protocol in process algebra"],"prefix":"10.1016","volume":"177","author":[{"given":"Lars-\u00e5ke","family":"Fredlund","sequence":"first","affiliation":[]},{"given":"Jan Friso","family":"Groote","sequence":"additional","affiliation":[]},{"given":"Henri","family":"Korver","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00256-3_BIB1","article-title":"Process Algebra","volume":"Vol. 18","author":"Baeten","year":"1990"},{"key":"10.1016\/S0304-3975(96)00256-3_BIB2_1","unstructured":"M.A. Bezem, R. Bol and J.F. Groote, A formal verification of the alternating bit protocol in the calculus of constructions (revised version)."},{"key":"10.1016\/S0304-3975(96)00256-3_BIB2_2","article-title":"A formal verification of the alternating bit protocol in the calculus of constructions","author":"Bezem","year":"1993"},{"issue":"4","key":"10.1016\/S0304-3975(96)00256-3_BIB3","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1093\/comjnl\/37.4.289","article-title":"A correctness proof of a one bit sliding window protocol in \u03bcCRL","volume":"37","author":"Bezem","year":"1994","journal-title":"Computer J."},{"key":"10.1016\/S0304-3975(96)00256-3_BIB4","series-title":"Proc. CONCUR '94 Conf. on Concurrency Theory","first-page":"401","article-title":"nvariants in process algebra with data","volume":"Vol. 836","author":"Bezem","year":"1994"},{"key":"10.1016\/S0304-3975(96)00256-3_BIB5","series-title":"Proc. Workshop on Algebra of Communicating Processes ACP94","first-page":"319","article-title":"Process specification in a UNITY format","author":"Brunekreef","year":"1995"},{"key":"10.1016\/S0304-3975(96)00256-3_BIB6","series-title":"Proc. Workshop on Algebra of Communicating Processes ACP'94","first-page":"338","article-title":"Algebraic specification of dynamic leader election protocols in broadcast networks","author":"Brunekreef","year":"1995"},{"issue":"4","key":"10.1016\/S0304-3975(96)00256-3_BIB7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s004460050017","article-title":"Design and analysis of dynamic leader election protocols in broadcast networks","volume":"9","author":"Brunekreef","year":"1996","journal-title":"Distributed Comput."},{"key":"10.1016\/S0304-3975(96)00256-3_BIB8","series-title":"Parallel Program Design. A Foundation","author":"Chandy","year":"1988"},{"issue":"76","key":"10.1016\/S0304-3975(96)00256-3_BIB9","article-title":"The calculus of constructions","author":"Coquand","year":"1988","journal-title":"Inform. and Control"},{"issue":"3","key":"10.1016\/S0304-3975(96)00256-3_BIB10","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","author":"Dolev","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(96)00256-3_BIB11","series-title":"Proc. workshop on Algebra of Communicating Processes ACP94","first-page":"63","article-title":"A correctness proof of the bakery protocol in \u03bcCRL","author":"Groote","year":"1995"},{"key":"10.1016\/S0304-3975(96)00256-3_BIB12_1","series-title":"Proc. workshop on Algebra of Communicating Processes ACP94","first-page":"26","article-title":"The syntax and semantics of \u03bcCRL","author":"Groote","year":"1995"},{"key":"10.1016\/S0304-3975(96)00256-3_BIB12_2","author":"Groote","year":"1990"},{"key":"10.1016\/S0304-3975(96)00256-3_BIB13","series-title":"Proc. Internat. Workshop on Semantics of Specification Languages","first-page":"231","article-title":"Proof theory for \u03bcCRL: a language for processes with data","author":"Groote","year":"1994"},{"key":"10.1016\/S0304-3975(96)00256-3_BIB14","series-title":"Proc. CONCUR '95 Conf. on Concurrency Theory","first-page":"204","article-title":"Confluency for process verification","volume":"Vol. 962","author":"Groote","year":"1995"},{"key":"10.1016\/S0304-3975(96)00256-3_BIB15","article-title":"A bounded retransmission protocol for large data packets. A case study in computer checked algebraic verification","author":"Groote","year":"1993"},{"key":"10.1016\/S0304-3975(96)00256-3_BIB16","article-title":"Protocol Verification in \u03bcCRL","author":"Korver","year":"1994"},{"key":"10.1016\/S0304-3975(96)00256-3_BIB17","series-title":"Proc. 2nd Internat. Symp. on Theoretical Aspects of Computer Software","first-page":"161","article-title":"A computer-checked verification of Milner's scheduler","volume":"Vol. 769","author":"Korver","year":"1994"},{"issue":"3","key":"10.1016\/S0304-3975(96)00256-3_BIB18","first-page":"219","article-title":"An introduction to input\/output automata","volume":"2","author":"Lynch","year":"1989","journal-title":"CWI Quart."},{"key":"10.1016\/S0304-3975(96)00256-3_BIB19","article-title":"A Calculus of Communicating Systems","volume":"Vol. 92","author":"Milner","year":"1980"},{"issue":"4","key":"10.1016\/S0304-3975(96)00256-3_BIB20","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/69622.357194","article-title":"An O(n log n) unidirectional algorithm for the circular extrema problem","volume":"4","author":"Peterson","year":"1982","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/S0304-3975(96)00256-3_BIB21","series-title":"Proc. Internat. Workshop on Semantics of Specification Languages","first-page":"314","article-title":"Verifying process algebra proofs in type theory","author":"Sellink","year":"1994"},{"key":"10.1016\/S0304-3975(96)00256-3_BIB22","series-title":"Uitwerking take-home tentamen protocolverificatie","author":"Vaandrager","year":"1993"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002563?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002563?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T04:56:48Z","timestamp":1555390608000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596002563"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["S0304397596002563"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00256-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,5]]}}}