Collaborated with:J.Katoen C.Matheja K.Batz F.Olmedo A.McIver C.Morgan M.Hark J.Giesl T.N.0001
Talks about:program (4) probabilist (3) reason (2) expect (2) sampl (2) logic (2) time (2) precondit (1) perspect (1) bayesian (1)
Person: Benjamin Lucien Kaminski
DBLP: Kaminski:Benjamin_Lucien
Contributed to:
20162018
201820192020Wrote 5 papers:
- ESOP-2016-KaminskiKMO #probability #reasoning #source code
- Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs (BLK, JPK, CM, FO), pp. 364–389.
- ESOP-2018-BatzKKM #how #network #program analysis
- How long, O Bayesian network, will I sample thee? - A program analysis perspective on expected sampling times (KB, BLK, JPK, CM), pp. 186–213.
- POPL-2018-McIverMKK #proving #termination
- A new proof rule for almost-sure termination (AM, CM, BLK, JPK), p. 28.
- POPL-2019-BatzKKMN #logic #pointer #probability #reasoning #source code
- Quantitative separation logic: a logic for reasoning about probabilistic pointer programs (KB, BLK, JPK, CM, TN0), p. 29.
- POPL-2020-HarkKGK #bound #induction #probability #verification
- Aiming low is harder: induction for lower bounds in probabilistic program verification (MH, BLK, JG, JPK), p. 28.