Automated Deduction - CADE-17: 17th International Conference on Automated Deduction Pittsburgh, PA, USA, June 17-20, 2000 Proceedings [Paperback]

For the past 25 years the CADE conference has been the major forum for the presentation of new results in automated deduction. This volume contains the papers and system descriptions selected for the 17th International Conference on Automated Deduction, CADE-17, held June 17-20, 2000,at Carnegie Mellon University, Pittsburgh, Pennsylvania (USA). Fifty-three research papers and twenty system descriptions were submitted by researchers from ?fteen countries. Each submission was reviewed by at least three reviewers. Twenty-four research papers and ?fteen system descriptions were accepted. The accepted papers cover a variety of topics related to t- orem proving and its applications such as proof carrying code, cryptographic protocol veri?cation, model checking, cooperating decision procedures, program veri?cation, and resolution theorem proving. The program also included three invited lectures: High-level veri?cation using theorem proving and formalized mathematics by John Harrison, Sc- able Knowledge Representation and Reasoning Systems by Henry Kautz, and Connecting Bits with Floating-Point Numbers: Model Checking and Theorem Proving in Practice by Carl Seger. Abstracts or full papers of these talks are included in this volume.In addition to the accepted papers, system descriptions, andinvited talks, this volumecontains one page summaries of four tutorials and ?ve workshops held in conjunction with CADE-17.Invited Talk:.- High-Level Verification Using Theorem Proving and Formalized Mathematics.- Session 1:.- Machine Instruction Syntax and Semantics in Higher Order Logic.- Proof Generation in the Touchstone Theorem Prover.- Wellfounded Schematic Definitions.- Session 2:.- Abstract Congruence Closure and Specializations.- A Framework for Cooperating Decision Procedures.- Modular Reasoning in Isabelle.- An Infrastructure for Intertheory Reasoning.- Session 3:.- G?dels Algorithm for Class Formation.- Automated Proof Construction in Type Theory Using Resolution.- Sysls)