Interactive Theorem Proving
Springer International Publishing (Verlag)
978-3-319-08969-0 (ISBN)
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 zeta(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 inIsabelle/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.
Erscheint lt. Verlag | 1.8.2014 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
Zusatzinfo | XXII, 555 p. 90 illus. |
Verlagsort | Cham |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 878 g |
Themenwelt | Informatik ► Netzwerke ► Sicherheit / Firewall |
Mathematik / Informatik ► Informatik ► Software Entwicklung | |
Informatik ► Theorie / Studium ► Algorithmen | |
Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik | |
Schlagworte | Algorithm analysis and problem complexity • Embedded Systems • formal methods • Functional languages • Network Protocols • Program verification • Real-Time Systems • Rewriting • theorem proving and SAT solving • Turing Machine • Virtual machines |
ISBN-10 | 3-319-08969-2 / 3319089692 |
ISBN-13 | 978-3-319-08969-0 / 9783319089690 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich