Kleene under a modal demonic star

Journal of Logic and Algebraic Programming

Volumn 66, Issue 2, 2006, Pages 127-160

  Desharnais, Jules ^a   Möller, Bernhard ^b   Tchier, Fairouz ^c  

^a UNIVERSITÉ LAVAL   (Canada)

^b UNIVERSITY OF AUGSBURG   (Germany)

^c KING SAUD UNIVERSITY   (Saudi Arabia)

Author keywords

Demonic semantics; Generalisation; Kleene algebra; Relational abstraction; Rule; Verification; While loop

Indexed keywords

ITERATIVE METHODS; MATHEMATICAL PROGRAMMING; SEMANTICS; SET THEORY; THEOREM PROVING;

DEMONIC SEMANTICS; GENERALISATION; KLEENE ALGEBRA; RELATIONAL ABSTRACTION; RULES; VERIFICATION; WHILE LOOP;

ALGEBRA;

EID: 30744447964     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jlap.2005.04.006     Document Type: Article

References (38)

1. R. Back, and J. von Wright Refinement Calculus-A Systematic Introduction 1998. Springer Berlin
2. R.C. Backhouse Fixed point calculus Information Processing Letters 53 1995 131 136
3. R.C. Backhouse, and J. van der Woude Demonic operators and monotype factors Mathematical Structures in Computer Science 3 4 1993 417 433
4. R. Berghammer, and H. Zierer Relational algebraic semantics of deterministic and nondeterministic programs Theoretical Computer Science 43 1986 123 147
5. N. Boudriga, F. Elloumi, and A. Mili On the lattice of specifications: Applications to a specification methodology Formal Aspects of Computing 4 1992 544 571
6. C. Brink W. Kahl G. Schmidt Relational Methods in Computer Science 1997. Springer Berlin
7. E. Cohen Separation and reduction R. Backhouse J.N. Oliveira Mathematics of Program Construction, Fifth International Conference (MPC 2000) Lecture Notes in Computer Science vol. 1837 2000 Springer Berlin 45 59
8. J.H. Conway Regular Algebra and Finite Machines 1971 Chapman and Hall London
9. 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 2 1995 333 360
10. J. Desharnais, A. Mili, and T.T. Nguyen Refinement and demonic semantics C. Brink W. Kahl G. Schmidt Relational Methods in Computer Science 1997 Springer Berlin 166 183 (Chapter 11).
11. J. Desharnais, B. Möller, G. Struth, Kleene algebra with domain, ACM Transactions on Computational Logic, in press.
12. J. Desharnais, B. Möller, and G. Struth Termination in modal Kleene algebra J.-J. Lévy E. Mayr J. Mitchell Exploring New Frontiers of Theoretical Informatics IFIP International Federation for Information Processing Series vol. 155 2004 Kluwer Dordrecht 653 666
13. J. Desharnais, B. Möller, G. Struth, Applications of modal Kleene algebra-A survey, Journal on Relational Methods in Computer Science 1 (2004) 93-131. Available from < http://www.cosc.brocku.ca/Faculty/Winter/JoRMiCS/ >.
14. J. Desharnais, B. Möller, and F. Tchier Kleene under a demonic star T. Rus Algebraic Methodology and Software Technology, Eight International Conference (AMAST 2000) Lecture Notes in Computer Science vol. 1816 2000 Springer Berlin 355 370
15. J. Desharnais, and B. Möller Characterizing determinacy in Kleene algebras Information Sciences 139 3-4 2001 253 273
16. E.W. Dijkstra Guarded commands, nondeterminacy and the formal derivation of programs Communications of the ACM 18 8 1975 453 457
17. R. Goldblatt An algebraic study of well-foundedness Studia Logica 44 4 1985 422 437
18. W. Guttmann, Non-termination in unifying theories of programming, in: I. Düntsch, M. Winter (Eds.), Proceedings of the 8th International Seminar on Relational Methods in Computer Science/3rd Workshop on Applications of Kleene Algebra, St Catharine's, Ont., February 22-26, 2005, pp. 87-94.
19. D. Harel, D. Kozen, and J. Tiuryn Dynamic Logic 2000. The MIT Press Cambridge, MA
20. E. Hehner Predicative programming, Parts I and II Communications of the ACM 27 1984 134 151
21. C. Hoare, and J. He Unifying Theories of Programming 1998. Prentice Hall Englewood Cliffs, NJ
22. D. Kozen A completeness theorem for Kleene algebras and the algebra of regular events Information and Computation 110 2 1994 366 390
23. D. Kozen Kleene algebras with tests ACM Transactions on Programming Languages and Systems 19 1997 427 443
24. R.C. Linger, H.D. Mills, and B.I. Witt Structured Programming-Theory and Practice 1979. Addison-Wesley Reading, MA
25. A. Mili, J. Desharnais, and F. Mili Relational heuristics for the design of deterministic programs Acta Informatica 24 3 1987 239 276
26. H.D. Mills The new math of computer programming Communications of the ACM 18 1 1975 43 48
27. B. Möller, Typed Kleene algebras, Technical report 1999/8, Universität Augsburg, Institut für Informatik, December 1999. Available from: < http://www.informatik.uni-augsburg.de/forschung/ techBerichte/reports/1999-8.pdf>.
28. B. Möller Derivation of graph and pointer algorithms B. Möller H.A. Partsch S.A. Schuman Formal Program Development Lecture Notes in Computer Science vol. 755 1993 Springer Berlin 123 160
29. B. Möller Lazy Kleene algebra D. Kozen Mathematics of Program Construction, Seventh International Conference Lecture Notes in Computer Science vol. 3125 2004 Springer Berlin 252 273
30. B. Möller, and G. Struth Modal Kleene algebra and partial correctness C. Rattray S. Maharaj C. Shankland Algebraic Methodology and Software Technology, Tenth International Conference (AMAST 2004) Lecture Notes in Computer Science vol. 3116 2004 Springer Berlin 379 393
31. B. Möller, G. Struth, WP is WLP, in: I. Düntsch, M. Winter (Eds.), Proceedings of the 8th International Seminar Relational Methods in Computer Science/3rd Workshop on Applications of Kleene Algebra, St Catharine's, Ont., February 22-26, 2005, pp. 171-178.
32. T.S. Norvell Predicative semantics of loops R.S. Bird L. Meertens Algorithmic Languages and Calculi 1997 Chapman and Hall London 415 437
33. S. Popkorn First Steps in Modal Logic 1994. Cambridge University Press Cambridge
34. G. Schmidt, and T. Ströhlein Relations and Graphs EATCS Monographs in Computer Science 1993. Springer Berlin
35. E. Sekerinski A calculus for predicative programming R.S. Bird C.C. Morgan J.C.P. Woodcock Mathematics of Program Construction, Second International Conference (MPC 1992) Lecture Notes in Computer Science vol. 669 1993 Springer Berlin 302 322
36. A. Tarski On the calculus of relations Journal of Symbolic Logic 6 3 1941 73 89
37. F. Tchier, Sémantiques relationelles démoniaques et vérification de boucles non-déterministes, Ph.D. Thesis, Département de Mathématiques, Université Laval, Canada, 1996.
38. F. Tchier, J. Desharnais, Applying a generalisation of a theorem of Mills to generalised looping structures, in: Colloquium Science and Engineering for Software Development, organised in the memory of Dr. Harlan D. Mills, and affiliated to the Twenty-First International Conference on Software Engineering, Los Angeles, May 18, 1999, pp. 31-38.