Termination of floating-point computations
From MaRDI portal
Publication:850498
DOI10.1007/s10817-005-6546-zzbMath1102.65054OpenAlexW2120056071MaRDI QIDQ850498
Alexander Serebrenik, Danny De Schreye
Publication date: 3 November 2006
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-005-6546-z
Related Items (1)
Uses Software
Cites Work
- Mixtus: An automatic partial evaluator for full Prolog
- A declarative approach for first-order built-in's of Prolog
- PCF extended with real numbers
- Refinement of rational end-points real numbers by means of floating-point numbers
- Linear resolution with selection function
- Inference of Termination Conditions for Numerical Loops in Prolog
- An Efficient Unification Algorithm
- Deriving descriptions of possible values of program variables by means of abstract interpretation
- Multiple specialization using minimal-function graph semantics
- Theory and practice of constraint handling rules
- Termination of logic programs: the never-ending story
- Faster numerical algorithms via exception handling
- Classes of terminating logic programs
- Termination of constraint logic programs
- Inference of termination conditions for numerical loops in Prolog
- Abstract multiple specialization and its application to program parallelization
- Programming Languages and Systems
- Programming Languages and Systems
- A Machine-Oriented Logic Based on the Resolution Principle
- Program Development in Computational Logic
- A general framework for automatic termination analysis od logic programs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Termination of floating-point computations
