Termination of floating-point computations
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1948394
- Inference of Termination Conditions for Numerical Loops in Prolog
- Inference of termination conditions for numerical loops in Prolog
- On the linear ranking problem for simple floating-point loops
- Unrestricted termination and non-termination arguments for bit-vector programs
Cites work
- scientific article; zbMATH DE number 1638665 (Why is no real title available?)
- scientific article; zbMATH DE number 1701751 (Why is no real title available?)
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 3610766 (Why is no real title available?)
- scientific article; zbMATH DE number 1948414 (Why is no real title available?)
- scientific article; zbMATH DE number 1953274 (Why is no real title available?)
- scientific article; zbMATH DE number 1973218 (Why is no real title available?)
- scientific article; zbMATH DE number 2080754 (Why is no real title available?)
- scientific article; zbMATH DE number 2084361 (Why is no real title available?)
- scientific article; zbMATH DE number 2087547 (Why is no real title available?)
- scientific article; zbMATH DE number 1832220 (Why is no real title available?)
- scientific article; zbMATH DE number 1832227 (Why is no real title available?)
- scientific article; zbMATH DE number 2090120 (Why is no real title available?)
- scientific article; zbMATH DE number 1420813 (Why is no real title available?)
- scientific article; zbMATH DE number 236855 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- scientific article; zbMATH DE number 970705 (Why is no real title available?)
- A Machine-Oriented Logic Based on the Resolution Principle
- A declarative approach for first-order built-in's of Prolog
- A general framework for automatic termination analysis od logic programs
- Abstract multiple specialization and its application to program parallelization
- An Efficient Unification Algorithm
- Classes of terminating logic programs
- Constraint solving with constraint handling rules
- Deriving descriptions of possible values of program variables by means of abstract interpretation
- Faster numerical algorithms via exception handling
- Inference of Termination Conditions for Numerical Loops in Prolog
- Inference of termination conditions for numerical loops in Prolog
- Linear resolution with selection function
- Mixtus: An automatic partial evaluator for full Prolog
- Multiple specialization using minimal-function graph semantics
- PCF extended with real numbers
- Program Development in Computational Logic
- Programming Languages and Systems
- Programming Languages and Systems
- Refinement of rational end-points real numbers by means of floating-point numbers
- Termination of constraint logic programs
- Termination of logic programs: the never-ending story
- Theory and practice of constraint handling rules
Cited in
(4)
This page was built for publication: Termination of floating-point computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q850498)