LEADER 06364nam 22008175 450 001 996465875103316 005 20200703044244.0 010 $a3-540-44755-5 024 7 $a10.1007/3-540-44755-5 035 $a(CKB)1000000000211631 035 $a(SSID)ssj0000327164 035 $a(PQKBManifestationID)11255982 035 $a(PQKBTitleCode)TC0000327164 035 $a(PQKBWorkID)10301592 035 $a(PQKB)11296323 035 $a(DE-He213)978-3-540-44755-9 035 $a(MiAaPQ)EBC3073019 035 $a(PPN)155170104 035 $a(EXLCZ)991000000000211631 100 $a20121227d2001 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aTheorem Proving in Higher Order Logics$b[electronic resource] $e14th International Conference, TPHOLs 2001, Edinburgh, Scotland, UK, September 3-6, 2001. Proceedings /$fedited by Richard J. Boulton, Paul B. Jackson 205 $a1st ed. 2001. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2001. 215 $a1 online resource (X, 402 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2152 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-42525-X 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Talks -- JavaCard Program Verification -- View from the Fringe of the Fringe -- Using Decision Procedures with a Higher-Order Logic -- Regular Contributions -- Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS -- An Irrational Construction of ? from ? -- HELM and the Semantic Math-Web -- Calculational Reasoning Revisited An Isabelle/Isar Experience -- Mechanical Proofs about a Non-repudiation Protocol -- Proving Hybrid Protocols Correct -- Nested General Recursion and Partiality in Type Theory -- A Higher-Order Calculus for Categories -- Certifying the Fast Fourier Transform with Coq -- A Generic Library for Floating-Point Numbers and Its Application to Exact Computing -- Ordinal Arithmetic: A Case Study for Rippling in a Higher Order Domain -- Abstraction and Refinement in Higher Order Logic -- A Framework for the Formalisation of Pi Calculus Type Systems in Isabelle/HOL -- Representing Hierarchical Automata in Interactive Theorem Provers -- Refinement Calculus for Logic Programming in Isabelle/HOL -- Predicate Subtyping with Predicate Sets -- A Structural Embedding of Ocsid in PVS -- A Certified Polynomial-Based Decision Procedure for Propositional Logic -- Finite Set Theory in ACL2 -- The HOL/NuPRL Proof Translator -- Formalizing Convex Hull Algorithms -- Experiments with Finite Tree Automata in Coq -- Mizar Light for HOL Light. 330 $aThis volume constitutes the proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2001) held 3?6 September 2001 in Edinburgh, Scotland. TPHOLs covers all aspects of theorem proving in higher order logics, as well as related topics in theorem proving and veri?cation. TPHOLs 2001 was collocated with the 11th Advanced Research Working Conference on Correct Hardware Design and Veri?cation Methods (CHARME 2001). This was held 4?7 September 2001 in nearby Livingston, Scotland at the Institute for System Level Integration, and a joint half-day session of talks was arranged for the 5th September in Edinburgh. An excursion to Traquair House and a banquet in the Playfair Library of Old College, University of Edinburgh were also jointly organized. The proceedings of CHARME 2001 have been p- lished as volume 2144 of Springer-Verlag?s Lecture Notes in Computer Science series, with Tiziana Margaria and Tom Melham as editors. Each of the 47 papers submitted in the full research category was refereed by at least 3 reviewers who were selected by the Program Committee. Of these submissions, 23 were accepted for presentation at the conference and publication in this volume. In keeping with tradition, TPHOLs 2001 also o?ered a venue for the presentation of work in progress, where researchers invite discussion by means of a brief preliminary talk and then discuss their work at a poster session. A supplementary proceedings containing associated papers for work in progress was published by the Division of Informatics at the University of Edinburgh. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2152 606 $aProgramming languages (Electronic computers) 606 $aComputers 606 $aArtificial intelligence 606 $aMathematical logic 606 $aComputer logic 606 $aSoftware engineering 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029 615 0$aProgramming languages (Electronic computers). 615 0$aComputers. 615 0$aArtificial intelligence. 615 0$aMathematical logic. 615 0$aComputer logic. 615 0$aSoftware engineering. 615 14$aProgramming Languages, Compilers, Interpreters. 615 24$aTheory of Computation. 615 24$aArtificial Intelligence. 615 24$aMathematical Logic and Formal Languages. 615 24$aLogics and Meanings of Programs. 615 24$aSoftware Engineering. 676 $a004/.01/51 702 $aBoulton$b Richard J$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aJackson$b Paul B$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aTPHOLs 2001 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465875103316 996 $aTheorem Proving in Higher Order Logics$9772309 997 $aUNISA