Christoph Walther

ORCID

Publication Activity (10 Years)

Years Active: 1980-2019
Publications (10 Years): 3

Top Venues

CAV (2)

ACM Trans. Math. Softw.

J. Autom. Reason.

Karlsruhe Institute of Technology, Germany (PHD)

Education History

Karlsruhe Institute of Technology, Germany

PHD

Publications

Christoph Walther
Verified Newton-Raphson Iteration for Multiplicative Inverses Modulo Powers of Any Base. ACM Trans. Math. Softw. 45 (1) (2019)
Christoph Walther
Formally Verified Montgomery Multiplication. CAV (2) (2018)
Christoph Walther, Nathan Wasser
Fermat, Euler, Wilson - Three Case Studies in Number Theory. J. Autom. Reason. 59 (2) (2017)
Andreas Schlosser, Christoph Walther, Michael Gonder, Markus Aderhold
Context Dependent Procedures and Computed Types in -eriFun. Electron. Notes Theor. Comput. Sci. 174 (7) (2007)
Christoph Walther, Stephan Schweitzer
Reasoning About Incompletely Defined Programs. LPAR (2005)
Christoph Walther, Stephan Schweitzer
Verification in the Classroom. J. Autom. Reason. 32 (1) (2004)
Christoph Walther, Stephan Schweitzer
Automated Termination Analysis for Incompletely Defined Programs. LPAR (2004)
Christoph Walther, Stephan Schweitzer
About VeriFun. CADE (2003)
Christoph Walther, Stephan Schweitzer
A Machine-Verified Code Generator. LPAR (2003)
Christoph Walther, Thomas Kolbe
Proving theorems by reuse. Artif. Intell. 116 (1-2) (2000)
Christoph Walther, Thomas Kolbe
On Terminating Lemma Speculations. Inf. Comput. 162 (1-2) (2000)
Christoph Walther
Criteria for Termination. Intellectics and Computational Logic (2000)
Thomas Kolbe, Christoph Walther
Termination of Theorem Proving by Reuse. CADE (1996)
Thomas Kolbe, Christoph Walther
Second-Order Matching modulo Evaluation: A Technique for Reusing Proofs. IJCAI (1995)
Thomas Kolbe, Christoph Walther
Patching Proofs for Reuse (Extended Abstract). ECML (1995)
Christoph Walther
On Proving the Termination of Algorithms by Machine. Artif. Intell. 71 (1) (1994)
Thomas Kolbe, Christoph Walther
Reusing Proofs. ECAI (1994)
Christoph Walther
Combining Induction Axioms by Machine. IJCAI (1993)
Christoph Walther
Computing Induction Axioms. LPAR (1992)
Christoph Walther
Many-Sorted Inferences in Automated Theorem Proving. Sorts and Types in Artificial Intelligence (1989)
Christoph Walther
Argument-Bounded Algorithms as a Basis for Automated Termination Proofs. CADE (1988)
Christoph Walther
Many-sorted unification. J. ACM 35 (1) (1988)
Christoph Walther
Many-Sorted Resolution. KIFS (1987)
Christoph Walther
A Classification of Many-Sorted Unification Problems. CADE (1986)
Christoph Walther
Automatisches Beweisen. KIFS (1986)
Susanne Biundo, Birgit Hummel, Dieter Hutter, Christoph Walther
The Karlsruhe Induction Theorem Proving System. CADE (1986)
Christoph Walther
A Mechanical Solution of Schubert's Steamroller by Many-Sorted Resolution. Artif. Intell. 26 (2) (1985)
Christoph Walther
Unification in Many-Sorted Theories. ECAI (1984)
Christoph Walther
A Mechanical Solution of Schubert's Steamroller by Many-Sorted Resolution. AAAI (1984)
Christoph Walther
A Many-Sorted Calculus Based on Resolution and Paramodulation. IJCAI (1983)
Karl-Hans Bläsius, Norbert Eisinger, Jörg H. Siekmann, Gert Smolka, Alexander Herold, Christoph Walther
The Markgraf Karl Refutation Procedure. IJCAI (1981)
Christoph Walther
Elimination of Redundant Links in Extended Connection Graphs. GWAI (1981)
Norbert Eisinger, Jörg H. Siekmann, Gert Smolka, E. Unvericht, Christoph Walther
Das Karlsruher Beweissystem. GI Jahrestagung (1980)

Christoph Walther.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Christoph Walther