{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T06:44:35Z","timestamp":1770273875010,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540333395","type":"print"},{"value":"9783540333401","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11734673_16","type":"book-chapter","created":{"date-parts":[[2006,7,3]],"date-time":"2006-07-03T21:59:04Z","timestamp":1151963944000},"page":"200-211","source":"Crossref","is-referenced-by-count":24,"title":["wp Is wlp"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"M\u00f6ller","sequence":"first","affiliation":[]},{"given":"Georg","family":"Struth","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511624162","volume-title":"The B-Book","author":"J.-R. Abrial","year":"1996","unstructured":"Abrial, J.-R.: The B-Book. Cambridge University Press, Cambridge (1996)"},{"key":"16_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2714-2","volume-title":"Verification of Sequential and Concurrent Programs","author":"K.-R. Apt","year":"1997","unstructured":"Apt, K.-R., Olderog, E.-R.: Verification of Sequential and Concurrent Programs, 2nd edn. Springer, Heidelberg (1997)","edition":"2"},{"issue":"4","key":"16_CR3","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(4), 417\u2013433 (1993)","journal-title":"Mathematical Structures in Computer Science"},{"key":"16_CR4","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":"16_CR5","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":"16_CR6","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":"16_CR7","volume-title":"Regular algebra and finite machines","author":"J.H. Conway","year":"1971","unstructured":"Conway, J.H.: Regular algebra and finite machines. Chapman and Hall, London (1971)"},{"key":"16_CR8","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":"16_CR9","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-7091-6510-2_11","volume-title":"Relational methods in computer science","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.\u00a011, pp. 166\u2013183. Springer, Heidelberg (1997)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Desharnais, J., M\u00f6ller, B., Struth, G.: Kleene algebra with domain. ACM Transactions on Computational Logic (to appear)","DOI":"10.1145\/1183278.1183285"},{"key":"16_CR11","series-title":"IFIP International Federation for Information Processing Series","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/1-4020-8141-3_49","volume-title":"Exploring new frontiers of theoretical informatics","author":"J. Desharnais","year":"2004","unstructured":"Desharnais, J., M\u00f6ller, B., Struth, G.: Termination in modal Kleene algebra. In: L\u00e9vy, J.-J., Mayr, E., Mitchell, J. (eds.) Exploring new frontiers of theoretical informatics. IFIP International Federation for Information Processing Series, vol.\u00a0155, pp. 653\u2013666. Kluwer, Dordrecht (2004)"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Desharnais, J., M\u00f6ller, B., Tchier, F.: Kleene under a modal demonic star. Journal on Logic and Algebraic Programming, Special Issue on Relation Algebra and Kleene Algebra (to appear, 2005)","DOI":"10.1016\/j.jlap.2005.04.006"},{"key":"16_CR13","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)"},{"key":"16_CR14","unstructured":"Ehm, T.: The Kleene algebra of nested pointer structures: theory and applications. Universit\u00e4t Augsburg, Ph.D Thesis (December 2003)"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11768173_14","volume-title":"Unifying Theories of Programming","author":"W. Guttmann","year":"2006","unstructured":"Guttmann, W., M\u00f6ller, B.: Modal design algebra. In: Dunne, S., Stoddart, B. (eds.) UTP 2006. LNCS, vol.\u00a04010. Springer, Heidelberg (2006); Preliminary version: Institut f\u00fcr Informatik, Universit\u00e4t Augsburg, Report 2005-15"},{"key":"16_CR16","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2516.001.0001","volume-title":"Dynamic Logic","author":"D. Harel","year":"2000","unstructured":"Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (2000)"},{"key":"16_CR17","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":"16_CR18","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/256167.256195","volume":"19","author":"D. Kozen","year":"1997","unstructured":"Kozen, D.: Kleene algebras with tests. ACM TOPLAS\u00a019, 427\u2013443 (1997)","journal-title":"ACM TOPLAS"},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0167-6423(93)90008-D","volume":"21","author":"B. M\u00f6ller","year":"1993","unstructured":"M\u00f6ller, B.: Towards pointer algebra. Science of Computer Programming\u00a021, 57\u201390 (1993)","journal-title":"Science of Computer Programming"},{"key":"16_CR20","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":"16_CR21","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)"},{"key":"16_CR22","unstructured":"M\u00f6ller, B., Struth, G.: WP is WLP. Institut f\u00fcr Informatik, Universit\u00e4t Augsburg, Report 2004-14 (2004)"},{"key":"16_CR23","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 Transactions on Programming Languages and Systems\u00a011, 517\u2013561 (1989)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"16_CR24","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":"16_CR25","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"},{"key":"16_CR26","volume-title":"Understanding Z","author":"J.M. Spivey","year":"1988","unstructured":"Spivey, J.M.: Understanding Z. Cambridge University Press, Cambridge (1988)"},{"key":"16_CR27","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.scico.2003.09.002","volume":"51","author":"J. Wright von","year":"2004","unstructured":"von Wright, J.: Towards a refinement algebra. Science of Computer Programming\u00a051, 23\u201345 (2004)","journal-title":"Science of Computer Programming"}],"container-title":["Lecture Notes in Computer Science","Relational Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11734673_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T19:24:56Z","timestamp":1555701896000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11734673_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540333395","9783540333401"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11734673_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}