| Relational Cost Analysis E Çiçek Max Planck Institute for Software Systems, 2018 | 94 | 2018 |
| Relational Cost Analysis E Çiçek, G Barthe, M Gaboardi, D Garg, J Hoffmann 44th Symposium on Principles of Programming Languages (POPL’17) 2017, 0 | 94* | |
| Refinement types for incremental computational complexity E Çiçek, D Garg, U Acar Programming Languages and Systems: 24th European Symposium on Programming …, 2015 | 39 | 2015 |
| 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 | 22 | 2016 |
| Bidirectional type checking for relational properties E Çiçek, W Qu, G Barthe, M Gaboardi, D Garg Proceedings of the 40th ACM SIGPLAN Conference on Programming Language …, 2019 | 19 | 2019 |
| Static resource analysis at scale E Çiçek, M Bouaziz, S Cho, D Distefano Static Analysis: 27th International Symposium, SAS 2020, Virtual Event …, 2020 | 6 | 2020 |
| A type theory for incremental computational complexity with control flow changes D Garg, E Çiçek, Z Paraskevopoulou | | 2016 |
| Refinement Types for Incremental Computational Complexity D Garg, E Çiçek, UA Acar | | 2015 |
| Refinement Types for Incremental Computational Complexity (Technical Appendix) E Çiçek, D Garg, U Acar | | |
| A Type Theory for Incremental Computational Complexity with Control Flow Changes (Technical Appendix) E Çiçek, Z Paraskevopoulou, D Garg | | |
| Cost-analysis: How do monads and comonads differ? E Ciçek, M Gaboardi, D Garg | | |
| Language Support for Efficient Dynamic Computation UA Acar, E Cicek, D Garg Carnegie Mellon University, 0 | | |
| POPL: G: Refinement Types for Incremental Computational Complexity E Çiçek | | |
Deepak GargMax Planck Institute for Software Systems (MPI-SWS), Saarland Informatics Campus (SIC)Verified email at mpi-sws.org
