S. Sheerazuddin
S. Sheerazuddin
Assistant Professor
Office Address:
Ph.D. Theoretical Computer Science, The Institute of Mathematical Sciences, Chennai 2013.
M.Sc. Theoretical Computer Science, The Institute of Mathematical Sciences, Chennai 2005.
B.Tech. Computer Science and Engineering, REC Calicut, 2002.
Educational Qualifications
-
Ph.D. Theoretical Computer Science, The Institute of Mathematical Sciences, Chennai 2013.
-
M.Sc. Theoretical Computer Science, The Institute of Mathematical Sciences, Chennai 2005.
-
B.Tech. Computer Science and Engineering, REC Calicut, 2002.
Journals
DBLP Listing
Google Scholar Listing
-
S. Sheerazuddin, Anand S and Anish Badhri R S, A Scheme to Model-check Services with Unboundedly many Clients using NuSMV, CoRR, arXiV:1812.00183 (2018)
-
R. Ramanujam and S. Sheerazuddin, Automata Models for Verification of Services with Unboundedly many Clients, chapter in the book Automata, Graphs and Logic, Narosa, to appear.
-
S. Sheerazuddin and K. Sriram, Identifying Conflicting Routes in Control Table of Indian Railways Interlocking System using NuSMV, International Journal of Computer Applications vol. 146(7), pp. 1-6, 2016
-
R. Ramanujam and S. Sheerazuddin, Realizable Temporal Logics for Web service Choreographies, Journal of Logical and Algebraical Methods in Programming,vol. 85(5-1), pp. 759-781, 2016
-
Sanjana Sahayaraj and S. Sheerazuddin. Formal Methods for Business Processes: A Survey, In Proceedings of the World Congress on Engineering and Computer Science (WCECS) 2015
-
R. Ramanujam and S. Sheerazuddin, A Local Logic for Realizability in Web service Choreographies, In Proceedings of International Workshop on Automated Specification and Verification of Web Systems (WWV’14), EPTCS vol. 163, pp.16-35, 2014
-
S. Sheerazuddin, Temporal Specifications of Client-Server Systems and Unbounded Agents, PhD thesis, 2013. Supervisor: R. Ramanujam
-
S. Sheerazuddin, Temporal Specifications for Services with Unboundedly Many Passive Clients, In Proceedings of International Conference on Distributed Computing and Networking (ICDCN’11). Lecture Notes in Computer Science, vol 6522, pp. 179-90, Springer, Berlin, Heidelberg 2011
-
S. Sheerazuddin, A Toy Logic for Programs with Pointers, Masters thesis, 2005. Supervisor: R. Ramanujam
Research Interests
-
Formal Verification
-
Model Checking
-
Logic in Computer Science
-
Certified Programming
Ph.D. Students
-
Tephilla Prince (co-guide Ramchandra Phawade) (2018 - )
-
Alphy George (co-guide Muralikrishnan K) (2021 - )
-
Shabana AT (co-guide Muralikrishnan K) (2021 - )
My Research Group
Algorithms & Formal Methods Faculty Research Group
Related Stuff
-
Z3 click here
-
CMBC click here
-
Coq click here
-
Iris click here