Diagram Chase in Relational System Development

Authors:
Michael Ebert;Georg Struth
Affiliations:
Department of Computer Science, University of the Federal Armed Forces Munich, Germany;Department of Computer Science, University of the Federal Armed Forces Munich, Germany
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 10
Cited 3

Commutation, transformation, and termination

Proc. of the 8th international conference on Automated deduction
A completeness theorem for Kleene algebras and the algebra of regular events

Papers presented at the IEEE symposium on Logic in computer science
Kleene algebra with tests

ACM Transactions on Programming Languages and Systems (TOPLAS)
Term rewriting and all that

Term rewriting and all that
More Church–Rosser Proofs

Journal of Automated Reasoning
Calculating Church-Rosser Proofs in Kleene Algebra

ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
A General Approach to Partial Order Reductions in Symbolic Verification (Extended Abstract)

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Separation and Reduction

MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
From Kleene Algebra to Refinement Algebra

MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
Kleene algebra with domain

ACM Transactions on Computational Logic (TOCL)

Can Refinement be Automated?

Electronic Notes in Theoretical Computer Science (ENTCS)
Automated Reasoning in Kleene Algebra

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Automated verification of refinement laws

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

We propose diagrammatic techniques for visualizing relational reasoning in formal methods like B or Z; in particular for induction and coinduction. These are similar to those for functional diagrams in category theory and inspired by rewriting theory. Diagrams are endowed with a simple algebraic semantics that imposes a convenient balance between expressive and algorithmic power. This makes the approach particularly suitable for mechanization and automation. Its usefulness for visual reasoning is illustrated by various examples.