- 5 Résultats
prix le plus bas: € 36,38, prix le plus élevé: € 70,57, prix moyen: € 55,03
1
Theorem Proving in Higher Order Logics : 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings - Tom Melham
Commander
sur ZVAB.com
€ 52,46
Envoi: € 0,001
Commander
Détails du fournisseur
Lien sponsorisé
Tom Melham:

Theorem Proving in Higher Order Logics : 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings - Livres de poche

2005, ISBN: 3540283722

[EAN: 9783540283720], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], BEGRÜNDUNG / BEWEIS; INTELLIGENZ KÜNSTLICHE INTELLIGENZ; KI; - AI; LOGIK; PHILOSOPHIE COQ; ISABELLE; FORMALVERI… Plus…

NEW BOOK. Frais d'envoiVersandkostenfrei. (EUR 0.00) AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
fermer(X)
2
Theorem Proving in Higher Order Logics : 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings - Tom Melham
Commander
sur ZVAB.com
€ 58,10
Envoi: € 0,001
Commander
Détails du fournisseur
Lien sponsorisé

Tom Melham:

Theorem Proving in Higher Order Logics : 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings - Livres de poche

2005, ISBN: 3540283722

[EAN: 9783540283720], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], BEGRÜNDUNG / BEWEIS; INTELLIGENZ KÜNSTLICHE INTELLIGENZ; KI; - AI; LOGIK; PHILOSOPHIE COQ; ISABELLE; FORMALVERI… Plus…

NEW BOOK. Frais d'envoiVersandkostenfrei. (EUR 0.00) AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
fermer(X)
3
Theorem Proving in Higher Order Logics: 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings: 3603 (Lecture Notes in Computer Science, 3603)
Commander
sur amazon.co.uk
£ 31,22
(environ € 36,38)
Envoi: € 5,591
Commander
Détails du fournisseur
Lien sponsorisé
Theorem Proving in Higher Order Logics: 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings: 3603 (Lecture Notes in Computer Science, 3603) - Livres de poche

2005

ISBN: 9783540283720

Editor: Hurd, Joe, Editor: Melham, Tom, Springer, Paperback, Auflage: 2005, 424 Seiten, Publiziert: 2005-08-08T00:00:01Z, Produktgruppe: Book, Hersteller-Nr.: Illustrations, 0.59 kg, Book… Plus…

Gut Frais d'envoiIn stock. Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 5.59) rbmbooks
fermer(X)
4
Theorem Proving in Higher Order Logics 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings - Melham, Tom (Herausgeber); Hurd, Joe (Herausgeber)
Commander
sur Achtung-Buecher.de
€ 57,66
Envoi: € 0,001
Commander
Détails du fournisseur
Lien sponsorisé
Melham, Tom (Herausgeber); Hurd, Joe (Herausgeber):
Theorem Proving in Higher Order Logics 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings - nouveau livre

2005, ISBN: 3540283722

2005 Kartoniert / Broschiert Begründung / Beweis, Beweis, Intelligenz / Künstliche Intelligenz, KI, Künstliche Intelligenz - AI, Logik, Philosophie / Logik, Theoretische Informatik, Sys… Plus…

Frais d'envoiVersandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien
fermer(X)
5
Commander
sur Biblio.co.uk
$ 76,68
(environ € 70,57)
Envoi: € 11,891
Commander
Détails du fournisseur
Lien sponsorisé
Joe Hurd:
Theorem Proving in Higher Order Logics: 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings - Livres de poche

2005, ISBN: 9783540283720

Paperback / softback. New. This volume constitutes the proceedings of the 18th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2005), which was held during22-2… Plus…

Frais d'envoi EUR 11.89 The Saint Bookstore
fermer(X)
1Comme certaines plateformes ne transmettent pas les conditions d'expédition et que celles-ci peuvent dépendre du pays de livraison, du prix d'achat, du poids et de la taille de l'article, d'une éventuelle adhésion de la plateforme, d'une livraison directe par la plateforme ou via un prestataire tiers (Marketplace), etc. il est possible que les frais de livraison indiqués par eurolivre ne correspondent pas à ceux de la plateforme qui propose l'article.

