Modal Tools for Separation and Refinement

Electronic Notes in Theoretical Computer Science

Volumn 214, Issue C, 2008, Pages 81-101

  Struth, Georg ^a  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

automated deduction; Kleene modules; Modal Kleene algebras; separation and refinement; termination and divergence

Indexed keywords

ALGEBRA; SEPARATION; STATE SPACE METHODS;

APPLIED (CO); ELSEVIER (CO); MODAL LOGICS; REFINEMENT LAWS; STATE SPACES;

ISOMERS;

EID: 46049107521     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2008.06.005     Document Type: Article

References (20)

1. Prover9 and Mace4. http://www.cs.unm.edu/~mccune/prover9
2. Spass 3.0. http://spass.mpi-inf.mpg.de/
3. Bachmair L., and Dershowitz N. Commutation, transformation, and termination. In: Siekmann J.H. (Ed). 8th International Conference on Automated Deduction. LNCS 230 (1986) 5-20
4. Blackburn P., de Rijke M., and Venema Y. Modal Logic (2001), Cambridge University Press
5. Cohen E. Separation and reduction. In: Backhouse R., and Oliveira J.N. (Eds). Mathematics of Program Construction. (MPC 2000). LNCS 1837 (2000) 45-59
6. Cohen, E., Omega algebra: the good, the bad, and the ugly, in: R. Backhouse, D. Kozen and B. Möller, editors, Applications of Kleene Algebra, Report of the Dagstuhl Seminar 01081, 2001, p. 5
7. Dershowitz, N., Personal communication, October 2007
8. Desharnais, J., B. Möller and G. Struth, Termination in modal Kleene algebra, in: J.-J. Lévy, E.W. Mayr and J.C. Mitchell, editors, IFIP TCS2004 (2004), pp. 647-660, revised version: Algebraic Notions of Termination. Technical Report 2006-23, Institut für Informatik, Universität Augsburg, 2006
9. Desharnais J., Möller B., and Struth G. Kleene algebra with domain. ACM Trans. Computational Logic 7 (2006) 798-833
10. Desharnais, J. and G. Struth, Domain semirings revisited, Technical Report CS-08-01, Department of Computer Science, University of Sheffield (2008), accepted for MPC 2008
11. Doornbos H., Backhouse R.C., and van der Woude J. A calculational approach to mathematical induction. Theoretical Computer Science 179 (1997) 103-135
12. Doornbos H., and von Karger B. On the union of well-founded relations. L.J. of the IGPL 6 (1998) 195-201
13. Ehm T., Möller B., and Struth G. Kleene modules. In: Berghammer R., Möller B., and Struth G. (Eds). Relational and Kleene-Algebraic Methods in Computer Science. LNCS 3051 (2004) 112-123
14. Geser, A., "Relative Termination," Ph.D. thesis, Fakultät für Mathematik und Informatik, Universität Passau (1990)
15. Höfner P., and Struth G. Nontermination in idempotent semirings. In: Berghammer R., Möller B., and Struth G. (Eds). Relations and Kleene Algebras in Computer Science. LNCS 4988 (2008) 206-220
16. Jónsson B., and Tarski A. Boolean algebras with operators. Part I. American Journal of Mathematics 73 (1951) 891-939
17. Kozen D. A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation 110 (1994) 366-390
18. Leiß H. Kleene modules and linear languages. Journal of Logic and Algebraic Programming 66 (2006) 185-194
19. Struth G. Abstract abstract reduction. Journal of Logic and Algebraic Programming 66 (2006) 239-270
20. von Wright J. Towards a refinement algebra. Science of Computer Programming 51 (2004) 23-45