Bi-Weekly Talk: Automated Run-Time Analysis of Probabilistic Programs
Wednesday, 07.01.2018, 10:15am
Location: RWTH Aachen University, Department of Computer Science - Ahornstr. 55, building E3, room 9u10
Speaker: Marcel Hark
The fully automated complexity analysis of non-probabilistic programs has been widely investigated. As probabilistic programs are becoming more and more popular we have to adapt our techniques to infer the expected run–time of probabilistic programs automatically. The talk will introduce the two concepts of almost–sure– and positive– almost sure–termination and give some ideas on how to analyze probabilistic programs automatically based on the semantics of a probabilistic program.