{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T22:27:43Z","timestamp":1693866463394},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1986,3,1]],"date-time":"1986-03-01T00:00:00Z","timestamp":510019200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib Comput"],"published-print":{"date-parts":[[1986,3]]},"DOI":"10.1007\/bf01843567","type":"journal-article","created":{"date-parts":[[2005,6,29]],"date-time":"2005-06-29T00:52:45Z","timestamp":1120006365000},"page":"7-25","source":"Crossref","is-referenced-by-count":40,"title":["A model and temporal proof system for networks of processes"],"prefix":"10.1007","volume":"1","author":[{"given":"Van","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Demers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Gries","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susan","family":"Owicki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01843567_CR1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/357146.357150","volume":"3","author":"KR Apt","year":"1981","unstructured":"Apt KR (1981) Ten years of Hoare's logic: a survey \u2014 Part 1. ACM TOPLAS 3:431\u2013483","journal-title":"ACM TOPLAS"},{"key":"BF01843567_CR2","doi-asserted-by":"crossref","unstructured":"Barringer H, Kuiper R, Pnueli A (1984) Now you may compose temporal logic specifications. Proc 16th ACM Symp. Theor Comput","DOI":"10.1145\/800057.808665"},{"key":"BF01843567_CR3","doi-asserted-by":"crossref","unstructured":"Brock JD, Ackerman WB (1981) Scenarios: a model of nondeterminate computation. International Colloquium on Formalization of Programming Concepts","DOI":"10.1007\/3-540-10699-5_102"},{"key":"BF01843567_CR4","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/3-540-12896-4_356","volume":"164","author":"SD Brookes","year":"1984","unstructured":"Brookes SD (1984) A semantics and proof system for communicating processes. Lect Notes Comput Sci 164:68\u201385","journal-title":"Lect Notes Comput Sci"},{"key":"BF01843567_CR5","unstructured":"Chen ZC, Hoare CAR (1981) Partial correctness of communicating processes and protocols. Technical monograph PRG-20, Programming Research Group, Oxford University Computing Laboratory"},{"key":"BF01843567_CR6","first-page":"987","volume":"77","author":"C Hewitt","year":"1977","unstructured":"Hewitt C, Baker HG (1977) Laws for communicating parallel processes. Proc IFIP 77:987\u2013992","journal-title":"Proc IFIP"},{"key":"BF01843567_CR7","doi-asserted-by":"crossref","unstructured":"Hoare CAR (1983) Notes on communicating sequential processes. Technical Monograph PRG-33, Programming Research Group, Oxford University Computing Laboratory","DOI":"10.1007\/978-3-662-09507-2_19"},{"key":"BF01843567_CR8","unstructured":"Kahn G (1974) The semantics of a simple language for parallel programming. Inf Process pp 471\u2013475"},{"key":"BF01843567_CR9","first-page":"993","volume":"77","author":"G Kahn","year":"1977","unstructured":"Kahn G, MacQueen DB (1977) Coroutines and networks of parallel processes. Proc IFIP 77:993\u2013998","journal-title":"Proc IFIP"},{"key":"BF01843567_CR10","first-page":"657","volume":"83","author":"L Lamport","year":"1983","unstructured":"Lamport L (1983) What good is temporal logic? Proc IFIP 83:657\u2013668","journal-title":"Proc IFIP"},{"key":"BF01843567_CR11","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF00289266","volume":"15","author":"GM Levin","year":"1981","unstructured":"Levin GM, Gries D (1981) A proof technique for communicating sequential processes. Acta Inf 15:281\u2013302","journal-title":"Acta Inf"},{"key":"BF01843567_CR12","doi-asserted-by":"crossref","unstructured":"Manna Z. Pnueli A (1981a) Verification of concurrent programs, Part 1: The temporal framework. Tech Rep STAN-CS-81-836, Stanford University. June 1981","DOI":"10.21236\/ADA106750"},{"key":"BF01843567_CR13","doi-asserted-by":"crossref","unstructured":"Manna Z. Pnueli A (1981 b) Verification of concurrent programs, Part 2: Temporal proof principles. Tech Rep STAN-CS-81-843, Stanford University. Sept 1981","DOI":"10.21236\/ADA116035"},{"key":"BF01843567_CR14","doi-asserted-by":"crossref","unstructured":"Manna Z, Pnueli A (1983) How to cook a temporal proof system for your pet language. Proc. 10th ACM Sym Prince of Prog Lang. Jan 1983, pp 141\u2013154","DOI":"10.1145\/567067.567082"},{"key":"BF01843567_CR15","doi-asserted-by":"crossref","unstructured":"Milner R (1980) A calculus of communicating systems. Lect Notes Comput Sci 92","DOI":"10.1007\/3-540-10235-3"},{"key":"BF01843567_CR16","first-page":"4","volume":"7","author":"J Misra","year":"1981","unstructured":"Misra J, Chandy KM (1981) Proofs of networks of processes. IEEE Trans Soft Eng SE-7, 4","journal-title":"IEEE Trans Soft Eng SE"},{"key":"BF01843567_CR17","doi-asserted-by":"crossref","unstructured":"Misra J, Chandy KM, Smith T (1982) Proving safety and liveness of communicating processes with examples. Proc SIGACT-SIGOPS Symp Princ of Distributed Computing, Aug 1982, pp 201\u2013208","DOI":"10.1145\/800220.806698"},{"key":"BF01843567_CR18","unstructured":"Nguyen V (1985a) A theory of processes. Ph. D. Thesis, Department of Computer Science, Cornell University"},{"key":"BF01843567_CR19","doi-asserted-by":"crossref","unstructured":"Nguyen V (1985b) The incompleteness of Misra and Chandy's proof systems. Inf Proc Lett (to appear)","DOI":"10.1016\/0020-0190(85)90040-7"},{"key":"BF01843567_CR20","doi-asserted-by":"crossref","unstructured":"Nguyen V, Demers A, Gries D, Owicki S (1985) Behavior: a temporal approach to process modeling. IBM Workshop on Logics of Programs. June 1985","DOI":"10.1007\/3-540-15648-8_19"},{"key":"BF01843567_CR21","doi-asserted-by":"crossref","unstructured":"Nguyen V, Gries D, Owicki S (1985) A model and temporal proof system for networks of processes. Proc 12th ACM Symp Princ of Prog Lang. Jan 1985, pp 121\u2013131","DOI":"10.1145\/318593.318624"},{"key":"BF01843567_CR22","doi-asserted-by":"crossref","unstructured":"Pratt V (1982) On the composition of processes. Proc 9th ACM Symp Princ of Prog Lang. Jan 1982, pp 213\u2013223","DOI":"10.1145\/582153.582177"},{"key":"BF01843567_CR23","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF03037020","volume":"1","author":"E Shapiro","year":"1983","unstructured":"Shapiro E, Takeuchi A (1983) Object-oriented programming in Concurrent Prolog. J New Generation Comput 1:25\u201348","journal-title":"J New Generation Comput"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01843567.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01843567\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01843567","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T01:41:06Z","timestamp":1586310066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01843567"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,3]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,3]]}},"alternative-id":["BF01843567"],"URL":"https:\/\/doi.org\/10.1007\/bf01843567","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,3]]}}}