Coverage of call graphs based on paths and sequences

    公开(公告)号:US10248547B2

    公开(公告)日:2019-04-02

    申请号:US15490482

    申请日:2017-04-18

    Applicant: SAP SE

    Abstract: Some embodiments provide a program that collects a set of call stack data associated with a set of test cases executed on an application. The program further generates a set of call graphs based on the set of call stack data. Each call graph in the set of call graphs includes a set of nodes representing a set of functions in the application executed in the corresponding test case in the set of test cases. The program also determines, for each call graph in the set of call graphs, a set of short paths and a set of short sequences in the call graph. The program further receives a notification indicating a modification to a function in the application. The program also determines a subset of the set of test cases to test the modification to the function based on the sets of short paths and the sets of short sequences in the set of call graphs.

    Graph based code performance analysis

    公开(公告)号:US10719431B2

    公开(公告)日:2020-07-21

    申请号:US16223414

    申请日:2018-12-18

    Applicant: SAP SE

    Abstract: Techniques are described for graph based code performance analysis of software, such as software that is being developed and tested in a development environment. Implementations provide a technique for instrumenting code by adding various annotations into the code. Each annotation may be a function call that executes with the annotated code, but does not alter the behavior and/or functionality of the annotated code apart from outputting call tracking information during execution. The call tracking information generated by annotations can be analyzed to generate a call graph that depicts calling relationships between functions in the code. The call graph can be presented within a user interface and/or automatically analyzed to develop recommendations regarding code coverage for testing, impact information describing how changes to one function impact another function, code optimization recommendations, and so forth.

    COVERAGE OF CALL GRAPHS BASED ON PATHS AND SEQUENCES

    公开(公告)号:US20180300224A1

    公开(公告)日:2018-10-18

    申请号:US15490482

    申请日:2017-04-18

    Applicant: SAP SE

    CPC classification number: G06F11/3676 G06F11/368

    Abstract: Some embodiments provide a program that collects a set of call stack data associated with a set of test cases executed on an application. The program further generates a set of call graphs based on the set of call stack data. Each call graph in the set of call graphs includes a set of nodes representing a set of functions in the application executed in the corresponding test case in the set of test cases. The program also determines, for each call graph in the set of call graphs, a set of short paths and a set of short sequences in the call graph. The program further receives a notification indicating a modification to a function in the application. The program also determines a subset of the set of test cases to test the modification to the function based on the sets of short paths and the sets of short sequences in the set of call graphs.

Patent Agency Ranking