Theorem Proving in Higher Order Logics

12th International Conference, TPHOLs'99, Nice, France, September 14-17, 1999, Proceedings

372 Seiten, Taschenbuch

Kurzbeschreibung des Verlags

Recent Advancements in Hardware Verification - How to Make Theorem Proving Fit for an Industrial Usage.- Disjoint Sums over Type Classes in HOL.- Inductive Datatypes in HOL - Lessons Learned in Formal-Logic Engineering.- Isomorphisms - A Link Between the Shallow and the Deep.- Polytypic Proof Construction.- Recursive Function Definition over Coinductive Types.- Hardware Verification Using Co-induction in COQ.- Connecting Proof Checkers and Computer Algebra Using OpenMath.- A Machine-Checked Theory of Floating Point Arithmetic.- Universal Algebra in Type Theory.- Locales A Sectioning Concept for Isabelle.- Isar - A Generic Interpretative Approach to Readable Formal Proof Documents.- On the Implementation of an Extensible Declarative Proof Language.- Three Tactic Theorem Proving.- Mechanized Operational Semantics via (Co)Induction.- Representing WP Semantics in Isabelle/ZF.- A HOL Conversion for Translating Linear Time Temporal Logic to ?-Automata.- From I/O Automata to Timed I/O Automata.- Formal Methods and Security Evaluation.- Importing MDG Verification Results into HOL.- Integrating Gandalf and HOL.- Lifted-FL: A Pragmatic Implementation of Combined Model Checking and Theorem Proving.- Symbolic Functional Evaluation.

• Reihe: Lecture Notes in Computer Science
• Themen: Informatik und Informationstechnologie Informatik Künstliche Intelligenz (KI)
• ISBN: 9783540664635
• Sprache: Englisch
• Erscheinungsdatum: 01.09.1999
• Größe: 235 x 155 mm
• Verlag: Springer
• Herausgegeben von: Yves Bertot, Gilles Dowek, Andre Hirschowitz, Laurent Thery, Christine Paulin