HUSCAP logo Hokkaido Univ. logo

Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
Peer-reviewed Journal Articles, etc >

Multi-Context Rewriting Induction with Termination Checkers

Files in This Item:
TIS93D-5_942-952.pdf580.22 kBPDFView/Open
Please use this identifier to cite or link to this item:http://hdl.handle.net/2115/44117

Title: Multi-Context Rewriting Induction with Termination Checkers
Authors: Sato, Haruhiko Browse this author
Kurihara, Masahito Browse this author →KAKEN DB
Keywords: equational theorem proving
term rewriting systems
mathematical induction
rewriting induction
multi-completion
Issue Date: 1-May-2010
Publisher: Institute of Electronics, Information and Communication Engineers
Journal Title: IEICE Transactions on Information and Systems
Volume: E93-D
Issue: 5
Start Page: 942
End Page: 952
Publisher DOI: 10.1587/transinf.E93.D.942
Abstract: Inductive theorem proving plays an important role in the field of formal verification of systems. The rewriting induction (RI) is a method for inductive theorem proving proposed by Reddy. In order to obtain successful proofs, it is very important to choose appropriate contexts (such as in which direction each equation should be oriented) when applying RI inference rules. If the choice is not appropriate, the procedure may diverge or the users have to come up with several lemmas to prove together with the main theorem. Therefore we have a good reason to consider parallel execution of several instances of the rewriting induction procedure, each in charge of a distinguished single context in search of a successful proof. In this paper, we propose a new procedure, called multi-context rewriting induction, which efficiently simulates parallel execution of rewriting induction procedures in a single process, based on the idea of the multi-completion procedure. By the experiments with a well-known problem set, we discuss the effectiveness of the proposed procedure when searching along various contexts for a successful inductive proof.
Rights: Copyright © 2010 The Institute of Electronics, Information and Communication Engineers
Relation: http://search.ieice.org/
Type: article
URI: http://hdl.handle.net/2115/44117
Appears in Collections:情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)

Submitter: 栗原 正仁

Export metadata:

OAI-PMH ( junii2 , jpcoar )

MathJax is now OFF:


 

 - Hokkaido University