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] ] : 21st International Conference, TPHOLs 2008, Montreal, Canada, August 18-21, 2008, Proceedings / / edited by Otmane Ait Mohamed, César Munoz, Sofiène Tahar
| Theorem Proving in Higher Order Logics [[electronic resource] ] : 21st International Conference, TPHOLs 2008, Montreal, Canada, August 18-21, 2008, Proceedings / / edited by Otmane Ait Mohamed, César Munoz, Sofiène Tahar |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (X, 321 p.) |
| Disciplina | 004.015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Compilers (Computer programs)
Computer systems Software engineering Machine theory Computer science Compilers and Interpreters Computer System Implementation Software Engineering Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming |
| ISBN | 3-540-71067-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Twenty Years of Theorem Proving for HOLs Past, Present and Future -- Will This Be Formal? -- Tutorials -- A Short Presentation of Coq -- An ACL2 Tutorial -- A Brief Overview of PVS -- A Brief Overview of HOL4 -- The Isabelle Framework -- Regular Papers -- A Compiled Implementation of Normalization by Evaluation -- LCF-Style Propositional Simplification with BDDs and SAT Solvers -- Nominal Inversion Principles -- Canonical Big Operators -- A Type of Partial Recursive Functions -- Formal Reasoning About Causality Analysis -- Imperative Functional Programming with Isabelle/HOL -- HOL-Boogie — An Interactive Prover for the Boogie Program-Verifier -- Secure Microkernels, State Monads and Scalable Refinement -- Certifying a Termination Criterion Based on Graphs, without Graphs -- Lightweight Separation -- Real Number Calculations and Theorem Proving -- A Formalized Theory for Verifying Stability and Convergence of Automata in PVS -- Certified Exact Transcendental Real Number Computation in Coq -- Formalizing Soundness of Contextual Effects -- First-Class Type Classes -- Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL -- Proof Pearls -- Proof Pearl: Revisiting the Mini-rubik in Coq. |
| Record Nr. | UNISA-996465339003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theorem Proving in Higher Order Logics : 21st International Conference, TPHOLs 2008, Montreal, Canada, August 18-21, 2008, Proceedings / / edited by Otmane Ait Mohamed, César Munoz, Sofiène Tahar
| Theorem Proving in Higher Order Logics : 21st International Conference, TPHOLs 2008, Montreal, Canada, August 18-21, 2008, Proceedings / / edited by Otmane Ait Mohamed, César Munoz, Sofiène Tahar |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (X, 321 p.) |
| Disciplina | 004.015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Compilers (Computer programs)
Computer systems Software engineering Machine theory Computer science Compilers and Interpreters Computer System Implementation Software Engineering Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming |
| ISBN | 3-540-71067-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Twenty Years of Theorem Proving for HOLs Past, Present and Future -- Will This Be Formal? -- Tutorials -- A Short Presentation of Coq -- An ACL2 Tutorial -- A Brief Overview of PVS -- A Brief Overview of HOL4 -- The Isabelle Framework -- Regular Papers -- A Compiled Implementation of Normalization by Evaluation -- LCF-Style Propositional Simplification with BDDs and SAT Solvers -- Nominal Inversion Principles -- Canonical Big Operators -- A Type of Partial Recursive Functions -- Formal Reasoning About Causality Analysis -- Imperative Functional Programming with Isabelle/HOL -- HOL-Boogie — An Interactive Prover for the Boogie Program-Verifier -- Secure Microkernels, State Monads and Scalable Refinement -- Certifying a Termination Criterion Based on Graphs, without Graphs -- Lightweight Separation -- Real Number Calculations and Theorem Proving -- A Formalized Theory for Verifying Stability and Convergence of Automata in PVS -- Certified Exact Transcendental Real Number Computation in Coq -- Formalizing Soundness of Contextual Effects -- First-Class Type Classes -- Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL -- Proof Pearls -- Proof Pearl: Revisiting the Mini-rubik in Coq. |
| Record Nr. | UNINA-9910484595903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||