| CertiCoq: A verified compiler for Coq A Anand, A Appel, G Morrisett, Z Paraskevopoulou, R Pollack, ... The third international workshop on Coq for programming languages (CoqPL), 2017 | 146 | 2017 |
| Foundational property-based testing Z Paraskevopoulou, C Hriţcu, M Dénès, L Lampropoulos, BC Pierce Interactive Theorem Proving: 6th International Conference, ITP 2015, Nanjing …, 2015 | 98 | 2015 |
| Generating good generators for inductive relations L Lampropoulos, Z Paraskevopoulou, BC Pierce Proceedings of the ACM on Programming Languages 2 (POPL), 1-30, 2017 | 63 | 2017 |
| Meta-F: Proof Automation with SMT, Tactics, and Metaprograms G Martínez, D Ahman, V Dumitrescu, N Giannarakis, C Hawblitzel, ... European Symposium on Programming, 30-59, 2019 | 59 | 2019 |
| Closure conversion is safe for space Z Paraskevopoulou, AW Appel Proceedings of the ACM on Programming Languages 3 (ICFP), 1-29, 2019 | 39 | 2019 |
| QuickChick: Property-based testing for Coq M Dénès, C Hritcu, L Lampropoulos, Z Paraskevopoulou, BC Pierce The Coq Workshop 125, 126, 2014 | 35 | 2014 |
| Compositional optimizations for CertiCoq Z Paraskevopoulou, JM Li, AW Appel Proceedings of the ACM on Programming Languages 5 (ICFP), 1-30, 2021 | 25 | 2021 |
| A type theory for incremental computational complexity with control flow changes E Çiçek, Z Paraskevopoulou, D Garg ACM SIGPLAN Notices 51 (9), 132-145, 2016 | 23 | 2016 |
| Computing correctly with inductive relations Z Paraskevopoulou, A Eline, L Lampropoulos Proceedings of the 43rd ACM SIGPLAN International Conference on Programming …, 2022 | 18 | 2022 |
| Compiling with continuations, correctly Z Paraskevopoulou, A Grover Proceedings of the ACM on Programming Languages 5 (OOPSLA), 1-29, 2021 | 10 | 2021 |
| Verified Optimizations for Functional Languages Z Paraskevopoulou Princeton University, 2020 | 7 | 2020 |
| Meta-F*: Metaprogramming and tactics in an effectful program verifier G Martınez, D Ahman, V Dumitrescu, N Giannarakis, C Hawblitzel, ... European Symposium on Programming (ESOP), 2019 | 5 | 2019 |
| Generating good generators for inductive relations. PACMPL 2, POPL (2018), 45: 1–45: 30 L Lampropoulos, Z Paraskevopoulou, BC Pierce | 4 | 2018 |
| RichWasm: Bringing Safe, Fine-Grained, Shared-Memory Interoperability Down to WebAssembly Z Paraskevopoulou, M Fitzgibbons, M Thalakottur, N Mushtak, JS Mazur, ... arXiv preprint arXiv:2401.08287, 2024 | 3 | 2024 |
| RichWasm: Bringing Safe, Fine-Grained, Shared-Memory Interoperability Down to WebAssembly M Fitzgibbons, Z Paraskevopoulou, N Mushtak, M Thalakottur, ... Proceedings of the ACM on Programming Languages 8 (PLDI), 1656-1679, 2024 | 2 | 2024 |
| A Coq framework for verified property-based testing Z Paraskevopoulou, C Hritcu Internship Report, Inria Paris-Rocquencourt, 2014 | 2 | 2014 |
| Making Our Own Luck A Language for Random Generators L Lampropoulos, BC Pierce, C Hriţcu, J Hughes, Z Paraskevopoulou, ... Workshop on Probabilistic Programming Semantics 2016, 2015 | 1 | 2015 |
| A type theory for incremental computational complexity with control flow changes D Garg, E Çiçek, Z Paraskevopoulou | | 2016 |
| QuickChick: A Coq Framework For Verified Property Based Testing Z Paraskevopoulou, C Hritcu | | 2014 |
| Making Our Own Luck L Lampropoulos, BC Pierce, C Hritcu, J Hughes, Z Paraskevopoulou, ... | | |
Cătălin HrițcuTenured Faculty at MPI-SPVahvistettu sähköpostiosoite verkkotunnuksessa mpi-sp.org
