BITS Pilani

  • Page last updated on Friday, December 25, 2020


Abhishek Kr Singh

Abhishek Kr Singh

PhD in Computer Science, TIFR Mumbai.
Dept. of Computer Science and Information Systems
Birla Institute of Technology and Science Pilani, Goa Campus.
I am a  faculty member in the Dept. of Computer Science and Information Systems at BITS Pilani (Goa Campus). Prior to joining BITS, I was a research scholar in the School of Technology and Computer Science at TIFR Mumbai, where I submitted my Ph.D. thesis working under the guidance of Prof. N. Raja. I did my M.Tech. in Media and Sound Engineering from IIT Kharagpur and B.Tech. in Computer Science and Engineering from Govt. College of Engineering and Textile Technology, Berhampore.
Research Interests 
I am interested in several areas of theoretical computer science such as Automata, Algorithms, Semantics of Computation, Concurrency Theory, Proof Theory, Formal Verification, and Interactive Theorem Proving.  Most of my previous research has been focussed on the formal verification of known Mathematical results using Proof Assistants. Currently, I  am trying to explore the broad area of semantics and verification of sequential as well as concurrent programs running under various memory models.  In particular, I am interested in assessing the suitability of theorem provers as a tool for modelling and verifying safety critical programs.
Research Articles
  • S. Saraswat, A. K. Singh, and N. Raja, Certified double sided auction mechanisms, Poster Presentation, In 25th ACM SIGPLAN International Conference on Functional Programming, ICFP 2020.
  • S. Saraswat and A. K. Singh, Formally Verified Trades in Financial Markets, In The 22nd International Conference on Formal Engineering Methods, ICFEM 2020. [arXiv] 
  • A. K. Singh and N. Raja, A Constructive Formalization of the Weak Perfect Graph Theorem, In The 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP, POPL 2020. [pdf] 
  • A. K. Singh and N. Raja, Towards a constructive formalization of Perfect Graph Theorems, In Logic and Its Applications - 8th Indian Conference, ICLA 2019. [pdf]
  • N. Raja and A. K. Singh, Towards formalizing finite set Combinatorics in Type theory, In The Handbook of the 6th World Congress and School on Universal Logic, UNILOG’2018. [pdf]
  • A. K. Singh and N. Raja, Formalization of finite set combinatorics in Coq, Poster Presentation, In The 2nd Winter School in Computer Science and Engineering on Formal Verification, IIAS, Israel, 2017. [pdf] 
  • A. K. Singh, Formalization of some central theorems in combinatorics of finite sets, In IWIL Workshop and LPAR-21s, LPAR 2017. [pdf]
  • A. K. Singh, Fully Mechanized Proofs of Dilworth's Theorem and Mirsky's Theorem, Accepted for presentation, In Logic and Its Applications - 7th Indian Conference, ICLA 2017. [pdf]
  • A. K. Singh and N. Raja, Separation Logic to Meliorate Software Testing and Validation, Trends in Software Testing, Springer-Verlag 2016. [pdf]
  • B. Mohanty, A. K. Singh and S. Mahapatra, A High Performance Modified SPIHT for Scalable Image Compression, International Journal of Image processing, IJIP, Volume (5), Issue (4), pages 390-402 (2011). [pdf]
Technical Reports
  • A. K. Singh, Interactive theorem proving in Coq and the Curry-Howard Isomorphism, Reading Project, TIFR Mumbai (2015). [pdf]
  • A. K. Singh, Wavelet Based Embedded Coding for Images, M.Tech. Thesis, IIT Kharagpur (2009). [pdf]

Quick Links

    An Institution Deemed to be University estd. vide Sec.3 of the UGC Act,1956 under notification # F.12-23/63.U-2 of Jun 18,1964

    © 2021 Centre for Software Development,SDET Unit, BITS-Pilani, India.

    Designed and developed by fractal | ink design studios