English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Formally Verified Roundoff Errors Using SMT-based Certificates and Subdivisions

MPS-Authors
/persons/resource/persons216356

Becker,  Heiko
Group E. Darulova, Max Planck Institute for Software Systems, Max Planck Society;

/persons/resource/persons216352

Darulova,  Eva
Group E. Darulova, Max Planck Institute for Software Systems, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Bard, J., Becker, H., & Darulova, E. (2019). Formally Verified Roundoff Errors Using SMT-based Certificates and Subdivisions. In M. H. ter Beek, A. McIver, & J. N. Oliveira (Eds.), Formal Methods - The Next 30 Years (pp. 38-44). Cham: Springer. doi:10.1007/978-3-030-30942-8_4.


Cite as: https://hdl.handle.net/21.11116/0000-0005-D53C-8
Abstract
When compared to idealized, real-valued arithmetic, finite precision arithmetic introduces unavoidable errors, for which numerous tools compute sound upper bounds. To ensure soundness, providing formal guarantees on these complex tools is highly valuable.