Automated Deduction – CADE-22

22nd International Conference on Automated Deduction, Montreal, Canada, August 2-7, 2009. Proceedings

  • Renate A. Schmidt
Conference proceedings CADE 2009

DOI: 10.1007/978-3-642-02959-2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5663)

Table of contents (35 papers)

  1. Front Matter
  2. Session 1. Invited Talk

  3. Session 2. Combinations and Extensions

    1. Superposition and Model Evolution Combined
      Peter Baumgartner, Uwe Waldmann
      Pages 17-34
    2. On Deciding Satisfiability by DPLL(\(\Gamma+{\mathcal T}\)) and Unsound Theorem Proving
      Maria Paola Bonacina, Christopher Lynch, Leonardo de Moura
      Pages 35-50
    3. Combinable Extensions of Abelian Groups
      Enrica Nicolini, Christophe Ringeissen, Michaël Rusinowitch
      Pages 51-66
  4. Session 3. Minimal Unsatisfiability and Automated Reasoning Support

    1. Does This Set of Clauses Overlap with at Least One MUS?
      Éric Grégoire, Bertrand Mazure, Cédric Piette
      Pages 100-115
    2. Progress in the Development of Automated Theorem Proving for Higher-Order Logic
      Geoff Sutcliffe, Christoph Benzmüller, Chad E. Brown, Frank Theiss
      Pages 116-130
  5. Session 4. System Descriptions

    1. System Description: H-PILoT
      Carsten Ihlemann, Viorica Sofronie-Stokkermans
      Pages 131-139
    2. SPASS Version 3.5
      Christoph Weidenbach, Dilyana Dimova, Arnaud Fietzke, Rohit Kumar, Martin Suda, Patrick Wischnewski
      Pages 140-145
    3. Dei: A Theorem Prover for Terms with Integer Exponents
      Hicham Bensaid, Ricardo Caferra, Nicolas Peltier
      Pages 146-150
    4. veriT: An Open, Trustable and Efficient SMT-Solver
      Thomas Bouton, Diego Caminha B. de Oliveira, David Déharbe, Pascal Fontaine
      Pages 151-156
    5. Divvy: An ATP Meta-system Based on Axiom Relevance Ordering
      Alex Roederer, Yury Puzis, Geoff Sutcliffe
      Pages 157-162
  6. Session 5. Invited Talk

  7. Session 6. Interpolation and Predicate Abstraction

    1. Interpolant Generation for UTVPI
      Alessandro Cimatti, Alberto Griggio, Roberto Sebastiani
      Pages 167-182
    2. Ground Interpolation for Combined Theories
      Amit Goel, Sava Krstić, Cesare Tinelli
      Pages 183-198
    3. Interpolation and Symbol Elimination
      Laura Kovács, Andrei Voronkov
      Pages 199-213
    4. Complexity and Algorithms for Monomial and Clausal Predicate Abstraction
      Shuvendu K. Lahiri, Shaz Qadeer
      Pages 214-229
  8. Session 7. Resolution-Based Systems for Non-classical Logics

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 22nd International Conference on Automated Deduction, CADE-22, held in Montreal, Canada, in August 2009.

The 27 revised full papers and 5 system descriptions presented were carefully reviewed and selected from 77 submissions. Furthermore, three invited lectures by distinguished experts in the area were included. The papers are organized in topical sections on combinations and extensions, minimal unsatisfiability and automated reasoning support, system descriptions, interpolation and predicate abstraction, resolution-based systems for non-classical logics, termination analysis and constraint solving, rewriting, termination and productivity, models, modal tableaux with global caching, arithmetic.

Keywords

Action Constraint Extension automated code verification automated deduction automated reasoning computational logics constraint solving decision theory formal methods formal verification hierarchical reasoning hybrid systems logic programming meta

Editors and affiliations

  • Renate A. Schmidt
    • 1
  1. 1.School of Computer ScienceThe University of ManchesterManchesterUK

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2009
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-02958-5
  • Online ISBN 978-3-642-02959-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349