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.
Concrete Semantics : With Isabelle/HOL / / by Tobias Nipkow, Gerwin Klein
| Concrete Semantics : With Isabelle/HOL / / by Tobias Nipkow, Gerwin Klein |
| Autore | Nipkow Tobias |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XIII, 298 p. 87 illus., 1 illus. in color.) |
| Disciplina | 005.1015113 |
| Soggetto topico |
Computer logic
Programming languages (Electronic computers) Mathematical logic Logics and Meanings of Programs Programming Languages, Compilers, Interpreters Mathematical Logic and Formal Languages |
| ISBN | 3-319-10542-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction -- Programming and Proving -- Case Study: IMP Expressions -- Logic and Proof Beyond Equality -- Isar: A Language for Structured Proofs -- IMP: A Simple Imperative Language -- Compiler -- Types -- Program Analysis -- Denotational Semantics -- Hoare Logic -- Abstract Interpretation -- App. A, Auxiliary Definitions -- App. B, Symbols -- References. |
| Record Nr. | UNINA-9910298989403321 |
Nipkow Tobias
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Interactive Theorem Proving [[electronic resource] ] : 5th International Conference, ITP 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014, Proceedings / / edited by Gerwin Klein, Ruben Gamboa
| Interactive Theorem Proving [[electronic resource] ] : 5th International Conference, ITP 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014, Proceedings / / edited by Gerwin Klein, Ruben Gamboa |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XXII, 555 p. 90 illus.) |
| Disciplina | 004.015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Artificial intelligence Computer science Software engineering Data protection Algorithms Formal Languages and Automata Theory Artificial Intelligence Computer Science Logic and Foundations of Programming Software Engineering Data and Information Security |
| ISBN | 3-319-08970-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Microcode Verification – Another Piece of the Microprocessor Verification Puzzle -- Are We There Yet? 20 Years of Industrial Theorem Proving with SPARK -- Towards a Formally Verified Proof Assistant -- Implicational Rewriting Tactics in HOL -- A Heuristic Prover for Real Inequalities -- A Formal Library for Elliptic Curves in the Coq Proof Assistant -- Truly Modular (Co) data types for Isabelle/HOL -- Cardinals in Isabelle/HOL -- Verified Abstract Interpretation Techniques for Disassembling Low-level Self-modifying Code -- Showing Invariance Compositionally for a Process Algebra for Network Protocols -- A Computer-Algebra-Based Formal Proof of the Irrationality of ζ(3) -- From Operational Models to Information Theory; Side Channels in pGCL with Isabelle -- A Coq Formalization of Finitely Presented Modules -- Formalized, Effective Domain Theory in Coq -- Completeness and Decidability Results for CTL in Coq -- Hypermap Specification and Certified Linked Implementation Using Orbits -- A Verified Generate-Test-Aggregate Coq Library for Parallel Programs Extraction -- Experience Implementing a Performant Category-Theory Library in Coq -- A New and Formalized Proof of Abstract Completion -- HOL with Definitions: Semantics, Soundness and a Verified Implementation -- Verified Efficient Implementation of Gabow’s Strongly Connected Component Algorithm -- Recursive Functions on Lazy Lists via Domains and Topologies -- Formal Verification of Optical Quantum Flip Gate -- Compositional Computational Reflection -- An Isabelle Proof Method Language -- Proof Pearl: Proving a Simple Von Neumann Machine Turing Complete -- The Reflective Milawa Theorem Prover Is Sound (Down to the Machine Code That Runs It) -- Balancing Lists: A Proof Pearl -- Unified Decision Procedures for Regular Expression Equivalence -- Collaborative Interactive Theorem Proving with Clide -- On the Formalization of Z-Transform in HOL -- Universe Polymorphism in Coq -- Asynchronous User Interaction and Tool Integration in Isabelle/PIDE -- HOL Constant Definition Done Right -- Rough Diamond: An Extension of Equivalence-Based Rewriting -- Formal C Semantics: Comp Cert and the C Standard -- Mechanical Certification of Loop Pipelining Transformations: A Preview. |
| Record Nr. | UNISA-996199992603316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Interactive Theorem Proving : 5th International Conference, ITP 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014, Proceedings / / edited by Gerwin Klein, Ruben Gamboa
| Interactive Theorem Proving : 5th International Conference, ITP 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014, Proceedings / / edited by Gerwin Klein, Ruben Gamboa |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XXII, 555 p. 90 illus.) |
| Disciplina | 004.015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Artificial intelligence Computer science Software engineering Data protection Algorithms Formal Languages and Automata Theory Artificial Intelligence Computer Science Logic and Foundations of Programming Software Engineering Data and Information Security |
| ISBN | 3-319-08970-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Microcode Verification – Another Piece of the Microprocessor Verification Puzzle -- Are We There Yet? 20 Years of Industrial Theorem Proving with SPARK -- Towards a Formally Verified Proof Assistant -- Implicational Rewriting Tactics in HOL -- A Heuristic Prover for Real Inequalities -- A Formal Library for Elliptic Curves in the Coq Proof Assistant -- Truly Modular (Co) data types for Isabelle/HOL -- Cardinals in Isabelle/HOL -- Verified Abstract Interpretation Techniques for Disassembling Low-level Self-modifying Code -- Showing Invariance Compositionally for a Process Algebra for Network Protocols -- A Computer-Algebra-Based Formal Proof of the Irrationality of ζ(3) -- From Operational Models to Information Theory; Side Channels in pGCL with Isabelle -- A Coq Formalization of Finitely Presented Modules -- Formalized, Effective Domain Theory in Coq -- Completeness and Decidability Results for CTL in Coq -- Hypermap Specification and Certified Linked Implementation Using Orbits -- A Verified Generate-Test-Aggregate Coq Library for Parallel Programs Extraction -- Experience Implementing a Performant Category-Theory Library in Coq -- A New and Formalized Proof of Abstract Completion -- HOL with Definitions: Semantics, Soundness and a Verified Implementation -- Verified Efficient Implementation of Gabow’s Strongly Connected Component Algorithm -- Recursive Functions on Lazy Lists via Domains and Topologies -- Formal Verification of Optical Quantum Flip Gate -- Compositional Computational Reflection -- An Isabelle Proof Method Language -- Proof Pearl: Proving a Simple Von Neumann Machine Turing Complete -- The Reflective Milawa Theorem Prover Is Sound (Down to the Machine Code That Runs It) -- Balancing Lists: A Proof Pearl -- Unified Decision Procedures for Regular Expression Equivalence -- Collaborative Interactive Theorem Proving with Clide -- On the Formalization of Z-Transform in HOL -- Universe Polymorphism in Coq -- Asynchronous User Interaction and Tool Integration in Isabelle/PIDE -- HOL Constant Definition Done Right -- Rough Diamond: An Extension of Equivalence-Based Rewriting -- Formal C Semantics: Comp Cert and the C Standard -- Mechanical Certification of Loop Pipelining Transformations: A Preview. |
| Record Nr. | UNINA-9910483576603321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||