Maximilian P. L. Haslbeck

13 papers A 2B 3Journal 6Unranked 2
YearRankTypeTitle / Venue / Authors
2024 J jnl
NREST: Nondeterministc RESult monad with Time.
Arch. Formal Proofs
Maximilian P. L. Haslbeck
2022 J jnl
For a Few Dollars More: Verified Fine-Grained Algorithm Analysis Down to LLVM.
ACM Trans. Program. Lang. Syst.
Maximilian P. L. Haslbeck, Peter Lammich
2021 A conf
For a Few Dollars More - Verified Fine-Grained Algorithm Analysis Down to LLVM.
ESOP
Maximilian P. L. Haslbeck, Peter Lammich
2020 B conf
Verified Textbook Algorithms - A Biased Survey.
ATVA
Tobias Nipkow, Manuel Eberl, Maximilian P. L. Haslbeck
2019 J jnl
Kruskal's Algorithm for Minimum Spanning Forest.
Arch. Formal Proofs
Maximilian P. L. Haslbeck, Peter Lammich, Julian Biendarra
2019 B conf
Refinement with Time - Refining the Run-Time of Algorithms in Isabelle/HOL.
ITP
Maximilian P. L. Haslbeck, Peter Lammich
2018 — conf
Hoare Logics for Time Bounds - A Study in Meta Theory.
TACAS (1)
Maximilian P. L. Haslbeck, Tobias Nipkow
2018 J jnl
Hoare Logics for Time Bounds.
Arch. Formal Proofs
Maximilian P. L. Haslbeck, Tobias Nipkow
2018 A conf
Verifying Asymptotic Time Complexity of Imperative Programs in Isabelle.
IJCAR
Bohua Zhan, Maximilian P. L. Haslbeck
2018 J jnl
Verifying Asymptotic Time Complexity of Imperative Programs in Isabelle.
CoRR
Bohua Zhan, Maximilian P. L. Haslbeck
2016 J jnl
Analysis of List Update Algorithms.
Arch. Formal Proofs
Maximilian P. L. Haslbeck, Tobias Nipkow
2016 — conf
Verified Analysis of List Update Algorithms.
FSTTCS
Maximilian P. L. Haslbeck, Tobias Nipkow
2013 B conf
A Brief Survey of Verified Decision Procedures for Equivalence of Regular Expressions.
TABLEAUX
Tobias Nipkow, Maximilian P. L. Haslbeck