Cantitate/Preț
Produs
Total produse
Vezi coșul
Theorem Proving in Higher Order Logics: 21st International Conference, TPHOLs 2008, Montreal, Canada, August 18-21, 2008, Proceedings de Otmane Ait Mohamed

Theorem Proving in Higher Order Logics: 21st International Conference, TPHOLs 2008, Montreal, Canada, August 18-21, 2008, Proceedings: Lecture Notes in Computer Science, cartea 5170

Editat de Otmane Ait Mohamed, César Munoz, Sofiène Tahar
en Limba Engleză Paperback – 30 iul 2008
This book constitutes the refereed proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2008, held in Montreal, Canada, in August 2008. The 17 revised full papers presented together with 1 proof pearl (concise and elegant presentations of interesting examples), 5 tool presentations, and 2 invited papers were carefully reviewed and selected from 40 submissions. The papers cover all aspects of theorem proving in higher order logics as well as related topics in theorem proving and verification such as formal semantics of specification, modeling, and programming languages, specification and verification of hardware and software, formalisation of mathematical theories, advances in theorem prover technology, as well as industrial application of theorem provers.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32863 lei

Preț vechi: 41078 lei
-20% Nou

Puncte Express: 493
Preț estimativ în valută:
6290€ • 6599$ • 5218£

Carte tipărită la comandă

Livrare economică 29 ianuarie-12 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540710653
ISBN-10: 3540710655
Pagini: 338
Ilustrații: X, 321 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.5 kg
Ediția:2008
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Invited Papers.- Twenty Years of Theorem Proving for HOLs Past, Present and Future.- Will This Be Formal?.- Tutorials.- A Short Presentation of Coq.- An ACL2 Tutorial.- A Brief Overview of PVS.- A Brief Overview of HOL4.- The Isabelle Framework.- Regular Papers.- A Compiled Implementation of Normalization by Evaluation.- LCF-Style Propositional Simplification with BDDs and SAT Solvers.- Nominal Inversion Principles.- Canonical Big Operators.- A Type of Partial Recursive Functions.- Formal Reasoning About Causality Analysis.- Imperative Functional Programming with Isabelle/HOL.- HOL-Boogie — An Interactive Prover for the Boogie Program-Verifier.- Secure Microkernels, State Monads and Scalable Refinement.- Certifying a Termination Criterion Based on Graphs, without Graphs.- Lightweight Separation.- Real Number Calculations and Theorem Proving.- A Formalized Theory for Verifying Stability and Convergence of Automata in PVS.- Certified Exact Transcendental Real Number Computation in Coq.- Formalizing Soundness of Contextual Effects.- First-Class Type Classes.- Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL.- Proof Pearls.- Proof Pearl: Revisiting the Mini-rubik in Coq.

Textul de pe ultima copertă

This book constitutes the refereed proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2008, held in Montreal, Canada, in August 2008.
The 17 revised full papers presented together with 1 proof pearl (concise and elegant presentations of interesting examples), 5 tool presentations, and 2 invited papers were carefully reviewed and selected from 40 submissions. The papers cover all aspects of theorem proving in higher order logics as well as related topics in theorem proving and verification such as formal semantics of specification, modeling, and programming languages, specification and verification of hardware and software, formalisation of mathematical theories, advances in theorem prover technology, as well as industrial application of theorem provers.