I studied computer science, with mathematics as minor subject, at the TU München from 2009 until 2015. Since October 2016 I am a Ph.D. student at the Chair for Logic and Verification.
| Address: |
Maximilian P. L. Haslbeck, M.Sc. Technische Universität München Institut für Informatik Boltzmannstr. 3 85748 Garching Deutschland | |
|---|---|---|
| Office: | MI 00.09.056 | |
 :
| orcid.org/0000-0003-4306-869X |
My interests are mainly formalizing mathematics in higher-order logic and verifying software upon this. I'm also interested in processing of natural language proofs. My current work mostly is related to the Isabelle theorem prover and verified analysis of algorithms.
Proving for Fun
At Proving for Fun we host proving contests and homework submission (in Isabelle). Feel free to solve the problems, spread the word and give feedback.
Publications
Drafts
-
Refinement with Time - Refining the Run-time of Algorithms in Isabelle/HOL.
Maximilian P.L. Haslbeck, Peter Lammich
Submitted, March 2019 -
Competitive Proving for Fun.
Maximilian P. L. Haslbeck, Simon Wimmer, Submitted, January 2019
Conference Proceedings
-
Verifying Asymptotic Time Complexity of Imperative Programs in Isabelle.
Bohua Zhan, Maximilian P.L. Haslbeck
In IJCAR 2018. Repository. -
Hoare Logics for Time Bounds.
Maximilian P.L. Haslbeck, Tobias Nipkow
In TACAS 2018, LNCS, 2018. -
Verified Analysis of List Update Algorithms.
Maximilian P.L. Haslbeck, Tobias Nipkow
In FSTTCS 2016, LNCS, 2016.
Archive of Formal Proofs
-
Kruskal's Algorithm for Minimum Spanning Forest.
Maximilian P.L. Haslbeck, Peter Lammich, Julian Biendarra
In: G. Klein, T. Nipkow, and L. Paulson (ed), The Archive of Formal Proofs, https://www.isa-afp.org/entries/Hoare_Time.html, February 2019, Formal proof development. -
Hoare Logics for Time Bounds.
Maximilian P.L. Haslbeck, Tobias Nipkow
In: G. Klein, T. Nipkow, and L. Paulson (ed), The Archive of Formal Proofs, https://www.isa-afp.org/entries/Hoare_Time.html, February 2018, Formal proof development. -
Analysis of List Update Algorithms.
Maximilian P.L. Haslbeck, Tobias Nipkow
In: G. Klein, T. Nipkow, and L. Paulson (ed), The Archive of Formal Proofs, https://www.isa-afp.org/entries/List_Update.shtml, February 2016, Formal proof development.
Master's Thesis
-
Verified Analysis of Algorithms for the List Update Problem.
Institut für Informatik, TU München. September 2015.
Bachelor's Thesis
-
Verified decision procedures for the equivalence of regular expressions.
Institut für Informatik, TU München. July 2013.
Teaching
- Summer 18: organizer of the Formal Proof in Mathematics and Computer Science Seminar
- Summer 17: co-organizer of the Formal Proof in Mathematics and Computer Science Seminar