Proof pearl: Regular expression equivalence and relation algebra

Journal of Automated Reasoning

Volumn 49, Issue 1, 2012, Pages 95-106

  Krauss, Alexander ^a   Nipkow, Tobias ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Decision procedure; Isabelle HOL; Regular expressions

Indexed keywords

BINARY RELATION; BISIMULATION RELATIONS; DECISION PROCEDURE; EQUIVALENCE CHECKER; ISABELLE/HOL; PROOF METHODS; REGULAR EXPRESSIONS; RELATION ALGEBRAS; THEOREM PROVERS; TRANSITIVE CLOSURE;

PATTERN MATCHING;

DATA HANDLING;

EID: 84860884245     PISSN: 01687433     EISSN: 15730670     Source Type: Journal    
DOI: 10.1007/s10817-011-9223-4     Document Type: Article

References (12)

1. Berghofer, S.; Nipkow, T.: Executing higher order logic. In: Callaghan, P.; Luo, Z.; McKinna, J.; Pollack, R. (eds.) Types for Proofs and Programs (TYPES 2000). Lect. Notes in Comp. Sci.; vol. 2277, pp. 24-40. Springer (2000)
2. Bonsangue, M.M.; Caltais, G.; Goriac, E.; Lucanu, D.; J.Rutten, J.M.M.; Silva, A.: A decision procedure for bisimilarity of generalized regular expressions. In: Brazilian Symposium on Formal Methods (SBMF 2010). Lect. Notes in Comp. Sci. Springer (2010)
3. Boyer, R.S.; Moore, J S.: Metafunctions: proving them correct and using them efficiently as new proof procedures. In Boyer, R.; Moore, J S. (eds.) The Correctness Problem in Computer Science, pp. 103-184. Academic Press (1981)
4. Braibant, T.; Pous, D.: An efficient Coq tactic for deciding Kleene algebras. In: Kaufmann, M.; Paulson, L. (eds.) Interactive Theorem Proving (ITP 2010). Lect. Notes in Comp. Sci.; vol. 6172, pp. 163-178. Springer (2010)
5. J Brzozowski 1964 Derivatives of regular expressions J. ACM 11 481 494 174434 0225.94044 10.1145/321239.321249
6. Haftmann, F.; Nipkow, T.: Code generation via higher-order rewrite systems. In: Blume, M.; Kobayashi, N.; Vidal, G. (eds.) Functional and Logic Programming (FLOPS 2010). Lect. Notes in Comp. Sci.; vol. 6009, pp. 103-117. Springer (2010)
7. D Kozen 1994 A completeness theorem for Kleene algebras and the algebra of regular events Inf. Comput. 110 366 390 1276741 0806.68082 10.1006/inco.1994.1037
8. Kozen, D.: On the coalgebraic theory of Kleene algebra with tests. Technical Report, Computing and Information Science, Cornell University. http://hdl.handle.net/1813/10173 (2008)
9. Krauss, A.; Nipkow, T.: Regular sets and expressions. In: Klein, G.; Nipkow, T.; Paulson, L.C. (eds.) The Archive of Formal Proofs. Formal proof development. http://afp.sf.net/entries/Regular-Sets.shtml (2010)
10. S Owens J Reppy A Turon 2009 Regular-expression derivatives re-examined J. Funct. Program. 19 173 190 2486568 1163.68317 10.1017/S0956796808007090
11. Rutten, J.J.M.M.: Automata and coinduction (an exercise in coalgebra). In: Sangiorgi, D.; de Simone, R. (eds.) Concurrency Theory (CONCUR'98). Lect. Notes in Comp. Sci.; vol. 1466, pp. 194-218. Springer (1998) (Pubitemid 128125357)
12. Thiemann, R.; Sternagel, C.: Certification of termination proofs using CeTA. In: Berghofer, S.; Nipkow, T.; Urban, C.; Wenzel, M. (eds.) Theorem Proving in Higher Order Logics (TPHOLs 2009). Lect. Notes in Comp. Sci.; vol. 5674, pp. 452-468. Springer (2009)