Collaborated with:G.Barthe M.Gaboardi D.Dreyer M.Patrignani E.Çiçek A.A.0001 D.Swasey Michael Sammler T.Litak J.H.0002 I.Radicek F.Zuleger Weihao Qu Marco Vassena A.Russo Vineet Rajani D.Stefan L.Birkedal A.Bizjak T.Sato J.Hsu
Talks about:relat (4) probabilist (2) analysi (2) robust (2) reason (2) verif (2) level (2) cost (2) properti (1) composit (1)
Person: Deepak Garg 0001
DBLP: 0001:Deepak_Garg
Contributed to:
20182019
2017
20172018
201920192020Wrote 9 papers:
- ESOP-2018-0001BBBG0 #markov #probability #reasoning #relational #λ-calculus
- Relational Reasoning for Markov Chains in a Probabilistic Guarded Lambda Calculus (AA0, GB, LB, AB, MG, DG0), pp. 214–241.
- ESOP-2019-PatrignaniG #compilation #robust
- Robustly Safe Compilation (MP, DG0), pp. 469–498.
- OOPSLA-2017-Swasey0D #composition #robust #verification
- Robust and compositional verification of object capability patterns (DS, DG0, DD), p. 26.
- POPL-2017-CicekBG0H #cost analysis #relational
- Relational cost analysis (EÇ, GB, MG, DG0, JH0), pp. 316–329.
- POPL-2018-RadicekBG0Z #cost analysis #monad #relational
- Monadic refinements for relational cost analysis (IR, GB, MG, DG0, FZ), p. 32.
- PLDI-2019-CicekQBG0 #bidirectional #relational #type checking
- Bidirectional type checking for relational properties (EÇ, WQ, GB, MG, DG0), pp. 533–547.
- POPL-2019-SatoABGGH #approximate #convergence #higher-order #optimisation #probability #reasoning #source code #verification
- Formal verification of higher-order probabilistic programs: reasoning about approximation, convergence, Bayesian inference, and optimization (TS, AA0, GB, MG, DG0, JH), p. 30.
- POPL-2019-VassenaRGRS #data flow #information management
- From fine- to coarse-grained dynamic information flow control and back (MV, AR, DG0, VR, DS), p. 31.
- POPL-2020-SammlerGDL #low level
- The high-level benefits of low-level sandboxing (MS, DG0, DD, TL), p. 32.