Overview
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.
Fields
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
03/08/2016
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
20/07/2016
Tukaram B Muske,
3. Repositioning of Static Analysis Alarms for Redundancy Reduction
ACM SIGSOFT International Symposium on Software Testing and Analysis
30/04/2018
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
22/12/2017
Shrawan Kumar, Venkatesh R, Punit Shah,
5. Reducing static analysis alarms based on non-impacting control dependencies
Asian Symposium on Programming Languages and Systems
12/08/2019
Tukaram B Muske, Talluri Siva Subramanya Rohith, Prof. Alexander Serebrenik,
6. Sequentialization Using Timestamps
Annual Conference on Theory and Applications of Models of Computation
20/01/2017
Anand Vijay Yeolekar, Venkatesh R, Dipali Bhutada, Kumar Madhukar,
7. Verifying Array Manipulating Programs by Tiling
Static Analysis Symposium
12/06/2017
Divyesh Pankajbhai Unadkat,
8. Efficiently Learning Safety Proofs from Appearance as well as Behaviours
Static Analysis Symposium
05/06/2018
Sumanth Prabhu, Kumar Madhukar, Venkatesh R,
9. Solving Constrained Horn Clauses Using Syntax and Data
Formal Methods in Computer-Aided Design
23/07/2018
Sumanth Prabhu, Kumar Madhukar,
10. VeriAbs : Verification by Abstraction and Test Generation
IEEE/ACM International Conference on Automated Software Engineering
12/08/2019
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
23/12/2019
Divyesh Pankajbhai Unadkat,
12. Scaling Test Case Generation For Expressive Decision Tables
IEEE International Conference on Software Testing, Verification and Validation
11/12/2019
Supriya Agrawal, Venkatesh R, Ulka Aniruddha Shrotri, Amey Zare, Sagar Verma,
13. Quantified Invariants via Syntax-Guided Synthesis
Computer Aided Verification
17/04/2019
Sumanth Prabhu, Kumar Madhukar
14. VeriAbs: Verification by Abstraction and Test Generation (Competition Contribution)
Tools and Algorithms for the Construction and Analysis of Systems
25.04.2020
Priyanka Darke,
15. Verifying Array Manipulating Programs with Full-Program Induction
Tools and Algorithms for the Construction and Analysis of Systems
25.04.2020
Divyesh Unadkat,
16. Using Hypersafety Verification for Proving Correctness of Programming Assignments
International Conference on Software Engineering
23.05.2020
Kumar Madhukar,
17. Techniques for Efficient Automated Elimination of false positives
International Conference on Software Maintenance and Evolution
27.09.2020
T Muske
