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.
Interactive Theorem Proving [[electronic resource] ] : First International Conference, ITP 2010 Edinburgh, UK, July 11-14, 2010, Proceedings / / edited by Matt Kaufmann, Lawrence C. Paulson
| Interactive Theorem Proving [[electronic resource] ] : First International Conference, ITP 2010 Edinburgh, UK, July 11-14, 2010, Proceedings / / edited by Matt Kaufmann, Lawrence C. Paulson |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XI, 495 p. 82 illus.) |
| Disciplina | 005.1015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Machine theory Compilers (Computer programs) Artificial intelligence Immunospecificity Computer Science Logic and Foundations of Programming Software Engineering Formal Languages and Automata Theory Compilers and Interpreters Artificial Intelligence Adaptive Immunity |
| ISBN |
1-280-38759-9
9786613565518 3-642-14052-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- A Formally Verified OS Kernel. Now What? -- Proof Assistants as Teaching Assistants: A View from the Trenches -- Proof Pearls -- A Certified Denotational Abstract Interpreter -- Using a First Order Logic to Verify That Some Set of Reals Has No Lesbegue Measure -- A New Foundation for Nominal Isabelle -- (Nominal) Unification by Recursive Descent with Triangular Substitutions -- A Formal Proof of a Necessary and Sufficient Condition for Deadlock-Free Adaptive Networks -- Regular Papers -- Extending Coq with Imperative Features and Its Application to SAT Verification -- A Tactic Language for Declarative Proofs -- Programming Language Techniques for Cryptographic Proofs -- Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder -- Formal Proof of a Wave Equation Resolution Scheme: The Method Error -- An Efficient Coq Tactic for Deciding Kleene Algebras -- Fast LCF-Style Proof Reconstruction for Z3 -- The Optimal Fixed Point Combinator -- Formal Study of Plane Delaunay Triangulation -- Reasoning with Higher-Order Abstract Syntax and Contexts: A Comparison -- A Trustworthy Monadic Formalization of the ARMv7 Instruction Set Architecture -- Automated Machine-Checked Hybrid System Safety Proofs -- Coverset Induction with Partiality and Subsorts: A Powerlist Case Study -- Case-Analysis for Rippling and Inductive Proof -- Importing HOL Light into Coq -- A Mechanized Translation from Higher-Order Logic to Set Theory -- The Isabelle Collections Framework -- Interactive Termination Proofs Using Termination Cores -- A Framework for Formal Verification of Compiler Optimizations -- On the Formalization of the Lebesgue Integration Theory in HOL -- From Total Store Order to Sequential Consistency: A Practical Reduction Theorem -- Equations: A Dependent Pattern-Matching Compiler -- A Mechanically Verified AIG-to-BDD Conversion Algorithm -- Inductive Consequences in the Calculus of Constructions -- Validating QBF Invalidity in HOL4 -- Rough Diamonds -- Higher-Order Abstract Syntax in Isabelle/HOL -- Separation Logic Adapted for Proofs by Rewriting -- Developing the Algebraic Hierarchy with Type Classes in Coq. |
| Record Nr. | UNISA-996465785003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Interactive Theorem Proving [[electronic resource] ] : First International Conference, ITP 2010 Edinburgh, UK, July 11-14, 2010, Proceedings / / edited by Matt Kaufmann, Lawrence C. Paulson
| Interactive Theorem Proving [[electronic resource] ] : First International Conference, ITP 2010 Edinburgh, UK, July 11-14, 2010, Proceedings / / edited by Matt Kaufmann, Lawrence C. Paulson |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XI, 495 p. 82 illus.) |
| Disciplina | 005.1015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Machine theory Compilers (Computer programs) Artificial intelligence Immunospecificity Computer Science Logic and Foundations of Programming Software Engineering Formal Languages and Automata Theory Compilers and Interpreters Artificial Intelligence Adaptive Immunity |
| ISBN |
1-280-38759-9
9786613565518 3-642-14052-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- A Formally Verified OS Kernel. Now What? -- Proof Assistants as Teaching Assistants: A View from the Trenches -- Proof Pearls -- A Certified Denotational Abstract Interpreter -- Using a First Order Logic to Verify That Some Set of Reals Has No Lesbegue Measure -- A New Foundation for Nominal Isabelle -- (Nominal) Unification by Recursive Descent with Triangular Substitutions -- A Formal Proof of a Necessary and Sufficient Condition for Deadlock-Free Adaptive Networks -- Regular Papers -- Extending Coq with Imperative Features and Its Application to SAT Verification -- A Tactic Language for Declarative Proofs -- Programming Language Techniques for Cryptographic Proofs -- Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder -- Formal Proof of a Wave Equation Resolution Scheme: The Method Error -- An Efficient Coq Tactic for Deciding Kleene Algebras -- Fast LCF-Style Proof Reconstruction for Z3 -- The Optimal Fixed Point Combinator -- Formal Study of Plane Delaunay Triangulation -- Reasoning with Higher-Order Abstract Syntax and Contexts: A Comparison -- A Trustworthy Monadic Formalization of the ARMv7 Instruction Set Architecture -- Automated Machine-Checked Hybrid System Safety Proofs -- Coverset Induction with Partiality and Subsorts: A Powerlist Case Study -- Case-Analysis for Rippling and Inductive Proof -- Importing HOL Light into Coq -- A Mechanized Translation from Higher-Order Logic to Set Theory -- The Isabelle Collections Framework -- Interactive Termination Proofs Using Termination Cores -- A Framework for Formal Verification of Compiler Optimizations -- On the Formalization of the Lebesgue Integration Theory in HOL -- From Total Store Order to Sequential Consistency: A Practical Reduction Theorem -- Equations: A Dependent Pattern-Matching Compiler -- A Mechanically Verified AIG-to-BDD Conversion Algorithm -- Inductive Consequences in the Calculus of Constructions -- Validating QBF Invalidity in HOL4 -- Rough Diamonds -- Higher-Order Abstract Syntax in Isabelle/HOL -- Separation Logic Adapted for Proofs by Rewriting -- Developing the Algebraic Hierarchy with Type Classes in Coq. |
| Record Nr. | UNINA-9910483708703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Isabelle/HOL [[electronic resource] ] : A Proof Assistant for Higher-Order Logic / / by Tobias Nipkow, Lawrence C. Paulson, Markus Wenzel
| Isabelle/HOL [[electronic resource] ] : A Proof Assistant for Higher-Order Logic / / by Tobias Nipkow, Lawrence C. Paulson, Markus Wenzel |
| Autore | Nipkow Tobias |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XIV, 226 p.) |
| Disciplina | 004.015113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical logic
Logic Computers Artificial intelligence Computer logic Programming languages (Electronic computers) Mathematical Logic and Formal Languages Theory of Computation Artificial Intelligence Logics and Meanings of Programs Programming Languages, Compilers, Interpreters |
| ISBN | 3-540-45949-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Elementary Techniques -- 1. The Basics -- 2. Functional Programming in HOL -- 3. More Functional Programming -- 4. Presenting Theories -- Logic and Sets -- 5. The Rules of the Game -- 6. Sets, Functions, and Relations -- 7. Inductively Defined Sets -- Advanced Material -- 8. More about Types -- 9. Advanced Simplification, Recursion, and Induction -- 10. Case Study: Verifying a Security Protocol. |
| Record Nr. | UNISA-996466028903316 |
Nipkow Tobias
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Isabelle/HOL : A Proof Assistant for Higher-Order Logic / / by Tobias Nipkow, Lawrence C. Paulson, Markus Wenzel
| Isabelle/HOL : A Proof Assistant for Higher-Order Logic / / by Tobias Nipkow, Lawrence C. Paulson, Markus Wenzel |
| Autore | Nipkow Tobias |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XIV, 226 p.) |
| Disciplina | 004.015113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical logic
Logic Computers Artificial intelligence Computer logic Programming languages (Electronic computers) Mathematical Logic and Formal Languages Theory of Computation Artificial Intelligence Logics and Meanings of Programs Programming Languages, Compilers, Interpreters |
| ISBN | 3-540-45949-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Elementary Techniques -- 1. The Basics -- 2. Functional Programming in HOL -- 3. More Functional Programming -- 4. Presenting Theories -- Logic and Sets -- 5. The Rules of the Game -- 6. Sets, Functions, and Relations -- 7. Inductively Defined Sets -- Advanced Material -- 8. More about Types -- 9. Advanced Simplification, Recursion, and Induction -- 10. Case Study: Verifying a Security Protocol. |
| Record Nr. | UNINA-9910145793603321 |
|
Nipkow Tobias
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||