About me

I have been a doctoral researcher at Research Group Computer Science 2 since April 2017. Since October 2017, I have been holding a scholarship by the RTG UnRAVeL funded by the German Research Association (DFG).

I am interested in

  • (automated) runtime analysis of
    • (probabilistic) programs
    • (probabilistic) term rewriting systems
  • semantics of (probabilistic) programs
  • decidability of termination and complexity

Publications

Show / Hide

Aiming Low is Harder - Induction for Lower Bounds on Weakest Preexpectations in Probabilistic Program Verification

2020
M. Hark, B. Kaminski, J. Giesl, and J.-P. Katoen
Proceedings of the ACM on Programming Languages (POPL). To appear.

On the Decidability of Termination for Polynomial Loops

2019
F. Frohn, M. Hark, and J. Giesl
Under review.

Computing Expected Runtimes for Constant Probability Programs

2019
J. Giesl, P. Giesl, and M. Hark
In Proceedings of the 27th International Conference on Automated Deduction (CADE '19), Natal, Brazil.

Activities

Show / Hide

AE-Member of the 13th International Conference on Tests and Proofs (TAP '19), Porto, Portugal

2019

I have been an external reviewer at the following conferences

  • ATVA (2019)
  • CADE (2019)
  • FSCD (2019)
  • LPAR (2018)
  • TACAS (2018)
2018-today

Teaching

Show / Hide

Lecture Programming

WiSe 19

Seminar Verification Techniques

WiSe 19

Lecture Functional Programming

SuSe 19

Seminar Verification Techniques

SuSe 19

Seminar Verification Techniques

WiSe 18

Lecture Programming

WiSe 18

Seminar Verification Techniques

WiSe 17

Lecture Programming

WiSe 17