{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:17Z","timestamp":1725663257192},"publisher-location":"Berlin, Heidelberg","reference-count":22,"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_3","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:24:04Z","timestamp":1330194244000},"page":"62-75","source":"Crossref","is-referenced-by-count":5,"title":["On the composition and decomposition of assertions"],"prefix":"10.1007","author":[{"given":"Glynn","family":"Winskel","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"3_CR1","unstructured":"Abramsky, S., Domain theory as a theory of experiments. In this proceedings (1984)."},{"key":"3_CR2","unstructured":"Aczel, P., An introduction to inductive definitions. In the handbook of Mathematical Logic, Ed. Barwise, J., North-Holland (1983)."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Barringer H., Kuiper R. and Pnueli A., Now you may compose temporal logic specifications. In the proceedings of STOC 84 (1984).","DOI":"10.1145\/800057.808665"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"de Nicola, R. and Hennessy, M.C.B., Testing Equivalences for Processes, Lecture Notes in Comp. Sc. vol. 154 (1983). To appear in JACM.","DOI":"10.1007\/BFb0036936"},{"key":"3_CR5","unstructured":"Golson, W. and Rounds W., In this proceedings (1984)."},{"key":"3_CR6","unstructured":"Hoare, C.A.R., A model for communicating sequential processes. Monograph of the Programming Research Group, Oxford University (1981)."},{"key":"3_CR7","unstructured":"Hoare, C.A.R., Brookes, S.D., and Roscoe, A.W., A Theory of Communicating Processes, Technical Report PRG-16, Programming Research Group, University of Oxford (1981); appears also in JACM (1984)."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Hennessy, M.C.B. and Milner, R., On observing nondeterminism and concurrency, Springer LNCS Vol. 85. (1979).","DOI":"10.1007\/3-540-10003-2_79"},{"key":"3_CR9","unstructured":"Hennessy, M.C.B. and Plotkin, G. D., A term model for CBL. Springer LNCS Vol. 88. (1980)."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Larsen, K. and Winskel, G., Using Information Systems to solve Recursive Domain Equations Effectively. Springer Lecture Notes in Comp. Sc., vol. 173 (1984).","DOI":"10.1007\/3-540-13346-1_5"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Milner, R., A Calculus of Communicating Systems. Springer Lecture Notes in Comp. Sc. vol. 92 (1980).","DOI":"10.1007\/3-540-10235-3"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Milner, R., A modal characterisation of observable machine-behaviour. Springer Lecture Notes in Comp. Sc. vol. 112 (1981).","DOI":"10.1007\/3-540-10828-9_52"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Milner, R., Calculi for synchrony and asynchrony, Theoretical Computer Science, pp.267\u2013310 (1983).","DOI":"10.1016\/0304-3975(83)90114-7"},{"key":"3_CR14","unstructured":"Olderog, E-R. and Hoare, C.A.R., Specification-oriented semantics for communicating processes. Monograph of the Programming Research Group, Oxford University (1984)."},{"key":"3_CR15","unstructured":"Plotkin, G. D., Some comments on Robin's \u201cA modal characterisation of observable machine-behaviour\u201d. Handwritten notes, Comp. Sc. Dept., University of Edinburgh (1983)."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Scott, D. S., Domains for Denotational Semantics. ICALP 1982.","DOI":"10.1007\/BFb0012801"},{"key":"3_CR17","unstructured":"Scott, D. S., Lectures on a mathematical theory of computation. Oxford University Computing Laboratory Technical Monograph PRG-19 (1981)."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Smyth, M.B., Power domains and predicate transformers: a topological view. Proc. of ICALP 83, Springer Lecture Notes in Comp. Sc. vol. 154 (1983).","DOI":"10.1007\/BFb0036946"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Stirling, C., A complete modal proof system for a subset of SCCS. Research report, Dept. of Comp. Sci., Edinburgh University (1984).","DOI":"10.1007\/3-540-15198-2_16"},{"key":"3_CR20","unstructured":"Stirling, C., A proof theoretic characterisation of observational equivalence. Research report, Dept. of Comp. Sci., Edinburgh University, CSR-132-83 (1983). A version also appears in the proceedings of the Bangalore conference, India (1983) and is to appear in Theoretical Computer Science."},{"key":"3_CR21","unstructured":"Winskel, G., Synchronisation trees. Technical Report, Comp. Sc. Dept., Carnegie-Mellon University (1983). To appear in Theoretical Computer Science."},{"key":"3_CR22","unstructured":"Winskel, G., A complete proof system for SCCS with modal assertions. In preparation."}],"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_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:08:45Z","timestamp":1605643725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-15670-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540156703","9783540395935"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-15670-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}