Great news! Our paper Parallel Complexity Analysis with Temporal Session Types (with Jan Hoffmann and Frank Pfenning) has been conditionally accepted to ICFP 2018. We define an elegant extension of session types inspired from linear temporal logic to analyze execution time of concurrent programs.
I am very excited that our paper Work Analysis with Resource-Aware Session Types (with Jan Hoffmann and Frank Pfenning) has been accepted to LICS 2018. Looking forward to seeing you all in Oxford in July! This work combines techniques from type-based amortized analysis with session types to analyze the sequential complexity of concurrent programs.
My mentor Akash Lal from Microsoft Research, India is presenting our paper Precise Null Pointer Analysis Through Global Value Numbering at ATVA in Pune! Please consider attending. We define a semantics-preserving program transformation inspired from global value numbering which drastically improves the precision of existing null pointer analysis techniques.
My undergraduate advisor Akshay S is presenting our paper On Petri Nets with Hierarchical Special Arcs at CONCUR in Berlin! Please consider attending. We solve several open problems regarding decidability of termination, reachability, converability and deadlock-freeness of Petri nets endowed with hierarchy.
I am super excited to attend the Dagstuhl seminar on Resource Bound Analysis. I will be presenting my research on Work Analysis of Session-Typed Programs. Looking forward to seeing you all there!
I will be presenting my paper on ML for ML: Learning Cost Semantics by Experiment at TACAS in Uppsala, Sweden! Please consider attending. This work uses machine learning techniques to learn a cost semantics for execution time of OCaml programs on a concrete hardware.
My advisor Jan Hoffmann is presenting our paper Towards Automatic Resource Bound Analysis for OCaml at POPL in Paris! Please consider attending.
I am looking forward to interning with Patrice Godefroid this summer at Microsoft Research, Redmond.
I will be serving on the admissions committee of the MS in Computer Science program at CMU.
I will be TAing for the course on Type Systems this fall at CMU.
I will be presenting my work on Learning Cost Semantics for Modeling Running Time of OCaml Programs at LOLA in New York.