Dr. Waldmann - Research Areas

Automated analysis of termination and derivational complexity of rewriting.

Achievements:

• Normalization of S Terms is Decidable (PhD thesis, and Best Student Paper award at RTA (Conf. Rewriting Techniques and Applications) 1998, Tsukuba)
• Matrix Interpretations (with Dieter Hofbauer, Best Paper award at RTA 2006, Seattle)
• Automatic Termination (invited talk at RTA 2009, Brasilia)

Software:

• matchbox termination prover. Winner of the SRS category of the 2007 Termination Competition.

---

Constraint Programming Methods and Tools for solving termination constraints.

• supervised PhD thesis: SAT Compilation for Constraints over Structured Finite Domains by Alexander Bau, ko-operatives Promotionsverfahren mit TU Dresden, 2017. (The CO4 compiler.)

---

Automated Grading and Generation of Online Exercises in Computer Science.

Software:

• autotool is used at HTWK Leipzig since 2003.

System is documented by several workshop contributions, and is being developed by a grant of SMWK (Landesarbeitskreis E-Learning) 2010, and several diploma theses.

---

Community service:

• organizer (with Bertram Felgenhauer) of ICFP 2010 Programming Contest

• technical organizer of Termination Competitions 2014 - 2017

• co-initiator, and frequent local organizer, of Haskell in Leipzig workshop series (2006 – present).

• speaker (2014 and 2017) and local organizer (2015, with Alfons Geser) for Intl. School on Rewriting

---

For more detail, see publications (at DBLP), talks, and past activities.