2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.PL2026
Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams
Daniel Basgöze, Kevin Batz, Sebastian Junges +1
Weakest pre-expectations are the probabilistic program analogue to weakest preconditions in classical programs. Deductive verification approaches aim to establish bounds on these q…
cs.SE2022★ 2 cited
BDDs Strike Back: Efficient Analysis of Static and Dynamic Fault Trees
Daniel Basgöze, Matthias Volk, Joost-Pieter Katoen +2
Fault trees are a key model in reliability analysis. Classical static fault trees (SFT) can best be analysed using binary decision diagrams (BDD). State-based techniques are favora…