Wp Is wlp

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3929 LNCS, Issue , 2006, Pages 200-211

  Möller, Bernhard ^a   Struth, Georg ^b  

^a UNIVERSITY OF AUGSBURG   (Germany)

^b BUNDESWEHR UNIVERSITY MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL OPERATORS; MATHEMATICAL PROGRAMMING; MODAL ANALYSIS; SEMANTICS; VECTORS;

HOARE LOGIC; KLEENE ALGEBRA; TRANSITION RELATION; WLP OPERATOR;

ALGEBRA;

EID: 33745788152     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11734673_16     Document Type: Conference Paper

References (28)

1. J.-R. Abrial: The B-Book. Cambridge University Press 1996
2. K.-R. Apt, E.-R. Olderog: Verification of Sequential and Concurrent Programs, 2nd edition. Springer 1997
3. R. C. Backhouse, J. van der Woude: Demonic operators and monotype factors. Mathematical Structures in Computer Science, 3(4):417-433 (1993)
4. R. Berghammer, H. Zierer: Relational algebraic semantics of deterministic and non-deterministic programs. Theoretical Computer Science, 43:123-147 (1986)
5. M. Broy, R. Gnatz, M. Wirsing: Semantics of nondeterministic and non-continuous constructs. In F.L. Bauer, M. Broy (eds.): Program construction. Lecture Notes in Computer Science 69. Berlin: Springer 1979, 553-592
6. E. Cohen: Separation and reduction. In R. Backhouse, J. N. Oliveira(eds.): Mathematics of Program Construction. Lecture Notes in Computer Science 1837. Berlin: Springer 2000, 45-59
7. J.H. Conway: Regular algebra and finite machines. London: Chapman and Hall 1971
8. J. Desharnais, N. Belkhiter, S.B.M. Sghaier, F. Tchier, A. Jaoua, A. Mili, and N. Zaguia: Embedding a demonic semilattice in a relation algebra. Theoretical Computer Science 149:333-360 (1995)
9. J. Desharnais, A. Mili, T.T. Nguyen: Refinement and demonic semantics. In C. Brink, W. Kahl, G. Schmidt (eds): Relational methods in computer science, Chapter 11. Springer 1997, 166-183
10. J. Desharnais, B. Möller, G. Struth: Kleene algebra with domain. ACM Transactions on Computational Logic (to appear)
11. J. Desharnais, B. Möller, G. Struth: Termination in modal Kleene algebra. In J.-J. Lévy, E. Mayr, and J. Mitchell, editors, Exploring new frontiers of theoretical informatics. IFIP International Federation for Information Processing Series 155. Kluwer 2004, 653-666
12. J. Desharnais, B. Möller F. Tchier: Kleene under a modal demonic star. Journal on Logic and Algebraic Programming, Special Issue on Relation Algebra and Kleene Algebra, 2005 (to appear)
13. H. Doornbos: A relational model of programs without the restriction to Egli-Milnermonotone constructs. In E.-R. Olderog (ed.): Programming concepts, methods and calculi. North-Holland 1994, 363-382
14. T. Ehm: The Kleene algebra of nested pointer structures: theory and applications. Universität Augsburg, PhD Thesis, Dec. 2003
15. W. Guttmann, B. Möller: Modal design algebra. In: S. Dunne (ed.): Proc. First International Symposium on Unifying Theories of Programming, Walworth Castle, 5-7 Feb. 2006.
16. To appear in LNCS. Preliminary version: Institut für Informatik, Universität Augsburg, Report 2005-15
17. D. Harel, D. Kozen, J. Tiuryn: Dynamic Logic. MIT Press 2000
18. C.A.R. Hoare, J. He: Unifying theories of programming. Prentice Hall 1998
19. D. Kozen: Kleene algebras with tests. ACM TOPLAS 19:427-443 (1997)
20. B. Möller: Towards pointer algebra. Science of Computer Programming 21:57-90 (1993)
21. B. Möller: Lazy Kleene algebra. In D. Kozen (ed.): Mathematics of Program Construction. Lecture Notes in Computer Science 3125. Berlin: Springer 2004, 252-273
22. B. Möller, G. Struth: Modal Kleene algebra and partial correctness. In C. Rattray, S. Maharaj, C. Shankland (eds.): Algebraic methods and software technology. Lecture Notes in Computer Science 3116. Berlin: Springer 2004, 379-393
23. B. Möller, G. Struth: WP is WLP. Institut für Informatik, Universität Augsburg, Report 2004-14
24. G. Nelson: A generalization of Dijkstra's calculus. ACM Transactions on Programming Languages and Systems 11:517-561 (1989)
25. T.T. Nguyen: A relational model of nondeterministic programs. International J. Foundations Comp. Sci. 2:101-131 (1991)
26. D. Parnas: A generalized control structure and its formal definition. Commun. ACM 26:572-581 (1983)
27. J. M. Spivey: Understanding Z. Cambrigde University Press 1988
28. J. von Wright: Towards a refinement algebra. Science of Computer Programming 51:23-45 (2004)