Automated reasoning in Kleene algebra

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

Volumn 4603 LNAI, Issue , 2007, Pages 279-294

  Höfner, Peter ^a   Struth, Georg ^a  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; CONCURRENCY CONTROL; MODEL CHECKING; THEOREM PROVING;

AUTOMATED DEDUCTION; HEAVY-WEIGHT AUTOMATION; TEMPORAL LOGICS; TERMINATION ANALYSIS;

ALGEBRA;

EID: 35148862168     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-73595-3_19     Document Type: Conference Paper

References (26)

1. http://www.des.shef.ac.uk/~georg/ka
2. Prover9 and Mace4. http://www.cs.unm.edu/~mccune/mace4
3. Aboul-Hosn, K., Kozen, D.: KAT-ML: An interactive theorem prover for Kleene algebra with tests. Journal of Applied Non-Classical Logics 16(1-2), 9-33 (2006)
4. Bachmair, L., Dershowitz, N.: Commutation, transformation, and termination. In: Siekmann, J.H. (ed.) 8th International Conference on Automated Deduction. LNCS, vol. 230, pp. 5-20. Springer, Heidelberg (1986)
5. Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)
6. Cohen, E.: Separation and reduction. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol. 1837, pp. 45-59. Springer, Heidelberg (2000)
7. Conway, J.H.: Regular Algebra and Finite Machines. Chapman & Hall, Sydney (1971)
8. De Nivelle, H., Schmidt, R.A., Hustadt, U.: Resolution-based methods for modal logics. Logic Journal of the IGPL 8(3), 265-292 (2000)
9. Desharnais, J., Möller, B., Struth, G.: Kleene algebra with domain. ACM Trans. Computational Logic 7(4), 798-833 (2006)
10. Ebert, M., Struth, G.: Diagram chase in relational system development. In: Minas, M. (ed.) 3rd IEEE workshop on Visual Languages and Formal Methods (VLFM'04), ENTCS, vol. 127, pp. 87-105. Elsevier, Amsterdam (2005)
11. Ehm, T., Möller, B., Struth, G.: Kleene modules. In: Berghammer, R., Möller, B., Struth, G. (eds.) Relational and Kleene-Algebraic Methods in Computer Science. LNCS, vol. 3051, pp. 112-123. Springer, Heidelberg (2004)
12. Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (2000)
13. Höfner, P., Struth, G.: Can refinement be automated? Technical Report CS-07-08, Department of Computer Science, University of Sheffield (2007)
14. Jipsen, P.: Personal communication
15. Kahl, W.: Calculational relation-algebraic proofs in Isabelle/Isar. In: Berghammer, R., Möller, B., Struth, G. (eds.) Relational and Kleene-Algebraic Methods in Computer Science. LNCS, vol. 3051, pp. 179-190. Springer, Heidelberg (2004)
16. Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation 110(2), 366-390 (1994)
17. Kozen, D.: On Hoare logic and Kleene algebra with tests. ACM Trans. Computational Logic 1(1), 60-76 (2000)
18. Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems-
19. Specification. Springer, Heidelberg (1991)
20. Möller, B., Struth, G.: Algebras of modal operators and partial correctness. Theoretical Computer Science 351(2), 221-239 (2006)
21. Nipkow, T.: More Church-Rosser proofs (in Isabelle/HOL). J. Automated Reasoning 26(1), 51-66 (2001)
22. Ohlbach, H.J., Nonnengart, A., de Rijke, M., Gabbay, D.: Encoding Two-Valued Nonclassical Logics in Classic Logic. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning (chapter 21), pp. 1403-1485. Elsevier, Amsterdam (2001)
23. Struth, G.: Calculating Church-Rosser proofs in Kleene algebra. In: de Swart, H. (ed.) RelMiCS 2001. LNCS, vol. 2561, pp. 276-290. Springer, Heidelberg (2002)
24. Struth, G.: Abstract abstract reduction. Journal of Logic and Algebraic Programming 66(2), 239-270 (2006)
25. Terese (ed.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003)
26. von Karger, B.: Temporal algebra. Mathematical Structures in Computer Science 8(3), 277-320 (1998)