Termination of floating-point computations
type: Item
instance of: scholarly article
title: Termination of floating-point computations
zbMATH Open document ID: 1102.65054
author: Alexander Serebrenik
author: Danny De Schreye
published in: Journal of Automated Reasoning
publication date: 2006-11-03T00:00:00Z
Mathematics Subject Classification ID: 65G50
zbMATH DE Number: 5070710
zbMATH Keywords: termination analysis
zbMATH Keywords: floating point numbers
zbMATH Keywords: integer computations
zbMATH Keywords: rounding errors
describes a project that uses: Numerica
describes a project that uses: ECCE
describes a project that uses: Ciao
describes a project that uses: Matlab
MaRDI profile type: Publication
full work available at URL: s10817-005-6546-z
OpenAlex ID: W2120056071
cites work: Refinement of rational end-points real numbers by means of floating-point numbers
cites work: A declarative approach for first-order built-in's of Prolog
cites work: Q4414726
cites work: Q2736363
cites work: Q4411979
cites work: Q4475099
cites work: Q2769578
cites work: Q4174789
cites work: Q4473711
cites work: Termination of logic programs: the never-ending story
cites work: Q5688890
cites work: Q4944879
cites work: Faster numerical algorithms via exception handling
cites work: A general framework for automatic termination analysis od logic programs
cites work: PCF extended with real numbers
cites work: Programming Languages and Systems
cites work: Theory and practice of constraint handling rules
cites work: Constraint solving with constraint handling rules
cites work: Q4778705
cites work: Q4738356
cites work: Deriving descriptions of possible values of program variables by means of abstract interpretation
cites work: Q5287559
cites work: Linear resolution with selection function
cites work: Q3992908
cites work: An Efficient Unification Algorithm
cites work: Program Development in Computational Logic
cites work: Q4778698
cites work: Q5566070
cites work: Classes of terminating logic programs
cites work: Abstract multiple specialization and its application to program parallelization
cites work: A Machine-Oriented Logic Based on the Resolution Principle
cites work: Termination of constraint logic programs
cites work: Mixtus: An automatic partial evaluator for full Prolog
cites work: Inference of Termination Conditions for Numerical Loops in Prolog
cites work: Q4421872
cites work: Inference of termination conditions for numerical loops in Prolog
cites work: Q4808812
cites work: Multiple specialization using minimal-function graph semantics
DOI: 10.1007/S10817-005-6546-Z
description: scientific article; zbMATH DE number 5070710