Ravichandhran Kandhadai Madhavan

Ph.D student and Doctoral Assistant
Laboratory for Automated Reasoning and Analysis
BC 355, EPFL
Station 14, 1015 Lausanne,
Switzerland
Email: ravi dot kandhadai at epfl dot ch

About me

I am a fifth 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 Lab India. I obtained my master's in Computer Science from Indian Institute of Science, Bangalore and bachelor's in Computer Science from College of Engineering, Guindy.

ACM author profile  Google Scholar Profile  DBLP Github

Software

• MuScaT:
          Multithreaded Scala Testing Framework (MuScaT) is a lightweight Scala library for systematically testing concurrent Scala programs.
• Orb:
          A resource bounds verifier for functional Scala programs that is part of the Leon Verification and Synthesis System.
          Try it online here: leondev.epfl.ch (look at resource bounds section)
• Grammar Online
          An online tutoring system for context-free grammars.
  
• Seal:
          A static analyzer for inferring side-effects of C# programs.
• NPEDetector:
          A verifier for proving absence of Null Pointer Exceptions in Java programs.

Professional Activities

• External Review Committee (ERC) PLDI 2017
• Additional reviewer for POPL 2014, SAS 2014, IJCAR 2014

Conference Publications

1. Contract-based Resource Verification for Higher-order Functions with Memoization
   Ravichandhran Madhavan, Sumith Kulal, Viktor Kuncak
   Principles of Programming Languages (POPL), 2017.
   Acceptance rate: 23% (64/286)
   (with proofs) (pptx) (Artifact)


2. A Scala Library for Testing Student Assignments on Concurrent Programming
   Mikaël Mayer and Ravichandhran Madhavan
   Scala Symposium (SCALA), 2016.
   Acceptance rate: ~67%
   (pptx)


3. Automating Grammar Comparison
   Ravichandhran Madhavan, Mikaël Mayer, Sumit Gulwani, and Viktor Kuncak
   Object Oriented Programming, Systems, Languages, and Applications (OOPSLA), 2015.
   Acceptance rate: 25% (53/210)
   (pptx) (Artifact)


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


5. Modular Heap Analysis of Higher Order Programs
   Ravichandhran Madhavan, G. Ramalingam, and Kapil Vaswani
   In Static Analysis Symposium (SAS), 2012.
   Acceptance rate: 40% (25/62).
   (pptx)


6. 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).
   (odp)


7. Purity Analysis: An Abstract Interpretation Formulation
   Ravichandhran Madhavan, G. Ramalingam, and Kapil Vaswani
   In Static Analysis Symposium (SAS), 2011.
   Acceptance rate: 33% (22/67)
   (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.
   

Technical Reports

1. Termination of Open Higher-Order Programs (with detailed proofs)
   Nicolas Voirol, Ravichandhran Madhavan, Viktor Kuncak
   EPFL Technical Report, 2017.


2. Verifying Resource Bounds of Programs with Lazy Evaluation and Memoization (with detailed proofs)
   Ravichandhran Madhavan, Sumith Kulal, Viktor Kuncak
   EPFL Technical Report, 2016.


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


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


5. 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.