- 5 resultados
menor preço: € 36,38, preço mais alto: € 70,57, preço médio: € 55,03
1
Theorem Proving in Higher Order Logics : 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings - Tom Melham
Encomendar
no/na ZVAB.com
€ 52,46
Envio: € 0,001
Encomendar
Detalhes fornecedor
Link patrocinado
Tom Melham:

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

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

NEW BOOK. Custos de envio:Versandkostenfrei. (EUR 0.00) AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
fechar(X)
2
Theorem Proving in Higher Order Logics : 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings - Tom Melham
Encomendar
no/na ZVAB.com
€ 58,10
Envio: € 0,001
Encomendar
Detalhes fornecedor
Link patrocinado

Tom Melham:

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

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

NEW BOOK. Custos de envio:Versandkostenfrei. (EUR 0.00) AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
fechar(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)
Encomendar
no/na amazon.co.uk
£ 31,22
(aproximadamente € 36,38)
Envio: € 5,591
Encomendar
Detalhes fornecedor
Link patrocinado
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) - Livro de bolso

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

Gut Custos de envio:In stock. Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 5.59) rbmbooks
fechar(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)
Encomendar
no/na Achtung-Buecher.de
€ 57,66
Envio: € 0,001
Encomendar
Detalhes fornecedor
Link patrocinado
Melham, Tom (Herausgeber); Hurd, Joe (Herausgeber):
Theorem Proving in Higher Order Logics 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings - novo libro

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

Custos de envio:Versandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien
fechar(X)
5
Encomendar
no/na Biblio.co.uk
$ 76,68
(aproximadamente € 70,57)
Envio: € 11,891
Encomendar
Detalhes fornecedor
Link patrocinado
Joe Hurd:
Theorem Proving in Higher Order Logics: 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings - Livro de bolso

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

Custos de envio: EUR 11.89 The Saint Bookstore
fechar(X)
1Como algumas plataformas não transmitem condições de envio e estas podem depender do país de entrega, do preço de compra, do peso e tamanho do artigo, de uma possível adesão à plataforma, de uma entrega directa pela plataforma ou através de um terceiro fornecedor (Marketplace), etc., é possível que os custos de envio indicados pelo eurolivro não correspondam aos da plataforma ofertante.

Dados bibliográficos do melhor livro correspondente

Pormenores referentes ao livro
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)
Autor:
Título:
Número 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.

Dados detalhados do livro - 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
Livro de bolso
Ano de publicação: 2005
Editor/Editora: Springer
408 Páginas
Peso: 0,637 kg
Língua: eng/Englisch

Livro na base de dados desde 2007-05-29T04:49:51+01:00 (Lisbon)
Página de detalhes modificada pela última vez em 2024-04-02T23:09:02+01:00 (Lisbon)
Número ISBN/EAN: 9783540283720

Número ISBN - Ortografia alternativa:
3-540-28372-2, 978-3-540-28372-0
Ortografia alternativa e termos de pesquisa relacionados:
Autor do livro: joe, paul wolfgang, wolfgang held
Título do livro: theoretical computer science, 2005, what logics mean, august, theorem proving, logic computer science

Dados da editora

Autor: Joe Hurd; Tom Melham
Título: 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
Editora: Springer; Springer Berlin
414 Páginas
Ano de publicação: 2005-08-08
Berlin; Heidelberg; DE
Língua: Inglês
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.
< Para arquivar...