Cited By
View all- Batz KBiskup TKatoen JWinkler T(2024)Programmatic Strategy Synthesis: Resolving Nondeterminism in Probabilistic ProgramsProceedings of the ACM on Programming Languages10.1145/36329358:POPL(2792-2820)Online publication date: 5-Jan-2024
- Müllner JMoosbrugger MKovács L(2024)Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) ProgramsProceedings of the ACM on Programming Languages10.1145/36328728:POPL(882-910)Online publication date: 5-Jan-2024
- Schröer PBatz KKaminski BKatoen JMatheja C(2023)A Deductive Verification Infrastructure for Probabilistic ProgramsProceedings of the ACM on Programming Languages10.1145/36228707:OOPSLA2(2052-2082)Online publication date: 16-Oct-2023
- Show More Cited By