Benjamin Lucien Kaminski

Orcid: 0000-0001-5185-2324

Affiliations:
  • Saarland University, Germany
  • University College London, UK
  • RWTH Aachen University, Germany (former, PhD 2019)


According to our database1, Benjamin Lucien Kaminski authored at least 42 papers between 2011 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A Deductive Verification Infrastructure for Probabilistic Programs.
Proc. ACM Program. Lang., October, 2023

A Deductive Verification Infrastructure for Probabilistic Programs - Artifact Evaluation.
Dataset, July, 2023

Lower Bounds for Possibly Divergent Probabilistic Programs.
Proc. ACM Program. Lang., April, 2023

A Calculus for Amortized Expected Runtimes.
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.
CoRR, 2023

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

Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants.
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.
Proc. ACM Program. Lang., 2022

Weighted programming: a programming paradigm for specifying mathematical models.
Proc. ACM Program. Lang., 2022

Generative Datalog with Continuous Distributions.
J. ACM, 2022

Weighted Programming.
CoRR, 2022

Quantitative Strongest Post.
CoRR, 2022

2021
Probabilistic Data with Continuous Distributions.
SIGMOD Rec., 2021

Relatively complete verification of probabilistic programs: an expressive language for expectation-based reasoning.
Proc. ACM Program. Lang., 2021

A pre-expectation calculus for probabilistic sensitivity.
Proc. ACM Program. Lang., 2021

Latticed k-Induction with an Application to Probabilistic Programs.
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

2020
Aiming low is harder: induction for lower bounds in probabilistic program verification.
Proc. ACM Program. Lang., 2020

Relatively Complete Verification of Probabilistic Programs.
CoRR, 2020

Generating Functions for Probabilistic Programs.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2020

Optimistic Value Iteration.
Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

PrIC3: Property Directed Reachability for MDPs.
Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

2019
Erweiterte Verifikationskalküle für Probabilistische Programme.
Proceedings of the Ausgezeichnete Informatikdissertationen 2019., 2019

Advanced weakest precondition calculi for probabilistic programs.
PhD thesis, 2019

Quantitative separation logic: a logic for reasoning about probabilistic pointer programs.
Proc. ACM Program. Lang., 2019

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

Kantorovich Continuity of Probabilistic Programs.
CoRR, 2019

On the hardness of analyzing probabilistic programs.
Acta Informatica, 2019

2018
A new proof rule for almost-sure termination.
Proc. ACM Program. Lang., 2018

Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms.
J. ACM, 2018

Quantitative Separation Logic.
CoRR, 2018

Rule-Based Conditioning of Probabilistic Data.
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.
Proceedings of the Programming Languages and Systems, 2018

2017
A weakest pre-expectation semantics for mixed-sign expectations.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016
Inferring Covariances for Probabilistic Programs.
Proceedings of the Quantitative Evaluation of Systems - 13th International Conference, 2016

Reasoning about Recursive Probabilistic Programs.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs.
Proceedings of the Programming Languages and Systems, 2016

Bounded Model Checking for Probabilistic Programs.
Proceedings of the Automated Technology for Verification and Analysis, 2016

2015
Conditioning in Probabilistic Programming.
Proceedings of the 31st Conference on the Mathematical Foundations of Programming Semantics, 2015

On the Hardness of Almost-Sure Termination.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Understanding Probabilistic Programs.
Proceedings of the Correct System Design, 2015

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

2011
Scalable Symbolic Execution of Distributed Systems.
Proceedings of the 2011 International Conference on Distributed Computing Systems, 2011


  Loading...