@article{oai:nagoya.repo.nii.ac.jp:00019055,
 author = {坂田, 翼 and 西田, 直樹 and 坂部, 俊樹 and 酒井, 正彦 and 草刈, 圭一朗 and Sakata, Tsubasa and Nishida, Naoki and Sakabe, Toshiki and Sakai, Masahiko and KUSAKARI, Keiichirou},
 issue = {2},
 journal = {情報処理学会論文誌, プログラミング},
 month = {Mar},
 note = {帰納的定理の証明原理の 1 つである潜在帰納法が制約付き項書換え系に対応するように拡張され,命令型プログラムの等価性検証に応用されている.本論文では,別の証明原理である書換え帰納法を制約付き項書き換え系に対応するように拡張するとともに,その正しさを証明する.また,拡張された書換え帰納法に基づいた帰納的定理の証明法を提案する.さらに,帰納的定理でないことを示す反証の手法についても議論する., The implicit induction, which is one of induction principles for proving inductive theorems of equational theories, has been extended to deal with constrained term rewriting systems. It has been applied to a method for proving equivalence of imperative programs. In this paper, we extend another induction principle, the rewriting induction, to cope with the case of constrained term rewriting systems, and show its correctness. We also propose a method for proving inductive theorems being based on the extended rewriting induction. Moreover, we show a technique to disprove inductive theorems.},
 pages = {80--96},
 title = {制約付き項書換え系における書換え帰納法},
 volume = {2},
 year = {2009}
}