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] ] : 4th International Conference, ITP 2013, Rennes, France, July 22-26, 2013, Proceedings / / edited by Sandrine Blazy, Christine Paulin-Mohring, David Pichardie
| Interactive Theorem Proving [[electronic resource] ] : 4th International Conference, ITP 2013, Rennes, France, July 22-26, 2013, Proceedings / / edited by Sandrine Blazy, Christine Paulin-Mohring, David Pichardie |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 498 p. 73 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-642-39634-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Applying Formal Methods in the Large -- Automating Theorem Proving with SMT -- Certifying Voting Protocols -- Invited Tutorials.-Counterexample Generation Meets Interactive Theorem Proving: Current Results and Future Opportunities -- Canonical Structures for the Working Coq User -- Regular Papers -- MaSh: Machine Learning for Sledgehammer -- Scalable LCF-Style Proof Translation -- Lightweight Proof by Reflection Using a Posteriori Simulation of Effectful Computation -- Automatic Data Refinement -- Data Refinement in Isabelle/HOL -- Light-Weight Containers for Isabelle: Efficient, Extensible, Nestable -- Ordinals in HOL: Transfinite Arithmetic up to (and Beyond) ω1 -- Mechanising Turing Machines and Computability Theory in Isabelle/HOL.-A Machine-Checked Proof of the Odd Order Theorem -- Kleene Algebra with Tests and Coq Tools for while Programs.-Program Analysis and Verification Based on Kleene Algebra in Isabelle/HOL -- Pragmatic Quotient Types in Coq -- Mechanical Verification of SAT Refutations with Extended Resolution -- Formalizing Bounded Increase -- Formal Program Optimization in Nuprl Using Computational Equivalence and Partial Types -- Type Classes and Filters for Mathematical Analysis in Isabelle/HOL -- Formal Reasoning about Classified Markov Chains in HOL -- Practical Probability: Applying pGCL to Lattice Scheduling -- Adjustable References -- Handcrafted Inversions Made Operational on Operational Semantics -- Circular Coinduction in Coq Using Bisimulation-Up-To Techniques -- Program Extraction from Nested Definitions -- Subformula Linking as an Interaction Method -- Automatically Generated Infrastructure for De Bruijn Syntaxes -- Shared-Memory Multiprocessing for Interactive Theorem Proving -- A Parallelized Theorem Prover for a Logic with Parallel Execution -- Rough Diamonds -- Communicating Formal Proofs: The Case of Flyspeck -- Square Root and Division Elimination in PVS -- The Picard Algorithm for Ordinary Differential Equations in Coq -- Stateless Higher-Order Logic with Quantified Types -- Implementing Hash-Consed Structures in Coq -- Towards Certifying Network Calculus -- Steps towards Verified Implementations of HOL Light. |
| Record Nr. | UNISA-996465982703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Interactive Theorem Proving : 4th International Conference, ITP 2013, Rennes, France, July 22-26, 2013, Proceedings / / edited by Sandrine Blazy, Christine Paulin-Mohring, David Pichardie
| Interactive Theorem Proving : 4th International Conference, ITP 2013, Rennes, France, July 22-26, 2013, Proceedings / / edited by Sandrine Blazy, Christine Paulin-Mohring, David Pichardie |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 498 p. 73 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-642-39634-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Applying Formal Methods in the Large -- Automating Theorem Proving with SMT -- Certifying Voting Protocols -- Invited Tutorials.-Counterexample Generation Meets Interactive Theorem Proving: Current Results and Future Opportunities -- Canonical Structures for the Working Coq User -- Regular Papers -- MaSh: Machine Learning for Sledgehammer -- Scalable LCF-Style Proof Translation -- Lightweight Proof by Reflection Using a Posteriori Simulation of Effectful Computation -- Automatic Data Refinement -- Data Refinement in Isabelle/HOL -- Light-Weight Containers for Isabelle: Efficient, Extensible, Nestable -- Ordinals in HOL: Transfinite Arithmetic up to (and Beyond) ω1 -- Mechanising Turing Machines and Computability Theory in Isabelle/HOL.-A Machine-Checked Proof of the Odd Order Theorem -- Kleene Algebra with Tests and Coq Tools for while Programs.-Program Analysis and Verification Based on Kleene Algebra in Isabelle/HOL -- Pragmatic Quotient Types in Coq -- Mechanical Verification of SAT Refutations with Extended Resolution -- Formalizing Bounded Increase -- Formal Program Optimization in Nuprl Using Computational Equivalence and Partial Types -- Type Classes and Filters for Mathematical Analysis in Isabelle/HOL -- Formal Reasoning about Classified Markov Chains in HOL -- Practical Probability: Applying pGCL to Lattice Scheduling -- Adjustable References -- Handcrafted Inversions Made Operational on Operational Semantics -- Circular Coinduction in Coq Using Bisimulation-Up-To Techniques -- Program Extraction from Nested Definitions -- Subformula Linking as an Interaction Method -- Automatically Generated Infrastructure for De Bruijn Syntaxes -- Shared-Memory Multiprocessing for Interactive Theorem Proving -- A Parallelized Theorem Prover for a Logic with Parallel Execution -- Rough Diamonds -- Communicating Formal Proofs: The Case of Flyspeck -- Square Root and Division Elimination in PVS -- The Picard Algorithm for Ordinary Differential Equations in Coq -- Stateless Higher-Order Logic with Quantified Types -- Implementing Hash-Consed Structures in Coq -- Towards Certifying Network Calculus -- Steps towards Verified Implementations of HOL Light. |
| Record Nr. | UNINA-9910483676803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Static analysis : 27th International Symposium, SAS 2020, virtual event, November 18-20, 2020, proceedings / / David Pichardie, Mihaela Sighireanu (editors)
| Static analysis : 27th International Symposium, SAS 2020, virtual event, November 18-20, 2020, proceedings / / David Pichardie, Mihaela Sighireanu (editors) |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2020] |
| Descrizione fisica | 1 online resource (XIV, 381 p. 98 illus., 46 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Lecture notes in computer science |
| Soggetto topico | Computer programming |
| ISBN | 3-030-65474-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Polynomial Invariants for Affine Programs -- Cost Analysis of Smart Contracts via Parametric Resource Analysis -- Memory-Efficient Fixpoint Computation -- Abstract Neural Networks -- Termination of Polynomial Loops -- Stratified Guarded First-order Transition Systems -- Predicate Abstraction and CEGAR for nuHFL(Z) Validity Checking -- Counterexample- and Simulation-Guided Floating-Point Loop Invariant Synthesis -- Harming Dynamic Analysis -- Simple and Efficient Computation of Minimal Weak Control Closure -- A Library Modeling Language for the Static Analysis of C Programs -- Interprocedural Shape Analysis Using Separation Logic-Based Transformer Summaries -- Probabilistic Lipschitz Analysis of Neural Networks -- On Multi-Language Abstraction: Towards a Static Analysis of Multi-Language Programs -- Exact and Linear-Time Gas-Cost Analysis -- Farkas-Based Tree Interpolation. |
| Record Nr. | UNINA-9910447246503321 |
| Cham, Switzerland : , : Springer, , [2020] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Static analysis : 27th International Symposium, SAS 2020, virtual event, November 18-20, 2020, proceedings / / David Pichardie, Mihaela Sighireanu (editors)
| Static analysis : 27th International Symposium, SAS 2020, virtual event, November 18-20, 2020, proceedings / / David Pichardie, Mihaela Sighireanu (editors) |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2020] |
| Descrizione fisica | 1 online resource (XIV, 381 p. 98 illus., 46 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Lecture notes in computer science |
| Soggetto topico | Computer programming |
| ISBN | 3-030-65474-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Polynomial Invariants for Affine Programs -- Cost Analysis of Smart Contracts via Parametric Resource Analysis -- Memory-Efficient Fixpoint Computation -- Abstract Neural Networks -- Termination of Polynomial Loops -- Stratified Guarded First-order Transition Systems -- Predicate Abstraction and CEGAR for nuHFL(Z) Validity Checking -- Counterexample- and Simulation-Guided Floating-Point Loop Invariant Synthesis -- Harming Dynamic Analysis -- Simple and Efficient Computation of Minimal Weak Control Closure -- A Library Modeling Language for the Static Analysis of C Programs -- Interprocedural Shape Analysis Using Separation Logic-Based Transformer Summaries -- Probabilistic Lipschitz Analysis of Neural Networks -- On Multi-Language Abstraction: Towards a Static Analysis of Multi-Language Programs -- Exact and Linear-Time Gas-Cost Analysis -- Farkas-Based Tree Interpolation. |
| Record Nr. | UNISA-996418299603316 |
| Cham, Switzerland : , : Springer, , [2020] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||