Skip to main content
Skip to footer
Contact Us
We are taking you to another website now.


The foundations of computing research group aims to apply the fundamental concepts of computer science – such as logic, formal methods and artificial intelligence – to the development of complex dependable systems. This group develops tools and technologies that help in the development and analysis of complex intelligent systems.


This group works in the areas of:

  • Development simplification: The group explores novel program synthesis techniques and formal notations that simplify the development of complex systems

  • Practical verification: Verification tools and techniques developed by the group focus on verifying individual units of code, and not the entire system. This includes automatically building models of the rest of the system with the help of the unit code. The group also explores testing of AI and machine learning systems

  • Artificial intelligence: In the field of AI, the group explores explainable AI through neural network alternatives to model knowledge and algorithms and learn from very few examples

People & Patents

  • Research team:  Led by Chief Scientist, R Venkatesh, the team includes Shrawan Kumar; Ulka Shrotri; Ravindra Metta; Advaita Datar; Bharti Chimdyalwar; Anand Yeolekar; Prasad Bokil; Priyanka Darke; Tukaram Muske; Kumar Madhukar; Sumanth Prabhu; Anushri Jana; Amey Zare; Supriya Agrawal; Komal Pathade; Divyesh Unadkat

  • Academic partners: IIT Bombay, India; Chennai Mathematical Institute, India; Technical University of Munich, Germany; Princeton University, USA; BITS Goa, India
  • Key publications since 2017

1. Scaling Bounded Model Checking for Programs with Arrays

Lecture Notes in Computer Science


Anushri Anu Jana, Advaita Datar, Venkatesh R, Niyas C, Prof Uday Khedkar,

2. Cause points analysis for effective handling of static analysis alarms

International Symposium on Software Reliability Engineering


Tukaram B Muske,

3. Repositioning of Static Analysis Alarms for Redundancy Reduction

ACM SIGSOFT International Symposium on Software Testing and Analysis


Tukaram B Muske,Talluri Siva Subramanya Rohith, Prof. Alexander Serebrenik,

4. Property Checking Array Programs Using Loop Shrinking

International Conference on Tools and Algorithms for the Construction and Analysis of Systems


Shrawan Kumar, Venkatesh R, Punit Shah,

5. Reducing static analysis alarms based on non-impacting control dependencies

Asian Symposium on Programming Languages and Systems


Tukaram B Muske, Talluri Siva Subramanya Rohith, Prof. Alexander Serebrenik,

6. Sequentialization Using Timestamps

Annual Conference on Theory and Applications of Models of Computation


Anand Vijay Yeolekar, Venkatesh R, Dipali Bhutada, Kumar Madhukar,

7. Verifying Array Manipulating Programs by Tiling

Static Analysis Symposium


Divyesh Pankajbhai Unadkat,

8. Efficiently Learning Safety Proofs from Appearance as well as Behaviours

Static Analysis Symposium


Sumanth Prabhu, Kumar Madhukar, Venkatesh R,

9. Solving Constrained Horn Clauses Using Syntax and Data

Formal Methods in Computer-Aided Design


Sumanth Prabhu, Kumar Madhukar,

10. VeriAbs : Verification by Abstraction and Test Generation

IEEE/ACM International Conference on Automated Software Engineering


Bharti Dewrao Chimdyalwar, Priyanka Dilip Darke, Mohammad Afzal, Asia, Avriti Chauhan, Advaita Datar, Shrawan Kumar, Venkatesh R,

11. Verifying Array Manipulating Programs with Full-Program Induction

International Conference on Tools and Algorithms for the Construction and Analysis of Systems


Divyesh Pankajbhai Unadkat,

12. Scaling Test Case Generation For Expressive Decision Tables

IEEE International Conference on Software Testing, Verification and Validation


Supriya Agrawal, Venkatesh R, Ulka Aniruddha Shrotri, Amey Zare, Sagar Verma,

13. Quantified Invariants via Syntax-Guided Synthesis

Computer Aided Verification


Sumanth Prabhu, Kumar Madhukar

14. VeriAbs: Verification by Abstraction and Test Generation (Competition Contribution)      

Tools and Algorithms for the Construction and Analysis of Systems           


Priyanka Darke,

15. Verifying Array Manipulating Programs with Full-Program Induction         

Tools and Algorithms for the Construction and Analysis of Systems           


Divyesh Unadkat,

16. Using Hypersafety Verification for Proving Correctness of Programming Assignments      

International Conference on Software Engineering          


Kumar Madhukar,

17. Techniques for Efficient Automated Elimination of false positives

International Conference on Software Maintenance and Evolution            


T Muske

What’s your challenge?
Let’s work together to solve it.
More Like This

Thank you for downloading

Your opinion counts! Let us know what you think by choosing one option below.