Tata Consultancy Services Limited

Gennova Biopharmaceuticals Limited

Shrawan Singh Kumar

Bharti Chimdyalwar

Venkatesh Ramanathan

Priyanka Darke

Anushri Jana

Advaita Datar

Asia Akhtar

Sanjay K Singh

Ulka Shrotri

Arun Gajanan Bahulkar

Amey Zare

Ravi Hanmant Mahamuni

Anita Pramod Nanadikar

Tanha Shah

Ankita Shamrao Khadsare

Vaidehi Manoj Ghime

Ramanathan Venkatesh

Suresh Bhaskaramurthy

Arjun Raghuwanshi

Mohammad Afzal

Mihir Sahoo Ranjan

Pragati Srivastava

Punit Shah

Ankit Kumar

Avriti Chauhan

Pavan Sabharwal

Kannan Dhanasekaran

Punyakoti Sathish

Sakshi Agrawal

Advaita Abhijit Datar

Ulka Aniruddha Shrotri

Sanjay Singh

This disclosure relates generally to the field of program slicing, and, more particularly, to a method and system for function call and variable access based relaxed backward slicing. The method discloses a slicing criterion which focuses only on functions called from an entry function. The slicing criteria uses control and data flow information to slice the given entry function with respect to functions called from the body of the entry function and eventually remove all functions not called directly or indirectly from the entry function. The variables modified by calls in the entry function are considered through side-effect while identifying control and data dependence chain within body of entry function. The proposed technique identifies partitions of functions based on the variables accessible in and functions called from the entry function. Thus, unrelated sets of functions with respect to the entry function are computed and divided into different partitions.

Method and system for function call and variable access based relaxed backward slicing

The present invention generally relates to the field of automated functional testing, and, more particularly, to a method and system for validation of calculation code against calculation specification. Currently the validation is done manually which is time consuming and effort intensive. Embodiments of present disclosure provide an automated method of validation by generating a schema from the calculation specification, retrieving data based on the schema, executing the intermediate calculations, and comparing the result with the output from the calculation code. The method requires minimal manual input and is a fast, simple, resilient and low-code/no-code technique that can be extended to support any type of calculation code and calculation specifications with minimal or no change.

Method and system for validation of calculation code against calculation specification

This disclosure relates generally to method and system for identifying static analysis alarms based on semantics of changed source code. The disclosed technique is integrated in the proprietary static analysis tool that identifies semantics of the change and reports only impacted alarms. The method receives source code and a property over variables to be verified for identifying one or more impacted alarms. Further, an incremental analysis based on the one or more change program points are performed to mark one or more impacted functions in the current version of the source code and then generating a data flow analysis (DFA) and a program dependence graph (PDG) for the one or more impacted functions. Further, a change-based alarm identification technique is utilized for the one or more impacted static analysis alarms from the one or more impacted functions in the current version of source code based on semantics of change.

Method and system for identifying static analysis alarms based on semantics of changed source code

Modern software verification tools are moving towards incremental verification of program properties to ensure safety of evolving software systems. However, not every change in the program impacts verification outcome of program properties. Moreover, analyzing these irrelevant changes adds to cost of incremental verification. A system and method have been provided for identifying relevant changes for incremental verification of evolving software. The disclosure provides a light-weight pre-analysis phase of identifying relevant changes that can lead to improvement in efficiency of all existing incremental verification techniques. To identify relevant changes, the system provides a relevant change identification technique (RCIT) with respect to program properties. The RCIT uses a variant of the strongly live variables (SLV) analysis to compute variables that are influencing the verification outcome of program properties. These variables are referred as value influencing variables (VIVs). The RCIT, then uses computed VIVs and changed statement information to identify relevant changes.

Method and system for identifying relevant changes for incremental verification of evolving software

Abstract interpretation based static analysis tools use relational/non-relational abstract domains to verify program properties. Precision and scalability of analysis vary basis usage of abstract domains. K-limited path-sensitive interval domain is an abstract domain that was conventionally proposed for analysis on industry strength programs. The domain maintains variables' intervals along a configurable K subsets of paths at each program point, which implicitly provides co-relation among variables. When the number of paths at the join point exceeds K, set of paths are partitioned into K subsets, arbitrarily, which results in loss of precision required to verify program properties. To address the above problem, embodiments of the present disclosure provide selective merging of paths in such a way that the intervals computed help verifying more properties. The selective path-sensitive method of the present disclosure is based on the knowledge of variables whose values influence the verification outcome of program properties.

Systems and methods for selective path sensitive interval analysis

A system and a method for verification of a source code are provided. There as many techniques available that can be used for verification of software codes, however, it is difficult to determine appropriate technique that can be utilized for verification of a given software code. In an embodiment, the system receives a source code encoded with one or more specifications to be verified. A static analysis of the source code is performed to identify program features of the source code. The program features may include, but are not limited to, multiple return paths, loops with an unstructured control flow, loops with arrays, short ranges and numerical loops. Based on the identification of the program features, verification techniques are applied to the source code for the verification. Each verification technique of the one or more verification techniques is applied for a predetermined period of time and in a predefined order.

System and method for software verification

The present invention relates to a novel process of isolating and purifying tissue plasminogen activator and its variants more specifically TNK-tPA from CHO cells and describes an industrially applicable, simple, cost effective, robust and highly efficient process of TNK-tPA purification.

Purification process for isolation and commercial production of recombinant TNK-tPA tenecteplase

The present disclosure provides a system and method for performing an analysis of a software application in a computing environment. A receiving module accepts source code of the software application as input data and obtains a list of the entry points. Intermediate representation from the input data is generated in order to construct informative structure for the software application. Uncalled functions in the software application are identified and are considered as entry points. The entry points are wrapped into one entry point and analyzed maintaining calling context of all the entry points.

System and method for analyzing software application in view of entry points

A system and method for analysis of a large code base using partitioning. The present application relates to management of large code bases, by enabling fragmentation of large code bases into smaller code clusters. Further the system and method analyze small code clusters individually and combining the results obtained therefrom, illustrating to programmers the combined result for the entire code base.

System and method for analysis of a large code base using partitioning

Method for automatically migrating power builder application to an open architecture is disclosed. The method includes converting to ASCII character format stream, parsing the stream to form constructs, generating a model from the constructs, analyzing the model and building trees in the model in the power builder format. The apparatus of the invention includes a schema of trees, one set, representing trees in the power builder format and another set in the selected open architecture format and a set of mappings defining correspondence between the two sets. Trees in one set are transformed into the other and attached in the model. An Unparser is provided having a class generator which generates classes including a global variable class in the open architecture and the classes are filled with the help of the parser and a model traverser by querying and responses thereto.

Apparatus and method for automatically migrating client server applications to other architectures and platforms

Growing community of inventors

Maharashtra, India

Shrawan Singh Kumar