- 5 Risultati
prezzo più basso: € 36,38, prezzo più alto: € 115,16, prezzo medio: € 70,50
1
Theorem Proving in Higher Order Logics : 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings - Tom Melham
Ordina
da ZVAB.com
€ 52,46
Spedizione: € 0,001
Ordina
Dettagli del offerente
Link sponsorizzato
Tom Melham:

Theorem Proving in Higher Order Logics : 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings - edizione con copertina flessibile

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… Altro …

NEW BOOK. Costi di spedizione:Versandkostenfrei. (EUR 0.00) AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
Chiudere (X)
2
Theorem Proving in Higher Order Logics by Joe Hurd Paperback | Indigo Chapters
Ordina
da Indigo.ca
C$ 165,50
(indicativi € 115,16)
Ordina
Dettagli & spedizione
Link sponsorizzato
Theorem Proving in Higher Order Logics by Joe Hurd Paperback | Indigo Chapters - nuovo libro

2005, ISBN: 9783540283720

This volume constitutes the proceedings of the 18th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2005), which was held during22-25August2005inOxford, UK. TPH… Altro …

new in stock. Costi di spedizione:zzgl. Versandkosten., Costi di spedizione aggiuntivi
Chiudere (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)
Ordina
da amazon.co.uk
£ 31,22
(indicativi € 36,38)
Spedizione: € 5,591
Ordina
Dettagli del offerente
Link sponsorizzato
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) - edizione con copertina flessibile

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… Altro …

Gut Costi di spedizione:In stock. Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 5.59) rbmbooks
Chiudere (X)
4
Theorem Proving in Higher Order Logics - Hurd, Joe Melham, Tom
Ordina
da booklooker.de
€ 77,95
Spedizione: € 0,001
Ordina
Dettagli del offerente
Link sponsorizzato
Hurd, Joe Melham, Tom:
Theorem Proving in Higher Order Logics - Prima edizione

2005, ISBN: 9783540283720

edizione con copertina flessibile

[ED: Kartoniert / Broschiert], [PU: Springer Berlin Heidelberg], Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This volume constitutes t… Altro …

Costi di spedizione:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) Moluna GmbH
Chiudere (X)
5
Ordina
da Biblio.co.uk
$ 76,68
(indicativi € 70,57)
Spedizione: € 11,891
Ordina
Dettagli del offerente
Link sponsorizzato
Joe Hurd:
Theorem Proving in Higher Order Logics: 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings - edizione con copertina flessibile

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… Altro …

Costi di spedizione: EUR 11.89 The Saint Bookstore
Chiudere (X)
1Poiché alcune piattaforme non trasmettono le condizioni di spedizione e queste possono dipendere dal paese di consegna, dal prezzo di acquisto, dal peso e dalle dimensioni dell'articolo, dall'eventuale iscrizione alla piattaforma, dalla consegna diretta da parte della piattaforma o tramite un fornitore terzo (Marketplace), ecc. è possibile che le spese di spedizione indicate da eurolibro non corrispondano a quelle della piattaforma offerente.

Dati bibliografici del miglior libro corrispondente

Dettagli del libro
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)
Autore:
Titolo:
ISBN:

3540283722


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.

Informazioni dettagliate del libro - 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
Copertina flessibile
Anno di pubblicazione: 2005
Editore: Springer
408 Pagine
Peso: 0,637 kg
Lingua: eng/Englisch

Libro nella banca dati dal 2007-05-29T05:49:51+02:00 (Rome)
Pagina di dettaglio ultima modifica in 2023-07-03T20:48:01+02:00 (Rome)
ISBN/EAN: 3540283722

ISBN - Stili di scrittura alternativi:
3-540-28372-2, 978-3-540-28372-0
Stili di scrittura alternativi e concetti di ricerca simili:
Autore del libro : joe, paul wolfgang, wolfgang held
Titolo del libro: theoretical computer science, 2005, what logics mean, august, theorem proving, logic computer science

Dati dell'editore

Autore: Joe Hurd; Tom Melham
Titolo: 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
Editore: Springer; Springer Berlin
414 Pagine
Anno di pubblicazione: 2005-08-08
Berlin; Heidelberg; DE
Lingua: Inglese
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.
< Per archiviare...