Automated theorem proving by test set induction

Journal of Symbolic Computation

Volumn 23, Issue 1, 1997, Pages 47-77

  Bouhoula, Adel ^a,b  

^a INRIA   (France)

^b SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030641947     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1996.0076     Document Type: Article

References (39)

1. Andrew, I., Bundy, A. (1996). Productive use of failure in inductive proof. J. Automated Reasoning, 16:79-111.
2. Aubin, R. (1979). Mechanizing structural induction. In Theoretical Computer Science, volume 9, pp. 329-362.
3. Bachmair, L (1988). Proof by consistency in equational theories. In Proc. of the 3rd IEEE Symposium on Logic in Computer Science, Edinburgh (UK), pp. 228-233.
4. Bouhoula, A. (1994a). The challenge of mutual recursion and mutual simplification in implicit induction. Invited talk at the International Workshop on the Automation of Proof by Mathematical Induction.
5. Bouhoula, A. (1994b). Preuves Automatiques par Récurrence dans les Théories Conditionnelles. PhD thesis, Université Henri Poincaré-Nancy 1.
6. Bouhoula, A. (1994c). SPIKE: a system for sufficient completeness and parameterized inductive proof. In Bundy, A., ed., Proc. of the 12th International Conference on Automated Deduction, Nancy (France), volume 814 of Lecture Notes in Artificial Intelligence, pp. 836-840. Berlin, Springer-Verlag.
7. Bouhoula, A. (1996). Using induction and rewriting to verify and complete parameterized specifications. Theoretical Computer Science, 170:245-276.
8. Bouhoula, A., Kounalis, E., Rusinowitch, M. (1995). Automated Mathematical Induction. J. Logic and Computation, 5(5):631-668.
9. Bouhoula, A., Rusinowitch, M. (1995). Implicit induction in conditional theories. J. Automated Reasoning, 14(2):189-235.
10. Boyer, R.S., Moore, J.S. (1979). A Computational Logic. Academic Press: New York.
11. Bronsard, F., Reddy, U.S., Hasker, R.W. (1996). Induction using term orders. J. Automated Reasoning, 16:3-37.
12. Bündgen, R., Eckhardt, H. (1992). A fast algorithm for ground normal form analysis. In Kirchner, H., Levi, G., eds, Proc. of the 3rd International Conference on Algebraic and Logic Programming, Volterra (Italy), volume 632 of Lecture Notes in Computer Science, pp. 291-305. Berlin, Springer-Verlag.
13. Bündgen, R., Küchlin, W. (1989). Computing ground reducibility and inductively complete positions. In Dershowitz, N., ed., Proc. of the 3rd Conference on Rewriting Techniques and Applications, Chapel Hill (N. C., USA), volume 355 of LNCS, pp. 59-75. Berlin, Springer-Verlag.
14. Bundy, A., van Harmelen, F., Smaill, A., Ireland, A. (1989). Extensions to the rippling-out tactic for guiding inductive proofs. In Stickel, M.E., ed., 10th International Conference on Automated Deduction, volume 449 of Lecture Notes in Artificial Intelligence, pp. 132-146. Berlin, Springer-Verlag.
15. Comon, H. (1989). Inductive proofs by specification transformations. In Dershowitz, N., ed., Proc. of the 3rd Conference on Rewriting Techniques and Applications, Chapel Hill (N. C., USA), volume 355 of LNCS, pp. 76-91. Berlin, Springer-Verlag.
16. Comon, H., Jacquemard, F. (1994). Ground reducibility and automata with disequality constraints. In Enjalbert, P., Mayr, E.W., Wagner, K.W., eds, Proc. of the 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen (France), volume 775 of LNCS, pp. 151-162. Berlin, Springer-Verlag.
17. Dershowitz, N. (1987). Termination of rewriting. J. Symbolic Computation, 3(1 & 2):69-116.
18. Dershowitz, N., Jouannaud, J.-P. (1990). Rewrite systems. In van Leeuwen, J., ed., Handbook of Theoretical Computer Science. Elsevier Science Publishers B. V. (North-Holland).
19. Dowek, G., Felty, A., Herbelin, H., Huet, G., Paulin-Mohring, C., Werner, B. (1991). The Coq Proof Assistant. User's guide, INRIA-CNRS-ENS.
20. Fribourg, L. (1989). A strong restriction of the inductive completion procedure. J. Symbolic Computation, 8(3):253-276.
21. Hofbauer, D., Huber, M. (1994). Linearizing term rewriting systems using test set. J. Symbolic Computation, 17(1):91-129.
22. Hofbauer, D., Kutsche, R.D. (1988). Proving inductive theorems based on term rewriting systems. In Grabowski, J., Lescanne, P., Wechler, W., eds, Proc. of the 1st International Workshop on Algebraic and Logic Programming, pp. 180-190. Akademie Verlag.
23. Huet, G., Hullot, J.-M. (1982). Proofs by induction in equational theories with constructors. J. Computer and System Sciences, 25(2):239-266. Preliminary version in Proc, of the 21st Symposium on Foundations of Computer Science, IEEE, 1980.
24. Jouannaud, J.-P., Kounalis, E. (1989). Automatic proofs by induction in theories without constructors. Information and Computation, 82:1-33.
25. Kaplan, S., Choquer, M. (1986). On the decidability of quasi-reducibility. Bulletin of European Association for Theoretical Computer Science, 28:32-34.
26. Kapur, D., Narendran, P., Zhang, H. (1987). On sufficient completeness and related properties of term rewriting systems. Acta Informatica, 24:395-415.
27. Kounalis, E. (1992). Testing for the ground (co-)reducibility property in term-rewriting systems. Theoretical Computer Science, 106:87-117.
28. Kounalis, E., Rusinowitch, M. (1990). Mechanizing inductive reasoning. In Proc. of the AAAI Conference, pp. 240-245, Boston. AAAI Press and the MIT Press.
29. Küchlin, W. (1989). Inductive completion by ground proof transformation. In Aït-Kaci, H., Nivat, M., eds, Colloquium on the Resolution of Equations in Algebraic Structures, Volume 2: Rewriting Techniques, pp. 211-244. San Diego, Academic Press inc.
30. Musser, D.R. (1980). On proving inductive properties of abstract data types. In Proc. of the 7th ACM Symp. on Principles of Programming Languages, pp. 154-162. New York, ACM.
31. Padawitz, P. (1988). Computing in Horn Clause Theories. Springer-Verlag.
32. Plaisted, D. (1985). Semantic confluence and completion method. Information and Control, 65:182-215.
33. Reddy, U.S. (1990). Term rewriting induction. In Stickel, M.E., ed., Proc. of the 10th International Conference on Automated Deduction, Kaiserslautern (Germany), volume 449 of LNCS, pp. 162-177. Berlin, Springer-Verlag.
34. Rushby, J., Owre, S., Shankar, N. (1992). PVS: a prototype verification system. In Kapur, D., ed., Proc. of the 11th International Conference on Automated Deduction, Saratoga Springs (N. Y., USA), volume 607 of Lecture Notes in Artificial Intelligence, pp. 748-752. Berlin, Springer-Verlag.
35. Schmid, K., Fettig, R. (1995). Towards an efficient construction of test sets for deciding ground reducibility. In Hsiang, J., ed., Proc. of the 6th Conference on Rewriting Techniques and Applications, Kaiserslautern (Germany), volume 914 of LNCS, pp. 86-100. Springer-Verlag.
36. Shankar, N. (1996). Steps towards mechanizing program transformations using PVS. Science of Computer Programming, 26:33-57.
37. Walther, C. (1993). Combining induction axioms by machine. In Bajcsy, R., ed., Proc. of the 13th International Joint Conference on Artificial Intelligence, Chambéry (France), volume 1, pp. 95-100. Morgan Kaufmann.
38. Wirth, C.-P., Gramlich, B. (1993). A constructor-based approach to positive/negative-conditional equational specifications. J. Symbolic Computation, 17:51-90.
39. Zhang, H., Kapur, D., Krishnamoorthy, M.S. (1988). A mechanizable induction principle for equational specifications. In Lusk, E., Overbeek, R., eds, Proc. of the 9th International Conference on Automated Deduction, Argonne (Ill., USA), volume 310 of LNCS, pp. 162-181. Berlin, Springer-Verlag.