Isbn: 9781785481123 - computer arithmetic and formal proofs: verifying floating-point algorithms with the coq system (5 risultati)

Perfeziona la tua ricerca

  • Libri (5)

  • Nuovo (5)

a

Fascia di prezzo personalizzata (EUR)

a

  • Lingua: Inglese

    Editore: Elsevier Science Ltd, 2017

    1785481126 / 9781785481123

    • Rilegato

    Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 156,34

    EUR 14,58 spedizione 
    Spedito da Regno Unito a U.S.A.

    Quantità: 2 disponibili

    Hardcover. Condizione: Brand New. 306 pages. 9.00x6.00x1.00 inches. In Stock.

  • Lingua: Inglese

    Editore: ISTE Press Ltd - Elsevier Inc, 2017

    1785481126 / 9781785481123

    • Rilegato

    Da: THE SAINT BOOKSTORE, Southport, Regno UnitoTHE SAINT BOOKSTORE

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 172,83

    EUR 20,80 spedizione 
    Spedito da Regno Unito a U.S.A.

    Quantità: Più di 20 disponibili

    Hardback. Condizione: New. New copy - Usually dispatched within 4 working days.

  • Lingua: Inglese

    Editore: ISTE Press - Elsevier, 2017

    1785481126 / 9781785481123

    • Rilegato
    • Print on Demand

    Da: Brook Bookstore On Demand, Napoli, NA, ItaliaBrook Bookstore On Demand

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 132,57

    EUR 6,80 spedizione 
    Spedito da Italia a U.S.A.

    Quantità: Più di 20 disponibili

    Condizione: new. Questo è un articolo print on demand.

  • Lingua: Inglese

    Editore: Elsevier Science Jul 2017, 2017

    1785481126 / 9781785481123

    • Brossura
    • Print on Demand

    Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 148,00

    EUR 23,00 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: 2 disponibili

    Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Floating-point arithmetic is ubiquitous in modern computing, as it is the tool of choice to approximate real numbers. Due to its limited range and precision, its use can become quite involved and potentially lead to numerous failures. One way to greatly increase confidence in floating-point software is by computer-assisted verification of its correctness proofs. This book provides a comprehensive view of how to formally specify and verify tricky floating-point algorithms with the Coq proof assistant. It describes the Flocq formalization of floating-point arithmetic and some methods to automate theorem proofs. It then presents the specification and verification of various algorithms, from error-free transformations to a numerical scheme for a partial differential equation. The examples cover not only mathematical algorithms but also C programs as well as issues related to compilation. 326 pp. Englisch.

  • Lingua: Inglese

    Editore: Elsevier Science, 2017

    1785481126 / 9781785481123

    • Rilegato
    • Print on Demand

    Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 207,67

    EUR 30,50 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: 2 disponibili

    Buch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Floating-point arithmetic is ubiquitous in modern computing, as it is the tool of choice to approximate real numbers. Due to its limited range and precision, its use can become quite involved and potentially lead to numerous failures. One way to greatly increase confidence in floating-point software is by computer-assisted verification of its correctness proofs. This book provides a comprehensive view of how to formally specify and verify tricky floating-point algorithms with the Coq proof assistant. It describes the Flocq formalization of floating-point arithmetic and some methods to automate theorem proofs. It then presents the specification and verification of various algorithms, from error-free transformations to a numerical scheme for a partial differential equation. The examples cover not only mathematical algorithms but also C programs as well as issues related to compilation.