36 citations · 42 across the 2 of their papers we have counts for
2 papers
cs.PL2016★ 36 cited
Synthesizing Probabilistic Invariants via Doob's Decomposition
Gilles Barthe, Thomas Espitau, Luis María Ferrer Fioriti +1
When analyzing probabilistic computations, a powerful approach is to first find a martingale---an expression on the program variables whose expectation remains invariant---and then…
cs.LO2014★ 6 cited
MeGARA: Menu-based Game Abstraction and Abstraction Refinement of Markov Automata
Bettina Braitling, Luis María Ferrer Fioriti, Hassan Hatefi +3
Markov automata combine continuous time, probabilistic transitions, and nondeterminism in a single model. They represent an important and powerful way to model a wide range of comp…