{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:08Z","timestamp":1725663248165},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540156703"},{"type":"electronic","value":"9783540395935"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-15670-4_1","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:23:05Z","timestamp":1330194185000},"page":"1-34","source":"Crossref","is-referenced-by-count":2,"title":["On the axiomatic treatment of concurrency"],"prefix":"10.1007","author":[{"given":"Stephen D.","family":"Brookes","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"issue":"4","key":"1_CR1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/357146.357150","volume":"3","author":"K. R. Apt","year":"1981","unstructured":"Apt, K. R., Ten Years of Hoare's Logic: A Survey, ACM TOPLAS, vol. 3 no. 4 (October 1981) 431\u2013483.","journal-title":"ACM TOPLAS"},{"issue":"3","key":"1_CR2","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1145\/357103.357110","volume":"2","author":"K. R. Apt","year":"1980","unstructured":"Apt, K. R., Francez, N., and de Roever, W. P., A proof system for communicating sequential processes, ACM TOPLAS, vol. 2 no. 3 (July 1980), 359\u2013385.","journal-title":"ACM TOPLAS"},{"key":"1_CR3","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/S0022-0000(75)80018-3","volume":"10","author":"E. A. Ashcroft","year":"1975","unstructured":"Ashcroft, E. A., Proving assertions about parallel programs, J. Comput. Syst. Sci. 10 (Jan. 1975), 110\u2013135.","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Barringer, H., Kuiper, R., and Pnueli, A., Now You May Compose Temporal Logic Assertions, Proc. 16th ACM Symposium on Theory of Computing, Washington, May 1984.","DOI":"10.1145\/800057.808665"},{"key":"1_CR5","unstructured":"Best, E., A relational framework for concurrent programs using atomic actions, Proc. IFIP TC2 Conference (1982)."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Brookes, S. D., On the Relationship of CCS and CSP, Proc. ICALP 83, Springer LNCS (1983).","DOI":"10.1007\/BFb0036899"},{"key":"1_CR7","unstructured":"Brookes, S. D., A Fully Abstract Semantics and Proof System for An ALGOL-like Language with Sharing, CMU Technical Report (1984)."},{"issue":"1","key":"1_CR8","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1137\/0207005","volume":"7","author":"S. Cook","year":"1978","unstructured":"Cook, S., Soundness and Completeness of an Axiom System for Program Verfification, SIAM J. Comput. vol. 7. no. 1 (February 1978) 70\u201390.","journal-title":"SIAM J. Comput."},{"key":"1_CR9","first-page":"43","volume-title":"Programming Languages","author":"E. W. Dijkstra","year":"1968","unstructured":"Dijkstra, E. W., Cooperating Sequential Processes, in: Programming Languages, F. Genuys (Ed.), Academic Press, NY (1968) 43\u2013112."},{"key":"1_CR10","volume-title":"A Discipline of Programming","author":"E. W. Dijkstra","year":"1976","unstructured":"Dijkstra, E. W., A Discipline of Programming, Prentice-Hall, New Jersey (1976)."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Gerth, R., Transition Logic, Proceedings of the 16th ACM STOC Conference, 1983.","DOI":"10.1145\/800057.808664"},{"issue":"10","key":"1_CR12","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C. A. R. R. Hoare","year":"1969","unstructured":"Hoare, C. A. R., An axiomatic basis for computer programming, CACM 12, 10 (Oct. 1969), 576\u2013580.","journal-title":"CACM"},{"issue":"8","key":"1_CR13","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C. A. R. R. Hoare","year":"1978","unstructured":"Hoare, C. A. R., Communicating Sequential Processes, CACM 21, 8 (Aug. 1978), 666\u2013677.","journal-title":"CACM"},{"issue":"4","key":"1_CR14","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/69575.69577","volume":"5","author":"C. B. Jones","year":"1983","unstructured":"Jones, C. B., Tentative Steps Towards a Development Method for Interfering Programs, ACM TOPLAS vol. 5 no. 4, (October 1983) 596\u2013619.","journal-title":"ACM TOPLAS"},{"issue":"7","key":"1_CR15","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/360248.360251","volume":"19","author":"R. M. Keller","year":"1976","unstructured":"Keller, R. M., Formal verification of parallel programs, CACM 19,7 (July 1976), 371\u2013384.","journal-title":"CACM"},{"key":"1_CR16","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF00289062","volume":"14","author":"L. Lamport","year":"1980","unstructured":"Lamport, L., The \u2018Hoare Logic\u2019 of concurrent programs, Acta Informatica 14 (1980), 21\u201337.","journal-title":"Acta Informatica"},{"issue":"2","key":"1_CR17","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1145\/2993.357247","volume":"6","author":"L. Lamport","year":"1984","unstructured":"Lamport, L., and Schneider, F., The \u201cHoare Logic\u201d of CSP, and All That, ACM TOPLAS 6, 2 (April 1984), 281\u2013296.","journal-title":"ACM TOPLAS"},{"key":"1_CR18","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF00289266","volume":"15","author":"G. M. Levin","year":"1981","unstructured":"Levin, G. M., and Gries, D., A proof technique for communicating sequential processes, Acta Informatica 15 (1981), 281\u2013302.","journal-title":"Acta Informatica"},{"key":"1_CR19","volume-title":"The Correctness Problem in Computer Science","author":"Z. Manna","year":"1982","unstructured":"Manna, Z., and Pnueli, A., Verification of Concurrent Programs: The Temporal Framework, in: \u201cThe Correctness Problem in Computer Science\u201d, ed. R. S. Boyer and J. S. Moore, Academic Press, London (1982)."},{"key":"1_CR20","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S. S. Owicki","year":"1976","unstructured":"Owicki, S. S., and Gries, D., An Axiomatic proof technique for parallel programs, Acta Informatica 6 (1976), 319\u2013340.","journal-title":"Acta Informatica"},{"key":"1_CR21","unstructured":"Owicki, S. S., Axiomatic proof techniques for parallel programs, Ph. D. dissertation, Cornell University (Aug. 1975)."},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Hennessy, M., and Plotkin, G. D., Full Abstraction for a Simple Parallel Programming Language, Proc. MFCS 1979, Springer LNCS vol. 74, pp. 108\u2013120.","DOI":"10.1007\/3-540-09526-8_8"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Milner, R., Fully Abstract Models of Typed Lambda-Calculi, Theoretical Computer Science (1977).","DOI":"10.1016\/0304-3975(77)90053-6"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Milner, R., A Calculus of Communicating Systems, Springer LNCS vol. 92 (1980).","DOI":"10.1007\/3-540-10235-3"},{"issue":"12","key":"1_CR25","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1145\/358728.358748","volume":"25","author":"M. O'Donnell","year":"1982","unstructured":"O'Donnell, M., A Critique of the Foundations of Hoare-Style Programming Logic, CACM vol. 25 no. 12 (December 1982) 927\u2013934.","journal-title":"CACM"},{"key":"1_CR26","unstructured":"Plotkin, G. D., A Structural Approach to Operational Semantics, DAIMI Report FN-19, Aarhus University (1981)."},{"key":"1_CR27","unstructured":"Plotkin, G. D., An Operational Semantics for CSP, Proceedings of the W. G. 2.2 Conference, 1982."},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Winskel, G., Synchronisation Trees, Proc. ICALP 1983, Springer LNCS vol. 154. (1983).","DOI":"10.1007\/BFb0036949"}],"container-title":["Lecture Notes in Computer Science","Seminar on Concurrency"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-15670-4_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:08:38Z","timestamp":1605643718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-15670-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540156703","9783540395935"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-15670-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}