On the public citation graph

Verifying the accuracy of polynomial approximations in HOL

https://doi.org/10.1007/bfb0028391
0 signed · 36 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4471-1591-5openalex-snapshot
Theorem Proving with the Real Numbers
inferredcites →https://doi.org/10.1007/978-3-662-21717-7openalex-snapshot
Computability in Analysis and Physics
inferredcites →https://doi.org/10.1007/bf01386330openalex-snapshot
Polynomials of best uniform approximation to certain rational functions
inferredcites →https://doi.org/10.1007/bfb0000475openalex-snapshot
Floating point verification in HOL light: The exponential function
inferredcites →https://doi.org/10.1145/146847.146928openalex-snapshot
Table-driven implementation of the Expm1 function in IEEE floating-point arithmetic
inferredcites →https://doi.org/10.1145/63522.214389openalex-snapshot
Table-driven implementation of the exponential function in IEEE floating-point arithmetic

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11814771_6openalex-snapshot
Pitfalls of a Full Floating-Point Proof: Example on the Formal Proof of the Veltkamp/Dekker Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-36103-0_47openalex-snapshot
Enabling Hardware Verification through Design Changes
inferred← citeshttps://doi.org/10.1007/3-540-36126-x_17openalex-snapshot
Mechanical Verification of a Square Root Algorithm Using Taylor’s Theorem
inferred← citeshttps://doi.org/10.1007/3-540-40922-x_14openalex-snapshot
Formal Verification of Floating Point Trigonometric Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-76526-6_13openalex-snapshot
Verifying Floating-Point Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-39724-3_29openalex-snapshot
Linear and Nonlinear Arithmetic in ACL2
inferred← citeshttps://doi.org/10.1007/978-3-540-71067-7_19openalex-snapshot
Real Number Calculations and Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-540-74591-4_9openalex-snapshot
Verifying Nonlinear Real Formulas Via Sums of Squares
inferred← citeshttps://doi.org/10.1007/bfb0000475openalex-snapshot
Floating point verification in HOL light: The exponential function
inferred← citeshttps://doi.org/10.1007/s10817-015-9320-xopenalex-snapshot
Formally-Verified Decision Procedures for Univariate Polynomial Computation Based on Sturm’s and Tarski’s Theorems
inferred← citeshttps://doi.org/10.1007/s10817-015-9350-4openalex-snapshot
Proving Tight Bounds on Univariate Expressions with Elementary Functions in Coq
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00223-2openalex-snapshot
Additive symmetries: the non-negative case
inferred← citeshttps://doi.org/10.1023/a:1008712907154openalex-snapshot
Floating Point Verification in HOL Light: The Exponential Function
inferred← citeshttps://doi.org/10.1023/a:1022973506233openalex-snapshot
Formal Verification of Square Root Algorithms
inferred← citeshttps://doi.org/10.1145/1141277.1141586openalex-snapshot
Provably faithful evaluation of polynomials
inferred← citeshttps://doi.org/10.1145/2676724.2693166openalex-snapshot
A Decision Procedure for Univariate Real Polynomials in Isabelle/HOL
inferred← citeshttps://doi.org/10.1145/3167099openalex-snapshot
A constructive formalisation of Semi-algebraic sets and functions
inferred← citeshttps://doi.org/10.1145/3176245.3167099openalex-snapshot
A constructive formalisation of Semi-algebraic sets and functions
inferred← citeshttps://doi.org/10.1145/3434310openalex-snapshot
An approach to generate correctly rounded math libraries for new floating point variants
inferred← citeshttps://doi.org/10.1145/3437992.3439933openalex-snapshot
Formal verification of semi-algebraic sets and real analytic functions
inferred← citeshttps://doi.org/10.1145/3453483.3454049openalex-snapshot
High performance correctly rounded math libraries for 32-bit floating point representations
inferred← citeshttps://doi.org/10.1145/3498664openalex-snapshot
One polynomial approximation to produce correctly rounded results of an elementary function for multiple representations and rounding modes
inferred← citeshttps://doi.org/10.1145/3519939.3523447openalex-snapshot
Progressive polynomial approximations for fast correctly rounded math libraries
inferred← citeshttps://doi.org/10.1145/3729332openalex-snapshot
Correctly Rounded Math Libraries without Worrying about the Application’s Rounding Mode
inferred← citeshttps://doi.org/10.48550/arxiv.2108.06756openalex-snapshot
RLIBM-ALL: A Novel Polynomial Approximation Method to Produce Correctly Rounded Results for Multiple Representations and Rounding Modes
inferred← citeshttps://doi.org/10.48550/arxiv.2111.12852openalex-snapshot
RLIBM-PROG: Progressive Polynomial Approximations for Fast Correctly Rounded Math Libraries
inferred← citeshttps://doi.org/10.5555/1998496.1998525openalex-snapshot
Automatic verification of estimate functions with polynomials of bounded functions
inferred← citeshttps://doi.org/10.6092/issn.1972-5787/2269openalex-snapshot
Formalizing a Proof that e is Transcendental
inferred← citeshttps://doi.org/10.6092/issn.1972-5787/8212openalex-snapshot
A Decision Procedure for Univariate Polynomial Systems Based on Root Counting and Interval Subdivision
inferred← citeshttps://doi.org/10.7282/t3-z898-ft43openalex-snapshot
A novel approach to generate correctly rounded math libraries for new floating point representations
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.