Theorem Proving in Higher Order Logics: 22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009, Proceedings: Lecture Notes in Computer Science, cartea 5674
Editat de Stefan Berghofer, Tobias Nipkow, Christian Urban, Makarius Wenzelen Limba Engleză Paperback – 4 aug 2009
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 645.28 lei
- Preț: 410.88 lei
- 15% Preț: 580.46 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- Preț: 381.21 lei
- 20% Preț: 353.50 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 309.90 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 310.26 lei
- 20% Preț: 655.02 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 15% Preț: 438.59 lei
- 20% Preț: 591.51 lei
- 20% Preț: 649.49 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 607.39 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 825.93 lei
- 20% Preț: 763.23 lei
- 17% Preț: 360.19 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.57 lei
- 20% Preț: 369.12 lei
- 20% Preț: 583.40 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 764.89 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.29 lei
Preț: 344.42 lei
Preț vechi: 430.53 lei
-20% Nou
Puncte Express: 517
Preț estimativ în valută:
65.91€ • 68.73$ • 54.78£
65.91€ • 68.73$ • 54.78£
Carte tipărită la comandă
Livrare economică 21 martie-04 aprilie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642033582
ISBN-10: 364203358X
Pagini: 519
Ilustrații: XI, 517 p.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.75 kg
Ediția:2009
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
ISBN-10: 364203358X
Pagini: 519
Ilustrații: XI, 517 p.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.75 kg
Ediția:2009
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ă
ResearchCuprins
Invited Papers.- Let’s Get Physical: Models and Methods for Real-World Security Protocols.- VCC: A Practical System for Verifying Concurrent C.- Without Loss of Generality.- Invited Tutorials.- HOL Light: An Overview.- A Brief Overview of Mizar.- A Brief Overview of Agda – A Functional Language with Dependent Types.- The Twelf Proof Assistant.- Regular Papers.- Hints in Unification.- Psi-calculi in Isabelle.- Some Domain Theory and Denotational Semantics in Coq.- Turning Inductive into Equational Specifications.- Formalizing the Logic-Automaton Connection.- Extended First-Order Logic.- Formalising Observer Theory for Environment-Sensitive Bisimulation.- Formal Certification of a Resource-Aware Language Implementation.- A Certified Data Race Analysis for a Java-like Language.- Formal Analysis of Optical Waveguides in HOL.- The HOL-Omega Logic.- A Purely Definitional Universal Domain.- Types, Maps and Separation Logic.- Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence.- Formalising FinFuns – Generating Code for Functions as Data from Isabelle/HOL.- Packaging Mathematical Structures.- Practical Tactics for Separation Logic.- Verified LISP Implementations on ARM, x86 and PowerPC.- Trace-Based Coinductive Operational Semantics for While.- A Better x86 Memory Model: x86-TSO.- Formal Verification of Exact Computations Using Newton’s Method.- Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL.- A Hoare Logic for the State Monad.- Certification of Termination Proofs Using CeTA.- A Formalisation of Smallfoot in HOL.- Liveness Reasoning with Isabelle/HOL.- Mind the Gap.
Textul de pe ultima copertă
This book constitutes the refereed proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics, TPHOLs 200, held in Munich, Germany, in August 2009. The 26 revised full papers presented together with 1 proof pearl, 4 tool presentations, and 3 invited papers were carefully reviewed and selected from 55 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, formalization of mathematical theories, advances in theorem prover technology, as well as industrial application of theorem provers.
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, formalization of mathematical theories, advances in theorem prover technology, as well as industrial application of theorem provers.