BibTeX records: Maximilian P. L. Haslbeck

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

> Home > Persons > Maximilian P. L. Haslbeck

download as .bib file

@article{DBLP:journals/toplas/HaslbeckL22,
  author       = {Maximilian P. L. Haslbeck and
                  Peter Lammich},
  title        = {For a Few Dollars More: Verified Fine-Grained Algorithm Analysis Down
                  to {LLVM}},
  journal      = {{ACM} Trans. Program. Lang. Syst.},
  volume       = {44},
  number       = {3},
  pages        = {14:1--14:36},
  year         = {2022},
  url          = {https://doi.org/10.1145/3486169},
  doi          = {10.1145/3486169},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toplas/HaslbeckL22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@phdthesis{DBLP:phd/de/Haslbeck21,
  author       = {Maximilian Paul Louis Haslbeck},
  title        = {Verified Quantitative Analysis of Imperative Algorithms (Verifizierte
                  Quantitative Analyse von Imperativen Algorithmen)},
  school       = {Technical University of Munich, Germany},
  year         = {2021},
  url          = {https://mediatum.ub.tum.de/1596032},
  urn          = {urn:nbn:de:bvb:91-diss-20210816-1596032-1-7},
  timestamp    = {Fri, 20 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/de/Haslbeck21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/esop/HaslbeckL21,
  author       = {Maximilian P. L. Haslbeck and
                  Peter Lammich},
  editor       = {Nobuko Yoshida},
  title        = {For a Few Dollars More - Verified Fine-Grained Algorithm Analysis
                  Down to {LLVM}},
  booktitle    = {Programming Languages and Systems - 30th European Symposium on Programming,
                  {ESOP} 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},
  series       = {Lecture Notes in Computer Science},
  volume       = {12648},
  pages        = {292--319},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-030-72019-3\_11},
  doi          = {10.1007/978-3-030-72019-3\_11},
  timestamp    = {Fri, 14 May 2021 08:34:21 +0200},
  biburl       = {https://dblp.org/rec/conf/esop/HaslbeckL21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/atva/NipkowEH20,
  author       = {Tobias Nipkow and
                  Manuel Eberl and
                  Maximilian P. L. Haslbeck},
  editor       = {Dang Van Hung and
                  Oleg Sokolsky},
  title        = {Verified Textbook Algorithms - {A} Biased Survey},
  booktitle    = {Automated Technology for Verification and Analysis - 18th International
                  Symposium, {ATVA} 2020, Hanoi, Vietnam, October 19-23, 2020, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12302},
  pages        = {25--53},
  publisher    = {Springer},
  year         = {2020},
  url          = {https://doi.org/10.1007/978-3-030-59152-6\_2},
  doi          = {10.1007/978-3-030-59152-6\_2},
  timestamp    = {Tue, 20 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/atva/NipkowEH20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/afp/HaslbeckLB19,
  author       = {Maximilian P. L. Haslbeck and
                  Peter Lammich and
                  Julian Biendarra},
  title        = {Kruskal's Algorithm for Minimum Spanning Forest},
  journal      = {Arch. Formal Proofs},
  volume       = {2019},
  year         = {2019},
  url          = {https://www.isa-afp.org/entries/Kruskal.html},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/afp/HaslbeckLB19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/itp/HaslbeckL19,
  author       = {Maximilian P. L. Haslbeck and
                  Peter Lammich},
  editor       = {John Harrison and
                  John O'Leary and
                  Andrew Tolmach},
  title        = {Refinement with Time - Refining the Run-Time of Algorithms in Isabelle/HOL},
  booktitle    = {10th International Conference on Interactive Theorem Proving, {ITP}
                  2019, September 9-12, 2019, Portland, OR, {USA}},
  series       = {LIPIcs},
  volume       = {141},
  pages        = {20:1--20:18},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.ITP.2019.20},
  doi          = {10.4230/LIPICS.ITP.2019.20},
  timestamp    = {Mon, 23 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/itp/HaslbeckL19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/afp/HaslbeckN18,
  author       = {Maximilian P. L. Haslbeck and
                  Tobias Nipkow},
  title        = {Hoare Logics for Time Bounds},
  journal      = {Arch. Formal Proofs},
  volume       = {2018},
  year         = {2018},
  url          = {https://www.isa-afp.org/entries/Hoare\_Time.html},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/afp/HaslbeckN18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cade/ZhanH18,
  author       = {Bohua Zhan and
                  Maximilian P. L. Haslbeck},
  editor       = {Didier Galmiche and
                  Stephan Schulz and
                  Roberto Sebastiani},
  title        = {Verifying Asymptotic Time Complexity of Imperative Programs in Isabelle},
  booktitle    = {Automated Reasoning - 9th International Joint Conference, {IJCAR}
                  2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford,
                  UK, July 14-17, 2018, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10900},
  pages        = {532--548},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-319-94205-6\_35},
  doi          = {10.1007/978-3-319-94205-6\_35},
  timestamp    = {Mon, 28 Aug 2023 21:17:45 +0200},
  biburl       = {https://dblp.org/rec/conf/cade/ZhanH18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/ruleml/HaslbeckW18,
  author       = {Maximilian Paul Louis Haslbeck and
                  Simon Wimmer},
  editor       = {Christoph Benzm{\"{u}}ller and
                  Xavier Parent and
                  Alexander Steen},
  title        = {Competitive Proving for Fun},
  booktitle    = {Selected Student Contributions and Workshop Papers of LuxLogAI 2018},
  series       = {Kalpa Publications in Computing},
  volume       = {10},
  pages        = {9--14},
  publisher    = {EasyChair},
  year         = {2018},
  url          = {https://doi.org/10.29007/ktx8},
  doi          = {10.29007/KTX8},
  timestamp    = {Mon, 13 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/ruleml/HaslbeckW18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/tacas/HaslbeckN18,
  author       = {Maximilian P. L. Haslbeck and
                  Tobias Nipkow},
  editor       = {Dirk Beyer and
                  Marieke Huisman},
  title        = {Hoare Logics for Time Bounds - {A} Study in Meta Theory},
  booktitle    = {Tools and Algorithms for the Construction and Analysis of Systems
                  - 24th International Conference, {TACAS} 2018, Held as Part of the
                  European Joint Conferences on Theory and Practice of Software, {ETAPS}
                  2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {10805},
  pages        = {155--171},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-319-89960-2\_9},
  doi          = {10.1007/978-3-319-89960-2\_9},
  timestamp    = {Fri, 09 Apr 2021 18:45:37 +0200},
  biburl       = {https://dblp.org/rec/conf/tacas/HaslbeckN18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1802-01336,
  author       = {Bohua Zhan and
                  Maximilian P. L. Haslbeck},
  title        = {Verifying Asymptotic Time Complexity of Imperative Programs in Isabelle},
  journal      = {CoRR},
  volume       = {abs/1802.01336},
  year         = {2018},
  url          = {http://arxiv.org/abs/1802.01336},
  eprinttype    = {arXiv},
  eprint       = {1802.01336},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1802-01336.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/afp/HaslbeckN16,
  author       = {Maximilian P. L. Haslbeck and
                  Tobias Nipkow},
  title        = {Analysis of List Update Algorithms},
  journal      = {Arch. Formal Proofs},
  volume       = {2016},
  year         = {2016},
  url          = {https://www.isa-afp.org/entries/List\_Update.shtml},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/afp/HaslbeckN16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fsttcs/HaslbeckN16,
  author       = {Maximilian P. L. Haslbeck and
                  Tobias Nipkow},
  editor       = {Akash Lal and
                  S. Akshay and
                  Saket Saurabh and
                  Sandeep Sen},
  title        = {Verified Analysis of List Update Algorithms},
  booktitle    = {36th {IARCS} Annual Conference on Foundations of Software Technology
                  and Theoretical Computer Science, {FSTTCS} 2016, December 13-15, 2016,
                  Chennai, India},
  series       = {LIPIcs},
  volume       = {65},
  pages        = {49:1--49:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.FSTTCS.2016.49},
  doi          = {10.4230/LIPICS.FSTTCS.2016.49},
  timestamp    = {Tue, 30 Nov 2021 13:29:05 +0100},
  biburl       = {https://dblp.org/rec/conf/fsttcs/HaslbeckN16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/tableaux/NipkowH13,
  author       = {Tobias Nipkow and
                  Maximilian P. L. Haslbeck},
  editor       = {Didier Galmiche and
                  Dominique Larchey{-}Wendling},
  title        = {A Brief Survey of Verified Decision Procedures for Equivalence of
                  Regular Expressions},
  booktitle    = {Automated Reasoning with Analytic Tableaux and Related Methods - 22th
                  International Conference, {TABLEAUX} 2013, Nancy, France, September
                  16-19, 2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8123},
  pages        = {10--12},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-40537-2\_3},
  doi          = {10.1007/978-3-642-40537-2\_3},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/tableaux/NipkowH13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

a service of

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.