Automata-driven automated induction

Information and Computation

Volumn 169, Issue 1, 2001, Pages 1-22

  Bouhoula, Adel ^a   Jouannaud, Jean Pierre ^b  

^a UNIVERSITY OF CARTHAGE   (Tunisia)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; SET THEORY; THEOREM PROVING;

TREE AUTOMATA;

AUTOMATA THEORY;

EID: 0035949339     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.3036     Document Type: Article

References (31)

1. Backhouse, R., On the meaning and construction of the rules in Martin-Löf's theory of types. Univ. of Groningen, the Netherlands.
2. Berregeb, N., Bouhoula. A., and Rusinowitch, M. (1995), Automated verification by induction with associative-commutative operator, in "Proceedings of the 8th International Conference on Computer-Aided Verification," Lecture Notes in Computer Science, Vol. 1102, pp. 220-231, New Jersey, Springer-Verlag.
3. Bouhoula, A. (1996). Using Induction and Rewriting to Verify and Complete Parameterized Specifications. Theoret. Comput. Sci. 170, 245-276.
4. Bouhoula, A. (1997), Automated theorem proving by test set induction, J. Symbolic Comput. 23, 47-77.
5. Bouhoula, A., and Jouannaud, J.-P. (June-July 1997), Automata-driven automated induction, in "Proceedings 12th IEEE Symposium on Logic in Computer Science," pp. 14-25. Warsaw (Poland).
6. Bouhoula, A., Jouannaud, J.-P., and Meseguer, J. (2000), Specification and proof in membership equational logic, Theoret. Comput. Sci. 236, pp. 35-132. Preliminary version in "Proceedings CAAP'97 Lille (France)," Apr. 1997 (M. Bidoit and M. Dauchet, Eds.), Lecture Notes in Computer Science, Vol. 1214, pp. 67-92, Springer-Verlag.
7. Bouhoula, A., Jouannaud, J.-P., and Meseguer, J. (2000), Specification and proof in membership equational logic, Theoret. Comput. Sci. 236, pp. 35-132. Preliminary version in "Proceedings CAAP'97 Lille (France)," Apr. 1997 (M. Bidoit and M. Dauchet, Eds.), Lecture Notes in Computer Science, Vol. 1214, pp. 67-92, Springer-Verlag.
8. Bouhoula, A., and Rusinowitch, M. (1995). Implicit induction in conditional theories. J. Automated Reasoning 14, 189-235.
9. Boyer, R. S., and Moore, J. S. (1990), A theorem prover for a computational logic, in "Proc. 10th Int. Conf. on Automated Deduction" (M. E. Stickel Ed.). Lecture Notes in Computer Science, Vol. 449, pp. 1-15, Kaiserslautern, Springer-Verlag.
10. Caron, A.-C., Coquidé J.-L., and Dauchet, M. (1993), Encompassment properties and automata with constraints, in "Proc. 5th Rewriting Techniques and Applications" (C. Kirchner. Ed.), Lecture Notes in Computer Science 690. Montréal, Springer-Verlag.
11. Christian, J., and Lincoln, P. (1988), Adventures in associative commutative unification, in "Proc. 9th Int. Conf. on Automated Deduction" (Lusk and Overbeek Eds.), Lecture Notes in Computer Science. Vol. 310, Argonne, IL, Springer-Verlag.
12. Comon, H. (Apr. 1989), Inductive proofs by specifications transformation, in "Proc. 3rd Rewriting Techniques and Applications." Lecture Notes in Computer Science, Vol. 355, pp. 76-91. Chapel Hill, Springer-Verlag.
13. Comon. H., and Delor, C. (Aug. 1994). Equational formulae with membership constraints. Information and Comput. 112, 167-216.
14. Comon, H., Dincbas, M., Jouannaud, J.-P., and Kirchner, C., A methodological view of constraint solving, submitted for publication.
15. Coquand, T. (1992), Pattern matching with dependent types, in "Proceedings of the Workshop on Logical Frameworks."
16. Coquand. T., and Paulin-Mohring, C, (June 1990), Inductively defined types, in "Proceedings of Colog 88" (P. Martin-Löf and G. Mints, Eds.), Lecture Notes in Computer Science. Vol. 417, Springer-Verlag.
17. Dershowitz, N., and Jouannaud, J.-P. (1990). Rewrite systems, in "Handbook of Theoretical Computer Science" (J. van Leeuwen. Ed.), Vol. B, pp. 243-309, North-Holland.
18. Dershowitz, N., and Okada, M. (1990), A rationale for conditional equational programming, Theoret. Comput. Sci. 75. 111-138.
19. Futatsugi, K. (Mar. 1997), Overview of cafe project. Cafe Workshop.
20. Futatsugi, K., Goguen, J., Jouannaud, J.-P., and Meseguer, J. (1985). Principles of OBJ2, in "Proc. 12th ACM Symp. on Principles of Programming Languages." New Orleans.
21. Goguen, J., Jouannaud, J.-P., and Meseguer, J. (July 1985), Operational semantics for order-sorted algebra, in "Proc. 12th Int. Coll. on Automata. Languages and Programming" (W. Brauer, Ed.). Lecture Notes in Computer Science. Vol. 194, Nafplion. Springer-Verlag.
22. Hullot, J.-M. (July 1980), Canonical forms and unification, in "Proc. 5th Conf. on Automated Deduction." Lecture Notes in Computer Science, Vol. 87, Les Arcs. France, Springer-Verlag.
23. Jouannaud, J.-P., and Kounalis. E. (1989). Automatic proofs by induction in theories without constructors. Inform. and Comput. 82.
24. Kaplan, S. (1984). Conditional rewrite rules. Theoret. Comput. Sci. 33, 175-193.
25. Lugiez, D. (1995). Positive and negative results for higher-order disunification, J. Symbolic Comput. 20, 431-470.
26. Lugiez, D., and Moysset, J.-L. (1994), Tree automata help one to solve equational formulae in ac-theories, J. Symbolic Comput. 18. 297-318.
27. Clavel, P. L. M., Eker, S., and Meseguer, J. ( 1996). Principles of maude, in "Proceedings of the 1st International Workshop on Rewriting Logic and its Applications" (J. Meseguer, Ed.), Electronic Notes in Theoretical Computer Science, Vol. 4.
28. Miller, D., and Nadathur, G. (Sept. 1987), A logic programming approach to manipulating formulas and programs. University of Pennsylvania, IEEE Proc. on Logic Programming, San Francisco.
29. Nieuwenhuis, R. (1996). Basic paramodulation and decidable theories, in "Proceedings LICS'96." IEEE. Comput. Soc. Press, New Jersey. Los Alamitos.
30. Owre, S., Rushby, J., Shankar, N., and von Henke, F. (1995), Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS, IEEE Trans. Software Engineering 21, 107-125.
31. Zhang, H., Kapur, D., and Krishnamoorthy, M. S. (1988). A mechanizable induction principle for equational specifications, in "Proc. 9th Int. Conf. on Automated Deduction" (E. Lusk and R. Oyerbeek. Eds.). Lecture Notes in Computer Science. Vol. 310. pp. 162-181, Argonne. IL., Springer-Verlag.