Abstract: This disclosure relates generally to method and system for incremental functional approach-based dataflow analysis. Static dataflow analysis can take hours to days depending on size and complexity of the code. In today's agile development environment faster analysis is required which can handle incremental changes to the code in an efficient manner. The method includes by performing a static dataflow analysis over a set of functions of a source code. Further, obtains a set of impacted functions from the source code and executes a dataflow analysis over the set of impacted functions of the source code. The method performs an incremental functional approach-based dataflow analysis over the set of impacted functions including an incremental bottom-up analysis and an incremental top-down analysis. The method efficiently updates results of dataflow analysis in response to incremental changes which is fast and scalable and minimizes the number of procedures by comparing summaries across the versions.

Abstract: This disclosure relates generally to method and system to perform interval analysis in source code using functional approach. The method performs data-flow analysis using functional approach to solve infinite-height analyses and properties are validated such as array index within bounds, non-zero division, and preventing arithmetic overflow or underflow on real-life applications. The method receives source code comprising one or more functions to perform a whole program interval analysis over each function using a functional approach to identify range interval of each variable at every program point in the source code. Further, summary for each function is computed which is stored in the form of variable and its corresponding range interval at every exit point of each function. Finally, an incremental interval analysis is performed over each function having edited version change and summary is recomputed for each function impacted by change to optimize overall interval analysis.

Abstract: An appliance includes a cabinet that has an inner surface. A frame is coupled to the inner surface of the cabinet. The frame includes a frame boss that extends from a bottom surface thereof. A panel is positioned within the frame. The frame extends along a perimeter of the panel. An inner trim member has a flange that extends therefrom. The flange defines an aperture configured to align with the frame boss. A fastener is configured to extend through the aperture and engage the frame boss to couple the inner trim member with the frame. An outer trim member is disposed over the inner trim member. The inner trim member is configured to slidably receive the outer trim member.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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).

Abstract: This disclosure relates generally to method and system for incremental functional approach-based dataflow analysis. Static dataflow analysis can take hours to days depending on size and complexity of the code. In today's agile development environment faster analysis is required which can handle incremental changes to the code in an efficient manner. The method includes by performing a static dataflow analysis over a set of functions of a source code. Further, obtains a set of impacted functions from the source code and executes a dataflow analysis over the set of impacted functions of the source code. The method performs an incremental functional approach-based dataflow analysis over the set of impacted functions including an incremental bottom-up analysis and an incremental top-down analysis. The method efficiently updates results of dataflow analysis in response to incremental changes which is fast and scalable and minimizes the number of procedures by comparing summaries across the versions.

Abstract: An appliance door closure assembly is provided and comprises an inner door selectively coupled with an outer door. An anchor is in connection with the inner door and defines a retention space. A latch assembly is in connection with the outer door. The latch assembly includes a first cam having a first contact surface and pivotally coupled to a base. A second cam has a second contact surface engaged with the first contact surface of the first cam. The latch assembly is movable between a first position and a second position.

Abstract: An appliance includes a cabinet that has an inner surface. A frame is coupled to the inner surface of the cabinet. The frame includes a frame boss that extends from a bottom surface thereof. A panel is positioned within the frame. The frame extends along a perimeter of the panel. An inner trim member has a flange that extends therefrom. The flange defines an aperture configured to align with the frame boss. A fastener is configured to extend through the aperture and engage the frame boss to couple the inner trim member with the frame. An outer trim member is disposed over the inner trim member. The inner trim member is configured to slidably receive the outer trim member.

Abstract: A shelf assembly for a refrigerator includes a frame assembly having front and rear frame members with respective front and rear channels. A panel includes first and second ends, wherein the first end is fully received in the front channel, and further wherein the second end is partially received in the rear channel. A spacer assembly includes a spacer member and one or more clip members extending upwardly from a base portion. The clip members are clipped to mounting apertures disposed on the second portion of the rear frame member. The spacer member is received through a receiving aperture disposed through the rear frame member. The spacer member extends into the rear channel and engages the second end of the panel when the spacer assembly is clipped to the rear frame member to retain the panel in the channels of the front and rear frame members.

Abstract: An appliance includes a cabinet that has an inner surface. A frame is coupled to the inner surface of the cabinet. The frame includes a frame boss that extends from a bottom surface thereof. A panel is positioned within the frame. The frame extends along a perimeter of the panel. An inner trim member has a flange that extends therefrom. The flange defines an aperture configured to align with the frame boss. A fastener is configured to extend through the aperture and engage the frame boss to couple the inner trim member with the frame. An outer trim member is disposed over the inner trim member. The inner trim member is configured to slidably receive the outer trim member.

Abstract: A shelf assembly for a refrigerator includes a frame assembly having front and rear frame members with respective front and rear channels. A panel includes first and second ends, wherein the first end is fully received in the front channel, and further wherein the second end is partially received in the rear channel. A spacer assembly includes a spacer member and one or more clip members extending upwardly from a base portion. The clip members are clipped to mounting apertures disposed on the second portion of the rear frame member. The spacer member is received through a receiving aperture disposed through the rear frame member. The spacer member extends into the rear channel and engages the second end of the panel when the spacer assembly is clipped to the rear frame member to retain the panel in the channels of the front and rear frame members.

Abstract: 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).

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: An appliance door closure assembly is provided and comprises an inner door selectively coupled with an outer door. An anchor is in connection with the inner door and defines a retention space. A latch assembly is in connection with the outer door. The latch assembly includes a first cam having a first contact surface and pivotally coupled to a base. A second cam has a second contact surface engaged with the first contact surface of the first cam. The latch assembly is movable between a first position and a second position.