{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":28,"n_cols":5,"rows_kept":28,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[20,2,20,3],[21,2,21,3],[25,2,25,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465962103316"]
[null,null,"Titolo",null,"Theorem Proving in Higher Order Logics [[electronic resource] ] : 16th International Conference, TPHOLs 2003, Rom, Italy, September 8-12, 2003, Proceedings / / edited by David Basin, Burkhart Wolff"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003"]
[null,null,"ISBN",null,"3-540-45130-7"]
[null,null,"Edizione",null,"[1st ed. 2003.]"]
[null,null,"Descrizione fisica",null,"1 online resource (X, 366 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 2758"]
[null,null,"Disciplina",null,"006.333"]
[null,null,"Soggetti",null,"Philosophy"]
[{"$nulls":4},"Mathematical logic"]
[{"$nulls":4},"Logic design"]
[{"$nulls":4},"Software engineering"]
[{"$nulls":4},"Computer logic"]
[{"$nulls":4},"Artificial intelligence"]
[{"$nulls":4},"Philosophy, general"]
[{"$nulls":4},"Mathematical Logic and Formal Languages"]
[{"$nulls":4},"Logic Design"]
[{"$nulls":4},"Software Engineering"]
[{"$nulls":4},"Logics and Meanings of Programs"]
[{"$nulls":4},"Artificial Intelligence"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references at the end of each chapters and index."]
[null,null,"Nota di contenuto",null,"Invited 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 "]
[{"$nulls":4},"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."]
[null,null,null,"Sommario/riassunto","This 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."]