Proof by Induction Using Test Sets
暂无分享,去创建一个
[1] Gerard Huet,et al. Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[2] Gérard P. Huet,et al. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.
[3] H. Brown,et al. Computational Problems in Abstract Algebra , 1971 .
[4] Deepak Kapur,et al. RRL: A Rewrite Rule Laboratory , 1986, CADE.
[5] Jean-Pierre Jouannaud,et al. Proofs by induction in equational theories without constructors , 1985, Bull. EATCS.
[6] Deepak Kapur,et al. Rewrite Rule Theory and Abstract Data Type Analysis , 1982, EUROCAM.
[7] Hélène Kirchner,et al. Completion of a set of rules modulo a set of equations , 1984, SIAM J. Comput..
[8] David R. Musser,et al. On proving inductive properties of abstract data types , 1980, POPL '80.
[9] Derick Wood,et al. Completeness of Context-Free Grammar Forms , 1981, J. Comput. Syst. Sci..
[10] Donald E. Knuth,et al. Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research. , 1970 .
[11] Gérard P. Huet,et al. A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm , 1981, J. Comput. Syst. Sci..
[12] Deepak Kapur,et al. Proof by Consistency , 1987, Artif. Intell..
[13] Gérard P. Huet,et al. Proofs by induction in equational theories with constructors , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[14] Joseph A. Goguen,et al. How to Prove Algebraic Inductive Hypotheses Without Induction , 1980, CADE.
[15] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .