Expert system for proving termination of rewrite rule programs by path orderings with extended status

Author

Noto, Masato ; Kurihara, Masahito ; Ohuchi, Azuma

Author_Institution

Dept. of Inf. Eng., Hokkaido Univ., Sapporo, Japan

fYear

1994

fDate

6-10 Nov. 1994

Firstpage

142

Lastpage

147

Abstract

We have developed an expert system, called TERMINATOR, which proves the termination of computer programs written as a set of rewrite rules. In TERMINATOR, the knowledge of the proof techniques is represented by a class of partial orderings called path orderings. In particular, the system incorporates the new and powerful orderings called RPOES and KNSES, which are presented in this paper. The two orderings generalize the well-known RPO and KNS orderings with an idea of the extended status proposed in this paper, and can be successfully used to prove the termination of rewrite rules that can not be proved by the conventional knowledge.<>

Keywords

expert systems; program verification; rewriting systems; theorem proving; KNSES; RPOES; TERMINATOR; extended status; path orderings; program termination proving; rewrite rule programs; Computer science; Concurrent computing; Concurrent engineering; Equations; Expert systems; Inference mechanisms; Manufacturing automation; Power engineering computing; Production facilities; Software engineering;

fLanguage

English

Publisher

ieee

Conference_Titel

Emerging Technologies and Factory Automation, 1994. ETFA '94., IEEE Symposium on

Conference_Location

Tokyo, Japan

Print_ISBN

0-7803-2114-6

Type

conf

DOI

10.1109/ETFA.1994.402011

Filename

402011