default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenjamin Lucien Kaminski
Person information
- affiliation: Saarland University, Germany
- affiliation: University College London, UK
- affiliation (former, PhD 2019): RWTH Aachen University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i29]Linpeng Zhang, Noam Zilberstein, Benjamin Lucien Kaminski, Alexandra Silva:
Quantitative Weakest Hyper Pre: Unifying Correctness and Incorrectness Hyperproperties via Predicate Transformers. CoRR abs/2404.05097 (2024)- 2023
- [j15]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): 696-726 (2023) - [j14]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): 2052-2082 (2023) - [j13]Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Lena Verscht:
A Calculus for Amortized Expected Runtimes. Proc. ACM Program. Lang. 7(POPL): 1957-1986 (2023) - [c17]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: 410-429 - [d1]Philipp Schröer, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
A Deductive Verification Infrastructure for Probabilistic Programs - Artifact Evaluation. Zenodo, 2023
- [i28]Shenghua Feng, Mingshuai Chen, Han Su, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Naijun Zhan:
Lower Bounds for Possibly Divergent Probabilistic Programs. CoRR abs/2302.06082 (2023) - [i27]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 abs/2308.09536 (2023) - [i26]Philipp Schröer, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
A Deductive Verification Infrastructure for Probabilistic Programs. CoRR abs/2309.07781 (2023) - [i25]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 abs/2312.09662 (2023) - 2022
- [j12]Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner:
Generative Datalog with Continuous Distributions. J. ACM 69(6): 46:1-46:52 (2022) - [j11]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(OOPSLA1): 1-30 (2022) - [j10]Linpeng Zhang, Benjamin Lucien Kaminski:
Quantitative strongest post: a calculus for reasoning about the flow of quantitative information. Proc. ACM Program. Lang. 6(OOPSLA1): 1-29 (2022) - [i24]Linpeng Zhang, Benjamin Lucien Kaminski:
Quantitative Strongest Post. CoRR abs/2202.06765 (2022) - [i23]Kevin Batz, Adrian Gallus, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Tobias Winkler:
Weighted Programming. CoRR abs/2202.07577 (2022) - [i22]Kevin Batz, Mingshuai Chen, Sebastian Junges, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants. CoRR abs/2205.06152 (2022) - [i21]Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Lena Verscht:
A Calculus for Amortized Expected Runtimes. CoRR abs/2211.12923 (2022) - 2021
- [j9]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): 1-28 (2021) - [j8]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): 1-30 (2021) - [j7]Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner:
Probabilistic Data with Continuous Distributions. SIGMOD Rec. 50(1): 69-76 (2021) - [c16]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: 524-549 - [i20]Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner:
Probabilistic Data with Continuous Distributions. CoRR abs/2101.12289 (2021) - [i19]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 abs/2105.14100 (2021) - 2020
- [j6]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): 37:1-37:28 (2020) - [c15]Arnd Hartmanns, Benjamin Lucien Kaminski:
Optimistic Value Iteration. CAV (2) 2020: 488-511 - [c14]Kevin Batz, Sebastian Junges, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Philipp Schröer:
PrIC3: Property Directed Reachability for MDPs. CAV (2) 2020: 512-538 - [c13]Lutz Klinkenberg, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Joshua Moerman, Tobias Winkler:
Generating Functions for Probabilistic Programs. LOPSTR 2020: 231-248 - [c12]Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner:
Generative Datalog with Continuous Distributions. PODS 2020: 347-360 - [i18]Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner:
Generative Datalog with Continuous Distributions. CoRR abs/2001.06358 (2020) - [i17]Kevin Batz, Sebastian Junges, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Philipp Schröer:
PrIC3: Property Directed Reachability for MDPs. CoRR abs/2004.14835 (2020) - [i16]Lutz Klinkenberg, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Joshua Moerman, Tobias Winkler:
Generating Functions for Probabilistic Programs. CoRR abs/2007.06327 (2020) - [i15]Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Relatively Complete Verification of Probabilistic Programs. CoRR abs/2010.14548 (2020)
2010 – 2019
- 2019
- [b1]Benjamin Lucien Kaminski:
Advanced weakest precondition calculi for probabilistic programs. RWTH Aachen University, Germany, 2019 - [j5]Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
On the hardness of analyzing probabilistic programs. Acta Informatica 56(3): 255-285 (2019) - [j4]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): 34:1-34:29 (2019) - [p1]Benjamin Lucien Kaminski:
Erweiterte Verifikationskalküle für Probabilistische Programme. Ausgezeichnete Informatikdissertationen 2019: 129-138 - [i14]Alejandro Aguirre, Gilles Barthe, Justin Hsu, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Kantorovich Continuity of Probabilistic Programs. CoRR abs/1901.06540 (2019) - [i13]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 abs/1904.01117 (2019) - [i12]Arnd Hartmanns, Benjamin Lucien Kaminski:
Optimistic Value Iteration. CoRR abs/1910.01100 (2019) - 2018
- [j3]Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo:
Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms. J. ACM 65(5): 30:1-30:68 (2018) - [j2]Annabelle McIver, Carroll Morgan, Benjamin Lucien Kaminski, Joost-Pieter Katoen:
A new proof rule for almost-sure termination. Proc. ACM Program. Lang. 2(POPL): 33:1-33:28 (2018) - [j1]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): 4:1-4:50 (2018) - [c11]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: 186-213 - [c10]Maurice van Keulen, Benjamin Lucien Kaminski, Christoph Matheja, Joost-Pieter Katoen:
Rule-Based Conditioning of Probabilistic Data. SUM 2018: 290-305 - [i11]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 abs/1802.10433 (2018) - [i10]Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Thomas Noll:
Quantitative Separation Logic. CoRR abs/1802.10467 (2018) - 2017
- [c9]Benjamin Lucien Kaminski, Joost-Pieter Katoen:
A weakest pre-expectation semantics for mixed-sign expectations. LICS 2017: 1-12 - [i9]Benjamin Lucien Kaminski, Joost-Pieter Katoen:
A Weakest Pre-Expectation Semantics for Mixed-Sign Expectations. CoRR abs/1703.07682 (2017) - [i8]Annabelle McIver, Carroll Morgan, Benjamin Lucien Kaminski, Joost-Pieter Katoen:
A New Proof Rule for Almost-Sure Termination. CoRR abs/1711.03588 (2017) - 2016
- [c8]Nils Jansen, Christian Dehnert, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Lukas Westhofen:
Bounded Model Checking for Probabilistic Programs. ATVA 2016: 68-85 - [c7]Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo:
Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs. ESOP 2016: 364-389 - [c6]Federico Olmedo, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Reasoning about Recursive Probabilistic Programs. LICS 2016: 672-681 - [c5]Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Inferring Covariances for Probabilistic Programs. QEST 2016: 191-206 - [i7]Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo:
Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs. CoRR abs/1601.01001 (2016) - [i6]Federico Olmedo, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Reasoning about Recursive Probabilistic Programs. CoRR abs/1603.02922 (2016) - [i5]Nils Jansen, Christian Dehnert, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Lukas Westhofen:
Bounded Model Checking for Probabilistic Programs. CoRR abs/1605.04477 (2016) - [i4]Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Inferring Covariances for Probabilistic Programs. CoRR abs/1606.08280 (2016) - 2015
- [c4]Joost-Pieter Katoen, Friedrich Gretz, Nils Jansen, Benjamin Lucien Kaminski, Federico Olmedo:
Understanding Probabilistic Programs. Correct System Design 2015: 15-32 - [c3]Benjamin Lucien Kaminski, Joost-Pieter Katoen:
On the Hardness of Almost-Sure Termination. MFCS (1) 2015: 307-318 - [c2]Nils Jansen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Federico Olmedo, Friedrich Gretz, Annabelle McIver:
Conditioning in Probabilistic Programming. MFPS 2015: 199-216 - [i3]Friedrich Gretz, Nils Jansen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Annabelle McIver, Federico Olmedo:
Conditioning in Probabilistic Programming. CoRR abs/1504.00198 (2015) - [i2]Benjamin Lucien Kaminski, Joost-Pieter Katoen:
On the Hardness of Almost-Sure Termination. CoRR abs/1506.01930 (2015) - 2014
- [i1]Benjamin Lucien Kaminski, Joost-Pieter Katoen:
Analyzing Expected Outcomes and Almost-Sure Termination of Probabilistic Programs is Hard. CoRR abs/1410.7225 (2014) - 2011
- [c1]Raimondas Sasnauskas, Oscar Soria Dustmann, Benjamin Lucien Kaminski, Klaus Wehrle, Carsten Weise, Stefan Kowalewski:
Scalable Symbolic Execution of Distributed Systems. ICDCS 2011: 333-342
Coauthor Index
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-08-05 21:17 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:
