Name
Abstract | ||
|---|---|---|
We present Ellora, a sound and relatively complete assertion-based program logic, and demonstrate its expressivity by verifying several classical examples of randomized algorithms using an implementation in the EasyCrypt proof assistant. Ellora features new proof rules for loops and adversarial code, and supports richer assertions than existing program logics. We also show that Ellora allows convenient reasoning about complex probabilistic concepts by developing a new program logic for probabilistic independence and distribution law, and then smoothly embedding it into Ellora. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-319-89884-1_5 | ESOP |
DocType | Volume | Citations |
Journal | abs/1803.05535 | 0 |
PageRank | References | Authors |
0.34 | 30 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gilles Barthe | 1 | 2337 | 152.36 |
| Thomas Espitau | 2 | 49 | 9.18 |
| Marco Gaboardi | 3 | 377 | 38.26 |
| Benjamin Grégoire | 4 | 817 | 48.93 |
| Justin Hsu | 5 | 364 | 24.38 |
| Pierre-Yves Strub | 6 | 540 | 29.87 |