Theorem Proving in Higher Order Logics
Springer Berlin (Verlag)
978-3-540-71065-3 (ISBN)
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.
Erscheint lt. Verlag | 30.7.2008 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
Zusatzinfo | X, 321 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 516 g |
Themenwelt | Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge |
Informatik ► Theorie / Studium ► Compilerbau | |
Schlagworte | automated deduction • causality analysis • dependent types • D programming language • exact arithmetic • formal methods • Formal Verification • general correctness • Hardcover, Softcover / Informatik, EDV/Informatik • hardware verification • HC/Informatik, EDV/Informatik • Higher Order Logic • interactive theorem proving • Isabelle/HOL • Model Checking • Modeling • programming • Programming language • Programm Verification • Proof theory • proving • Semantics • static program analysis • theorem proving • type classes • Type Systems • verification |
ISBN-10 | 3-540-71065-5 / 3540710655 |
ISBN-13 | 978-3-540-71065-3 / 9783540710653 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich