例外処理を含む関数型プログラム停止性証明のための条件付き依存対法
Year: 2013
Type: article
Abstract: We have recently proposed a method for proving termination/non-termination properties of eager-evaluation-based functional programs with exception handling. The method transforms them into Context-Sensitive Term Rewriting Systems (CS-TRSs) in preserving the properties. However we encounter a problem that the existing termination provers for CS-TRSs fail even if a very short program is given. In this paper, we present a dependency method specialized for CS-TRSs transformed from functional programs with exception handling. We introduce conditions that represent context information into the dependency pairs, and define conditional dependency chains. We prove that the target CS-TRS is inner-most terminating if and only if there exists no infinite conditional dependency chain. Moreover, we augment graph notion into the framework of the dependency pair problems, and propose some new processors. The new method works effectively for CS-TRSs produced by the transformation.
Authors: 濱口, 毅, 酒井, 正彦, HAMAGUCHI, Takeshi, SAKAI, Masahiko
Language: Japanese
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7145399567