Données bibliographiques du meilleur livre correspondant

Détails sur le livre
Theorem Proving in Higher Order Logics: 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings: 3603 (Lecture Notes in Computer Science, 3603)
Auteur:
Titre:
ISBN:

9783540283720


This book constitutes the refereed proceedings of the 18th International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2005, held in Oxford, UK, in August 2005.The 20 revised full papers presented together with 2 invited papers and 4 proof pearls (concise and elegant presentations of interesting examples) were carefully reviewed and selected from 49 submissions. All current issues in HOL theorem proving and formal verification of software and hardware systems are addressed. Among the topics of this volume are theorem proving, verification, recursion and induction, mechanized proofs, mathematical logic, proof theory, type systems, program verification, and proving systems like HOL, Coq, ACL2, Isabelle/HOL and Isabelle/HOLCF.

Informations détaillées sur le livre - Theorem Proving in Higher Order Logics: 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings: 3603 (Lecture Notes in Computer Science, 3603)


EAN (ISBN-13): 9783540283720
ISBN (ISBN-10): 3540283722
Livre de poche
Date de parution: 2005
Editeur: Springer
408 Pages
Poids: 0,637 kg
Langue: eng/Englisch

Livre dans la base de données depuis 2007-05-29T05:49:51+02:00 (Zurich)
Page de détail modifiée en dernier sur 2024-04-03T00:09:02+02:00 (Zurich)
ISBN/EAN: 9783540283720

ISBN - Autres types d'écriture:
3-540-28372-2, 978-3-540-28372-0
Autres types d'écriture et termes associés:
Auteur du livre: joe, paul wolfgang, wolfgang held
Titre du livre: theoretical computer science, 2005, what logics mean, august, theorem proving, logic computer science

Données de l'éditeur

Auteur: Joe Hurd; Tom Melham
Titre: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Theorem Proving in Higher Order Logics - 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings
Editeur: Springer; Springer Berlin
414 Pages
Date de parution: 2005-08-08
Berlin; Heidelberg; DE
Langue: Anglais
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
X, 414 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Informatik; Coq; Isabelle; formal verification; logic; proof theory; proving; theorem proving; verification; Theory of Computation; Computer System Implementation; Formal Languages and Automata Theory; Computer Science Logic and Foundations of Programming; Software Engineering; Artificial Intelligence; Systemanalyse und -design; Software Engineering; Künstliche Intelligenz; EA

Invited Papers.- On the Correctness of Operating System Kernels.- Alpha-Structural Recursion and Induction.- Regular Papers.- Shallow Lazy Proofs.- Mechanized Metatheory for the Masses: The PoplMark Challenge.- A Structured Set of Higher-Order Problems.- Formal Modeling of a Slicing Algorithm for Java Event Spaces in PVS.- Proving Equalities in a Commutative Ring Done Right in Coq.- A HOL Theory of Euclidean Space.- A Design Structure for Higher Order Quotients.- Axiomatic Constructor Classes in Isabelle/HOLCF.- Meta Reasoning in ACL2.- Reasoning About Java Programs with Aliasing and Frame Conditions.- Real Number Calculations and Theorem Proving.- Verifying a Secure Information Flow Analyzer.- Proving Bounds for Real Linear Programs in Isabelle/HOL.- Essential Incompleteness of Arithmetic Verified by Coq.- Verification of BDD Normalization.- Extensionality in the Calculus of Constructions.- A Mechanically Verified, Sound and Complete Theorem Prover for First Order Logic.- A Generic Network on Chip Model.- Formal Verification of a SHA-1 Circuit Core Using ACL2.- From PSL to LTL: A Formal Validation in HOL.- Proof Pearls.- Proof Pearl: A Formal Proof of Higman’s Lemma in ACL2.- Proof Pearl: Dijkstra’s Shortest Path Algorithm Verified with ACL2.- Proof Pearl: Defining Functions over Finite Sets.- Proof Pearl: Using Combinators to Manipulate let-Expressions in Proof.
< pour archiver...