Theorem Proving in Higher Order Logics
Springer Berlin (Verlag)
978-3-642-03358-2 (ISBN)
Invited Papers.- Let's Get Physical: Models and Methods for Real-World Security Protocols.- VCC: A Practical System for Verifying Concurrent C.- Without Loss of Generality.- Invited Tutorials.- HOL Light: An Overview.- A Brief Overview of Mizar.- A Brief Overview of Agda - A Functional Language with Dependent Types.- The Twelf Proof Assistant.- Regular Papers.- Hints in Unification.- Psi-calculi in Isabelle.- Some Domain Theory and Denotational Semantics in Coq.- Turning Inductive into Equational Specifications.- Formalizing the Logic-Automaton Connection.- Extended First-Order Logic.- Formalising Observer Theory for Environment-Sensitive Bisimulation.- Formal Certification of a Resource-Aware Language Implementation.- A Certified Data Race Analysis for a Java-like Language.- Formal Analysis of Optical Waveguides in HOL.- The HOL-Omega Logic.- A Purely Definitional Universal Domain.- Types, Maps and Separation Logic.- Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence.- Formalising FinFuns - Generating Code for Functions as Data from Isabelle/HOL.- Packaging Mathematical Structures.- Practical Tactics for Separation Logic.- Verified LISP Implementations on ARM, x86 and PowerPC.- Trace-Based Coinductive Operational Semantics for While.- A Better x86 Memory Model: x86-TSO.- Formal Verification of Exact Computations Using Newton's Method.- Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL.- A Hoare Logic for the State Monad.- Certification of Termination Proofs Using CeTA.- A Formalisation of Smallfoot in HOL.- Liveness Reasoning with Isabelle/HOL.- Mind the Gap.
Erscheint lt. Verlag | 4.8.2009 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
Zusatzinfo | XI, 517 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 807 g |
Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
Mathematik / Informatik ► Mathematik | |
Schlagworte | Agda • Algorithm analysis and problem complexity • Automata Theory • Calculus • Coq • First-Order Logic • Formal Verification • Hardcover, Softcover / Informatik, EDV/Informatik • Higher-Order Logic • HOL • Logic • memory model • MIZAR • Model Checking • proof pearl • second-order logic • security protocols • verification |
ISBN-10 | 3-642-03358-X / 364203358X |
ISBN-13 | 978-3-642-03358-2 / 9783642033582 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich