default search action
Maximilian P. L. Haslbeck
Person information
- affiliation: Technical University of Munich, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Maximilian P. L. Haslbeck:
NREST: Nondeterministc RESult monad with Time. Arch. Formal Proofs 2024 (2024) - 2022
- [j4]Maximilian P. L. Haslbeck
, Peter Lammich:
For a Few Dollars More: Verified Fine-Grained Algorithm Analysis Down to LLVM. ACM Trans. Program. Lang. Syst. 44(3): 14:1-14:36 (2022) - 2021
- [b1]Maximilian Paul Louis Haslbeck:
Verified Quantitative Analysis of Imperative Algorithms (Verifizierte Quantitative Analyse von Imperativen Algorithmen). Technical University of Munich, Germany, 2021 - [c8]Maximilian P. L. Haslbeck
For a Few Dollars More - Verified Fine-Grained Algorithm Analysis Down to LLVM. ESOP 2021: 292-319 - 2020
- [c7]Tobias Nipkow
Verified Textbook Algorithms - A Biased Survey. ATVA 2020: 25-53
2010 – 2019
- 2019
- [j3]Maximilian P. L. Haslbeck, Peter Lammich, Julian Biendarra:
Kruskal's Algorithm for Minimum Spanning Forest. Arch. Formal Proofs 2019 (2019) - [c6]Maximilian P. L. Haslbeck
Refinement with Time - Refining the Run-Time of Algorithms in Isabelle/HOL. ITP 2019: 20:1-20:18 - 2018
- [j2]Maximilian P. L. Haslbeck, Tobias Nipkow:
Hoare Logics for Time Bounds. Arch. Formal Proofs 2018 (2018) - [c5]Bohua Zhan, Maximilian P. L. Haslbeck
Verifying Asymptotic Time Complexity of Imperative Programs in Isabelle. IJCAR 2018: 532-548 - [c4]Maximilian Paul Louis Haslbeck, Simon Wimmer:
Competitive Proving for Fun. LuxLogAI (Student / Workshop Papers) 2018: 9-14 - [c3]Maximilian P. L. Haslbeck
Hoare Logics for Time Bounds - A Study in Meta Theory. TACAS (1) 2018: 155-171 - [i1]Bohua Zhan, Maximilian P. L. Haslbeck:
Verifying Asymptotic Time Complexity of Imperative Programs in Isabelle. CoRR abs/1802.01336 (2018) - 2016
- [j1]Maximilian P. L. Haslbeck, Tobias Nipkow:
Analysis of List Update Algorithms. Arch. Formal Proofs 2016 (2016) - [c2]Maximilian P. L. Haslbeck
Verified Analysis of List Update Algorithms. FSTTCS 2016: 49:1-49:15 - 2013
- [c1]Tobias Nipkow
A Brief Survey of Verified Decision Procedures for Equivalence of Regular Expressions. TABLEAUX 2013: 10-12
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-28 01:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: