Loop invariants in floating point algorithms
From MaRDI portal
Recommendations
- Counterexample- and simulation-guided floating-point loop invariant synthesis
- FM 2005: Formal Methods
- Accurate and efficient algorithms for floating point computation
- Programming Languages and Systems
- Algorithms for efficient reproducible floating point summation
- Floating-point error propagation in iterative methods
- An iterative method for generating loop invariants
- Faithfully rounded floating-point computations
- Publication:3033331
Cites work
- scientific article; zbMATH DE number 3874497 (Why is no real title available?)
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 3905740 (Why is no real title available?)
- scientific article; zbMATH DE number 4047034 (Why is no real title available?)
- scientific article; zbMATH DE number 3740740 (Why is no real title available?)
- scientific article; zbMATH DE number 3766957 (Why is no real title available?)
- scientific article; zbMATH DE number 44308 (Why is no real title available?)
- scientific article; zbMATH DE number 67122 (Why is no real title available?)
- scientific article; zbMATH DE number 3502707 (Why is no real title available?)
- scientific article; zbMATH DE number 3300589 (Why is no real title available?)
- An axiomatic basis for computer programming
- Basic results for the behaviour of discrete iterations
- Evaluation of Hausdorff distances in interval mathematics
- Punktkonvergenz in der Intervall‐Rechnung
- Über die Notwendigkeit einer Fehlerschranken-Arithmetik für Rechenautomaten
Cited in
(2)
This page was built for publication: Loop invariants in floating point algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685861)