Formal Verification of Exact Computations Using Newton’s Method (Q3183542): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of GMP square root / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern Computer Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Knowledge Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonstandard analysis in ACL2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal verification of square root algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4531982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified Exact Real Arithmetic Using Co-induction in Arbitrary Integer Base / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3184782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real Number Calculations and Theorem Proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coinductive Formal Reasoning in Exact Real Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified Exact Transcendental Real Number Computation in Coq / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427909 / rank
 
Normal rank

Latest revision as of 01:27, 2 July 2024

scientific article
Language Label Description Also known as
English
Formal Verification of Exact Computations Using Newton’s Method
scientific article

    Statements

    Identifiers