000 | 05112nam a22006375i 4500 | ||
---|---|---|---|
001 | 978-3-642-03359-9 | ||
003 | DE-He213 | ||
005 | 20240730195524.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2009 gw | s |||| 0|eng d | ||
020 |
_a9783642033599 _9978-3-642-03359-9 |
||
024 | 7 |
_a10.1007/978-3-642-03359-9 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aTheorem Proving in Higher Order Logics _h[electronic resource] : _b22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009, Proceedings / _cedited by Stefan Berghofer, Tobias Nipkow, Christian Urban, Makarius Wenzel. |
250 | _a1st ed. 2009. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2009. |
|
300 |
_aXI, 517 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v5674 |
|
505 | 0 | _aInvited 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. | |
520 | _aThis 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. | ||
650 | 0 |
_aComputer science. _99832 |
|
650 | 0 |
_aMachine theory. _9160514 |
|
650 | 0 |
_aComputer science _xMathematics. _93866 |
|
650 | 0 |
_aDiscrete mathematics. _912873 |
|
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 1 | 4 |
_aTheory of Computation. _9160515 |
650 | 2 | 4 |
_aFormal Languages and Automata Theory. _9160516 |
650 | 2 | 4 |
_aComputer Science Logic and Foundations of Programming. _942203 |
650 | 2 | 4 |
_aMathematics of Computing. _931875 |
650 | 2 | 4 |
_aDiscrete Mathematics in Computer Science. _931837 |
650 | 2 | 4 |
_aAlgorithms. _93390 |
700 | 1 |
_aBerghofer, Stefan. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9160517 |
|
700 | 1 |
_aNipkow, Tobias. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9160518 |
|
700 | 1 |
_aUrban, Christian. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9160519 |
|
700 | 1 |
_aWenzel, Makarius. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9160520 |
|
710 | 2 |
_aSpringerLink (Online service) _9160521 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783642033582 |
776 | 0 | 8 |
_iPrinted edition: _z9783642033605 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v5674 _9160522 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-03359-9 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c95662 _d95662 |