Ravichandhran Kandhadai Madhavan


getPhoto.jpg


Ph.D student and Doctoral Assistant

Laboratory for Automated Reasoning and Analysis
BC 355, EPFL, 

Station 14, 1015 Lausanne, 

Switzerland

Email: ravi.kandhadai@epfl.ch


About me 

I am a fourth year Ph.D student advised by Viktor Kuncak. My research interests lie in the areas of programming languages, static program analysis and software verification.
My current and past research has been mainly focused on static analysis of higher-order, object-oriented programs. I have developed softwares for analysing programs written in Java, C# and Scala. Before joining EPFL, I was working as a Research Assistant in the Programming Languages and Tools group of Microsoft Research India. I obtained my masters in Computer Science from Indian Institute of Science, Bangalore and bachelors in Computer Science from College of Engineering, Guindy. 

ACM author profile, Google Scholar Profile, DBLP


Softwares

Conference Publications

  1. Automating Grammar Comparison
    Ravichandhran Madhavan, Mikaël Mayer, Sumit Gulwani, and Viktor Kuncak
    Object Oriented Programming, Systems, Languages, and Applications (OOPSLA), 2015. Acceptance rate: 26% (53/201)
    PDF  Slides (pptx)

  2. Symbolic Resource Bound Inference For Functional Programs
    Ravichandhran Madhavan, and Viktor Kuncak
    In Computer Aided Verification (CAV), 2014. Acceptance rate: 25% (57/229)
    PDF  Slides (pptx)

  3. Modular Heap Analysis of Higher Order Programs
    Ravichandhran Madhavan, G. Ramalingam, and Kapil Vaswani
    In Static Analysis Symposium (SAS), 2012.
    PDF  Slides (pptx)

  4. Null dereference verification via over-approximated weakest precondition analysis
    Ravichandhran Madhavan, Raghavan Komondoor
    In Object Oriented Programming, Systems, Languages, and Applications (OOPSLA), 2011. Acceptance rate: 37% (61/166).
    PDF
      Slides (odp)

  5. Purity Analysis: An Abstract Interpretation Formulation
    Ravichandhran Madhavan, G. Ramalingam, and Kapil Vaswani
    In Static Analysis Symposium (SAS), 2011. Acceptance rate: 33% (22/67)
    PDF  Slides (pptx)

Journal Publications

  1. A Framework For Efficient Modular Heap Analysis
    Ravichandhran Madhavan, G. Ramalingam, and Kapil Vaswani.
    In Foundations and Trends In Programming Languages, Volume 1, Issue 4, 2015.
    PDF

Technical Reports

  1. Verifying Resource Bounds of Programs with Lazy Evaluation and Memoization
    Ravichandhran Madhavan, Viktor Kuncak
    EPFL Technical Report, 2016.

  2. Towards Automating Grammar Equivalence Checking
    Ravichandhran Madhavan, Mikaël Mayer, Sumit Gulwani, Viktor Kuncak
    EPFL Technical Report, 2015.

  3. Symbolic Resource Bound Inference For Functional Programs (with detailed proofs)
    Ravichandhran Madhavan, Viktor Kuncak
    EPFL Technical Report, 2013.

  4. Purity Analysis: An Abstract Interpretation Formulation (with detailed proofs)
    Ravichandhran Madhavan, G. Ramalingam, and Kapil Vaswani
    Microsoft Research Technical Report MSR-TR-2011-102, 2011.
    PDF