KAT-ML: an interactive theorem prover for Kleene algebra with tests
Authors:
- 1 January 2006
- journal article
- Published by Taylor & Francis in Journal of Applied Non-Classical Logics
- Vol. 16 (1-2) , 9-34
Abstract
We describe KAT-ML, an implementation of an interactive theorem prover for Kleene algebra with tests (KAT). The system is designed to reflect the natural style of reasoning with KAT that one finds in the literature. One can also use the system to reason about properties of simple imperative programs using schematic KAT (SKAT). We explain how the system works and illustrate its use with some examples, including an extensive scheme equivalence proof.Keywords
This publication has 9 references indexed in Scilit:
- Substructural logic and partial correctnessACM Transactions on Computational Logic, 2003
- Calculating Church-Rosser Proofs in Kleene Algebra2002
- On the Complexity of Reasoning in Kleene AlgebraInformation and Computation, 2002
- Fractal symbolic analysis2001
- On Hoare logic and Kleene algebra with testsACM Transactions on Computational Logic, 2000
- Kleene algebra with testsACM Transactions on Programming Languages and Systems, 1997
- A Completeness Theorem for Kleene Algebras and the Algebra of Regular EventsInformation and Computation, 1994
- Propositional dynamic logic of regular programsJournal of Computer and System Sciences, 1979
- Representation of Events in Nerve Nets and Finite Automata1956