Benjamin Lucien Kaminski

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Conditioning in Probabilistic Programming.
ACM Trans. Program. Lang. Syst., 2018

A new proof rule for almost-sure termination.
PACMPL, 2018

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

Quantitative Separation Logic.
CoRR, 2018

How long, O Bayesian network, will I sample thee? A program analysis perspective on expected sampling times.
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 New Proof Rule for Almost-Sure Termination.
CoRR, 2017

A Weakest Pre-Expectation Semantics for Mixed-Sign Expectations.
CoRR, 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
Reasoning about Recursive Probabilistic Programs.
CoRR, 2016

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

Inferring Covariances for Probabilistic Programs.
CoRR, 2016

Bounded Model Checking for Probabilistic Programs.
CoRR, 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.
Electr. Notes Theor. Comput. Sci., 2015

On the Hardness of Almost-Sure Termination.
CoRR, 2015

Conditioning in Probabilistic Programming.
CoRR, 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...