Benjamin Lucien Kaminski

According to our database, Benjamin Lucien Kaminski authored at least 43 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2024

Quantitative Weakest Hyper Pre: Unifying Correctness and Incorrectness Hyperproperties via Predicate Transformers.

Linpeng Zhang, Noam Zilberstein, Benjamin Lucien Kaminski, Alexandra Silva

Proc. ACM Program. Lang., 2024

2023

A Deductive Verification Infrastructure for Probabilistic Programs.

Philipp Schröer, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja

Proc. ACM Program. Lang., October, 2023

A Deductive Verification Infrastructure for Probabilistic Programs - Artifact Evaluation.

Philipp Schröer, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja

Dataset, July, 2023

Lower Bounds for Possibly Divergent Probabilistic Programs.

Shenghua Feng, Mingshuai Chen, Han Su, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Naijun Zhan

Proc. ACM Program. Lang., April, 2023

A Calculus for Amortized Expected Runtimes.

Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Lena Verscht

Proc. ACM Program. Lang., January, 2023

Hoare-Like Triples and Kleene Algebras with Top and Tests: Towards a Holistic Perspective on Hoare Logic, Incorrectness Logic, and Beyond.

Lena Verscht, Benjamin Lucien Kaminski

CoRR, 2023

The 19th International Workshop on Termination (WST 2023): Preface, Invited Talk Abstract, and Tool Descriptions.

Akihisa Yamada, Benjamin Lucien Kaminski, Dieter Hofbauer, Fred Mesnard, Étienne Payet

CoRR, 2023

Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants.

Kevin Batz, Mingshuai Chen, Sebastian Junges, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

2022

Quantitative strongest post: a calculus for reasoning about the flow of quantitative information.

Linpeng Zhang, Benjamin Lucien Kaminski

Proc. ACM Program. Lang., 2022

Weighted programming: a programming paradigm for specifying mathematical models.

Kevin Batz, Adrian Gallus, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Tobias Winkler

Proc. ACM Program. Lang., 2022

Generative Datalog with Continuous Distributions.

Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner

J. ACM, 2022

Weighted Programming.

Kevin Batz, Adrian Gallus, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Tobias Winkler

CoRR, 2022

Quantitative Strongest Post.

Linpeng Zhang, Benjamin Lucien Kaminski

CoRR, 2022

2021

Probabilistic Data with Continuous Distributions.

Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner

SIGMOD Rec., 2021

Relatively complete verification of probabilistic programs: an expressive language for expectation-based reasoning.

Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja

Proc. ACM Program. Lang., 2021

A pre-expectation calculus for probabilistic sensitivity.

Alejandro Aguirre, Gilles Barthe, Justin Hsu, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja

Proc. ACM Program. Lang., 2021

Latticed k-Induction with an Application to Probabilistic Programs.

Kevin Batz, Mingshuai Chen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Philipp Schröer

Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

2020

Aiming low is harder: induction for lower bounds in probabilistic program verification.

Marcel Hark, Benjamin Lucien Kaminski, Jürgen Giesl, Joost-Pieter Katoen

Proc. ACM Program. Lang., 2020

Relatively Complete Verification of Probabilistic Programs.

Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja

CoRR, 2020

Generating Functions for Probabilistic Programs.

Lutz Klinkenberg, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Joshua Moerman, Tobias Winkler

Proceedings of the Logic-Based Program Synthesis and Transformation, 2020

Optimistic Value Iteration.

Arnd Hartmanns, Benjamin Lucien Kaminski

Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

PrIC3: Property Directed Reachability for MDPs.

Kevin Batz, Sebastian Junges, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Philipp Schröer

Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

2019

Erweiterte Verifikationskalküle für Probabilistische Programme.

Benjamin Lucien Kaminski

Proceedings of the Ausgezeichnete Informatikdissertationen 2019., 2019

Advanced weakest precondition calculi for probabilistic programs.

Benjamin Lucien Kaminski

PhD thesis, 2019

Quantitative separation logic: a logic for reasoning about probabilistic pointer programs.

Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Thomas Noll

Proc. ACM Program. Lang., 2019

Aiming Low Is Harder - Inductive Proof Rules for Lower Bounds on Weakest Preexpectations in Probabilistic Program Verification.

Marcel Hark, Benjamin Lucien Kaminski, Jürgen Giesl, Joost-Pieter Katoen

CoRR, 2019

Kantorovich Continuity of Probabilistic Programs.

Alejandro Aguirre, Gilles Barthe, Justin Hsu, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja

CoRR, 2019

On the hardness of analyzing probabilistic programs.

Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja

Acta Informatica, 2019

2018

A new proof rule for almost-sure termination.

Annabelle McIver, Carroll Morgan, Benjamin Lucien Kaminski, Joost-Pieter Katoen

Proc. ACM Program. Lang., 2018

Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms.

Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo

J. ACM, 2018

Quantitative Separation Logic.

Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Thomas Noll

CoRR, 2018

Rule-Based Conditioning of Probabilistic Data.

Maurice van Keulen, Benjamin Lucien Kaminski, Christoph Matheja, Joost-Pieter Katoen

Proceedings of the Scalable Uncertainty Management - 12th International Conference, 2018

How long, O Bayesian network, will I sample thee? - A program analysis perspective on expected sampling times.

Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja

Proceedings of the Programming Languages and Systems, 2018

2017

A weakest pre-expectation semantics for mixed-sign expectations.

Benjamin Lucien Kaminski, Joost-Pieter Katoen

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016

Inferring Covariances for Probabilistic Programs.

Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja

Proceedings of the Quantitative Evaluation of Systems - 13th International Conference, 2016

Reasoning about Recursive Probabilistic Programs.

Federico Olmedo, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs.

Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo

Proceedings of the Programming Languages and Systems, 2016

Bounded Model Checking for Probabilistic Programs.

Nils Jansen, Christian Dehnert, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Lukas Westhofen

Proceedings of the Automated Technology for Verification and Analysis, 2016

2015

Conditioning in Probabilistic Programming.

Nils Jansen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Federico Olmedo, Friedrich Gretz, Annabelle McIver

Proceedings of the 31st Conference on the Mathematical Foundations of Programming Semantics, 2015

On the Hardness of Almost-Sure Termination.

Benjamin Lucien Kaminski, Joost-Pieter Katoen

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Understanding Probabilistic Programs.

Joost-Pieter Katoen, Friedrich Gretz, Nils Jansen, Benjamin Lucien Kaminski, Federico Olmedo

Proceedings of the Correct System Design, 2015

2014

Analyzing Expected Outcomes and Almost-Sure Termination of Probabilistic Programs is Hard.

Benjamin Lucien Kaminski, Joost-Pieter Katoen

CoRR, 2014

2011

Scalable Symbolic Execution of Distributed Systems.

Raimondas Sasnauskas, Oscar Soria Dustmann, Benjamin Lucien Kaminski, Klaus Wehrle, Carsten Weise, Stefan Kowalewski

Proceedings of the 2011 International Conference on Distributed Computing Systems, 2011