An efficient Coq tactic for deciding Kleene algebras

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6172 LNCS, Issue , 2010, Pages 163-178

  Braibant, Thomas ^a   Pous, Damien ^a  

^a UNIV GRENOBLE ALPES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY RELATION; COQ PROOF ASSISTANT; DECISION PROCEDURE; EQUATIONAL THEORY; KLEENE ALGEBRAS;

ALGEBRA; PROBLEM SOLVING;

THEOREM PROVING;

EID: 77955245911     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14052-5_13     Document Type: Conference Paper

References (34)

1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)
2. Allen, S.F., Constable, R.L., Howe, D.J., Aitken, W.E.: The semantics of reflected proof. In: LICS, pp. 95-105. IEEE Computer Society, Los Alamitos (1990)
3. Bertot, Y., Gonthier, G., Ould Biha, S., Pasca, I.: Canonical big operators. In: Mohamed, O.A., Muñoz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 86-101. Springer, Heidelberg (2008)
4. Blanqui, F., Coupet-Grimal, S., Delobel, W., Koprowski, A.: CoLoR: a Coq library on rewriting and termination (2006)
5. Braibant, T., Pous, D.: Coq library: ATBR, algebraic tools for working with binary relations (May 2009), http://sardes.inrialpes.fr/~braibant/atbr/
6. Briais, S.: Coq development: Finite automata theory (July 2008), http://www.prism.uvsq.fr/~bris/tools/Automata-080708.tar.gz
7. Brüggemann-Klein, A.: Regular expressions into finite automata. TCS 120(2), 197-213 (1993)
8. Cohen, E., Kozen, D., Smith, F.: The complexity of Kleene algebra with tests, TR96-1598, CS Dpt., Cornell University (July 1996)
9. Conchon, S., Filliâtre, J.-C.: A Persistent Union-Find Data Structure. In: ACM SIGPLAN Workshop on ML, Freiburg, Germany, October 2007, pp. 37-45 (2007)
10. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
11. Doornbos, H., Backhouse, R., van der Woude, J.: A calculational approach to mathematical induction. TCS 179(1-2), 103-135 (1997)
12. Garillot, F., Gonthier, G., Mahboubi, A., Rideau, L.: Packaging mathematical structures. In: Urban, C. (ed.) TPHOLs 2009. LNCS, vol. 5674, pp. 327-342. Springer, Heidelberg (2009)
13. Gonthier, G., Mahboubi, A., Rideau, L., Tassi, E., Théry, L.: A modular formalisation of finite group theory. In: Schneider, K., Brandt, J. (eds.) TPHOLs 2007. LNCS, vol. 4732, pp. 86-101. Springer, Heidelberg (2007)
14. Grégoire, B., Mahboubi, A.: Proving equalities in a commutative ring done right in Coq. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol. 3603, pp. 98-113. Springer, Heidelberg (2005)
15. Höfner, P., Struth, G.: Automated reasoning in Kleene algebra. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 279-294. Springer, Heidelberg (2007)
16. Höfner, P., Struth, G.: On automating the calculus of relations. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 50-66. Springer, Heidelberg (2008)
17. Ilie, L., Yu, S.: Follow automata. Inf. and Comp. 186(1), 140-162 (2003)
18. Kahl, W.: Calculational relation-algebraic proofs in Isabelle/Isar. In: Berghammer, R., Möller, B., Struth, G. (eds.) RelMiCS 2003. LNCS, vol. 3051, pp. 178-190. Springer, Heidelberg (2004)
19. Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Automata Studies, pp. 3-41. Princeton University Press, Princeton (1956)
20. Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Inf. and Comp. 110(2), 366-390 (1994)
21. Kozen, D.: Typed Kleene algebra, TR98-1669, CS Dpt. Cornell University (1998)
22. Kozen, D.: On Hoare logic and Kleene algebra with tests. ACM Trans. Comput. Log. 1(1), 60-76 (2000)
23. Kozen, D., Smith, F.: Kleene algebra with tests: Completeness and decidability. In: van Dalen, D., Bezem, M. (eds.) CSL 1996. LNCS, vol. 1258, pp. 244-259. Springer, Heidelberg (1997)
24. Krob, D.: Complete systems of B-rational identities. TCS 89(2), 207-343 (1991)
25. Leroy, X.: A formally verified compiler back-end. JAR 43(4), 363-446 (2009)
26. Meyer, A.R., Stockmeyer, L.J.: Word problems requiring exponential time. In: Proc. STOC, pp. 1-9. ACM, New York (1973)
27. Narboux, J.: Formalisation et automatisation du raisonnement géométrique en Coq. PhD thesis, Université Paris Sud (September 2006)
28. Pous, D.: Untyping typed algebraic structures and colouring proof nets of cyclic linear logic. Technical Report RR-7176, INRIA Rhône-Alpes (January 2010)
29. Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM Journal of Research and Development 3(2), 114-125 (1959)
30. Sozeau, M., Oury, N.: First-class type classes. In: Mohamed, O.A., Muñoz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 278-293. Springer, Heidelberg (2008)
31. Struth, G.: Calculating Church-Rosser proofs in Kleene algebra. In: de Swart, H. (ed.) RelMiCS 2001. LNCS, vol. 2561, pp. 276-290. Springer, Heidelberg (2002)
32. Tarski, A., Givant, S.: A Formalization of Set Theory without Variables, AMS, Providence, Rhode Island, vol. 41. Colloquium Publications (1987)
33. Thompson, K.: Regular expression search algorithm. ACM C. 11, 419-422 (1968)
34. von Oheimb, D., Gritzner, T.F.: RALL: Machine-supported proofs for relation algebra. In:McCune,W. (ed.) CADE 1997. LNCS, vol. 1249, pp. 380-394. Springer, Heidelberg (1997)