Bounded Size-change Termination
| dc.contributor.author | KHOO, Siau-Cheng | en_US |
| dc.contributor.author | ANDERSON, Hugh | en_US |
| dc.date.accessioned | 2005-08-03T02:49:06Z | en_US |
| dc.date.accessioned | 2017-01-23T06:59:35Z | |
| dc.date.available | 2005-08-03T02:49:06Z | en_US |
| dc.date.available | 2017-01-23T06:59:35Z | |
| dc.date.issued | 2005-08-03T02:49:06Z | en_US |
| dc.description.abstract | The size-change principle devised by Lee, Jones and Ben-Amram, provides an effective method of determining program termination for recursive functions over well-founded types. In this paper, we extend size-change termination beyond the original well-founded condition to include arbitrary bounds that are expressed by linear constraints. Our bounded termination condition determines if repeated calls to a function will monotonically move the call arguments toward the boundary of the guard. We also present a technique which allows the analysis of functions in which there turn values are relevant to termination. Our analysis exploits the decidability and expressive power of affine constraints. These techniques significantly extend the set of programs that are size-change terminating. | en_US |
| dc.format.extent | 557411 bytes | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/1817 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | TRB6/05 | en_US |
| dc.title | Bounded Size-change Termination | en_US |
| dc.type | Technical Report | en_US |