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. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
