open access

https://hdl.handle.net/2115/44117

Multi-Context Rewriting Induction with Termination Checkers

英語

multi-completion

2010-05-01

Institute of Electronics, Information and Communication Engineers

IEICE Transactions on Information and Systems

E93-D(5)

942-952

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.

学術雑誌論文

Version of Record

Copyright © 2010 The Institute of Electronics, Information and Communication Engineers

0916-8532