Coverage of call graphs based on paths and sequences

Coverage of call graphs based on paths and sequences

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 represen...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Jiang, Yunfeng, Xu, Junshan, Peng, Yang, Wang, Yueling
Format: Patent
Sprache:eng
Schlagworte:
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Jiang, Yunfeng
Xu, Junshan
Peng, Yang
Wang, Yueling
description 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.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US10248547B2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US10248547B2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US10248547B23</originalsourceid><addsrcrecordid>eNrjZDBxzi9LLUpMT1XIT1NITszJUUgvSizIKFZISixOTVHIz1MoSCwBchPzUhSKUwtLU_OSU4t5GFjTEnOKU3mhNDeDoptriLOHbmpBfnxqcUFicmpeakl8aLChgZGJhamJuZORMTFqAPFfLGo</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Coverage of call graphs based on paths and sequences</title><source>esp@cenet</source><creator>Jiang, Yunfeng ; Xu, Junshan ; Peng, Yang ; Wang, Yueling</creator><creatorcontrib>Jiang, Yunfeng ; Xu, Junshan ; Peng, Yang ; Wang, Yueling</creatorcontrib><description>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.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2019</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20190402&amp;DB=EPODOC&amp;CC=US&amp;NR=10248547B2$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,777,882,25545,76296</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20190402&amp;DB=EPODOC&amp;CC=US&amp;NR=10248547B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Jiang, Yunfeng</creatorcontrib><creatorcontrib>Xu, Junshan</creatorcontrib><creatorcontrib>Peng, Yang</creatorcontrib><creatorcontrib>Wang, Yueling</creatorcontrib><title>Coverage of call graphs based on paths and sequences</title><description>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.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2019</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZDBxzi9LLUpMT1XIT1NITszJUUgvSizIKFZISixOTVHIz1MoSCwBchPzUhSKUwtLU_OSU4t5GFjTEnOKU3mhNDeDoptriLOHbmpBfnxqcUFicmpeakl8aLChgZGJhamJuZORMTFqAPFfLGo</recordid><startdate>20190402</startdate><enddate>20190402</enddate><creator>Jiang, Yunfeng</creator><creator>Xu, Junshan</creator><creator>Peng, Yang</creator><creator>Wang, Yueling</creator><scope>EVB</scope></search><sort><creationdate>20190402</creationdate><title>Coverage of call graphs based on paths and sequences</title><author>Jiang, Yunfeng ; Xu, Junshan ; Peng, Yang ; Wang, Yueling</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US10248547B23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2019</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>Jiang, Yunfeng</creatorcontrib><creatorcontrib>Xu, Junshan</creatorcontrib><creatorcontrib>Peng, Yang</creatorcontrib><creatorcontrib>Wang, Yueling</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Jiang, Yunfeng</au><au>Xu, Junshan</au><au>Peng, Yang</au><au>Wang, Yueling</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Coverage of call graphs based on paths and sequences</title><date>2019-04-02</date><risdate>2019</risdate><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.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US10248547B2
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title Coverage of call graphs based on paths and sequences
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T23%3A22%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=Jiang,%20Yunfeng&rft.date=2019-04-02&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS10248547B2%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true