Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
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
| 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 |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (X, 366 p.) |
| Disciplina | 006.333 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Philosophy
Mathematical logic Logic design Software engineering Computer logic Artificial intelligence Philosophy, general Mathematical Logic and Formal Languages Logic Design Software Engineering Logics and Meanings of Programs Artificial Intelligence |
| ISBN | 3-540-45130-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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 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. |
| Record Nr. | UNINA-9910144027503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
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
| 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 |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (X, 366 p.) |
| Disciplina | 006.333 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Philosophy
Mathematical logic Logic design Software engineering Computer logic Artificial intelligence Philosophy, general Mathematical Logic and Formal Languages Logic Design Software Engineering Logics and Meanings of Programs Artificial Intelligence |
| ISBN | 3-540-45130-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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 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. |
| Record Nr. | UNISA-996465962103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
