Dual Choice and Iteration in an Abstract Algebra of Action

1. Back, R. J. R., Anna Mikhajlova, and Joakim von Wright, Reasoning about interactive systems. In Jeannette M. Wing, Jim Woodcock, and Jim Davies, (eds.), World Congress on Formal Methods, vol. 1709 of Lecture Notes in Computer Science, Springer, 1999, pp. 1460–1476.

2. Back, R. J. R., and Joakim von Wright, Refinement calculus. A systematic introduction. Springer, 1998.

3. Celiku, Orieta, and Joakim von Wright, Implementing angelic nondeterminism. In APSEC, IEEE Computer Society, 2003, pp. 176–185.

4. Cohen, Ernie, Separation and reduction. in Roland Carl Backhouse, and José Nuno Oliveira, (eds.), MPC, vol. 1837 of Lecture Notes in Computer Science, Springer, 2000, pp. 45–59.

5. Desharnais, Jules, Bernhard Möller, Georg Struth : Kleene algebra with domain. ACM Trans. Comput. Log. 7(4), 798–833 (2006)

   Article  Google Scholar 

6. Dijkstra, Edsger W., A Discipline of Programming. Prentice-Hall, 1976.

7. Gries, David, and Fred B. Schneider, A Logical Approach to Discrete Math. Springer, 1993.

8. Hoare C. A. R. : An axiomatic basis for computer programming. Commun. ACM 12(10), 576–580 (1969)

   Article  Google Scholar 

9. Höfner, Peter, Bernhard Möller, and Kim Solin, Omega algebra, demonic refinement algebra and commands. In Schmidt [15], pp. 222–234.

10. Höfner, Peter, and Georg Struth, Automated reasoning in kleene algebra. In Frank Pfenning, (ed.), CADE, vol. 4603 of Lecture Notes in Computer Science, Springer, 2007, pp. 279–294.

11. Höfner, Peter, Georg Struth, Geoff Sutcliffe : Automated verification of refinement laws. Ann. Math. Artif. Intell. 55(1-2), 35–62 (2009)

    Article  Google Scholar 

12. Kozen, Dexter : A completeness theorem for kleene algebras and the algebra of regular events. Inf. Comput. 110(2), 366–390 (1994)

    Article  Google Scholar 

13. Kozen, Dexter : Kleene algebra with tests. ACM Trans. Program. Lang. Syst. 19(3), 427–443 (1997)

    Article  Google Scholar 

14. Pratt, Vaughan : Application of modal logic to programming. Studia Logica 39(2), 257–274 (1980)

    Article  Google Scholar 

15. Schmidt, Renate A., (ed.), RelMiCS/AKA 2006, vol. 4136 of Lecture Notes in Computer Science, Springer, 2006.

16. Segerberg, Krister : Applying modal logic. Studia Logica 39(2), 275–296 (1980)

    Article  Google Scholar 

17. Segerberg, Krister, John-Jules Meyer, and Marcus Kracht, The logic of action. Stanford Encyclopedia of Philosophy, 2009.

18. Solin, Kim, On two dually nondeterministic refinement algebras. In Schmidt [15], pp. 373–387.

19. Solin, Kim : A sketch of a dynamic epistemic semiring. Inf. Comput. 208(5), 594–604 (2010)

    Article  Google Scholar 

20. Solin, Kim, von Joakim Wright : Enabledness and termination in refinement algebra. Sci. Comput. Program. 74(8), 654–668 (2009)

    Article  Google Scholar 

21. Tarski, Alfred : A lattice theoretical fixed point theorem and its applications. Pacific J. Mathematics 5, 285–309 (1955)

    Google Scholar 

22. von Wright, Joakim : Towards a refinement algebra. Sci. Comput. Program. 51(1-2), 23–45 (2004)

    Article  Google Scholar 

Download references