{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:08:51Z","timestamp":1742393331886},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540601173"},{"type":"electronic","value":"9783540494454"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60117-1_10","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:43:39Z","timestamp":1330260219000},"page":"180-196","source":"Crossref","is-referenced-by-count":5,"title":["Formal derivation of CSP programs from temporal specifications"],"prefix":"10.1007","author":[{"given":"Rudolf","family":"Berghammer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Burghard","family":"Karger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"10_CR1","unstructured":"Backhouse R.C., de Bruin P., Malcolm G., Voermans T.S., van der Woude J.: Relational catamorphisms. In: M\u00f6ller B. (ed.): Constructing programs from specifications. Proceedings IFIP TC2\/WG2.1 Working Conference on Constructing Programs, Elsevier Science Publishers, 287\u2013318 (1991)"},{"key":"10_CR2","unstructured":"de Bakker J.W., de Roever W.P.: A calculus for recursive program schemes. In: Nivat M. (ed.): Proceedings ICALP 73, North-Holland, 167\u2013196 (1973)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Brookes S.D., Roscoe A.W.: An improved failure model for communicating sequential processes. In: Brookes S.D. et al. (eds.): Proceedings NSF-SERC Seminar on Concurrency, LNCS 197, Springer Verlag, 285\u2013305 (1985)","DOI":"10.1007\/3-540-15670-4_14"},{"key":"10_CR4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1109\/32.21743","volume":"15","author":"F.L. Bauer","year":"1989","unstructured":"Bauer F.L., M\u00f6ller B., Partsch H., Pepper P.: Formal program construction by transformations \u2014 Computer-aided intuition guided programming. IEEE Transactions on Software Engineering 15, 165\u2013180 (1989)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0304-3975(86)90172-6","volume":"43","author":"R. Berghammer","year":"1986","unstructured":"Berghammer R., Zierer H.: Relational algebraic semantics of deterministic and nondeterministic programs. Theoretical Computer Science 43, 123\u2013147 (1986)","journal-title":"Theoretical Computer Science"},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/321992.321996","volume":"24","author":"R.M. Burstall","year":"1977","unstructured":"Burstall R.M., Darlington J.: A transformation system for developing recursive programs. Journal of the ACM 24, 44\u201367 (1977)","journal-title":"Journal of the ACM"},{"key":"10_CR7","first-page":"341","volume":"1","author":"L.H. Chin","year":"1951","unstructured":"Chin L.H., Tarski A.: Distributive and modular laws in the arithmetic of relation algebras. University of California Publications in Mathematics (new series) 1, 341\u2013384 (1951)","journal-title":"University of California Publications in Mathematics (new series)"},{"key":"10_CR8","unstructured":"Davies J.: Specification and Proof in Real Time Systems. D. Phil. Thesis, Oxford University (1991)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Dijkstra E.W.: The unification of three calculi. In: Broy M. (ed.): Program Design Calculi. Springer Verlag, 197\u2013231 (1993)","DOI":"10.1007\/978-3-662-02880-3_7"},{"key":"10_CR10","unstructured":"Goldsmith M.H.: The Oxford occam transformation system (draft user documentation). Oxford University (1994)"},{"issue":"2","key":"10_CR11","first-page":"65","volume":"1","author":"M.H. Goldsmith","year":"1993","unstructured":"Goldsmith M.H., Roscoe A.W., Scott B.G.O.: Denotational Semantics for occam 2, parts I & II. Transputer Communications 1(2), 65\u201391 (1993) and 2(1), 25\u201367 (1994)","journal-title":"Transputer Communications"},{"key":"10_CR12","unstructured":"Hoare C.A.R.: Communicating Sequential Processes. Prentice-Hall International (1985)"},{"key":"10_CR13","doi-asserted-by":"crossref","first-page":"51","DOI":"10.3233\/FI-1986-9104","volume":"IX","author":"C.A.R. Hoare","year":"1986","unstructured":"Hoare C.A.R., He Jifeng: The weakest prespecification, parts I & II. Fundamenta Informaticae IX, 51\u201384 & 217\u2013252 (1986)","journal-title":"Fundamenta Informaticae"},{"key":"10_CR14","unstructured":"Hoare C.A.R., Roscoe A.W.: The laws of occam programming. Technical Report PRG-53, Oxford University (1986)"},{"key":"10_CR15","unstructured":"von Karger B.: Sequential calculus. ProCoS II Report Kiel BvK 15\/4, Institut f\u00fcr Informatik und Praktische Mathematik, Christian-Albrechts-Universit\u00e4t Kiel (1994)"},{"key":"10_CR16","unstructured":"von Karger B.: An algebraic foundation of temporal logic. In: Peter D. Mosses et al. (eds.): Proceedings TAPSOFT '95, LNCS 915, Springer Verlag, 232\u2013246 (1995) Also available as: ProCoS II Report Kiel BvK 17\/1, Institut f\u00fcr Informatik und Praktische Mathematik, Christian-Albrechts-Universit\u00e4t Kiel (1994)"},{"key":"10_CR17","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0190(94)00205-D","volume":"53","author":"B. Karger von","year":"1995","unstructured":"von Karger B., Hoare C.A.R.: Sequential calculus. Information Processing Letters 53, 123\u2013130 (1995)","journal-title":"Information Processing Letters"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Lamport L., Merz S.: Specifying and verifying fault-tolerant systems. In: Langmaack H. et al. (eds.): Formal techniques in real-time and fault-tolerant systems. LNCS 863, Springer Verlag, 41\u201376 (1994)","DOI":"10.1007\/3-540-58468-4_159"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Manna Z., Pnueli A.: The temporal logic of reactive and concurrent systems-specification. Springer Verlag (1991)","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"10_CR20","unstructured":"Meertens L.G.L.T: Algorithmics \u2014 Towards programming as a mathematically activity. In: de Bakker J.W. et al. (eds.): Proceedings CWI Symposium on Mathematics and Computer Science, CWI Monographs Vol. 1, North Holland, 289\u2013334 (1986)"},{"key":"10_CR21","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF00268075","volume":"33","author":"E.-R. Olderog","year":"1986","unstructured":"Olderog E.-R., Hoare C.A.R.: Specification-oriented semantics for communicating processes. Acta Informatica 33, 9\u201366 (1986)","journal-title":"Acta Informatica"},{"key":"10_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(81)90060-8","volume":"15","author":"G. Schmidt","year":"1981","unstructured":"Schmidt G.: Programs as partial graphs, parts I & II. Theoretical Computer Science 15, 1\u201325 & 159\u2013179 (1981)","journal-title":"Theoretical Computer Science"},{"key":"10_CR23","unstructured":"Schmidt G., Str\u00f6hlein T.: Relations and graphs. Discrete Mathematics for Computer Scientists, EATCS Monographs on Theoretical Computer Science, Springer Verlag (1993)"},{"key":"10_CR24","unstructured":"Spivey J.M.: The Z notation: A reference manual. 2nd ed., Prentice Hall (1992)"},{"key":"10_CR25","doi-asserted-by":"crossref","first-page":"73","DOI":"10.2307\/2268577","volume":"6","author":"A. Tarski","year":"1941","unstructured":"Tarski A.: On the calculus of relations. Journal of Symbolic Logic 6, 73\u201389 (1941)","journal-title":"Journal of Symbolic Logic"},{"key":"10_CR26","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Tarski A.: A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math. 5, 285\u2013309 (1955)","journal-title":"Pacific J. Math."}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60117-1_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T04:25:20Z","timestamp":1640924720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60117-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601173","9783540494454"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-60117-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}