KAT-ML:An interactive theorem prover for kleene algebra with tests

Journal of Applied Non-Classical Logics

Volumn 16, Issue 1-2, 2006, Pages 9-33

  Aboul Hosn, Kamal ^a   Kozen, Dexter ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

Kleene algebra; Mathematical knowledge management; Program verification; Theorem provers

Indexed keywords

EID: 35148817297     PISSN: 11663081     EISSN: 19585780     Source Type: Journal    
DOI: 10.3166/jancl.16.9-33     Document Type: Article

References (37)

1. [Ang 01] Angus A., Kozen D., "Kleene Algebra With Tests And Program Schematology", Report Num. 2001-1844, July 2001, Computer Science Department, Cornell University.
2. [Bal 01] Ball T., Rajamani S. K., "Automatically Validating Temporal Safety Properties Of Interfaces", Proc. 8Th Int. Spin Workshop On Model Checking Of Software (Spin 2001), Vol. 2057 Of Lect. Notes In Comput. Sci., Springer-Verlag, May 2001, P. 103-122. (Pubitemid 33276265)
3. [Bal 03] Ballarin C., "Locales And Locale Expressions In Isabelle/Isar.", Berardi S., Coppo M., Damiani F., Eds., Types, Vol. 3085 Of Lecture Notes In Computer Science, Springer, 2003, P. 34-50.
4. [Bar 02] Barth A., Kozen D., "Equational Verification Of Cache Blocking In Lu Decomposition Using Kleene Algebra With Tests", Report Num. 2002-1865, June 2002, Computer Science Department, Cornell University.
5. [Bau 01] Bauer G., Wenzel M., "Calculational Reasoning Revisited-An Isabelle/Isar Experience", Boulton R. J., Jackson P. B., Eds., Proc. 14Th Int. Conf. Theorem Proving In Higher Order Logics (Tphols'01), Vol. 2152 Of Lect. Notes In Comput. Sci., Springer, 2001.
6. [Coh ] Cohen E., "Lazy Caching In Kleene Algebra", http://Citeseer.Nj.Nec.Com/22581.html.
7. [Coh 93] Cohen E., "Hypotheses In Kleene Algebra", Report Num. Tm-Arh-023814, 1993, Bellcore, http://Citeseer.Nj.Nec.Com/1688.html.
8. [Coh 94] Cohen E., "Using Kleene Algebra To Reason About Concurrency Control", Report, 1994, Telcordia, Morristown, N.J.
9. [Coh 96] Cohen E., Kozen D., Smith F., "The Complexity Of Kleene Algebra With Tests", Report Num. 96-1598, July 1996, Computer Science Department, Cornell University.
10. [Con 71] Conway J. H., Regular Algebra And Finite Machines, Chapman And Hall, London, 1971.
11. [Del 00] Delahaye D., "A Tactic Language For The System Coq", Parigot M., Voronkov A., Eds., Lpar, Vol. 1955 Of Lecture Notes In Computer Science, Springer, 2000, P. 85-95.
12. [Des 03] Desharnais J., Moller B., Struth G., "Kleene Algebra With Domain", Report Num. 2003-07, June 2003, Universitä;T Augsburg, Institut Fü;R Informatik.
13. [Fis 79] Fischer M. J., Ladner R. E., "Propositional Dynamic Logic Of Regular Programs", J. Comput. Syst. Sci., Vol. 18, Num. 2, 1979, P. 194-211.
14. [Har 03] Hardin C., Kozen D., "On The Complexity Of The Horn Theory Of Rel", Report Num. 2003-1896, May 2003, Computer Science Department, Cornell University.
15. [Hic 03] Hickey J., Nogin A., Constable R. L., Aydemir B. E., Barzilay E., Bryukhov Y., Eaton R., Granicz A., Kopylov A., Kreitz C., Krupski V. N., Lorigo L., Schmitt S., Witty C., Yu X., "Metaprl-A Modular Logical Environment", Basin D., Wolff B., Eds., Proc. 16Th Int. Conf. Theorem Proving In Higher Order Logics (Tphols 2003), Vol. 2758 Of Lncs, Springer-Verlag, 2003, P. 287-303.
16. [Jip 01] Jipsen P., "Pcp: Point And Click Proofs", 2001, http://Www1.Chapman.Edu/~Jipsen/Pcp/Pcphome.html.
17. [Kah 03] Kahl W., "Calculational Relation-Algebraic Proofs In Isabelle/Isar", Berghammer R., Mö;Ller B., Struth G., Eds., Proc. Int. Conf. Relational Methods In Computer Science (Relmics'03), Vol. 3051 Of Lecture Notes In Computer Science, Springer, 2003, P. 178-190.
18. [Kat] http://www.Cs.Cornell.Edu/Projects/Kat/.
19. [Kle 56] Kleene S. C., "Representation Of Events In Nerve Nets And Finite Automata", Shannon C. E., Mccarthy J., Eds., Automata Studies, P. 3-41, Princeton University Press, Princeton, N.J., 1956.
20. [Koz 94] Kozen D., "A Completeness Theorem For Kleene Algebras And The Algebra Of Regular Events", Infor. And Comput., Vol. 110, Num. 2, 1994, P. 366-390.
21. [Koz 96] Kozen D., Smith F., "Kleene Algebra With Tests: Completeness And Decidability", Van Dalen D., Bezem M., Eds., Proc. 10Th Int. Workshop Computer Science Logic (Csl'96), Vol. 1258 Of Lecture Notes In Computer Science, Utrecht, The Netherlands, September 1996, Springer-Verlag, P. 244-259.
22. [Koz 97] Kozen D., "Kleene Algebra With Tests", Transactions On Programming Languages And Systems, Vol. 19, Num. 3, 1997, P. 427-443. (Pubitemid 127448489)
23. [Koz 00A] Kozen D., "On Hoare Logic And Kleene Algebra With Tests", Trans. Computational Logic, Vol. 1, Num. 1, 2000, P. 60-76.
24. [Koz 00B] Kozen D., Patron M.-C., "Certification Of Compiler Optimizations Using Kleene Algebra With Tests", Lloyd J., Dahl V., Furbach U., Kerber M., Lau K.-K., Palamidessi C., Pereira L. M., Sagiv Y., Stuckey P. J., Eds., Proc. 1St Int. Conf. Computational Logic (Cl2000), Vol. 1861 Of Lecture Notes In Artificial Intelligence, London, July 2000, Springer-Verlag, P. 568-582.
25. [Koz 02] Kozen D., "On The Complexity Of Reasoning In Kleene Algebra", Information And Computation, Vol. 179, 2002, P. 152-162.
26. [Koz 03A] Kozen D., "Automata On Guarded Strings And Applications", MatéMatica ContemporâNea, Vol. 24, 2003, P. 117-139.
27. [Koz 03B] Kozen D., Tiuryn J., "Substructural Logic And Partial Correctness", Trans. Computational Logic, Vol. 4, Num. 3, 2003, P. 355-378.
28. [Koz 05] Kozen D., Ramanarayanan G., "Publication/Citation: A Proof-Theoretic Approach To Mathematical Knowledge Management", Report Num. 2005-1985, March 2005, Computer Science Department, Cornell University.
29. [Man 74] Manna Z., Mathematical Theory Of Computation, Mcgraw-Hill, 1974.
30. [Mat 01] Mateev N., Menon V., Pingali K., "Fractal Symbolic Analysis", Proc. 15Th Int. Conf. Supercomputing (Ics'01), New York, 2001, Acm Press, P. 38-49. (Pubitemid 32865301)
31. [Nip 03] Nipkow T., "Structured Proofs In Isar/Hol", Geuvers H., Wiedijk F., Eds., Types For Proofs And Programs (Types 2002), Vol. 2646 Of Lncs, Springer, 2003, P. 259-278.
32. [Puc 05] Pucella R., "On Partially Additive Kleene Algebras", Proc. 8Th Int. Conf. Relational Methods In Computer Science (Relmics 8), February 2005.
33. [SØR 98] SØRensen M. H., Urzyczyn P., Lectures On The Curry-Howard Isomorphism, Available As Diku Rapport 98/14, 1998.
34. [Str 01] Struth G., "Isabelle Specification And Proofs Of Church-Rosser Theorems", 2001, http://www.Informatik.Uni-Augsburg.De/ ~Struth/Papers/Isabelle.
35. [Str 02] Struth G., "Calculating Church-Rosser Proofs In Kleene Algebra", Proc. 6Th Int. Conf. Relational Methods In Computer Science (Reimics'01), London, 2002, Springer-Verlag, P. 276-290. (Pubitemid 36137194)
36. [Wen 02] Wenzel M. M., "Isabelle/Isar: A Versatile Environment For Human-Readable Formal Proof Documents", Phd Thesis, Institut Fü;R Informatik, Tu Mü;Nchen, 2002.
37. [Wri 02] Von Wright J., "From Kleene Algebra To Refinement Algebra", Boiten E. A., Mö;Ller B., Eds., Proc. Conf.Mathematics Of Program Construction (Mpc'02), Vol. 2386 Of Lect. Notes In Comput. Sci., Springer, July 2002, P. 233-262.