{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:25Z","timestamp":1725663385018},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540190202"},{"type":"electronic","value":"9783540389200"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-19020-1_16","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:54:57Z","timestamp":1330199697000},"page":"312-330","source":"Crossref","is-referenced-by-count":0,"title":["Semantically based axiomatics"],"prefix":"10.1007","author":[{"given":"Stephen D.","family":"Brookes","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"16_CR1","unstructured":"Abramsky, S., Domain Theory in Logical Form, Proc. Symposium on Logic in Computer Science, Ithaca, NY, IEEE Computer Society Press (1987) 47\u201353."},{"key":"16_CR2","doi-asserted-by":"publisher","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 (1981) 431\u2013483.","journal-title":"ACM TOPLAS"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(79)90058-6","volume":"8","author":"K. R. Apt","year":"1979","unstructured":"Apt, K. R., Bergstra, J. A., and Meertens, G. L. T., Recursive Assertions are not enough\u2014or are they?, TCS 8 (1979) 73\u201387.","journal-title":"TCS"},{"key":"16_CR4","unstructured":"de Bakker, J. W., Mathematical Theory of Program Correctness, Prentice-Hall (1980)."},{"issue":"4","key":"16_CR5","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/4472.4474","volume":"7","author":"H.-J. Boehm","year":"1985","unstructured":"Boehm, H.-J., Side-effects and Aliasing can have Simple Axiomatic Descriptions, ACM TOPLAS, vol. 7, no. 4 (1985) 637\u2013655.","journal-title":"ACM TOPLAS"},{"key":"16_CR6","first-page":"41","volume":"193","author":"S. D. Brookes","year":"1985","unstructured":"Brookes, S. D., An Axiomatic Treatment of a Parallel Language, Proc. Symposium on Logics of Programs, Springer LNCS 193 (1985) 41\u201360.","journal-title":"Springer LNCS"},{"key":"16_CR7","unstructured":"Brookes, S. D., A Semantically Based Proof System for Deadlock and Partial Correctness in CSP, Proc. Symposium on Logic in Computer Science, IEEE Computer Society Press (1986) 58\u201365."},{"key":"16_CR8","first-page":"59","volume":"239","author":"S. D. Brookes","year":"1985","unstructured":"Brookes, S. D., A Fully Abstract Semantics and a Proof System for an ALGOL-like Language with Aliasing, Proc. Conference on Mathematical Foundations of Programming Semantics, Manhattan, Kansas, Springer LNCS 239 (1985) 59\u2013100.","journal-title":"Springer LNCS"},{"key":"16_CR9","unstructured":"Clarke, E. M., The Characterization Problem for Hoare's Logic, in: Mathematical Logic and Programming Languages, eds. C. A. R. Hoare and J. C. Shepherdson, Prentice-Hall (1986) 89\u2013103."},{"issue":"1","key":"16_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/322108.322121","volume":"26","author":"E. M. Clarke","year":"1979","unstructured":"Clarke, E. M., Programming Language Constructs For Which It Is Impossible To Obtain Good Hoare Axiom Systems, JACM Vol. 26 No. 1 (January 1979) 129\u2013147.","journal-title":"JACM"},{"key":"16_CR11","doi-asserted-by":"publisher","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 Verification, SIAM J. Comput 7 (1978) 70\u201390.","journal-title":"SIAM J. Comput"},{"key":"16_CR12","unstructured":"Dijkstra, E. W., A Discipline of Programming, Prentice-Hall (1976)."},{"key":"16_CR13","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1090\/psapm\/019\/0235771","volume":"19","author":"R. Floyd","year":"1967","unstructured":"Floyd, R., Assigning Meanings to Programs, in: J. T. Schwartz, ed., Mathematical Aspects of Computer Science, Proc. Symp. Applied Math. (American Math. Soc. Providence) Vol. 19 (1967) 19\u201332.","journal-title":"Proc. Symp. Applied Math."},{"key":"16_CR14","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 (1969) 576\u2013580).","journal-title":"CACM"},{"key":"16_CR15","first-page":"108","volume":"74","author":"M. C. B. B. Hennessy","year":"1979","unstructured":"Hennessy, M. C. B., and Plotkin, G. D., Full Abstraction for a Simple Parallel Language, Proc. MFCS 1979, Springer LNCS 74 (1979) 108\u2013120.","journal-title":"Springer LNCS"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Milner, R., A Calculus of Communicating Systems, Springer LNCS 92 (1980).","DOI":"10.1007\/3-540-10235-3"},{"issue":"1","key":"16_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","volume":"4","author":"R. Milner","year":"1977","unstructured":"Milner, R., Fully Abstract Models of Typed Lambda-Calculi, Theoretical Computer Science vol. 4 no. 1 (1977) 1\u201322.","journal-title":"Theoretical Computer Science"},{"issue":"12","key":"16_CR18","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":"16_CR19","unstructured":"Owicki, S. S., Axiomatic proof techniques for parallel programming, Ph.D. thesis, Cornell University (1975)."},{"key":"16_CR20","doi-asserted-by":"publisher","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":"16_CR21","doi-asserted-by":"crossref","unstructured":"Robinson, E., Axiomatic Aspects of Denotational Semantics, preprint, Cambridge University (1986).","DOI":"10.1007\/3-540-18508-9_29"},{"key":"16_CR22","first-page":"407","volume":"226","author":"C. Stirling","year":"1986","unstructured":"Stirling, C., A Compositional Reformulation of Owicki-Gries's Partial Correctness Logic for a Concurrent While Language, Proc. ICALP 1986, Springer LNCS 226 (1986) 407\u2013415.","journal-title":"Springer LNCS"},{"key":"16_CR23","unstructured":"Stoughton, A., Fully Abstract Models of Programming Languages, Ph. D. thesis, Department of Computer Science, Edinburgh University (1986)."},{"key":"16_CR24","unstructured":"Stoy, J., Denotational Semantics, MIT Press (1977)."},{"key":"16_CR25","unstructured":"Strachey, C., The Varieties of Programming Language, Proceedings of International Computing Symposium, Cini Foundation, Venice (1972) 222\u2013233."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Programming Language Semantics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-19020-1_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:16:02Z","timestamp":1605644162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-19020-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540190202","9783540389200"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-19020-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}