Seguir
Benjamin Lucien Kaminski
Benjamin Lucien Kaminski
Otros nombresBenjamin Kaminski
Professor of Computer Science at Saarland University and Lecturer at University College London
Dirección de correo verificada de cs.uni-saarland.de - Página principal
Título
Citado por
Citado por
Año
Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs
BL Kaminski, JP Katoen, C Matheja, F Olmedo
European Symposium on Programming (ESOP) 9632, 364-389, 2016
1562016
Reasoning about Recursive Probabilistic Programs
F Olmedo, BL Kaminski, JP Katoen, C Matheja
Logic in Computer Science (LICS), 672-681, 2016
1082016
A New Proof Rule for Almost-Sure Termination
A McIver, C Morgan, BL Kaminski, JP Katoen
Proceedings of the ACM on Programming Languages 2 (POPL), 1-28, 2017
102*2017
Conditioning in Probabilistic Programming
F Olmedo, F Gretz, N Jansen, BL Kaminski, JP Katoen, A McIver
ACM Transactions on Programming Languages and Systems (TOPLAS) 40 (1), 1-50, 2018
98*2018
Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms
BL Kaminski, JP Katoen, C Matheja, F Olmedo
Journal of the ACM (J.ACM) 65 (5), 1-68, 2018
912018
Quantitative Separation Logic: A Logic for Reasoning about Probabilistic Pointer Programs
K Batz, BL Kaminski, JP Katoen, C Matheja, T Noll
Proceedings of the ACM on Programming Languages 3 (POPL), 34, 2019
66*2019
On the Hardness of Almost–sure Termination
BL Kaminski, JP Katoen
Mathematical Foundations of Computer Science (MFCS), 307-318, 2015
602015
Optimistic Value Iteration
A Hartmanns, BL Kaminski
Computer Aided Verification (CAV), 488-511, 2020
562020
On the Hardness of Analyzing Probabilistic Programs
BL Kaminski, JP Katoen, C Matheja
Acta Informatica 56 (3), 255-285, 2019
552019
Advanced Weakest Precondition Calculi for Probabilistic Programs
BL Kaminski
Rheinisch-Westfälische Technische Hochschule Aachen, 2019
532019
Aiming low is harder: Induction for Lower Bounds in Probabilistic Program Verification
M Hark, BL Kaminski, J Giesl, JP Katoen
Proceedings of the ACM on Programming Languages 4 (POPL), 1-28, 2020
412020
Scalable Symbolic Execution of Distributed Systems
R Sasnauskas, OS Dustmann, BL Kaminski, K Wehrle, C Weise, ...
International Conference on Distributed Computing Systems (ICDCS), 333-342, 2011
372011
How long, O Bayesian network, will I sample thee?
K Batz, BL Kaminski, JP Katoen, C Matheja
European Symposium on Programming (ESOP), 186-213, 2018
35*2018
Bounded Model Checking for Probabilistic Programs
N Jansen, C Dehnert, BL Kaminski, JP Katoen, L Westhofen
Automated Technology for Verification and Analysis (ATVA) 9938, 68, 2016
322016
Understanding Probabilistic Programs
JP Katoen, F Gretz, N Jansen, BL Kaminski, F Olmedo
Correct System Design: Symposium in Honor of Ernst-Rüdiger Olderog on the …, 2015
262015
A Weakest Pre-expectation Semantics for Mixed-sign Expectations
BL Kaminski, JP Katoen
Logic In Computer Science (LICS), 1-12, 2017
252017
A Pre-expectation Calculus for Probabilistic Sensitivity
A Aguirre, G Barthe, J Hsu, BL Kaminski, JP Katoen, C Matheja
Proceedings of the ACM on Programming Languages 5 (POPL), 1-28, 2021
24*2021
Relatively Complete Verification of Probabilistic Programs: An Expressive Language for Expectation-based Reasoning
K Batz, BL Kaminski, JP Katoen, C Matheja
Proceedings of the ACM on Programming Languages 5 (POPL), 1-30, 2021
242021
Latticed k-Induction with an Application to Probabilistic Programs
K Batz, M Chen, BL Kaminski, JP Katoen, C Matheja, P Schröer
International Conference on Computer Aided Verification (CAV), 524-549, 2021
212021
Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants
K Batz, M Chen, S Junges, BL Kaminski, JP Katoen, C Matheja
Tools and Algorithms for the Construction and Analysis of Systems (TACAS …, 2023
202023
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20