Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

Target-based test path prioritization for UML activity diagram using weight assignment methods

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 11 No. 1 (2021)

DOI
10.11591/ijece.v11i1.pp575-588
ISSN
2722-2578, 2088-8708
Published
2021-02-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

The benefit of exploratory testing and ad hoc testing by tester’s experience is that crucial bugs are found quickly. Regression testing and test case prioritization are important processes of software testing when software functions have been changed. We propose a test path prioritization method to generate a sequence of test paths that would match the testers’ interests and focuses on the target area of interest or on the changed area. We generate test paths form the activity diagrams and survey the test path prioritization from testers. We define node and edge weight to the symbols of activity diagrams by applying Time management, Pareto, Buffett, Binary, and Bipolar method. Then we propose a test path score equation to prioritize test paths. We also propose evaluation methods i.e., the difference and the similarity of test path prioritization to testers’ interests. Our proposed method had the least average of the difference and the most average of the similarity compare with the tester’s prioritization of test paths. The Bipolar method was the most suitable for assigning weights to match test path rank by the tester. Our proposed method also has given the affected path by changing area higher priority than the other test path.

Collaboration network of the authors

2 authors · 1 co-authorship link

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Walailak University
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Target-based test path prioritization for UML activity diagram using weight assignment methods</dc:title><dc:creator>Sornkliang, Walaiporn</dc:creator><dc:creator>Phetkaew, Thimaporn</dc:creator><dc:description>&lt;jats:p&gt;The benefit of exploratory testing and ad hoc testing by tester’s experience is that crucial bugs are found quickly. Regression testing and test case prioritization are important processes of software testing when software functions have been changed. We propose a test path prioritization method to generate a sequence of test paths that would match the testers’ interests and focuses on the target area of interest or on the changed area. We generate test paths form the activity diagrams and survey the test path prioritization from testers. We define node and edge weight to the symbols of activity diagrams by applying Time management, Pareto, Buffett, Binary, and Bipolar method. Then we propose a test path score equation to prioritize test paths. We also propose evaluation methods i.e., the difference and the similarity of test path prioritization to testers’ interests. Our proposed method had the least average of the difference and the most average of the similarity compare with the tester’s prioritization of test paths. The Bipolar method was the most suitable for assigning weights to match test path rank by the tester. Our proposed method also has given the affected path by changing area higher priority than the other test path.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2021-02-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v11i1.pp575-588</dc:identifier><dc:identifier>10.11591/ijece.v11i1.pp575-588</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 11 No 1 (2021); 575</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/22818/14527</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>