LEADER 06185nam 22008175 450 001 996465962103316 005 20240106002502.0 010 $a3-540-45130-7 024 7 $a10.1007/b11935 035 $a(CKB)1000000000212111 035 $a(SSID)ssj0000327166 035 $a(PQKBManifestationID)11268689 035 $a(PQKBTitleCode)TC0000327166 035 $a(PQKBWorkID)10297637 035 $a(PQKB)10596905 035 $a(DE-He213)978-3-540-45130-3 035 $a(MiAaPQ)EBC3087542 035 $a(PPN)155169424 035 $a(EXLCZ)991000000000212111 100 $a20121227d2003 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] $e16th International Conference, TPHOLs 2003, Rom, Italy, September 8-12, 2003, Proceedings /$fedited by David Basin, Burkhart Wolff 205 $a1st ed. 2003. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003. 215 $a1 online resource (X, 366 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2758 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-40664-6 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Talk I -- Click?n Prove: Interactive Proofs within Set Theory -- Hardware and Assembler Languages -- Formal Specification and Verification of ARM6 -- A Programming Logic for Java Bytecode Programs -- Verified Bytecode Subroutines -- Proof Automation I -- Complete Integer Decision Procedures as Derived Rules in HOL -- Changing Data Representation within the Coq System -- Applications of Polytypism in Theorem Proving -- Proof Automation II -- A Coverage Checking Algorithm for LF -- Automatic Generation of Generalization Lemmas for Proving Properties of Tail-Recursive Definitions -- Tool Combination -- Embedding of Systems of Affine Recurrence Equations in Coq -- Programming a Symbolic Model Checker in a Fully Expansive Theorem Prover -- Combining Testing and Proving in Dependent Type Theory -- Invited Talk II -- Reasoning about Proof Search Specifications: An Abstract -- Logic Extensions -- Program Extraction from Large Proof Developments -- First Order Logic with Domain Conditions -- Extending Higher-Order Unification to Support Proof Irrelevance -- Advances in Theorem Prover Technology -- Inductive Invariants for Nested Recursion -- Implementing Modules in the Coq System -- MetaPRL ? A Modular Logical Environment -- Mathematical Theories -- Proving Pearl: Knuth?s Algorithm for Prime Numbers -- Formalizing Hilbert?s Grundlagen in Isabelle/Isar -- Security -- Using Coq to Verify Java CardTM Applet Isolation Properties -- Verifying Second-Level Security Protocols. 330 $aThis volume constitutes the proceedings of the16th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2003) held September 8?12, 2003 in Rome, Italy. TPHOLs covers all aspects of theorem proving in higher order logics as well as related topics in theorem proving and verification. TPHOLs 2003 was co-located with TABLEAUX, the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, and with Calculemus, the Symposium on the Integration of Symbolic Computation and Mechanized Reasoning. There were 50 papers submitted to TPHOLs in the full research category, each of which was refereed by at least 3 reviewers, selected by the program c- mittee. Of these submissions, 21 were accepted for presentation at the conference and publication in this volume. In keeping with tradition, TPHOLs 2003 also offered a venue for the presentation of work in progress, where researchers - vite 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 computer science department at the Universit¨ at Freiburg. The organizers are grateful to Jean-Raymond Abrial, Patrick Lincoln, and Dale Miller for agreeing to give invited talks at TPHOLs 2003. The TPHOLs conference traditionally changes continent each year in order to maximize the chances that researchers from around the world can attend. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2758 606 $aPhilosophy 606 $aMathematical logic 606 $aLogic design 606 $aSoftware engineering 606 $aComputer logic 606 $aArtificial intelligence 606 $aPhilosophy, general$3https://scigraph.springernature.com/ontologies/product-market-codes/E00003 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aLogic Design$3https://scigraph.springernature.com/ontologies/product-market-codes/I12050 606 $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 615 0$aPhilosophy. 615 0$aMathematical logic. 615 0$aLogic design. 615 0$aSoftware engineering. 615 0$aComputer logic. 615 0$aArtificial intelligence. 615 14$aPhilosophy, general. 615 24$aMathematical Logic and Formal Languages. 615 24$aLogic Design. 615 24$aSoftware Engineering. 615 24$aLogics and Meanings of Programs. 615 24$aArtificial Intelligence. 676 $a006.333 702 $aBasin$b David$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aWolff$b Burkhart$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aTPHOLs 2003 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465962103316 996 $aTheorem Proving in Higher Order Logics$9772309 997 $aUNISA