Inference of termination conditions for numerical loops
| dc.creator | Serebrenik, Alexander | |
| dc.creator | De Schreye, Danny | |
| dc.date | 2001-06-26 | |
| dc.date.accessioned | 2026-07-07T03:17:17Z | |
| dc.date.available | 2026-07-07T03:17:17Z | |
| dc.description | We present a new approach to termination analysis of numerical computations in logic programs. Traditional approaches fail to analyse them due to non well-foundedness of the integers. We present a technique that allows to overcome these difficulties. Our approach is based on transforming a program in way that allows integrating and extending techniques originally developed for analysis of numerical computations in the framework of query-mapping pairs with the well-known framework of acceptability. Such an integration not only contributes to the understanding of termination behaviour of numerical computations, but also allows to perform a correct analysis of such computations automatically, thus, extending previous work on a constraints-based approach to termination. In the last section of the paper we discuss possible extensions of the technique, including incorporating general term orderings. | |
| dc.description | Presented at WST2001 | |
| dc.identifier | https://arxiv.org/abs/cs/0106053 | |
| dc.identifier | http://arxiv.org/abs/cs/0106053 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30668 | |
| dc.subject | Programming Languages | |
| dc.subject | Logic in Computer Science | |
| dc.subject | D.1.6; D.2.4 | |
| dc.title | Inference of termination conditions for numerical loops | |
| dc.type | text |