rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Theorem Proving in Higher Order Logics
    sub title: 20th International Conference, TPHOLs 2007, Kaiserslautern, Germany, September 10-13, 2007. Proceedings
  name:
    name part: Schneider, Klaus.
    role:
      role term: editor.
  name:
    name part: Brandt, Jens.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2007
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: VIII, 404 p. online resource.
  table of contents: On the Utility of Formal Methods in the Development and Certification of Software -- Formal Techniques in Software Engineering: Correct Software and Safe Systems -- Separation Logic for Small-Step cminor -- Formalising Java’s Data Race Free Guarantee -- Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL -- Formalising Generalised Substitutions -- Extracting Purely Functional Contents from Logical Inductive Types -- A Modular Formalisation of Finite Group Theory -- Verifying Nonlinear Real Formulas Via Sums of Squares -- Verification of Expectation Properties for Discrete Random Variables in HOL -- A Formally Verified Prover for the Description Logic -- Proof Pearl: The Termination Analysis of Terminator -- Improving the Usability of HOL Through Controlled Automation Tactics -- Verified Decision Procedures on Context-Free Grammars -- Using XCAP to Certify Realistic Systems Code: Machine Context Management -- Proof Pearl: De Bruijn Terms Really Do Work -- Proof Pearl: Looping Around the Orbit -- Source-Level Proof Reconstruction for Interactive Theorem Proving -- Proof Pearl: The Power of Higher-Order Encodings in the Logical Framework LF -- Automatically Translating Type and Function Definitions from HOL to ACL2 -- Operational Reasoning for Concurrent Caml Programs and Weak Memory Models -- Proof Pearl: Wellfounded Induction on the Ordinals Up to ? 0 -- A Monad-Based Modeling and Verification Toolbox with Application to Security Protocols -- Primality Proving with Elliptic Curves -- HOL2P - A System of Classical Higher Order Logic with Second Order Polymorphism -- Building Formal Method Tools in the Isabelle/Isar Framework -- Simple Types in Type Theory: Deep and Shallow Encodings -- Mizar’s Soft Type System.
  note: edited by Klaus Schneider, Jens Brandt.
  subject:
    topic: Computer science
  subject:
    topic: Logic design
  subject:
    topic: Software engineering
  subject:
    topic: Computers
  subject:
    topic: Computer logic
  subject:
    topic: Mathematical logic
  subject:
    topic: Artificial intelligence
  subject:
    topic: Computer Science
  subject:
    topic: Theory of Computation
  subject:
    topic: Mathematical Logic and Formal Languages
  subject:
    topic: Logics and Meanings of Programs
  subject:
    topic: Software Engineering
  subject:
    topic: Artificial Intelligence (incl. Robotics)
  subject:
    topic: Logic Design
  classification: QA75.5-76.95
  classification: 004.0151
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 4732
  identifier: 9783540745914
  identifier: http://dx.doi.org/10.1007/978-3-540-74591-4
  record info:
    record creation date: 100301
    record change date: 20151204145552.0
    record identifier: 978-3-540-74591-4