Benjamin Lucien Kaminski

Registered user since Tue 10 Nov 2020

Name:Benjamin Lucien Kaminski
Bio:
as of Nov. 2021 Professor Saarland University, Germany
as of Jan. 2020 Lecturer University College London, United Kingdom
Feb. 2019 – Dec. 2019 Postdoctoral Researcher RWTH Aachen, Germany
Oct. 2013 – Feb. 2019 PhD in semantics and verification of probabilistic programs RWTH Aachen, Germany
Country:Germany
Affiliation:Saarland University; University College London
Research interests:formal verification, semantics, probabilistic programs, quantitative verification

Contributions

SPLASH 2023 Author of Lower Bounds for Possibly Divergent Probabilistic Programs within the OOPSLA-track
POPL 2023 Author of Deductive Verification of Probabilistic Programs within the TutorialFest-track
Author of A Calculus for Amortized Expected Runtimes within the POPL-track
SPLASH 2022 Committee Member in Review Committee within the OOPSLA-track
Session Chair of Logic and Verification I (part of OOPSLA)
Session Chair of Probabilistic (part of OOPSLA)
Author of Quantitative strongest post: a calculus for reasoning about the flow of quantitative information within the OOPSLA-track
Author of Weighted programming: a programming paradigm for specifying mathematical models within the OOPSLA-track
PLDI 2022 Author of (POPL 2021) A Pre-Expectation Calculus for Probabilistic Sensitivity within the SIGPLAN Track-track
POPL 2022 Committee Member in Program Committee within the POPL-track
POPL 2021 Author of Relatively Complete Verification of Probabilistic Programs within the POPL-track
Author of A Pre-Expectation Calculus for Probabilistic Sensitivity within the POPL-track
POPL 2020 Author of Aiming Low Is Harder: Induction for Lower Bounds in Probabilistic Program Verification within the Research Papers-track
QAPL 2019 Author of Quantitative Separation Logic - A Logic for Reasoning about Probabilistic Pointer Programs within the QAPL-track
POPL 2019 Author of Quantitative Separation Logic - A Logic for Reasoning about Probabilistic Pointer Programs within the Research Papers-track
POPL 2018 Author of A new proof rule for almost-sure termination within the Research Papers-track
PPS 2017 Author of A weakest pre-expectation semantics for mixed-sign expectations within the PPS-track
PPS 2016 Author of On The Semantic Intricacies of Conditioning within the PPS 2016-track