Benjamin Lucien Kaminski

ORCID

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 54

Top Venues

CoRR

Proc. ACM Program. Lang.

CAV (2)

LICS

RWTH Aachen University, Germany (PHD)

Education History

RWTH Aachen University, Germany

PHD

Publications

Linpeng Zhang, Noam Zilberstein, Benjamin Lucien Kaminski, Alexandra Silva
Quantitative Weakest Hyper Pre: Unifying Correctness and Incorrectness Hyperproperties via Predicate Transformers. CoRR (2024)
Akihisa Yamada, Benjamin Lucien Kaminski, Dieter Hofbauer, Fred Mesnard, Étienne Payet
The 19th International Workshop on Termination (WST 2023): Preface, Invited Talk Abstract, and Tool Descriptions. CoRR (2023)
Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Lena Verscht
A Calculus for Amortized Expected Runtimes. Proc. ACM Program. Lang. 7 (POPL) (2023)
Philipp Schröer, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja
A Deductive Verification Infrastructure for Probabilistic Programs. CoRR (2023)
Philipp Schröer, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja
A Deductive Verification Infrastructure for Probabilistic Programs. Proc. ACM Program. Lang. 7 (OOPSLA2) (2023)
Shenghua Feng, Mingshuai Chen, Han Su, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Naijun Zhan
Lower Bounds for Possibly Divergent Probabilistic Programs. Proc. ACM Program. Lang. 7 (OOPSLA1) (2023)
Shenghua Feng, Mingshuai Chen, Han Su, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Naijun Zhan
Lower Bounds for Possibly Divergent Probabilistic Programs. CoRR (2023)
Kevin Batz, Mingshuai Chen, Sebastian Junges, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja
Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants. TACAS (2) (2023)
Lena Verscht, Benjamin Lucien Kaminski
Hoare-Like Triples and Kleene Algebras with Top and Tests: Towards a Holistic Perspective on Hoare Logic, Incorrectness Logic, and Beyond. CoRR (2023)
Kevin Batz, Adrian Gallus, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Tobias Winkler
Weighted Programming. CoRR (2022)
Linpeng Zhang, Benjamin Lucien Kaminski
Quantitative strongest post: a calculus for reasoning about the flow of quantitative information. Proc. ACM Program. Lang. 6 (OOPSLA) (2022)
Kevin Batz, Mingshuai Chen, Sebastian Junges, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja
Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants. CoRR (2022)
Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner
Generative Datalog with Continuous Distributions. J. ACM 69 (6) (2022)
Kevin Batz, Adrian Gallus, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Tobias Winkler
Weighted programming: a programming paradigm for specifying mathematical models. Proc. ACM Program. Lang. 6 (OOPSLA) (2022)
Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Lena Verscht
A Calculus for Amortized Expected Runtimes. CoRR (2022)
Linpeng Zhang, Benjamin Lucien Kaminski
Quantitative Strongest Post. CoRR (2022)
Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner
Probabilistic Data with Continuous Distributions. CoRR (2021)
Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja
Relatively complete verification of probabilistic programs: an expressive language for expectation-based reasoning. Proc. ACM Program. Lang. 5 (POPL) (2021)
Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner
Probabilistic Data with Continuous Distributions. SIGMOD Rec. 50 (1) (2021)
Alejandro Aguirre, Gilles Barthe, Justin Hsu, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja
A pre-expectation calculus for probabilistic sensitivity. Proc. ACM Program. Lang. 5 (POPL) (2021)
Kevin Batz, Mingshuai Chen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Philipp Schröer
Latticed k-Induction with an Application to Probabilistic Programs. CAV (2) (2021)
Kevin Batz, Mingshuai Chen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Philipp Schröer
Latticed k-Induction with an Application to Probabilistic Programs. CoRR (2021)
Marcel Hark, Benjamin Lucien Kaminski, Jürgen Giesl, Joost-Pieter Katoen
Aiming low is harder: induction for lower bounds in probabilistic program verification. Proc. ACM Program. Lang. 4 (POPL) (2020)
Arnd Hartmanns, Benjamin Lucien Kaminski
Optimistic Value Iteration. CAV (2) (2020)
Kevin Batz, Sebastian Junges, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Philipp Schröer
PrIC3: Property Directed Reachability for MDPs. CAV (2) (2020)
Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner
Generative Datalog with Continuous Distributions. PODS (2020)
Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner
Generative Datalog with Continuous Distributions. CoRR (2020)
Lutz Klinkenberg, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Joshua Moerman, Tobias Winkler
Generating Functions for Probabilistic Programs. LOPSTR (2020)
Kevin Batz, Sebastian Junges, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Philipp Schröer
PrIC3: Property Directed Reachability for MDPs. CoRR (2020)
Lutz Klinkenberg, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Joshua Moerman, Tobias Winkler
Generating Functions for Probabilistic Programs. CoRR (2020)
Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja
Relatively Complete Verification of Probabilistic Programs. CoRR (2020)
Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Thomas Noll
Quantitative separation logic: a logic for reasoning about probabilistic pointer programs. Proc. ACM Program. Lang. 3 (POPL) (2019)
Marcel Hark, Benjamin Lucien Kaminski, Jürgen Giesl, Joost-Pieter Katoen
Aiming Low Is Harder - Inductive Proof Rules for Lower Bounds on Weakest Preexpectations in Probabilistic Program Verification. CoRR (2019)
Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja
On the hardness of analyzing probabilistic programs. Acta Informatica 56 (3) (2019)
Alejandro Aguirre, Gilles Barthe, Justin Hsu, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja
Kantorovich Continuity of Probabilistic Programs. CoRR (2019)
Arnd Hartmanns, Benjamin Lucien Kaminski
Optimistic Value Iteration. CoRR (2019)
Annabelle McIver, Carroll Morgan, Benjamin Lucien Kaminski, Joost-Pieter Katoen
A new proof rule for almost-sure termination. Proc. ACM Program. Lang. 2 (POPL) (2018)
Federico Olmedo, Friedrich Gretz, Nils Jansen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Annabelle McIver
Conditioning in Probabilistic Programming. ACM Trans. Program. Lang. Syst. 40 (1) (2018)
Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo
Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms. J. ACM 65 (5) (2018)
Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja
How long, O Bayesian network, will I sample thee? A program analysis perspective on expected sampling times. CoRR (2018)
Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Thomas Noll
Quantitative Separation Logic. CoRR (2018)
Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja
How long, O Bayesian network, will I sample thee? - A program analysis perspective on expected sampling times. ESOP (2018)
Maurice van Keulen, Benjamin Lucien Kaminski, Christoph Matheja, Joost-Pieter Katoen
Rule-Based Conditioning of Probabilistic Data. SUM (2018)
Annabelle McIver, Carroll Morgan, Benjamin Lucien Kaminski, Joost-Pieter Katoen
A New Proof Rule for Almost-Sure Termination. CoRR (2017)
Benjamin Lucien Kaminski, Joost-Pieter Katoen
A Weakest Pre-Expectation Semantics for Mixed-Sign Expectations. CoRR (2017)
Benjamin Lucien Kaminski, Joost-Pieter Katoen
A weakest pre-expectation semantics for mixed-sign expectations. LICS (2017)
Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo
Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs. ESOP (2016)
Federico Olmedo, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja
Reasoning about Recursive Probabilistic Programs. LICS (2016)
Nils Jansen, Christian Dehnert, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Lukas Westhofen
Bounded Model Checking for Probabilistic Programs. CoRR (2016)
Federico Olmedo, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja
Reasoning about Recursive Probabilistic Programs. CoRR (2016)
Nils Jansen, Christian Dehnert, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Lukas Westhofen
Bounded Model Checking for Probabilistic Programs. ATVA (2016)
Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo
Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs. CoRR (2016)
Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja
Inferring Covariances for Probabilistic Programs. QEST (2016)
Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja
Inferring Covariances for Probabilistic Programs. CoRR (2016)
Benjamin Lucien Kaminski, Joost-Pieter Katoen
On the Hardness of Almost-Sure Termination. MFCS (1) (2015)
Friedrich Gretz, Nils Jansen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Annabelle McIver, Federico Olmedo
Conditioning in Probabilistic Programming. CoRR (2015)
Nils Jansen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Federico Olmedo, Friedrich Gretz, Annabelle McIver
Conditioning in Probabilistic Programming. MFPS (2015)
Joost-Pieter Katoen, Friedrich Gretz, Nils Jansen, Benjamin Lucien Kaminski, Federico Olmedo
Understanding Probabilistic Programs. Correct System Design (2015)
Benjamin Lucien Kaminski, Joost-Pieter Katoen
On the Hardness of Almost-Sure Termination. CoRR (2015)
Benjamin Lucien Kaminski, Joost-Pieter Katoen
Analyzing Expected Outcomes and Almost-Sure Termination of Probabilistic Programs is Hard. CoRR (2014)
Raimondas Sasnauskas, Oscar Soria Dustmann, Benjamin Lucien Kaminski, Klaus Wehrle, Carsten Weise, Stefan Kowalewski
Scalable Symbolic Execution of Distributed Systems. ICDCS (2011)

Benjamin Lucien Kaminski.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Benjamin Lucien Kaminski