Demonic algebra with domain

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

Volumn 4136 LNCS, Issue , 2006, Pages 120-134

  De Carufel, Jean Lou ^a   Desharnais, Jules ^a  

^a UNIVERSITÉ LAVAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; MATHEMATICAL OPERATORS; PROBLEM SOLVING;

DEMONIC ALGEBRA WITH DOMAIN (DAD); ISOMORPHISM; KLEENE ALGEBRA WITH DOMAIN (KAD);

ALGEBRA;

EID: 33750078686     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11828563_8     Document Type: Conference Paper

References (24)

1. Backhouse, R.C., van der Woude, J.: Demonic operators and monotype factors. Mathematical Structures in Computer Science 3 (1993) 417-433
2. Berghammer, R., Zierer, H.: Relational algebraic semantics of deterministic and nondeterministic programs. Theoretical Computer Science 43 (1986) 123-147
3. Cohen, E.: Separation and reduction. In: Mathematics of Program Construction. Volume 1837 of Lecture Notes in Computer Science, Springer (2000) 45-59
4. Conway, J.: Regular Algebra and Finite Machines. Chapman and Hall, London (1971)
5. De Carufel, J.L., Desharnais, J.: Demonic algebra with domain. Research report DIUL-RR-0601, Département d'informatique et de génie logiciel, Université Laval, Canada (2006). Available at http://www.ift.ulaval.ca/~Desharnais/Recherche/RR/DIUL-RR-0601.pdf
6. Desharnais, J., Belkhiter, N., Sghaier, S., Tchier, F., Jaoua, A., Mili, A., Zaguia, N.: Embedding a demonic semilattice in a relation algebra. Theoretical Computer Science 149 (1995) 333-360
7. Desharnais, J., Mili, A., Nguyen, T.: Refinement and demonic semantics. In Brink, C., Kahl, W., Schmidt, G., eds.: Relational Methods in Computer Science, Springer (1997) 166-183
8. Desharnais, J., Möller, B., Struth, G.: Kleene algebra with domain. Technical Report 2003-7, Institut für Informatik, Augsburg, Germany (2003)
9. Desharnais, J., Möller, B., Struth, G.: Modal Kleene algebra and applications - a survey. JoRMiCS - Journal on Relational Methods in Computer Science 1 (2004) 93-131
10. Desharnais, J., Möller, B., Struth, G.: Kleene algebra with domain. To appear in ACM Transactions on Computational Logic (2006)
11. Desharnais, J., Möller, B., Tchier, F.: Kleene under a demonic star. In: AMAST 2000. Volume 1816 of Lecture Notes in Computer Science, Springer (2000) 355-370
12. Desharnais, J., Möller, B., Tchier, F.: Kleene under a modal demonic star. Journal of Logic and Algebraic Programming, Special issue on Relation Algebra and Kleene Algebra 66 (2006) 127-160
13. Hoare, C.A.R., Hayes, I.J., Jifeng, H., Morgan, C.C., Roscoe, A.W., Sanders, J.W., Sorensen, I.H., Spivey, J.M., Sufrin, B.A.: Laws of programming. Communications of the ACM 30 (1987) 672-686
14. Hoare, C.A.R., Jifeng, H.: Unifying Theories of Programming. International Series in Computer Science. Prentice Hall (1998)
15. Höfner, P., Möller, B., Solin, K.: Omega algebra, demonic refinement algebra and commands. These proceedings
16. Kahl, W.: Parallel composition and decomposition of specifications. Information Sciences 139 (2001) 197-220
17. Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation 110 (1994) 366-390
18. Kozen, D.; Kleene algebra with tests. ACM Transactions on Programming Languages and Systems 19 (1997) 427-443
19. Maddux, R.: Relation-algebraic semantics. Theoretical Computer Science 160 (1996) 1-85
20. McCarthy, J.: A basis for a mathematical theory of computation. In Braffort, P., Hirschberg, D., eds.: Computer Programming and Formal Systems, North-Holland, Amsterdam (1963) 33-70. Available at http://ww-formal.stanford. edu/jmc/basis/basis.html
21. Möller, B.: Lazy Kleene algebra. In Kozen, D., Shankland, C., eds.: Mathematics of Program Construction. Volume 3125 of Lecture Notes in Computer Science, Springer (2004) 252-273
22. Solin, K., von Wright, J.: Refinement algebra with operators for enabledness and termination. In: Mathematics of Program Construction. Lecture Note in Computer Science, Springer-Verlag (2006). In press
23. Tchier, F., Desharnais, J.: Applying a generalisation of a theorem of Mills to generalised looping structures. In: Colloquium on Science and Engineering for Software Development, organised in the memory of Dr. Harlan D. Mills, and affiliated to the 21st International Conference on Software Engineering, Los Angeles (1999) 31-38
24. von Wright, J.: Towards a refinement algebra. Science of Computer Programming 51 (2004) 23-45