| Abstract | .... 2 | |
| Contents | .... 2 | |
| 1 | Introduction | .... 3 |
| 2 | Preliminaries | .... 3 |
| 2.1 | Polarity of Subformulas | .... 3 |
| 2.2 | S-formulas and Goal Formulas | .... 4 |
| 2.3 | Manipuration of Goal Formulas | .... 4 |
| 3 | Framework of Verification of Prolog Programs | .... 5 |
| 3.1 | Programing Language | .... 5 |
| 3.2 | Specification Language | .... 5 |
| 3.3 | Framework of Verification | .... 6 |
| 4 | Generation of Computational Induction Schemes | .... 6 |
| 4.1 | Computational Induction | .... 6 |
| 4.2 | Inducible Definite Clause | .... 7 |
| 4.3 | Generation of Induction Schemes | .... 7 |
| 4.4 | Generalization | .... 8 |
| 4.5 | Examples of Induction Schemes | .... 9 |
| 5 | Merging of Computational Induction Schemes | .... 10 |
| 5.1 | Mergible Schemes | .... 10 |
| 5.2 | Tamaki-Sato's Transformation | .... 11 |
| 5.3 | Derivation of Merged Schemes | .... 12 |
| 6 | Discussons | .... 14 |
| 7 | Conclusion | .... 14 |
| Acknowledgements | .... 15 | |
| References | .... 15 | |
| Appendix | .... 16 |
ICOT研究論文(TR)一覧に戻る / Back to the list of ICOT Technical Reports