Christoph Walther

Andreas Schlosser, Christoph Walther, Michael Gonder, Markus Aderhold: Context Dependent Procedures and Computed Types in -eriFun. Electr. Notes Theor. Comput. Sci. 174(7): 61-78 (2007)

Christoph Walther, Stephan Schweitzer: Reasoning About Incompletely Defined Programs. LPAR 2005: 427-442

Christoph Walther, Stephan Schweitzer: Verification in the Classroom. J. Autom. Reasoning 32(1): 35-73 (2004)

Christoph Walther, Stephan Schweitzer: Automated Termination Analysis for Incompletely Defined Programs. LPAR 2004: 332-346

Christoph Walther, Stephan Schweitzer: About VeriFun. CADE 2003: 322-327

Christoph Walther, Stephan Schweitzer: A Machine-Verified Code Generator. LPAR 2003: 91-106

Christoph Walther: Semantik und Programmverifikation. Teubner Texte zur Informatik 34, Teubner 2001, isbn 3-519-00336-8

Christoph Walther, Thomas Kolbe: Proving theorems by reuse. Artif. Intell. 116(1-2): 17-66 (2000)

Christoph Walther, Thomas Kolbe: On Terminating Lemma Speculations. Inf. Comput. 162(1-2): 96-116 (2000)

Christoph Walther: Criteria for Termination. Intellectics and Computational Logic 2000: 361-386

Thomas Kolbe, Christoph Walther: Termination of Theorem Proving by Reuse. CADE 1996: 106-120

Thomas Kolbe, Christoph Walther: Patching Proofs for Reuse (Extended Abstract). ECML 1995: 303-306

Thomas Kolbe, Christoph Walther: Second-Order Matching modulo Evaluation: A Technique for Reusing Proofs. IJCAI 1995: 190-195

Christoph Walther: On Proving the Termination of Algorithms by Machine. Artif. Intell. 71(1): 101-157 (1994)

Christoph Walther: Mathematical induction. Handbook of Logic in Artificial Intelligence and Logic Programming (2) 1994: 127-228

Thomas Kolbe, Christoph Walther: Reusing Proofs. ECAI 1994: 80-84

Christoph Walther: Combining Induction Axioms by Machine. IJCAI 1993: 95-101

Christoph Walther: Computing Induction Axioms. LPAR 1992: 381-392

Christoph Walther: Automatisierung von Terminierungsbeweisen. Vieweg 1991, isbn 3-528-04771-2

Christoph Walther: Many-Sorted Inferences in Automated Theorem Proving. Sorts and Types in Artificial Intelligence 1989: 18-48

Christoph Walther: Many-sorted unification. J. ACM 35(1): 1-17 (1988)

Christoph Walther: Argument-Bounded Algorithms as a Basis for Automated Termination Proofs. CADE 1988: 602-621

Christoph Walther: A Many-Sorted Calculus Based on Resolution and Paramodulation. Pitman / Morgan Kaufmann 1987, isbn 0-273-08718-5

Christoph Walther: Many-Sorted Resolution. KIFS 1987: 65-102

Christoph Walther: A Classification of Many-Sorted Unification Problems. CADE 1986: 525-537

Susanne Biundo, B. Hummel, Dieter Hutter, Christoph Walther: The Karlsruhe Induction Theorem Proving System. CADE 1986: 672-674

Christoph Walther: Automatisches Beweisen. KIFS 1986: 292-339

Christoph Walther: A Mechanical Solution of Schubert's Steamroller by Many-Sorted Resolution. Artif. Intell. 26(2): 217-224 (1985)

Christoph Walther: A Mechanical Solution of Schubert's Steamroller by Many-Sorted Resolution. AAAI 1984: 330-334

Christoph Walther: Unification in Many-Sorted Theories. ECAI 1984: 383-392

Christoph Walther: A Many-Sorted Calculus Based on Resolution and Paramodulation. IJCAI 1983: 882-891

Karl-Hans Bläsius, Norbert Eisinger, Jörg H. Siekmann, Gert Smolka, Alexander Herold, Christoph Walther: The Markgraf Karl Refutation Procedure. IJCAI 1981: 511-518

Christoph Walther: Elimination of Redundant Links in Extended Connection Graphs. GWAI 1981: 201-213

Norbert Eisinger, Jörg H. Siekmann, Gert Smolka, E. Unvericht, Christoph Walther: Das Karlsruher Beweissystem. GI Jahrestagung 1980: 400-412