{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:29:35Z","timestamp":1761596975867},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540347507"},{"type":"electronic","value":"9783540347521"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11768173_14","type":"book-chapter","created":{"date-parts":[[2006,6,21]],"date-time":"2006-06-21T12:02:49Z","timestamp":1150891369000},"page":"236-256","source":"Crossref","is-referenced-by-count":12,"title":["Modal Design Algebra"],"prefix":"10.1007","author":[{"given":"Walter","family":"Guttmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"M\u00f6ller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1017\/S096012950000030X","volume":"3","author":"R.C. Backhouse","year":"1993","unstructured":"Backhouse, R.C., van der Woude, J.: Demonic operators and monotype factors. Mathematical Structures in Computer Science\u00a03, 417\u2013433 (1993)","journal-title":"Mathematical Structures in Computer Science"},{"key":"14_CR2","doi-asserted-by":"publisher","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 non-deterministic programs. Theoretical Computer Science\u00a043, 123\u2013147 (1986)","journal-title":"Theoretical Computer Science"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/BFb0014683","volume-title":"Program Construction","author":"M. Broy","year":"1979","unstructured":"Broy, M., Gnatz, R., Wirsing, M.: Semantics of nondeterministic and non-continuous constructs. In: Gerhart, S.L., Pair, C., Pepper, P.A., W\u00f6ssner, H., Dijkstra, E.W., Guttag, J.V., Owicki, S.S., Partsch, H., Bauer, F.L., Gries, D., Griffiths, M., Horning, J.J., Wirsing, M. (eds.) Program Construction. LNCS, vol.\u00a069, pp. 553\u2013592. Springer, Heidelberg (1979)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/10722010_4","volume-title":"Mathematics of Program Construction","author":"E. Cohen","year":"2000","unstructured":"Cohen, E.: Separation and reduction. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol.\u00a01837, pp. 45\u201359. Springer, Heidelberg (2000)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(94)00271-J","volume":"149","author":"J. Desharnais","year":"1995","unstructured":"Desharnais, J., Belkhiter, N., Sghaier, S.B.M., Tchier, F., Jaoua, A., Mili, A., Zaguia, N.: Embedding a demonic semilattice in a relation algebra. Theoretical Computer Science\u00a0149, 333\u2013360 (1995)","journal-title":"Theoretical Computer Science"},{"key":"14_CR6","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/978-3-7091-6510-2_11","volume-title":"Relational methods in computer science, ch. 11","author":"J. Desharnais","year":"1997","unstructured":"Desharnais, J., Mili, A., Nguyen, T.T.: Refinement and demonic semantics. In: Brink, C., Kahl, W., Schmidt, G. (eds.) Relational methods in computer science, ch. 11, pp. 166\u2013183. Springer, Heidelberg (1997)"},{"unstructured":"Desharnais, J., M\u00f6ller, B., Struth, G.: Kleene algebra with domain. ACM TOCL (to appear)","key":"14_CR7"},{"issue":"2","key":"14_CR8","first-page":"127","volume":"66","author":"J. Desharnais","year":"2006","unstructured":"Desharnais, J., M\u00f6ller, B., Tchier, F.: Kleene under a modal demonic star. Journal of Logic and Algebraic Programming (Special Issue on Relation Algebra and Kleene Algebra)\u00a066(2), 127\u2013160 (2006)","journal-title":"Journal of Logic and Algebraic Programming (Special Issue on Relation Algebra and Kleene Algebra)"},{"key":"14_CR9","first-page":"363","volume-title":"Programming concepts, methods and calculi","author":"H. Doornbos","year":"1994","unstructured":"Doornbos, H.: A relational model of programs without the restriction to Egli-Milner-monotone constructs. In: Olderog, E.-R. (ed.) Programming concepts, methods and calculi, pp. 363\u2013382. North-Holland, Amsterdam (1994)"},{"doi-asserted-by":"crossref","unstructured":"Dunne, S.: Recasting Hoare and He\u2019s unifying theory of programs in the context of general correctness. In: Butterfield, A., Strong, G., Pahl, C. (eds.) 5th Irish Workshop on Formal Methods. EWiC, The British Computer Society (2001)","key":"14_CR10","DOI":"10.14236\/ewic\/IWFM2001.1"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/11734673_9","volume-title":"Relational Methods in Computer Science","author":"W. Guttmann","year":"2006","unstructured":"Guttmann, W.: Non-termination in Unifying Theories of Programming. In: MacCaull, W., Winter, M., D\u00fcntsch, I. (eds.) RelMiCS 2005. LNCS, vol.\u00a03929, pp. 108\u2013120. Springer, Heidelberg (2006)"},{"unstructured":"Guttmann, W., M\u00f6ller, B.: Modal design algebra. Institut f\u00fcr Informatik, Universit\u00e4t Augsburg, Report 2005-15","key":"14_CR12"},{"key":"14_CR13","volume-title":"Unifying theories of programming","author":"C.A.R. Hoare","year":"1998","unstructured":"Hoare, C.A.R., He, J.: Unifying theories of programming. Prentice-Hall, Englewood Cliffs (1998)"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D. Kozen","year":"1994","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation\u00a0110, 366\u2013390 (1994)","journal-title":"Information and Computation"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/256167.256195","volume":"19","author":"D. Kozen","year":"1997","unstructured":"Kozen, D.: Kleene algebra with tests. ACM TOPLAS\u00a019, 427\u2013443 (1997)","journal-title":"ACM TOPLAS"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-540-27764-4_14","volume-title":"Mathematics of Program Construction","author":"B. M\u00f6ller","year":"2004","unstructured":"M\u00f6ller, B.: Lazy Kleene algebra. In: Kozen, D. (ed.) MPC 2004. LNCS, vol.\u00a03125, pp. 252\u2013273. Springer, Heidelberg (2004)"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-540-27815-3_30","volume-title":"Algebraic Methodology and Software Technology","author":"B. M\u00f6ller","year":"2004","unstructured":"M\u00f6ller, B., Struth, G.: Modal Kleene Algebra and Partial Correctness. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol.\u00a03116, pp. 379\u2013393. Springer, Heidelberg (2004); Revised and extended version: M\u00f6ller, B., Struth, G.: Algebras of modal operators and partial correctness. Theoretical Computer Science 351, 221\u2013239 (2006)"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/11734673_16","volume-title":"Relational Methods in Computer Science","author":"B. M\u00f6ller","year":"2006","unstructured":"M\u00f6ller, B., Struth, G.: wp is wlp. In: MacCaull, W., Winter, M., D\u00fcntsch, I. (eds.) RelMiCS 2005. LNCS, vol.\u00a03929, pp. 200\u2013211. Springer, Heidelberg (2006)"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/69558.69559","volume":"11","author":"G. Nelson","year":"1989","unstructured":"Nelson, G.: A generalization of Dijkstra\u2019s calculus. ACM TOPLAS\u00a011, 517\u2013561 (1989)","journal-title":"ACM TOPLAS"},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1142\/S012905419100008X","volume":"2","author":"T.T. Nguyen","year":"1991","unstructured":"Nguyen, T.T.: A relational model of nondeterministic programs. International J. Foundations Comp. Sci.\u00a02, 101\u2013131 (1991)","journal-title":"International J. Foundations Comp. Sci."},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1145\/358161.358168","volume":"26","author":"D. Parnas","year":"1983","unstructured":"Parnas, D.: A generalized control structure and its formal definition. Commun. ACM\u00a026, 572\u2013581 (1983)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Unifying Theories of Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11768173_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:06:43Z","timestamp":1605643603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11768173_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540347507","9783540347521"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11768173_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}