Diagram chase in relational system development

Electronic Notes in Theoretical Computer Science

Volumn 127, Issue 4, 2005, Pages 87-105

  Ebert, Michael ^a   Struth, Georg ^a  

^a BUNDESWEHR UNIVERSITY MUNICH   (Germany)

Author keywords

B; Coinduction; Diagrams; Formal semantics; Induction; Iterator algebras; Relational system development; Semi commutation; Z

Indexed keywords

ALGEBRA; ALGORITHMS; AUTOMATION; COMPUTER SOFTWARE SELECTION AND EVALUATION; DATA FLOW ANALYSIS; FLOWCHARTING; FUNCTIONS; GRAPH THEORY; RELATIONAL DATABASE SYSTEMS; SEMANTICS;

COINDUCTION; DIAGRAMS; FORMAL SEMANTICS; INDUCTION; ITERATOR ALGEBRAS; RELATIONAL SYSTEM DEVELOPMENT; SEMI-COMMUTATION;

SOFTWARE ENGINEERING;

EID: 16244365545     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.08.049     Document Type: Conference Paper

References (22)

1. P.A. Abdulla, B. Jonsson, M. Kindahl, and D. Peled A general approach to partial order reductions in symbolic verification A.J. Hu M.Y. Vardi Computer Aided Verification, 10th International Conference CAV'98 LNCS 1427 1998 379 390
2. Aboul-Hosn, K. and D. Kozen, KAT-ML: An interactive theorem prover for Kleene algebra with tests, in: B. Konev and R. Schmidt, editors, 4th International Workshop on the Implementation of Logics, Technical Report ULCS-03-018, University of Liverpool, 2003, pp. 2-12
3. J.-R. Abrial The B-Book 1996 Cambridge University Press
4. F. Baader, and T. Nipkow Term Rewriting and All That 1998 Cambrigde University Press
5. L. Bachmair, and N. Dershowitz Commutation, transformation, and termination J.H. Siekmann 8th International Conference on Automated Deduction LNCS 230 1986 5 20
6. E. Cohen Separation and reduction R. Backhouse J.N. Oliveira Proc. of Mathematics of Program Construction, 5th International Conference MPC 2000 LNCS 1837 2000 45 59
7. M. Davis Computability and Unsolvability 1958 McGraw-Hill
8. Desharnais, J. (2004), personal communication
9. Desharnais, J., B. Möller and G. Struth, Kleene algebra with domain, ACM Transactions on Computational Logic (2004), to appear
10. J. Desharnais, B. Möller, and G. Struth Termination of modal Kleene algebra J. Mitchell IFIP-TCS 2004 2004 to appear
11. P. Freyd, and A. Scedrov Categories, Allegories 1990 North-Holland
12. M. Jamnik Mathematical Reasoning with Diagrams: From Intuition to Automation 2001 CSLI Press
13. W. Kahl Calculation relation-algebraic proofs in Isabelle/Isar R. Berghammer B. Möller G. Struth Relational and Kleene-Algebraic Methods in Computer Science LNCS 3051 2004 178 190
14. D. Kozen A completeness theorem for Kleene algebras and the algebra of regular events Information and Computation 110 1994 366 390
15. D. Kozen Kleene algebra with tests Trans. Programming Languages and Systems 19 1997 427 443
16. B. Möller Lazy Kleene algebra D. Kozen Mathematics of Program Construction: 7th International Conference MPC 2004 LNCS 2004 to appear
17. T. Nipkow More Church-Rosser proofs (in Isabelle/HOL) J. Automated Reasoning 26 2001 51 66
18. J.M. Spivey Understanding Z 1988 Cambrigde University Press
19. G. Struth Calculating Church-Rosser proofs in Kleene algebra H. de Swart Relational Methods in Computer Science, 6th International Conference LNCS 2561 2002 276 290
20. G. Struth Abstract abstract rewriting Journal of Logic and Algebraic Programming 2004 to appear
21. J. von Wright From Kleene algebra to refinement algebra E.A. Boiten B. Möller Mathematics of Program Construction: 6th International Conference MPC 2002 LNCS 2386 2002 233 263
22. W. Wechler Universal Algebra for Computer Scientists 1992 Springer