| How to make ad hoc proof automation less ad hoc G Gonthier, B Ziliani, A Nanevski, D Dreyer ACM SIGPLAN Notices 46 (9), 163-175, 2011 | 63 | 2011 |
| Mtac: a monad for typed tactic programming in Coq B Ziliani, D Dreyer, NR Krishnaswami, A Nanevski, V Vafeiadis ACM SIGPLAN Notices 48 (9), 87-100, 2013 | 51 | 2013 |
| Mtac: A monad for typed tactic programming in Coq B Ziliani, D Dreyer, NR Krishnaswami, A Nanevski, V Vafeiadis Journal of functional programming 25, 2015 | 35 | 2015 |
| Lightweight proof by reflection using a posteriori simulation of effectful computation G Claret, LCG Huesca, Y Régis-Gianas, B Ziliani International Conference on Interactive Theorem Proving, 67-83, 2013 | 29 | 2013 |
| A unification algorithm for Coq featuring universe polymorphism and overloading B Ziliani, M Sozeau Proceedings of the 20th ACM SIGPLAN International Conference on Functional …, 2015 | 28 | 2015 |
| How to make ad hoc proof automation less ad hoc G Gonthier, B Ziliani, A Nanevski, D Dreyer Journal of Functional Programming 23 (4), 357-401, 2013 | 26 | 2013 |
| Mtac2: typed tactics for backward reasoning in Coq JO Kaiser, B Ziliani, R Krebbers, Y Régis-Gianas, D Dreyer Proceedings of the ACM on Programming Languages 2 (ICFP), 1-31, 2018 | 23 | 2018 |
| Decoding Lua: formal semantics for the developer and the semanticist M Soldevila, B Ziliani, B Silvestre, D Fridlender, F Mascarenhas Proceedings of the 13th ACM SIGPLAN International Symposium on on Dynamic …, 2017 | 11 | 2017 |
| A comprehensible guide to a new unifier for CIC including universe polymorphism and overloading B Ziliani, M Sozeau Journal of Functional Programming 27, 2017 | 9 | 2017 |
| Swapping: a natural bridge between named and indexed explicit substitution calculi A Mendelzon, A Ríos, B Ziliani arXiv preprint arXiv:1102.3730, 2011 | 3 | 2011 |
| Mechanizing bisimulation theorems for relation-changing logics in Coq R Fervari, F Trucco, B Ziliani International Workshop on Dynamic Logic, 3-18, 2019 | 2 | 2019 |
| Towards a better-behaved unification algorithm for Coq B Ziliani, M Sozeau RISC-Linz, 74, 2014 | 1 | 2014 |
| Verification of dynamic bisimulation theorems in Coq R Fervari, F Trucco, B Ziliani Journal of Logical and Algebraic Methods in Programming 120, 100642, 2021 | | 2021 |
| Understanding Lua’s Garbage Collection: Towards a Formalized Static Analyzer M Soldevila, B Ziliani, D Fridlender Proceedings of the 22nd International Symposium on Principles and Practice …, 2020 | | 2020 |
| Understanding Lua’s Garbage Collection M Soldevila, B Ziliani, D Fridlender | | 2020 |
| Decoding Lua: formal semantics for the developer and the semanticist ME Soldevila Raffa, B Ziliani, B Silvestre, DE Fridlender, F Mascarenhas Association for Computing Machinery, 2018 | | 2018 |
| The Next 700 Safe Tactic Languages B Ziliani, Y Régis-Gianas, JO Kaiser Submitted for publication, 2016 | | 2016 |
| Mtac: A monad for typed tactic programming... B Ziliani, D Dreyer, NR Krishnaswami, A Nanevski | | 2015 |
| Interactive typed tactic programming in the coq proof assistant B Ziliani | | 2015 |
| Generalization of Meta-Programs with Dependent Types in Mtac2 with Mtac2 I Tiraboschi, JO Kaiser, B Ziliani | | |
Derek DreyerMax Planck Institute for Software Systems (MPI-SWS), Saarland Informatics CampusVerified email at mpi-sws.org
