BibTeX records: Maximilian P. L. Haslbeck

download as .bib file

@inproceedings{DBLP:conf/atva/NipkowEH20,
  author    = {Tobias Nipkow and
               Manuel Eberl and
               Maximilian P. L. Haslbeck},
  title     = {Verified Textbook Algorithms - {A} Biased Survey},
  booktitle = {{ATVA}},
  series    = {Lecture Notes in Computer Science},
  volume    = {12302},
  pages     = {25--53},
  publisher = {Springer},
  year      = {2020}
}
@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}
}
@inproceedings{DBLP:conf/itp/HaslbeckL19,
  author    = {Maximilian P. L. Haslbeck and
               Peter Lammich},
  title     = {Refinement with Time - Refining the Run-Time of Algorithms in Isabelle/HOL},
  booktitle = {{ITP}},
  series    = {LIPIcs},
  volume    = {141},
  pages     = {20:1--20:18},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2019}
}
@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}
}
@inproceedings{DBLP:conf/cade/ZhanH18,
  author    = {Bohua Zhan and
               Maximilian P. L. Haslbeck},
  title     = {Verifying Asymptotic Time Complexity of Imperative Programs in Isabelle},
  booktitle = {{IJCAR}},
  series    = {Lecture Notes in Computer Science},
  volume    = {10900},
  pages     = {532--548},
  publisher = {Springer},
  year      = {2018}
}
@inproceedings{DBLP:conf/ruleml/HaslbeckW18,
  author    = {Maximilian Paul Louis Haslbeck and
               Simon Wimmer},
  title     = {Competitive Proving for Fun},
  booktitle = {LuxLogAI (Student / Workshop Papers)},
  series    = {Kalpa Publications in Computing},
  volume    = {10},
  pages     = {9--14},
  publisher = {EasyChair},
  year      = {2018}
}
@inproceedings{DBLP:conf/tacas/HaslbeckN18,
  author    = {Maximilian P. L. Haslbeck and
               Tobias Nipkow},
  title     = {Hoare Logics for Time Bounds - {A} Study in Meta Theory},
  booktitle = {{TACAS} {(1)}},
  series    = {Lecture Notes in Computer Science},
  volume    = {10805},
  pages     = {155--171},
  publisher = {Springer},
  year      = {2018}
}
@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}
}
@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}
}
@inproceedings{DBLP:conf/fsttcs/HaslbeckN16,
  author    = {Maximilian P. L. Haslbeck and
               Tobias Nipkow},
  title     = {Verified Analysis of List Update Algorithms},
  booktitle = {{FSTTCS}},
  series    = {LIPIcs},
  volume    = {65},
  pages     = {49:1--49:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2016}
}
@inproceedings{DBLP:conf/tableaux/NipkowH13,
  author    = {Tobias Nipkow and
               Maximilian P. L. Haslbeck},
  title     = {A Brief Survey of Verified Decision Procedures for Equivalence of
               Regular Expressions},
  booktitle = {{TABLEAUX}},
  series    = {Lecture Notes in Computer Science},
  volume    = {8123},
  pages     = {10--12},
  publisher = {Springer},
  year      = {2013}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics