Deze website maakt gebruik van cookies. Klik hier voor meer informatie.X sluit
Uitgebreid zoeken

Interactive Theorem Proving

First International Conference, Itp 2010 Edinburgh, Uk, July 11-14, 2010, Proceedings

Interactive Theorem Proving - ISBN: 9783642140518
Prijs: € 120,35
Levertijd: 4 tot 6 werkdagen
Bindwijze: Boek
Genre: Theoretische informatica
Interactive Theorem Proving op
Add to cart


Constitutes The Proceedings Of The First International Conference On Interactive Theorem Proving, Itp 2010, Held In Edinburgh, Uk, In July 2010. This Title Features The Papers That Are Organized In Topics Such As Counterexample Generation, Hybrid System Verification, Translations From One Formalism To Another, And Cooperation Between Tools.


Titel: Interactive Theorem Proving
Mediatype: Boek
Taal: Engels
Aantal pagina's: 495
Uitgever: Springer-verlag Berlin And Heidelberg Gmbh & Co. Kg
Plaats van publicatie: DE
NUR: Theoretische informatica
Afmetingen: 236 x 155 x 28
Gewicht: 771 gr
ISBN/ISBN13: 9783642140518
Intern nummer: 15755480


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.


Dit product is op dit moment niet op voorraad in een van onze vestigingen.