An enhanced zero-one optimal path set selection method

Optimal path set selection problem is a crucial issue in structural testing. The zero-one optimal path set selection method is a generalized method that can be applied to all coverage criteria. The only drawback to this method is that for a large program the computation may take ten or more hours be...

Full description

Saved in:
Bibliographic Details
Main Authors: Chyan-Goei Chung, Jen-Gaw Lee
Format: Conference Proceeding
Language:English
Subjects:
Computer science
Cost function
Linear programming
Software testing
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 233
container_issue
container_start_page 225
container_title
container_volume
creator Chyan-Goei Chung
Jen-Gaw Lee
description Optimal path set selection problem is a crucial issue in structural testing. The zero-one optimal path set selection method is a generalized method that can be applied to all coverage criteria. The only drawback to this method is that for a large program the computation may take ten or more hours because the computation is exponentially proportional to the number of candidate paths and proportional to the number of components to be covered. To alleviate the drawback, this paper enhances the method by: defining five reduction rules: and reusing previously selected path set(s) to reduce both the number of candidate paths and the number of components to be covered. Since both the number of candidate paths and the number of components to be covered are reduced, the computation time can be greatly reduced.
doi_str_mv 10.1109/APSEC.1995.496971
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_496971</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>496971</ieee_id><sourcerecordid>496971</sourcerecordid><originalsourceid>FETCH-LOGICAL-i89t-1c90085a359a0c8ba65609c08ba11637a53476dd7a84c8e557dfd37b67acd9463</originalsourceid><addsrcrecordid>eNotj81qwzAQhAWlkJL6AZqTXsCuFv2s9mhM-gOBFpp7UKQNdnFsY-vSPn0N6cAw32mYEeIJVAWg6Ln-_No3FRDZypAjhDtREHrlwTsEBLsRxbJ8q1XGgkF4EK4eJA9tGCIn-cvzWI4Dy3HK3TX0cgq5lQvn1T3H3I2DvHJux_Qo7i-hX7j4z604vuyPzVt5-Hh9b-pD2XnKJURSytugLQUV_Tk46xRFtRKA0xisNuhSwuBN9GwtpkvSeHYYYiLj9FbsbrUdM5-meR01_5xu3_QfmOlDzw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>An enhanced zero-one optimal path set selection method</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Chyan-Goei Chung ; Jen-Gaw Lee</creator><creatorcontrib>Chyan-Goei Chung ; Jen-Gaw Lee</creatorcontrib><description>Optimal path set selection problem is a crucial issue in structural testing. The zero-one optimal path set selection method is a generalized method that can be applied to all coverage criteria. The only drawback to this method is that for a large program the computation may take ten or more hours because the computation is exponentially proportional to the number of candidate paths and proportional to the number of components to be covered. To alleviate the drawback, this paper enhances the method by: defining five reduction rules: and reusing previously selected path set(s) to reduce both the number of candidate paths and the number of components to be covered. Since both the number of candidate paths and the number of components to be covered are reduced, the computation time can be greatly reduced.</description><identifier>ISBN: 9780818671715</identifier><identifier>ISBN: 0818671718</identifier><identifier>DOI: 10.1109/APSEC.1995.496971</identifier><language>eng</language><publisher>IEEE Comput. Soc</publisher><subject>Computer science ; Cost function ; Linear programming ; Software testing</subject><ispartof>Proceedings 1995 Asia Pacific Software Engineering Conference, 1995, p.225-233</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/496971$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>310,311,786,790,795,796,2071,4069,4070,27958,55271</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/496971$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Chyan-Goei Chung</creatorcontrib><creatorcontrib>Jen-Gaw Lee</creatorcontrib><title>An enhanced zero-one optimal path set selection method</title><title>Proceedings 1995 Asia Pacific Software Engineering Conference</title><addtitle>APSEC</addtitle><description>Optimal path set selection problem is a crucial issue in structural testing. The zero-one optimal path set selection method is a generalized method that can be applied to all coverage criteria. The only drawback to this method is that for a large program the computation may take ten or more hours because the computation is exponentially proportional to the number of candidate paths and proportional to the number of components to be covered. To alleviate the drawback, this paper enhances the method by: defining five reduction rules: and reusing previously selected path set(s) to reduce both the number of candidate paths and the number of components to be covered. Since both the number of candidate paths and the number of components to be covered are reduced, the computation time can be greatly reduced.</description><subject>Computer science</subject><subject>Cost function</subject><subject>Linear programming</subject><subject>Software testing</subject><isbn>9780818671715</isbn><isbn>0818671718</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1995</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotj81qwzAQhAWlkJL6AZqTXsCuFv2s9mhM-gOBFpp7UKQNdnFsY-vSPn0N6cAw32mYEeIJVAWg6Ln-_No3FRDZypAjhDtREHrlwTsEBLsRxbJ8q1XGgkF4EK4eJA9tGCIn-cvzWI4Dy3HK3TX0cgq5lQvn1T3H3I2DvHJux_Qo7i-hX7j4z604vuyPzVt5-Hh9b-pD2XnKJURSytugLQUV_Tk46xRFtRKA0xisNuhSwuBN9GwtpkvSeHYYYiLj9FbsbrUdM5-meR01_5xu3_QfmOlDzw</recordid><startdate>1995</startdate><enddate>1995</enddate><creator>Chyan-Goei Chung</creator><creator>Jen-Gaw Lee</creator><general>IEEE Comput. Soc</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>1995</creationdate><title>An enhanced zero-one optimal path set selection method</title><author>Chyan-Goei Chung ; Jen-Gaw Lee</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i89t-1c90085a359a0c8ba65609c08ba11637a53476dd7a84c8e557dfd37b67acd9463</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1995</creationdate><topic>Computer science</topic><topic>Cost function</topic><topic>Linear programming</topic><topic>Software testing</topic><toplevel>online_resources</toplevel><creatorcontrib>Chyan-Goei Chung</creatorcontrib><creatorcontrib>Jen-Gaw Lee</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Chyan-Goei Chung</au><au>Jen-Gaw Lee</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>An enhanced zero-one optimal path set selection method</atitle><btitle>Proceedings 1995 Asia Pacific Software Engineering Conference</btitle><stitle>APSEC</stitle><date>1995</date><risdate>1995</risdate><spage>225</spage><epage>233</epage><pages>225-233</pages><isbn>9780818671715</isbn><isbn>0818671718</isbn><abstract>Optimal path set selection problem is a crucial issue in structural testing. The zero-one optimal path set selection method is a generalized method that can be applied to all coverage criteria. The only drawback to this method is that for a large program the computation may take ten or more hours because the computation is exponentially proportional to the number of candidate paths and proportional to the number of components to be covered. To alleviate the drawback, this paper enhances the method by: defining five reduction rules: and reusing previously selected path set(s) to reduce both the number of candidate paths and the number of components to be covered. Since both the number of candidate paths and the number of components to be covered are reduced, the computation time can be greatly reduced.</abstract><pub>IEEE Comput. Soc</pub><doi>10.1109/APSEC.1995.496971</doi><tpages>9</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 9780818671715
ispartof Proceedings 1995 Asia Pacific Software Engineering Conference, 1995, p.225-233
issn
language eng
recordid cdi_ieee_primary_496971
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Computer science
Cost function
Linear programming
Software testing
title An enhanced zero-one optimal path set selection method
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-09-23T04%3A31%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=An%20enhanced%20zero-one%20optimal%20path%20set%20selection%20method&rft.btitle=Proceedings%201995%20Asia%20Pacific%20Software%20Engineering%20Conference&rft.au=Chyan-Goei%20Chung&rft.date=1995&rft.spage=225&rft.epage=233&rft.pages=225-233&rft.isbn=9780818671715&rft.isbn_list=0818671718&rft_id=info:doi/10.1109/APSEC.1995.496971&rft_dat=%3Cieee_6IE%3E496971%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i89t-1c90085a359a0c8ba65609c08ba11637a53476dd7a84c8e557dfd37b67acd9463%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=496971&rfr_iscdi=true