Automated Deduction - CADE-19

1. Front Matter

   PDF

2. Session 1: Invited Talk

   1. SAT-Based Counterexample Guided Abstraction Refinement in Model Checking

      • Edmund M. Clarke

      Pages 1-1

3. Session 2

   1. Equational Abstractions

      • José Meseguer, Miguel Palomino, Narciso Martí-Oliet

      Pages 2-16

   2. Deciding Inductive Validity of Equations

      • Jürgen Giesl, Deepak Kapur

      Pages 17-31

   3. Automating the Dependency Pair Method

      • Nao Hirokawa, Aart Middeldorp

      Pages 32-46

   4. An AC-Compatible Knuth-Bendix Order

      • Konstantin Korovin, Andrei Voronkov

      Pages 47-59

4. Session 3

   1. The Complexity of Finite Model Reasoning in Description Logics

      • Carsten Lutz, Ulrike Sattler, Lidia Tendera

      Pages 60-74

   2. Optimizing a BDD-Based Modal Solver

      • Guoqiang Pan, Moshe Y. Vardi

      Pages 75-89

   3. A Translation of Looping Alternating Automata into Description Logics

      • Jan Hladik, Ulrike Sattler

      Pages 90-105

5. Session 4

   1. Foundational Certified Code in a Metalogical Framework

      • Karl Crary, Susmit Sarkar

      Pages 106-120

   2. Proving Pointer Programs in Higher-Order Logic

      • Farhad Mehta, Tobias Nipkow

      Pages 121-135

   3. ⋌

      • Dimitri Hendriks, Vincent van Oostrom

      Pages 136-150

   4. Subset Types and Partial Functions

      • Aaron Stump

      Pages 151-165

6. Session 5

   1. Reasoning about Quantifiers by Matching in the E-graph

      • Greg Nelson

      Pages 166-166

7. Session 6

   1. A Randomized Satisfiability Procedure for Arithmetic and Uninterpreted Function Symbols

      • Sumit Gulwani, George C. Necula

      Pages 167-181

   2. Superposition Modulo a Shostak Theory

      • Harald Ganzinger, Thomas Hillenbrand, Uwe Waldmann

      Pages 182-196

   3. Canonization for Disjoint Unions of Theories

      • Sava Krstić, Sylvain Conchon

      Pages 197-211

   4. Matching in a Class of Combined Non-disjoint Theories

      • Christophe Ringeissen

      Pages 212-227

8. Session 7

   1. Reasoning about Iteration in Gödel’s Class Theory

      • Johan Gijsbertus Frederik Belinfante

      Pages 228-242

   2. Algorithms for Ordinal Arithmetic

      • Panagiotis Manolios, Daron Vroon

      Pages 243-257

This volume contains the papers presented at the 19th International Conference on Automated Deduction (CADE-19) held 28 July–2 August 2003 in Miami Beach, Florida, USA. They are divided into the following categories: – 4 contributions by invited speakers: one full paper and three short abstracts; – 29 accepted technical papers; – 7 descriptions of automated reasoning systems. These proceedings also contain a short description of the automated theor- proving system competition (CASC-19) organized by Geo? Sutcli?e and Chr- tian Suttner. Despite many competing smaller conferences and workshops covering di?- entaspectsofautomateddeduction,CADEisstillthemajorforumfordiscussing new results on all aspects of automated deduction as well as presenting new s- tems and improvements of established systems. In contrast to the previous year, when CADE was one of the conferences participating in the Third Federated Logic Conference (FLoC 2002), and next year, when CADE will be part of the Second International Joint Conference on Automated Reasoning (IJCAR 2004), CADE-19 was organized as a stand-alone event.

• Erfüllbarkeitsproblem der Aussagenlogik
• Evolution
• algorithms
• automata
• automated code verification
• automated deduction
• automated reasoning
• complexity
• description logics
• formal verification
• meta theory
• model checking
• resolution
• type theory
• unification

• Theoretical Computer Science, TU Dresden, Germany

  Franz Baader

Policies and ethics