You have reached my academic website. Welcome!

I have obtained my PhD in Programming Languages at MPI-SWS (Max Planck Institute for Software Systems, Saarbrücken, Germany) and Saarland University in January 2018. I was advised by Deepak Garg.

I am currently a Software Engineer at Facebook’s Static Analysis team, Infer. Nowadays, I am working on a static analysis tool for detecting performance regressions at diff time.

 

My research interests are

• type systems with an emphasis on refinements, dependent types, and resource usage
• incremental computation
• relational reasoning
• bidirectional programming.

I graduated from Bilkent University’s Computer Engineering Department in 2011.

Theses

• Relational Cost Analysis. Ezgi Cicek, PhD Thesis, University of Saarland, 2018.

Publications

• Bidirectional Typechecking For Relational Properties. Ezgi Cicek, Weihao Qu, Gilles Barthe, Marco Gaboardi and Deepak Garg, 40th ACM SIGPLAN Conference on Programming Languages Design and Implementation PLDI’19. (appendix)
• Relational Cost Analysis. Ezgi Cicek, Gilles Barthe, Marco Gaboardi, Deepak Garg and Jan Hoffmann, 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL’17. (appendix)
• A Type Theory for Incremental Computational Complexity with Control Flow Changes.  Ezgi Çiçek,  Zoe Paraskevopoulou and Deepak Garg, 21st ACM SIGPLAN International Conference on Functional Programming, ICFP’16. (appendix)
• Refinement Types for Incremental Computational Complexity Ezgi Çiçek, Umut Acar and Deepak Garg, 24th European Symposium on Programming, ESOP’15. (appendix)

Workshop Publications

• Cost-analysis: How do monads and comonads differ? Ezgi Çiçek, Marco Gaboardi and Deepak Garg at DICE 16 (Developments on Implicit Computational Complexity, co-located with ETAPS). [video]
• Language Support for Efficient Dynamic Computation Umut Acar, Ezgi Çiçek and Deepak Garg OBT’13 (Off the Beaten Track Workshop, co-located with POPL).

News

The last unpublished part of my PhD is finally accepted to PLDI’19!

I am done with my PhD!

I am invited to the Dagstuhl Seminar on “Resource Bound Analysis“.

I have attended to the NII Schonan Meeting on “Semantics of Effects, Resources and Applications” in Shonan Village near Tokyo, Japan.

I have attended the Dagstuhl Seminar on “Programming Language Techniques for Incremental and Reactive Computing“.

I recently completed a research internship on bidirectional graph transformations at National Institute of Informatics (NII) in Tokyo, Japan. I worked on a proof system for guaranteeing free-edits to bidirectional graph transformations with Asst. Prof. Soichiro Hidaka at Programming Research Lab.

Awards

First Place (Graduate), ACM Student Reseach Competiton at POPL 2015, Mumbai, India

Recipient, Google Anita Borg Scholarship in 2012, EMEA.

Service

• I was on the PC of the 2019 ACM SIGPLAN International Conference on Functional Programming (ICFP’19).
• I was on the PC of the Workshop on Developments in Implicit Computational complExity & Foundational & Practical Aspects of Resource Analysis (DICE/FOPARA’19).
• I am serving on the PC of the 2018 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM’18).
• I was on the PC of the 1st Workshop on Incremental Computing (IC’17).
• I have served on the POPL’17 Artifact Evaluation Committee.
• For the 2014-2015 year, I was the graduate student representative at MPI-SWS.

 

Posters

CostIt: Refinement Types for Incremental Computational Complexity. (appeared on MPI-SWS’14 Retreat)

A Type System for Incremental Computational Complexity. (appeared on POPL’14 Student Poster Session and MPI-SWS’13 Advisory Board Meeting)

Workshops/Summer Schools

If you are interested in type systems or functional programming, here is a list of summer schools and workshops you can attend:

PLMW  co-located with POPL.

MGS organized  in the UK.

OPLSS in Eugene, OR.

ScienceSLAM

I am a fan of ScienceSLAMs -10 minute entertaining research talks for human beings-. You can watch my ScienceSLAM talk from CEBIT’13.