Home


Hi! I am S P Suresh. Welcome to my home page. I am on the faculty of Theoretical Computer Science at the Chennai Mathematical Institute. My research interests include logic in computer science, concurrency and distributed computing, and formal methods for security. I did my PhD at the Institute of Mathematical Sciences with Jam.

My other interests include classical Indian logic and epistemology, Carnatic music, chess, and P G Wodehouse. And my mission in life is to prove beautiful theorems and present them in beautifully typeset papers!

Publications


  • The complexity of disjunction in intuitionistic logic [Technical report]
    R Ramanujam, Vaishnavi Sundararajan and S P Suresh
    Under submission.

  • Effective verification of Replicated Data Types using Later Appearance Records (LAR) [PDF]
    Madhavan Mukund, Gautham Shenoy R and S P Suresh
    To be presented at ATVA 2015.

  • Bounded Implementations of Replicated Data Types [PDF | BibTeX]
    Madhavan Mukund, Gautham Shenoy R and S P Suresh
    Proc. VMCAI 2015, Springer LNCS volume 8931, pages 355–372.

  • Extending Dolev-Yao with assertions [PDF | BibTeX]
    R Ramanujam, Vaishnavi Sundararajan and S P Suresh
    Proc. ICISS 2014, Springer LNCS volume 8880, pages 50–68.

  • 34th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2014) [Proceedings]
    Venkatesh Raman and S P Suresh (Editors)
    LIPIcs volume 29, 2014.

  • Optimized OR-Sets Without Ordering Constraints [Conference version | BibTeX | Technical report]
    Madhavan Mukund, Gautham Shenoy R and S P Suresh
    Proc. ICDCN 2014, Springer LNCS volume 8314, pages 227–241.

  • Primal infon logic: derivability in polynomial time [Conference version | BibTeX | Technical report | Slides]
    A Baskar, Prasad Naldurg, K R Raghavendra and S P Suresh
    Proc. FSTTCS 2013, LIPIcs volume 24, pages 162–174.

  • On bounded version vectors [PDF]
    Madhavan Mukund, Gautham Shenoy R and S P Suresh
    Technical Report. August 2012.

  • Challenges for epistemic logic from security protocols [PDF | BibTeX]
    R Ramanujam and S P Suresh
    Games, Norms and Reasons: Logic at the Crossroads, volume 353, Synthese Library, pages 215–231. April 2011.

  • A DEXPTIME-complete Dolev-Yao theory with distributive encryption [Conference version | BibTeX | Technical report]
    A Baskar, R Ramanujam and S P Suresh
    Proc. MFCS 2010, Springer LNCS volume 6281, pages 102–113.

  • A Dolev-Yao model for Zero-Knowledge [PDF | BibTeX]
    A Baskar, R Ramanujam and S P Suresh
    Proc. ASIAN 2009, Springer LNCS volume 5913, pages 137–146.

  • Knowledge-based modelling of voting protocols [ PDF | BibTeX]
    A Baskar, R Ramanujam and S P Suresh
    Proc. TARK 2007, pages 62–71.

  • A (restricted) quantifier elimination for security protocols [PDF | BibTeX]
    R Ramanujam and S P Suresh
    Theoretical Computer Science, volume 367, 2006, pages 228–256.

  • Generic verification of security protocols [PDF | BibTeX]
    Abdul Sahid Khan, Madhavan Mukund and S P Suresh
    Proc. SPIN 2005, Springer LNCS 3639, pages 221–235.

  • Decidability of context-explicit security protocols [PDF | BibTeX]
    R Ramanujam and S P Suresh
    Journal of Computer Security, volume 13(1), 2005, pages 135–165.

  • Deciding knowledge properties of security protocols [PDF | BibTeX]
    R Ramanujam and S P Suresh
    Proc. TARK 2005, pages 219–235.

  • Tagging makes secrecy decidable for unbounded nonces as well [PDF | BibTeX]
    R Ramanujam and S P Suresh
    Proc. FSTTCS 2003, Springer LNCS 2914, pages 363–374.

  • Foundations of Security Protocol Analysis [PDF]
    S P Suresh
    PhD Thesis, Madras University, November 2003.

  • An equivalence on terms for security protocols [PDF]
    R Ramanujam and S P Suresh
    Proc. AVIS 2003, pages 45–56.

  • A decidable subclass of unbounded security protocols [PDF]
    R Ramanujam and S P Suresh
    Proc. WITS 2003, pages 11–20.

  • Semi-deterministic extensions of fixed-point logic [PDF]
    S P Suresh
    MSc Thesis, Anna University, June 1999.

Professional activities