Inductive theorem proving for design specifications

Journal of Symbolic Computation

Volumn 21, Issue 1, 1996, Pages 41-99

  Padawitz, Peter ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (43)

1. Antoy, S., Echahed, R., Hanus, M. (1994). A Needed Narrowing Strategy. Proc. 21st ACM Symp. on Principles of Programming Languages, 268-279.
2. Avenhaus, J., Becker, K. (1992). Conditional Rewriting modulo a Built-in Algebra. SEKI Report SR-92-11, Universität Kaiserslautern.
3. Bertling, H., Ganzinger, H. (1989). Completion - Time Optimization of Rewrite - Time Goal Solving. Proc. RTA '89, Springer LNCS 355, 45-58.
4. Bouhoula, A., Kounalis, E., Rusinowitch, M. (1992). Automated Mathematical Induction. Report INRIA Lorraine No. 1636.
5. Dershowitz, N., Jouannaud, J.-P. (1990). Rewrite Systems. In (J. van Leeuwen, ed.) Handbook of Theoretical Computer Science, Elsevier, 243-320.
6. Dershowitz, N., Okada, M., Sivakumar, G. (1988). Confluence of Conditional Rewrite Systems. Proc. CTRS '87, Springer LNCS 308, 31-44.
7. Dershowitz, N., Okada, M., Sivakumar, G. (1988). Canonical Conditional Rewrite Systems, Proc. CADE '88, Springer LNCS 310, 538-549.
8. Duffy, D. (1991). Principles of Automated Theorem Proving. New York: Wiley.
9. Echahed, R. (1988). On Completeness of Narrowing Strategies. Proc. CAAP '88, Springer LNCS 299, 89-101.
10. Echahed, R. (1992). Uniform Narrowing Strategies. Proc. 3rd ALP, Springer LNCS 632, 259-275.
11. Ehrig, H., Mahr, B. (1985). Fundamentals of Algebraic Specification 1. New York: Springer.
12. Fay, M. (1979). First Order Unification in an Equational Theory. Proc. 4th Workshop on Automated Deduction, Academic Press, 161-167.
13. Fribourg, L. (1985). Handling Function Definitions through Innermost Superposition and Rewriting, Proc. RTA '85, Springer LNCS 202, 325-344.
14. Geser, A. (1991). Relative Termination. Ph.D. thesis, Report 91-03, FB Informatik, Universität Ulm.
15. Goguen, J.A., Thatcher, J.W., Wagner, E.G. (1978). An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types. In (R. Yeh, ed.) Current Trends in Programming Methodology 4, Prentice-Hall, 80-149.
16. Guttag J., Horowitz, E., Musser, D.R. (1976). Abstract Data Types and Software Validation. Report ISI/RR-76-48, University of Southern California.
17. Hanus, M. (1994). The Integration of Functions into Logic Programming: From Theory to Practice. J. Logic Programming, 19 20, 583-628.
18. Hölldobler, S. (1989). Foundations of Equational Logic Programming. New York: Springer.
19. Hullot, J.M. (1980). Canonical Forms and Unification. Proc. 5th CADE, Springer LNCS 87, 318-334.
20. Jouannaud, J.-P., Kirchner, H. (1986). Completion of a Set of Rules Modulo a Set of Equations. SIAM Journal of Computing 15, 1155-1194.
21. Jouannaud, J.-P., Kounalis, E. (1986). Automatic Proofs by Induction in Equational Theories without Constructors. Proc. LICS '86, 358-366.
22. Jouannaud, J.-P., Waldmann, B. (1986). Reductive Conditional Term Rewriting Systems. Proc. Conf. Formal Description of Programming Concepts III, North-Holland, 223-244.
23. Kaplan, S. (1984). Conditional Rewrite Rules. Theoretical Computer Science, 33, 175-194.
24. Kaplan, S. (1987). Simplifying Conditional Term Rewriting Systems: Unification, Termination and Confluence. J. Symbolic Computation 4, 295-334.
25. Kapur, D., Musser, D.R. (1987). Proof by Consistency. Artificial Intelligence, 31, 125-157.
26. Kounalis, E., Rusinowitch, M. (1990). Mechanizing Inductive Reasoning. EATCS Bulletin, 41, 216-226.
27. Küchlin, W. (1989). Inductive Completion by Ground Proof Transformation. In (H. Ait-Kaci, M. Nivat, eds.) Resolution of Equations in Algebraic Structures, Vol. 2, Academic Press, 211-244.
28. Malcolm, G., Goguen, J.A. (1994). Proving Correctness of Refinement and Implementation. Technical Monograph PRG-114, Oxford University Computing Lab.
29. Padawitz, P. (1987). Strategy-Controlled Reduction and Narrowing. Proc. RTA '87, Springer LNCS 256, 242-255.
30. Padawitz, P. (1988). Computing in Horn Clause Theories. New York: Springer.
31. Padawitz, P. (1991). Inductive Expansion: A Calculus for Verifying and Synthesizing Functional and Logic Programs. J. Automated Reasoning, 7, 27-103.
32. Padawitz, P. (1991). Reduction and Narrowing for Horn Clause Theories. The Computer J., 34, 42-51.
33. Padawitz, P. (1992). Deduction and Declarative Programming, Cambridge University Press.
34. Padawitz, P. (1994). Expander: A System for Testing and Verifying Functional-Logic Programs. Report No. 522/1994, FB Informatik, Universität Dortmund.
35. Padawitz, P. (1995). Swinging Data Types: The Dielectic of Actions and Constructors. Report, FB Informatik, Universität Dortmund.
36. Reddy, U. (1990). Term Rewriting Induction. Proc. CADE 10, Springer LNCS 449, 162-177.
37. Reiter, R. (1978). On Closed World Data Bases. Proc. Logic and Data Bases. New York: Plenum.
38. Réty, P. (1987). Improving Basic Narrowing Techniques. Proc. RTA '87, Springer LNCS 256, 228-241.
39. Shapiro, E. (1989). The Family of Concurrent Logic Programming Languages. ACM Computing Surveys 21, 413-510.
40. Slagle, J.R. (1974). Automated Theorem-Proving for Theories with Simplifiers, Commutativity and Associativity. Journal ACM 21, 622-642.
41. Stickel, M. (1985). Automated Deduction by Theory Resolution. J. Automated Reasoning, 1, 333-356.
42. Wirsing, M. (1990). Algebraic Specification. In (J. van Leeuwen, ed.) Handbook of Theoretical Computer Science, Elsevier, 675-788.
43. Zhang, H., Remy, J.-L. (1985). Contextual Rewriting. Proc. RTA '85, Springer LNCS 202, 46-62.