On termination of logic programs with floating point computations

A. Serebrenik; D. De Schreye

doi:10.1007/3-540-45789-5_13

On termination of logic programs with floating point computations

A. Serebrenik, D. De Schreye

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

5 Citations (Scopus)

Abstract

Numerical computations form an essential part of almost any real-world program. Traditional approaches to termination of logic programs are restricted to domains isomorphic to N, more recent works study termination of integer computations. Termination of computations involving real numbers is cumbersome and counter-intuitive due to rounding errors and implementation conventions. We present a novel technique that allows us to prove termination of such computations. Our approach extends the previous work on termination of integer computations.

Original language	English
Title of host publication	Proceedings of the 9th International Symposium on Static Analysis (SAS 2002), 17-20 September 2002, Madrid, Spain
Editors	M.V. Hermenegildo, G. Puebla
Place of Publication	Berlin
Publisher	Springer
Pages	151-164
ISBN (Print)	3-540-44235-9
DOIs	https://doi.org/10.1007/3-540-45789-5_13
Publication status	Published - 2002

Publication series

Name	Lecture Notes in Computer Science
Volume	2477
ISSN (Print)	0302-9743

Access to Document

10.1007/3-540-45789-5_13

Cite this

Serebrenik, A., & De Schreye, D. (2002). On termination of logic programs with floating point computations. In M. V. Hermenegildo, & G. Puebla (Eds.), Proceedings of the 9th International Symposium on Static Analysis (SAS 2002), 17-20 September 2002, Madrid, Spain (pp. 151-164). (Lecture Notes in Computer Science; Vol. 2477). Springer. https://doi.org/10.1007/3-540-45789-5_13

@inproceedings{a79638600ea04aa6b914896df3e04d48,

title = "On termination of logic programs with floating point computations",

abstract = "Numerical computations form an essential part of almost any real-world program. Traditional approaches to termination of logic programs are restricted to domains isomorphic to N, more recent works study termination of integer computations. Termination of computations involving real numbers is cumbersome and counter-intuitive due to rounding errors and implementation conventions. We present a novel technique that allows us to prove termination of such computations. Our approach extends the previous work on termination of integer computations.",

author = "A. Serebrenik and {De Schreye}, D.",

year = "2002",

doi = "10.1007/3-540-45789-5_13",

language = "English",

isbn = "3-540-44235-9",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "151--164",

editor = "M.V. Hermenegildo and G. Puebla",

booktitle = "Proceedings of the 9th International Symposium on Static Analysis (SAS 2002), 17-20 September 2002, Madrid, Spain",

address = "Germany",

}

Serebrenik, A & De Schreye, D 2002, On termination of logic programs with floating point computations. in MV Hermenegildo & G Puebla (eds), Proceedings of the 9th International Symposium on Static Analysis (SAS 2002), 17-20 September 2002, Madrid, Spain. Lecture Notes in Computer Science, vol. 2477, Springer, Berlin, pp. 151-164. https://doi.org/10.1007/3-540-45789-5_13

On termination of logic programs with floating point computations. / Serebrenik, A.; De Schreye, D.
Proceedings of the 9th International Symposium on Static Analysis (SAS 2002), 17-20 September 2002, Madrid, Spain. ed. / M.V. Hermenegildo; G. Puebla. Berlin: Springer, 2002. p. 151-164 (Lecture Notes in Computer Science; Vol. 2477).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - On termination of logic programs with floating point computations

AU - Serebrenik, A.

AU - De Schreye, D.

PY - 2002

Y1 - 2002

N2 - Numerical computations form an essential part of almost any real-world program. Traditional approaches to termination of logic programs are restricted to domains isomorphic to N, more recent works study termination of integer computations. Termination of computations involving real numbers is cumbersome and counter-intuitive due to rounding errors and implementation conventions. We present a novel technique that allows us to prove termination of such computations. Our approach extends the previous work on termination of integer computations.

AB - Numerical computations form an essential part of almost any real-world program. Traditional approaches to termination of logic programs are restricted to domains isomorphic to N, more recent works study termination of integer computations. Termination of computations involving real numbers is cumbersome and counter-intuitive due to rounding errors and implementation conventions. We present a novel technique that allows us to prove termination of such computations. Our approach extends the previous work on termination of integer computations.

U2 - 10.1007/3-540-45789-5_13

DO - 10.1007/3-540-45789-5_13

M3 - Conference contribution

SN - 3-540-44235-9

T3 - Lecture Notes in Computer Science

SP - 151

EP - 164

BT - Proceedings of the 9th International Symposium on Static Analysis (SAS 2002), 17-20 September 2002, Madrid, Spain

A2 - Hermenegildo, M.V.

A2 - Puebla, G.

PB - Springer

CY - Berlin

ER -

On termination of logic programs with floating point computations

Abstract

Publication series

Access to Document

Fingerprint

Cite this