Smell Detection Agent Optimization Approach to Path Generation in Automated Software Testing
Abstract Software testing is the most crucial stage in the software development process. Structural testing, functional testing and models that even support hybrid testing are different software testing techniques. Basic path testing, the most significant structural testing approach, is focused on e...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Chandra, S. S. Vinod [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2022 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. |
|---|
| Übergeordnetes Werk: |
Enthalten in: Journal of electronic testing - Springer US, 1990, 38(2022), 6 vom: Dez., Seite 623-636 |
|---|---|
| Übergeordnetes Werk: |
volume:38 ; year:2022 ; number:6 ; month:12 ; pages:623-636 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10836-022-06033-8 |
|---|
| Katalog-ID: |
OLC2133580972 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2133580972 | ||
| 003 | DE-627 | ||
| 005 | 20230506151810.0 | ||
| 007 | tu | ||
| 008 | 230506s2022 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10836-022-06033-8 |2 doi | |
| 035 | |a (DE-627)OLC2133580972 | ||
| 035 | |a (DE-He213)s10836-022-06033-8-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |a 670 |q VZ |
| 100 | 1 | |a Chandra, S. S. Vinod |e verfasserin |0 (orcid)0000-0003-2298-1906 |4 aut | |
| 245 | 1 | 0 | |a Smell Detection Agent Optimization Approach to Path Generation in Automated Software Testing |
| 264 | 1 | |c 2022 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. | ||
| 520 | |a Abstract Software testing is the most crucial stage in the software development process. Structural testing, functional testing and models that even support hybrid testing are different software testing techniques. Basic path testing, the most significant structural testing approach, is focused on evaluating software source code. The method emphasizes developing test data inputs to produce all feasible and efficient test paths that connect to all nodes and edges of the graph. The objective is to define the number of independent paths that can define the number of test cases needed to maximize test coverage. It ensured the execution of every statement and condition at least once. A nature-inspired Smell Detection Agent (SDA) algorithm is proposed in this paper to select all paths and prioritize the feasible solution. This algorithm is an optimization algorithm suitable for identifying optimal paths with priority. The concept is derived from the natural behaviour of canines that identified optimal path from source to the destination. The SDA algorithm is based on the evaporation of smell molecules in the form of gas and the perception capability of a smelling agent. The number of linearly independent paths through a programme module is measured by creating a Control Flow Graph of the code, which measures cyclomatic complexity. SDA algorithm gives significant increases in performance while considering the cyclomatic complexity. Complexity analysis of SDA trends to be in the O(E+V log V), while the competitor algorithms have an exponential growth of O(n$$^2$$). Various experiments were also carried out to emphasis the relevance of the proposed method. Ten different benchmarked applications has been taken for experimental analysis and it was observed to have an increased path coverage of 8% when SDA was used over the traditional methods. Also, the time complexity was reduced by 22%, which shows the powerfulness of the proposed SDA algorithm. | ||
| 650 | 4 | |a SDA algorithm | |
| 650 | 4 | |a Software testing | |
| 650 | 4 | |a Structural testing | |
| 650 | 4 | |a Basic path testing | |
| 650 | 4 | |a Test case calculation | |
| 700 | 1 | |a Sankar, S. Saju |4 aut | |
| 700 | 1 | |a Anand, H. S. |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Journal of electronic testing |d Springer US, 1990 |g 38(2022), 6 vom: Dez., Seite 623-636 |w (DE-627)130869090 |w (DE-600)1033317-4 |w (DE-576)024991600 |x 0923-8174 |7 nnns |
| 773 | 1 | 8 | |g volume:38 |g year:2022 |g number:6 |g month:12 |g pages:623-636 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10836-022-06033-8 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-TEC | ||
| 912 | |a SSG-OLC-MAT | ||
| 951 | |a AR | ||
| 952 | |d 38 |j 2022 |e 6 |c 12 |h 623-636 | ||
| author_variant |
s s v c ssv ssvc s s s ss sss h s a hs hsa |
|---|---|
| matchkey_str |
article:09238174:2022----::mldtcingnotmztoapoctptgnrtoiat |
| hierarchy_sort_str |
2022 |
| publishDate |
2022 |
| allfields |
10.1007/s10836-022-06033-8 doi (DE-627)OLC2133580972 (DE-He213)s10836-022-06033-8-p DE-627 ger DE-627 rakwb eng 004 670 VZ Chandra, S. S. Vinod verfasserin (orcid)0000-0003-2298-1906 aut Smell Detection Agent Optimization Approach to Path Generation in Automated Software Testing 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. Abstract Software testing is the most crucial stage in the software development process. Structural testing, functional testing and models that even support hybrid testing are different software testing techniques. Basic path testing, the most significant structural testing approach, is focused on evaluating software source code. The method emphasizes developing test data inputs to produce all feasible and efficient test paths that connect to all nodes and edges of the graph. The objective is to define the number of independent paths that can define the number of test cases needed to maximize test coverage. It ensured the execution of every statement and condition at least once. A nature-inspired Smell Detection Agent (SDA) algorithm is proposed in this paper to select all paths and prioritize the feasible solution. This algorithm is an optimization algorithm suitable for identifying optimal paths with priority. The concept is derived from the natural behaviour of canines that identified optimal path from source to the destination. The SDA algorithm is based on the evaporation of smell molecules in the form of gas and the perception capability of a smelling agent. The number of linearly independent paths through a programme module is measured by creating a Control Flow Graph of the code, which measures cyclomatic complexity. SDA algorithm gives significant increases in performance while considering the cyclomatic complexity. Complexity analysis of SDA trends to be in the O(E+V log V), while the competitor algorithms have an exponential growth of O(n$$^2$$). Various experiments were also carried out to emphasis the relevance of the proposed method. Ten different benchmarked applications has been taken for experimental analysis and it was observed to have an increased path coverage of 8% when SDA was used over the traditional methods. Also, the time complexity was reduced by 22%, which shows the powerfulness of the proposed SDA algorithm. SDA algorithm Software testing Structural testing Basic path testing Test case calculation Sankar, S. Saju aut Anand, H. S. aut Enthalten in Journal of electronic testing Springer US, 1990 38(2022), 6 vom: Dez., Seite 623-636 (DE-627)130869090 (DE-600)1033317-4 (DE-576)024991600 0923-8174 nnns volume:38 year:2022 number:6 month:12 pages:623-636 https://doi.org/10.1007/s10836-022-06033-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT AR 38 2022 6 12 623-636 |
| spelling |
10.1007/s10836-022-06033-8 doi (DE-627)OLC2133580972 (DE-He213)s10836-022-06033-8-p DE-627 ger DE-627 rakwb eng 004 670 VZ Chandra, S. S. Vinod verfasserin (orcid)0000-0003-2298-1906 aut Smell Detection Agent Optimization Approach to Path Generation in Automated Software Testing 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. Abstract Software testing is the most crucial stage in the software development process. Structural testing, functional testing and models that even support hybrid testing are different software testing techniques. Basic path testing, the most significant structural testing approach, is focused on evaluating software source code. The method emphasizes developing test data inputs to produce all feasible and efficient test paths that connect to all nodes and edges of the graph. The objective is to define the number of independent paths that can define the number of test cases needed to maximize test coverage. It ensured the execution of every statement and condition at least once. A nature-inspired Smell Detection Agent (SDA) algorithm is proposed in this paper to select all paths and prioritize the feasible solution. This algorithm is an optimization algorithm suitable for identifying optimal paths with priority. The concept is derived from the natural behaviour of canines that identified optimal path from source to the destination. The SDA algorithm is based on the evaporation of smell molecules in the form of gas and the perception capability of a smelling agent. The number of linearly independent paths through a programme module is measured by creating a Control Flow Graph of the code, which measures cyclomatic complexity. SDA algorithm gives significant increases in performance while considering the cyclomatic complexity. Complexity analysis of SDA trends to be in the O(E+V log V), while the competitor algorithms have an exponential growth of O(n$$^2$$). Various experiments were also carried out to emphasis the relevance of the proposed method. Ten different benchmarked applications has been taken for experimental analysis and it was observed to have an increased path coverage of 8% when SDA was used over the traditional methods. Also, the time complexity was reduced by 22%, which shows the powerfulness of the proposed SDA algorithm. SDA algorithm Software testing Structural testing Basic path testing Test case calculation Sankar, S. Saju aut Anand, H. S. aut Enthalten in Journal of electronic testing Springer US, 1990 38(2022), 6 vom: Dez., Seite 623-636 (DE-627)130869090 (DE-600)1033317-4 (DE-576)024991600 0923-8174 nnns volume:38 year:2022 number:6 month:12 pages:623-636 https://doi.org/10.1007/s10836-022-06033-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT AR 38 2022 6 12 623-636 |
| allfields_unstemmed |
10.1007/s10836-022-06033-8 doi (DE-627)OLC2133580972 (DE-He213)s10836-022-06033-8-p DE-627 ger DE-627 rakwb eng 004 670 VZ Chandra, S. S. Vinod verfasserin (orcid)0000-0003-2298-1906 aut Smell Detection Agent Optimization Approach to Path Generation in Automated Software Testing 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. Abstract Software testing is the most crucial stage in the software development process. Structural testing, functional testing and models that even support hybrid testing are different software testing techniques. Basic path testing, the most significant structural testing approach, is focused on evaluating software source code. The method emphasizes developing test data inputs to produce all feasible and efficient test paths that connect to all nodes and edges of the graph. The objective is to define the number of independent paths that can define the number of test cases needed to maximize test coverage. It ensured the execution of every statement and condition at least once. A nature-inspired Smell Detection Agent (SDA) algorithm is proposed in this paper to select all paths and prioritize the feasible solution. This algorithm is an optimization algorithm suitable for identifying optimal paths with priority. The concept is derived from the natural behaviour of canines that identified optimal path from source to the destination. The SDA algorithm is based on the evaporation of smell molecules in the form of gas and the perception capability of a smelling agent. The number of linearly independent paths through a programme module is measured by creating a Control Flow Graph of the code, which measures cyclomatic complexity. SDA algorithm gives significant increases in performance while considering the cyclomatic complexity. Complexity analysis of SDA trends to be in the O(E+V log V), while the competitor algorithms have an exponential growth of O(n$$^2$$). Various experiments were also carried out to emphasis the relevance of the proposed method. Ten different benchmarked applications has been taken for experimental analysis and it was observed to have an increased path coverage of 8% when SDA was used over the traditional methods. Also, the time complexity was reduced by 22%, which shows the powerfulness of the proposed SDA algorithm. SDA algorithm Software testing Structural testing Basic path testing Test case calculation Sankar, S. Saju aut Anand, H. S. aut Enthalten in Journal of electronic testing Springer US, 1990 38(2022), 6 vom: Dez., Seite 623-636 (DE-627)130869090 (DE-600)1033317-4 (DE-576)024991600 0923-8174 nnns volume:38 year:2022 number:6 month:12 pages:623-636 https://doi.org/10.1007/s10836-022-06033-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT AR 38 2022 6 12 623-636 |
| allfieldsGer |
10.1007/s10836-022-06033-8 doi (DE-627)OLC2133580972 (DE-He213)s10836-022-06033-8-p DE-627 ger DE-627 rakwb eng 004 670 VZ Chandra, S. S. Vinod verfasserin (orcid)0000-0003-2298-1906 aut Smell Detection Agent Optimization Approach to Path Generation in Automated Software Testing 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. Abstract Software testing is the most crucial stage in the software development process. Structural testing, functional testing and models that even support hybrid testing are different software testing techniques. Basic path testing, the most significant structural testing approach, is focused on evaluating software source code. The method emphasizes developing test data inputs to produce all feasible and efficient test paths that connect to all nodes and edges of the graph. The objective is to define the number of independent paths that can define the number of test cases needed to maximize test coverage. It ensured the execution of every statement and condition at least once. A nature-inspired Smell Detection Agent (SDA) algorithm is proposed in this paper to select all paths and prioritize the feasible solution. This algorithm is an optimization algorithm suitable for identifying optimal paths with priority. The concept is derived from the natural behaviour of canines that identified optimal path from source to the destination. The SDA algorithm is based on the evaporation of smell molecules in the form of gas and the perception capability of a smelling agent. The number of linearly independent paths through a programme module is measured by creating a Control Flow Graph of the code, which measures cyclomatic complexity. SDA algorithm gives significant increases in performance while considering the cyclomatic complexity. Complexity analysis of SDA trends to be in the O(E+V log V), while the competitor algorithms have an exponential growth of O(n$$^2$$). Various experiments were also carried out to emphasis the relevance of the proposed method. Ten different benchmarked applications has been taken for experimental analysis and it was observed to have an increased path coverage of 8% when SDA was used over the traditional methods. Also, the time complexity was reduced by 22%, which shows the powerfulness of the proposed SDA algorithm. SDA algorithm Software testing Structural testing Basic path testing Test case calculation Sankar, S. Saju aut Anand, H. S. aut Enthalten in Journal of electronic testing Springer US, 1990 38(2022), 6 vom: Dez., Seite 623-636 (DE-627)130869090 (DE-600)1033317-4 (DE-576)024991600 0923-8174 nnns volume:38 year:2022 number:6 month:12 pages:623-636 https://doi.org/10.1007/s10836-022-06033-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT AR 38 2022 6 12 623-636 |
| allfieldsSound |
10.1007/s10836-022-06033-8 doi (DE-627)OLC2133580972 (DE-He213)s10836-022-06033-8-p DE-627 ger DE-627 rakwb eng 004 670 VZ Chandra, S. S. Vinod verfasserin (orcid)0000-0003-2298-1906 aut Smell Detection Agent Optimization Approach to Path Generation in Automated Software Testing 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. Abstract Software testing is the most crucial stage in the software development process. Structural testing, functional testing and models that even support hybrid testing are different software testing techniques. Basic path testing, the most significant structural testing approach, is focused on evaluating software source code. The method emphasizes developing test data inputs to produce all feasible and efficient test paths that connect to all nodes and edges of the graph. The objective is to define the number of independent paths that can define the number of test cases needed to maximize test coverage. It ensured the execution of every statement and condition at least once. A nature-inspired Smell Detection Agent (SDA) algorithm is proposed in this paper to select all paths and prioritize the feasible solution. This algorithm is an optimization algorithm suitable for identifying optimal paths with priority. The concept is derived from the natural behaviour of canines that identified optimal path from source to the destination. The SDA algorithm is based on the evaporation of smell molecules in the form of gas and the perception capability of a smelling agent. The number of linearly independent paths through a programme module is measured by creating a Control Flow Graph of the code, which measures cyclomatic complexity. SDA algorithm gives significant increases in performance while considering the cyclomatic complexity. Complexity analysis of SDA trends to be in the O(E+V log V), while the competitor algorithms have an exponential growth of O(n$$^2$$). Various experiments were also carried out to emphasis the relevance of the proposed method. Ten different benchmarked applications has been taken for experimental analysis and it was observed to have an increased path coverage of 8% when SDA was used over the traditional methods. Also, the time complexity was reduced by 22%, which shows the powerfulness of the proposed SDA algorithm. SDA algorithm Software testing Structural testing Basic path testing Test case calculation Sankar, S. Saju aut Anand, H. S. aut Enthalten in Journal of electronic testing Springer US, 1990 38(2022), 6 vom: Dez., Seite 623-636 (DE-627)130869090 (DE-600)1033317-4 (DE-576)024991600 0923-8174 nnns volume:38 year:2022 number:6 month:12 pages:623-636 https://doi.org/10.1007/s10836-022-06033-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT AR 38 2022 6 12 623-636 |
| language |
English |
| source |
Enthalten in Journal of electronic testing 38(2022), 6 vom: Dez., Seite 623-636 volume:38 year:2022 number:6 month:12 pages:623-636 |
| sourceStr |
Enthalten in Journal of electronic testing 38(2022), 6 vom: Dez., Seite 623-636 volume:38 year:2022 number:6 month:12 pages:623-636 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
SDA algorithm Software testing Structural testing Basic path testing Test case calculation |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Journal of electronic testing |
| authorswithroles_txt_mv |
Chandra, S. S. Vinod @@aut@@ Sankar, S. Saju @@aut@@ Anand, H. S. @@aut@@ |
| publishDateDaySort_date |
2022-12-01T00:00:00Z |
| hierarchy_top_id |
130869090 |
| dewey-sort |
14 |
| id |
OLC2133580972 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2133580972</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230506151810.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230506s2022 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10836-022-06033-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2133580972</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10836-022-06033-8-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="a">670</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chandra, S. S. Vinod</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0003-2298-1906</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Smell Detection Agent Optimization Approach to Path Generation in Automated Software Testing</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Software testing is the most crucial stage in the software development process. Structural testing, functional testing and models that even support hybrid testing are different software testing techniques. Basic path testing, the most significant structural testing approach, is focused on evaluating software source code. The method emphasizes developing test data inputs to produce all feasible and efficient test paths that connect to all nodes and edges of the graph. The objective is to define the number of independent paths that can define the number of test cases needed to maximize test coverage. It ensured the execution of every statement and condition at least once. A nature-inspired Smell Detection Agent (SDA) algorithm is proposed in this paper to select all paths and prioritize the feasible solution. This algorithm is an optimization algorithm suitable for identifying optimal paths with priority. The concept is derived from the natural behaviour of canines that identified optimal path from source to the destination. The SDA algorithm is based on the evaporation of smell molecules in the form of gas and the perception capability of a smelling agent. The number of linearly independent paths through a programme module is measured by creating a Control Flow Graph of the code, which measures cyclomatic complexity. SDA algorithm gives significant increases in performance while considering the cyclomatic complexity. Complexity analysis of SDA trends to be in the O(E+V log V), while the competitor algorithms have an exponential growth of O(n$$^2$$). Various experiments were also carried out to emphasis the relevance of the proposed method. Ten different benchmarked applications has been taken for experimental analysis and it was observed to have an increased path coverage of 8% when SDA was used over the traditional methods. Also, the time complexity was reduced by 22%, which shows the powerfulness of the proposed SDA algorithm.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">SDA algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software testing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Structural testing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Basic path testing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Test case calculation</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sankar, S. Saju</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Anand, H. S.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of electronic testing</subfield><subfield code="d">Springer US, 1990</subfield><subfield code="g">38(2022), 6 vom: Dez., Seite 623-636</subfield><subfield code="w">(DE-627)130869090</subfield><subfield code="w">(DE-600)1033317-4</subfield><subfield code="w">(DE-576)024991600</subfield><subfield code="x">0923-8174</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:38</subfield><subfield code="g">year:2022</subfield><subfield code="g">number:6</subfield><subfield code="g">month:12</subfield><subfield code="g">pages:623-636</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10836-022-06033-8</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">38</subfield><subfield code="j">2022</subfield><subfield code="e">6</subfield><subfield code="c">12</subfield><subfield code="h">623-636</subfield></datafield></record></collection>
|
| author |
Chandra, S. S. Vinod |
| spellingShingle |
Chandra, S. S. Vinod ddc 004 misc SDA algorithm misc Software testing misc Structural testing misc Basic path testing misc Test case calculation Smell Detection Agent Optimization Approach to Path Generation in Automated Software Testing |
| authorStr |
Chandra, S. S. Vinod |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)130869090 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science 670 - Manufacturing |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0923-8174 |
| topic_title |
004 670 VZ Smell Detection Agent Optimization Approach to Path Generation in Automated Software Testing SDA algorithm Software testing Structural testing Basic path testing Test case calculation |
| topic |
ddc 004 misc SDA algorithm misc Software testing misc Structural testing misc Basic path testing misc Test case calculation |
| topic_unstemmed |
ddc 004 misc SDA algorithm misc Software testing misc Structural testing misc Basic path testing misc Test case calculation |
| topic_browse |
ddc 004 misc SDA algorithm misc Software testing misc Structural testing misc Basic path testing misc Test case calculation |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Journal of electronic testing |
| hierarchy_parent_id |
130869090 |
| dewey-tens |
000 - Computer science, knowledge & systems 670 - Manufacturing |
| hierarchy_top_title |
Journal of electronic testing |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)130869090 (DE-600)1033317-4 (DE-576)024991600 |
| title |
Smell Detection Agent Optimization Approach to Path Generation in Automated Software Testing |
| ctrlnum |
(DE-627)OLC2133580972 (DE-He213)s10836-022-06033-8-p |
| title_full |
Smell Detection Agent Optimization Approach to Path Generation in Automated Software Testing |
| author_sort |
Chandra, S. S. Vinod |
| journal |
Journal of electronic testing |
| journalStr |
Journal of electronic testing |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 600 - Technology |
| recordtype |
marc |
| publishDateSort |
2022 |
| contenttype_str_mv |
txt |
| container_start_page |
623 |
| author_browse |
Chandra, S. S. Vinod Sankar, S. Saju Anand, H. S. |
| container_volume |
38 |
| class |
004 670 VZ |
| format_se |
Aufsätze |
| author-letter |
Chandra, S. S. Vinod |
| doi_str_mv |
10.1007/s10836-022-06033-8 |
| normlink |
(ORCID)0000-0003-2298-1906 |
| normlink_prefix_str_mv |
(orcid)0000-0003-2298-1906 |
| dewey-full |
004 670 |
| title_sort |
smell detection agent optimization approach to path generation in automated software testing |
| title_auth |
Smell Detection Agent Optimization Approach to Path Generation in Automated Software Testing |
| abstract |
Abstract Software testing is the most crucial stage in the software development process. Structural testing, functional testing and models that even support hybrid testing are different software testing techniques. Basic path testing, the most significant structural testing approach, is focused on evaluating software source code. The method emphasizes developing test data inputs to produce all feasible and efficient test paths that connect to all nodes and edges of the graph. The objective is to define the number of independent paths that can define the number of test cases needed to maximize test coverage. It ensured the execution of every statement and condition at least once. A nature-inspired Smell Detection Agent (SDA) algorithm is proposed in this paper to select all paths and prioritize the feasible solution. This algorithm is an optimization algorithm suitable for identifying optimal paths with priority. The concept is derived from the natural behaviour of canines that identified optimal path from source to the destination. The SDA algorithm is based on the evaporation of smell molecules in the form of gas and the perception capability of a smelling agent. The number of linearly independent paths through a programme module is measured by creating a Control Flow Graph of the code, which measures cyclomatic complexity. SDA algorithm gives significant increases in performance while considering the cyclomatic complexity. Complexity analysis of SDA trends to be in the O(E+V log V), while the competitor algorithms have an exponential growth of O(n$$^2$$). Various experiments were also carried out to emphasis the relevance of the proposed method. Ten different benchmarked applications has been taken for experimental analysis and it was observed to have an increased path coverage of 8% when SDA was used over the traditional methods. Also, the time complexity was reduced by 22%, which shows the powerfulness of the proposed SDA algorithm. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. |
| abstractGer |
Abstract Software testing is the most crucial stage in the software development process. Structural testing, functional testing and models that even support hybrid testing are different software testing techniques. Basic path testing, the most significant structural testing approach, is focused on evaluating software source code. The method emphasizes developing test data inputs to produce all feasible and efficient test paths that connect to all nodes and edges of the graph. The objective is to define the number of independent paths that can define the number of test cases needed to maximize test coverage. It ensured the execution of every statement and condition at least once. A nature-inspired Smell Detection Agent (SDA) algorithm is proposed in this paper to select all paths and prioritize the feasible solution. This algorithm is an optimization algorithm suitable for identifying optimal paths with priority. The concept is derived from the natural behaviour of canines that identified optimal path from source to the destination. The SDA algorithm is based on the evaporation of smell molecules in the form of gas and the perception capability of a smelling agent. The number of linearly independent paths through a programme module is measured by creating a Control Flow Graph of the code, which measures cyclomatic complexity. SDA algorithm gives significant increases in performance while considering the cyclomatic complexity. Complexity analysis of SDA trends to be in the O(E+V log V), while the competitor algorithms have an exponential growth of O(n$$^2$$). Various experiments were also carried out to emphasis the relevance of the proposed method. Ten different benchmarked applications has been taken for experimental analysis and it was observed to have an increased path coverage of 8% when SDA was used over the traditional methods. Also, the time complexity was reduced by 22%, which shows the powerfulness of the proposed SDA algorithm. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. |
| abstract_unstemmed |
Abstract Software testing is the most crucial stage in the software development process. Structural testing, functional testing and models that even support hybrid testing are different software testing techniques. Basic path testing, the most significant structural testing approach, is focused on evaluating software source code. The method emphasizes developing test data inputs to produce all feasible and efficient test paths that connect to all nodes and edges of the graph. The objective is to define the number of independent paths that can define the number of test cases needed to maximize test coverage. It ensured the execution of every statement and condition at least once. A nature-inspired Smell Detection Agent (SDA) algorithm is proposed in this paper to select all paths and prioritize the feasible solution. This algorithm is an optimization algorithm suitable for identifying optimal paths with priority. The concept is derived from the natural behaviour of canines that identified optimal path from source to the destination. The SDA algorithm is based on the evaporation of smell molecules in the form of gas and the perception capability of a smelling agent. The number of linearly independent paths through a programme module is measured by creating a Control Flow Graph of the code, which measures cyclomatic complexity. SDA algorithm gives significant increases in performance while considering the cyclomatic complexity. Complexity analysis of SDA trends to be in the O(E+V log V), while the competitor algorithms have an exponential growth of O(n$$^2$$). Various experiments were also carried out to emphasis the relevance of the proposed method. Ten different benchmarked applications has been taken for experimental analysis and it was observed to have an increased path coverage of 8% when SDA was used over the traditional methods. Also, the time complexity was reduced by 22%, which shows the powerfulness of the proposed SDA algorithm. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT |
| container_issue |
6 |
| title_short |
Smell Detection Agent Optimization Approach to Path Generation in Automated Software Testing |
| url |
https://doi.org/10.1007/s10836-022-06033-8 |
| remote_bool |
false |
| author2 |
Sankar, S. Saju Anand, H. S. |
| author2Str |
Sankar, S. Saju Anand, H. S. |
| ppnlink |
130869090 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10836-022-06033-8 |
| up_date |
2024-07-03T20:18:37.549Z |
| _version_ |
1803590479433957376 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2133580972</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230506151810.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230506s2022 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10836-022-06033-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2133580972</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10836-022-06033-8-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="a">670</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chandra, S. S. Vinod</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0003-2298-1906</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Smell Detection Agent Optimization Approach to Path Generation in Automated Software Testing</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Software testing is the most crucial stage in the software development process. Structural testing, functional testing and models that even support hybrid testing are different software testing techniques. Basic path testing, the most significant structural testing approach, is focused on evaluating software source code. The method emphasizes developing test data inputs to produce all feasible and efficient test paths that connect to all nodes and edges of the graph. The objective is to define the number of independent paths that can define the number of test cases needed to maximize test coverage. It ensured the execution of every statement and condition at least once. A nature-inspired Smell Detection Agent (SDA) algorithm is proposed in this paper to select all paths and prioritize the feasible solution. This algorithm is an optimization algorithm suitable for identifying optimal paths with priority. The concept is derived from the natural behaviour of canines that identified optimal path from source to the destination. The SDA algorithm is based on the evaporation of smell molecules in the form of gas and the perception capability of a smelling agent. The number of linearly independent paths through a programme module is measured by creating a Control Flow Graph of the code, which measures cyclomatic complexity. SDA algorithm gives significant increases in performance while considering the cyclomatic complexity. Complexity analysis of SDA trends to be in the O(E+V log V), while the competitor algorithms have an exponential growth of O(n$$^2$$). Various experiments were also carried out to emphasis the relevance of the proposed method. Ten different benchmarked applications has been taken for experimental analysis and it was observed to have an increased path coverage of 8% when SDA was used over the traditional methods. Also, the time complexity was reduced by 22%, which shows the powerfulness of the proposed SDA algorithm.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">SDA algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software testing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Structural testing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Basic path testing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Test case calculation</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sankar, S. Saju</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Anand, H. S.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of electronic testing</subfield><subfield code="d">Springer US, 1990</subfield><subfield code="g">38(2022), 6 vom: Dez., Seite 623-636</subfield><subfield code="w">(DE-627)130869090</subfield><subfield code="w">(DE-600)1033317-4</subfield><subfield code="w">(DE-576)024991600</subfield><subfield code="x">0923-8174</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:38</subfield><subfield code="g">year:2022</subfield><subfield code="g">number:6</subfield><subfield code="g">month:12</subfield><subfield code="g">pages:623-636</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10836-022-06033-8</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">38</subfield><subfield code="j">2022</subfield><subfield code="e">6</subfield><subfield code="c">12</subfield><subfield code="h">623-636</subfield></datafield></record></collection>
|
| score |
7.3998556 |