Christoph Walther
20 publications
7 venues
H Index 12
Affiliation
Darmstadt University of Technology, GermanyLinks
DBLP
ORCID- http://www.inferenzsysteme.informatik.tu-darmstadt.de/users/walther/
- https://mathscinet.ams.org/mathscinet/MRAuthorID/220391
- https://mathgenealogy.org/id.php?id=84714
- https://en.wikipedia.org/wiki/Christoph_Walther
- https://www.wikidata.org/entity/Q24004969
- https://id.loc.gov/authorities/names/n86007622
- https://d-nb.info/gnd/123321123
| Name | Venue | Year | citations |
|---|---|---|---|
Reasoning About Incompletely Defined Programs.
|
LPAR | 2005 | 17 |
| Automated Termination Analysis for Incompletely Defined Programs.
|
LPAR | 2004 | 0 |
| About VeriFun.
|
CADE | 2003 | 26 |
| A Machine-Verified Code Generator.
|
LPAR | 2003 | 4 |
| Proving theorems by reuse.
|
Artificial Intelligence | 2000 | 18 |
| Termination of Theorem Proving by Reuse.
|
CADE | 1996 | 9 |
| Second-Order Matching modulo Evaluation: A Technique for Reusing Proofs.
|
IJCAI | 1995 | 27 |
| Patching Proofs for Reuse (Extended Abstract).
|
ECML/PKDD | 1995 | 11 |
| Reusing Proofs.
|
ECAI | 1994 | 63 |
| On Proving the Termination of Algorithms by Machine.
|
Artificial Intelligence | 1994 | 96 |
| Combining Induction Axioms by Machine.
|
IJCAI | 1993 | 25 |
| Computing Induction Axioms.
|
LPAR | 1992 | 33 |
| Argument-Bounded Algorithms as a Basis for Automated Termination Proofs.
|
CADE | 1988 | 41 |
| The Karlsruhe Induction Theorem Proving System.
|
CADE | 1986 | 73 |
| A Classification of Many-Sorted Unification Problems.
|
CADE | 1986 | 8 |
| A Mechanical Solution of Schubert's Steamroller by Many-Sorted Resolution.
|
Artificial Intelligence | 1985 | 0 |
| Unification in Many-Sorted Theories.
|
ECAI | 1984 | 28 |
| A Mechanical Solution of Schubert's Steamroller by Many-Sorted Resolution.
|
AAAI | 1984 | 128 |
| A Many-Sorted Calculus Based on Resolution and Paramodulation.
|
IJCAI | 1983 | 0 |
| The Markgraf Karl Refutation Procedure.
|
IJCAI | 1981 | 0 |