000 04463nam a22006135i 4500
001 978-3-540-71067-7
003 DE-He213
005 20240423125629.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540710677
_9978-3-540-71067-7
024 7 _a10.1007/978-3-540-71067-7
_2doi
050 4 _aQA76.76.C65
072 7 _aUMC
_2bicssc
072 7 _aCOM010000
_2bisacsh
072 7 _aUMC
_2thema
082 0 4 _a005.45
_223
245 1 0 _aTheorem Proving in Higher Order Logics
_h[electronic resource] :
_b21st International Conference, TPHOLs 2008, Montreal, Canada, August 18-21, 2008, Proceedings /
_cedited by Otmane Ait Mohamed, César Munoz, Sofiène Tahar.
250 _a1st ed. 2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2008.
300 _aX, 321 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 ;
_v5170
505 0 _aInvited Papers -- Twenty Years of Theorem Proving for HOLs Past, Present and Future -- Will This Be Formal? -- Tutorials -- A Short Presentation of Coq -- An ACL2 Tutorial -- A Brief Overview of PVS -- A Brief Overview of HOL4 -- The Isabelle Framework -- Regular Papers -- A Compiled Implementation of Normalization by Evaluation -- LCF-Style Propositional Simplification with BDDs and SAT Solvers -- Nominal Inversion Principles -- Canonical Big Operators -- A Type of Partial Recursive Functions -- Formal Reasoning About Causality Analysis -- Imperative Functional Programming with Isabelle/HOL -- HOL-Boogie — An Interactive Prover for the Boogie Program-Verifier -- Secure Microkernels, State Monads and Scalable Refinement -- Certifying a Termination Criterion Based on Graphs, without Graphs -- Lightweight Separation -- Real Number Calculations and Theorem Proving -- A Formalized Theory for Verifying Stability and Convergence of Automata in PVS -- Certified Exact Transcendental Real Number Computation in Coq -- Formalizing Soundness of Contextual Effects -- First-Class Type Classes -- Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL -- Proof Pearls -- Proof Pearl: Revisiting the Mini-rubik in Coq.
520 _aThis book constitutes the refereed proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2008, held in Montreal, Canada, in August 2008. The 17 revised full papers presented together with 1 proof pearl (concise and elegant presentations of interesting examples), 5 tool presentations, and 2 invited papers were carefully reviewed and selected from 40 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, formalisation of mathematical theories, advances in theorem prover technology, as well as industrial application of theorem provers.
650 0 _aCompilers (Computer programs).
650 0 _aComputer systems.
650 0 _aSoftware engineering.
650 0 _aMachine theory.
650 0 _aComputer science.
650 1 4 _aCompilers and Interpreters.
650 2 4 _aComputer System Implementation.
650 2 4 _aSoftware Engineering.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aComputer Science Logic and Foundations of Programming.
700 1 _aAit Mohamed, Otmane.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aMunoz, César.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aTahar, Sofiène.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540710653
776 0 8 _iPrinted edition:
_z9783540867487
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5170
856 4 0 _uhttps://doi.org/10.1007/978-3-540-71067-7
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c180056
_d180056