Travelled to:
3 × USA
Collaborated with:
∅ S.Schweitzer T.Kolbe S.Biundo B.Hummel D.Hutter
Talks about:
theorem (2) termin (2) prove (2) montgomeri (1) algorithm (1) karlsruh (1) argument (1) problem (1) multipl (1) classif (1)
Person: Christoph Walther
DBLP: Walther:Christoph
Contributed to:
Wrote 6 papers:
- CADE-2003-WaltherS
- About VeriFun (CW, SS), pp. 322–327.
- CADE-1996-KolbeW #proving #reuse #termination #theorem proving
- Termination of Theorem Proving by Reuse (TK, CW), pp. 106–120.
- CADE-1988-Walther #algorithm #automation #bound #proving #termination
- Argument-Bounded Algorithms as a Basis for Automated Termination Proofs (CW), pp. 602–621.
- CADE-1986-BiundoHHW #induction #proving #theorem proving
- The Karlsruhe Induction Theorem Proving System (SB, BH, DH, CW), pp. 672–674.
- CADE-1986-Walther #classification #problem #unification
- A Classification of Many-Sorted Unification Problems (CW), pp. 525–537.
- CAV-2018-Walther #multi
- Formally Verified Montgomery Multiplication (CW), pp. 505–522.