Marcel Hark Copyright: © Marcel Hark

Person

Dr.

Marcel Hark

Computer Science Departement, RTG UnRAVeL

Former associate doctoral researcher

Address

Department of Computer Science
Erweiterungsbau 3, Room 9218
Ahornstrasse 55
52074 Aachen
 

 
Dissertation project
Automated Run-Time Analysis of Probabilistic Programs
Collaborations
Benjamin Kaminski: Advanced Weakest Precondition Calculi for Probabilistic Programs
Dominik Meier: Termination and Complexity Analysis of Probabilistic Programs
Peter Lindner: The Theory of Infinite Probabilistic Databases
Engagement

Organisational Committee from 10.2017 – 06.2019

Steering Committee since 10.2017 – 06.2019

Organisation: "Dagstuhl seminar", 06.2018- 06.2019
Organisation: "UnRAVeL Spring Workshop", 10.2017 – 03.2018
Talks
Bi-Weekly Talk: Marcel Hark: Computing Expected Runtimes for Constant Probability Programs
Bi-Weekly Talk: Inductive Lower Bounds in Probabilistic Programs
Bi-Weekly Talk: Automated Run-Time Analysis of Probabilistic Programs
 

Publications related to UnRAVeL

Source Author(s)
[Contribution to a book, Contribution to a conference proceedings]
Improving Automatic Complexity Analysis of Integer Programs
In: The logic of software : a tasting menu of formal methods : essays dedicated to Reiner Hähnle on the occasion of his 60th birthday / Wolfgang Ahrendt, Bernhard Beckert, Richard Bubel, Einar Broch Johnsen (eds.), 193-228, 2022
[DOI: 10.1007/978-3-031-08166-8_10]
Giesl, Jürgen (Corresponding author)
Lommen, Nils
Hark, Marcel Tobias
Meyer, Fabian Niklas
[Dissertation / PhD Thesis]
Towards complete methods for automatic complexity and termination analysis of (probabilistic) programs, 2021
[DOI: 10.18154/RWTH-2021-06073]
Hark, Marcel Tobias
[Contribution to a book, Contribution to a conference proceedings]
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
In: Tools and Algorithms for the Construction and Analysis of Systems : 27th International Conference, TACAS 2021, Held As Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 - April 1, 2021, Proceedings, Part I, 250-269, 2021
[DOI: 10.1007/978-3-030-72016-2_14]
Meyer, Fabian Niklas
Hark, Marcel Tobias (Corresponding author)
Giesl, Jürgen (Corresponding author)
[Contribution to a book, Contribution to a conference proceedings]
Termination of Polynomial Loops
In: Static Analysis : 27th International Symposium, SAS 2020 : Virtual Event, November 18-20, 2020 : Proceedings / Pichardie, David, Sighireanu, Mihaela (Eds.), 89-112, 2020
[DOI: 10.1007/978-3-030-65474-0_5]
Frohn, Florian
Hark, Marcel Tobias (Corresponding author)
Giesl, Jürgen
[Report]
UnRAVeL Research Training Group : Uncertainty and Randomness in Algorithms, Verification, and Logic, 2020
Katoen, Joost-Pieter
Ritzert, Martin
Wilke, Richard Marlon
Dannert, Katrin M.
Lindner, Peter
et al.
[Contribution to a book, Contribution to a conference proceedings]
Polynomial Loops: Beyond Termination
In: Proceedings of LPAR-23: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, 279-297, 2020
[DOI: 10.29007/nxv1]
Hark, Marcel Tobias
Frohn, Florian
Giesl, Jürgen
[Conference Presentation, Journal Article]
Aiming low is harder: induction for lower bounds in probabilistic program verification
In: Proceedings of the ACM on programming languages, 4 (POPL), 1-28, 2020
[DOI: 10.1145/3371105]
Hark, Marcel Tobias (Corresponding author)
Kaminski, Benjamin Lucien
Giesl, Jürgen
Katoen, Joost-Pieter
[Contribution to a book, Contribution to a conference proceedings]
Computing Expected Runtimes for Constant Probability Programs
In: Automated Deduction - CADE 27 : 27th International Conference on Automated Deduction, Natal, Brazil, August 27-30, 2019 : Proceedings / Pascal Fontaine (Ed.), 269-286, 2019
[DOI: 10.1007/978-3-030-29436-6_16]
Giesl, Jürgen
Giesl, Peter
Hark, Marcel Tobias (Corresponding author)