{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:38:54Z","timestamp":1720201134419},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"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":[[1985]]},"DOI":"10.1016\/0304-3975(85)90130-6","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"47-68","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["On the suitability of trace semantics for modular proofs of communicating processes"],"prefix":"10.1016","volume":"39","author":[{"given":"R.J.R.","family":"Back","sequence":"first","affiliation":[]},{"given":"H.","family":"Mannila","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90130-6_BIB1","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1145\/357103.357110","article-title":"A proof system for communicating sequential processes","volume":"2","author":"Apt","year":"1980","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/0304-3975(85)90130-6_BIB2","series-title":"Proc. ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing","first-page":"111","article-title":"A refinement of Kahn's semantics to handle non-determinism and communication","author":"Back","year":"1982"},{"key":"10.1016\/0304-3975(85)90130-6_BIB3","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/S0019-9958(82)91250-5","article-title":"Processes and the denotational semantics of concurrency","volume":"54","author":"de Bakker","year":"1982","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(85)90130-6_BIB4","article-title":"A process algebra for the operational semantics of static data flow networks","author":"Bergstra","year":"1983","journal-title":"Mathematisch Centrum report IW 222\/83"},{"key":"10.1016\/0304-3975(85)90130-6_BIB5","series-title":"Formalization of Programming Concepts","first-page":"252","article-title":"Scenarios: a model of non-deterministic computation","volume":"107","author":"Brock","year":"1981"},{"key":"10.1016\/0304-3975(85)90130-6_BIB6","series-title":"Second Internat. Conf. on Distributed Computer Systems","first-page":"1","article-title":"Partial correctness of communicating sequential processes","author":"Chen","year":"1981"},{"key":"10.1016\/0304-3975(85)90130-6_BIB7","series-title":"Proc. 21st IEEE Symp. on Foundations of Computer Science","article-title":"A linear history semantics for languages for distributed programming","author":"Francez","year":"1980"},{"key":"10.1016\/0304-3975(85)90130-6_BIB8","article-title":"Transition logic, how to reason about temporal properties of programs in a compositional way","author":"Gerth","year":"1983"},{"key":"10.1016\/0304-3975(85)90130-6_BIB9","article-title":"A model for communicating sequential processes","author":"Hoare","year":"1981"},{"key":"10.1016\/0304-3975(85)90130-6_BIB10","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0167-6423(81)90005-8","article-title":"A calculus of total correctness for communicating processes","volume":"1","author":"Hoare","year":"1981","journal-title":"Science of Computer Programming"},{"issue":"10","key":"10.1016\/0304-3975(85)90130-6_BIB11","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis for computer programming","volume":"12","author":"Hoare","year":"1969","journal-title":"Comm. ACM"},{"issue":"3","key":"10.1016\/0304-3975(85)90130-6_BIB12","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","article-title":"A theory of communicating sequential processes","volume":"31","author":"Hoare","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(85)90130-6_BIB13","first-page":"471","article-title":"The semantics of a simple language for parallel programming","author":"Kahn","year":"1974"},{"key":"10.1016\/0304-3975(85)90130-6_BIB14","series-title":"Algebraic Systems","author":"Malcev","year":"1973"},{"key":"10.1016\/0304-3975(85)90130-6_BIB15","article-title":"A Calculus of Communicating Systems","volume":"92","author":"Milner","year":"1980"},{"issue":"4","key":"10.1016\/0304-3975(85)90130-6_BIB16","doi-asserted-by":"crossref","DOI":"10.1109\/TSE.1981.230844","article-title":"Proofs of networks of processes","volume":"SE-7","author":"Misra","year":"1981","journal-title":"IEEE Trans. Software Engineering"},{"key":"10.1016\/0304-3975(85)90130-6_BIB17","article-title":"Specification-oriented semantics for communicating processes","author":"Olderog","year":"1984"},{"key":"10.1016\/0304-3975(85)90130-6_BIB18","series-title":"Formal Description of Programming Concepts II","first-page":"199","article-title":"An operational semantics for CSP","author":"Plotkin","year":"1983"},{"key":"10.1016\/0304-3975(85)90130-6_BIB19","series-title":"4th Advanced Course on Foundations of Computer Science","article-title":"Partially ordered computations, with applications to VLSI design","author":"Rem","year":"1982"},{"key":"10.1016\/0304-3975(85)90130-6_BIB20","series-title":"Proc. 1981 Foundation of Computer Science Conf.","first-page":"140","article-title":"Possible futures, acceptances, refusals and communicating processes","author":"Rounds","year":"1981"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901306?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901306?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T08:52:56Z","timestamp":1553158376000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585901306"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":20,"alternative-id":["0304397585901306"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90130-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}