Termination of floating-point computations
From MaRDI portal
Recommendations
- On termination of logic programs with floating point computations
- 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
- Pos( T): Analyzing dependencies in typed logic programs
- A declarative approach for first-order built-in's of Prolog
- A general framework for automatic termination analysis od logic programs
- A Machine-Oriented Logic Based on the Resolution Principle
- Abstract multiple specialization and its application to program parallelization
- An abstract analysis of the probabilistic termination of programs
- An Efficient Unification Algorithm
- Asserting the precision of floating-point computations: A simple abstract interpreter
- Classes of terminating logic programs
- Constraint solving with constraint handling rules
- Deriving descriptions of possible values of program variables by means of abstract interpretation
- Design and implementation of a special-purpose static program analyzer for safety-critical real-time embedded software
- Faster numerical algorithms via exception handling
- 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 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?)
- 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
- Non-transformational termination analysis of logic programs, based on general term-orderings
- PCF extended with real numbers
- Program Development in Computational Logic
- Programming Languages and Systems
- Programming Languages and Systems
- Proving termination of logic programs by exploiting term properties
- Refinement of rational end-points real numbers by means of floating-point numbers
- Reuse of results in termination analysis of typed logic programs
- Static analyses of the precision of floating-point operations
- Synthesis of linear ranking functions
- Termination of constraint logic programs
- Termination of logic programs: the never-ending story
- Theory and practice of constraint handling rules
- Verification of embedded software: Problems and perspectives
- When size does matter. Termination analysis for typed logic programs.
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)
