Marcel Hark

13 papers A 1B 2Journal 7Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Termination of triangular polynomial loops.
Formal Methods Syst. Des.
Marcel Hark, Florian Frohn, Jürgen Giesl
2022 — conf
Improving Automatic Complexity Analysis of Integer Programs.
The Logic of Software. A Tasting Menu of Formal Methods
Jürgen Giesl, Nils Lommen, Marcel Hark, Fabian Meyer
2022 J jnl
Improving Automatic Complexity Analysis of Integer Programs.
CoRR
Jürgen Giesl, Nils Lommen, Marcel Hark, Fabian Meyer
2021 — conf
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes.
TACAS (1)
Fabian Meyer, Marcel Hark, Jürgen Giesl
2021 — —
Towards complete methods for automatic complexity and termination analysis of (probabilistic) programs.
Marcel Hark
2020 J jnl
Aiming low is harder: induction for lower bounds in probabilistic program verification.
Proc. ACM Program. Lang.
Marcel Hark, Benjamin Lucien Kaminski, Jürgen Giesl, Joost-Pieter Katoen
2020 J jnl
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes.
CoRR
Fabian Meyer, Marcel Hark, Jürgen Giesl
2020 B conf
Polynomial Loops: Beyond Termination.
LPAR
Marcel Hark, Florian Frohn, Jürgen Giesl
2020 B conf
Termination of Polynomial Loops.
SAS
Florian Frohn, Marcel Hark, Jürgen Giesl
2019 J jnl
Aiming Low Is Harder - Inductive Proof Rules for Lower Bounds on Weakest Preexpectations in Probabilistic Program Verification.
CoRR
Marcel Hark, Benjamin Lucien Kaminski, Jürgen Giesl, Joost-Pieter Katoen
2019 A conf
Computing Expected Runtimes for Constant Probability Programs.
CADE
Jürgen Giesl, Peter Giesl, Marcel Hark
2019 J jnl
Computing Expected Runtimes for Constant Probability Programs.
CoRR
Jürgen Giesl, Peter Giesl, Marcel Hark
2019 J jnl
On the Decidability of Termination for Polynomial Loops.
CoRR
Florian Frohn, Marcel Hark, Jürgen Giesl