Marcel Hark

According to our database, Marcel Hark authored at least 9 papers between 2019 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2022

Improving Automatic Complexity Analysis of Integer Programs.

Jürgen Giesl, Nils Lommen, Marcel Hark, Fabian Meyer

Proceedings of the Logic of Software. A Tasting Menu of Formal Methods, 2022

2021

Towards complete methods for automatic complexity and termination analysis of (probabilistic) programs.

Marcel Hark

PhD thesis, 2021

Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes.

Fabian Meyer, Marcel Hark, Jürgen Giesl

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2021

2020

Aiming low is harder: induction for lower bounds in probabilistic program verification.

Marcel Hark, Benjamin Lucien Kaminski, Jürgen Giesl, Joost-Pieter Katoen

Proc. ACM Program. Lang., 2020

Termination of Polynomial Loops.

Florian Frohn, Marcel Hark, Jürgen Giesl

Proceedings of the Static Analysis - 27th International Symposium, 2020

Polynomial Loops: Beyond Termination.

Marcel Hark, Florian Frohn, Jürgen Giesl

Proceedings of the LPAR 2020: 23rd International Conference on Logic for Programming, 2020

2019

On the Decidability of Termination for Polynomial Loops.

Florian Frohn, Marcel Hark, Jürgen Giesl

CoRR, 2019

Aiming Low Is Harder - Inductive Proof Rules for Lower Bounds on Weakest Preexpectations in Probabilistic Program Verification.

Marcel Hark, Benjamin Lucien Kaminski, Jürgen Giesl, Joost-Pieter Katoen

CoRR, 2019

Computing Expected Runtimes for Constant Probability Programs.

Jürgen Giesl, Peter Giesl, Marcel Hark

Proceedings of the Automated Deduction - CADE 27, 2019