2019
DOI: 10.1016/j.infsof.2019.06.001
|View full text |Cite
|
Sign up to set email alerts
|

Test case selection-prioritization approach based on memoization dynamic programming algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
16
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 21 publications
(16 citation statements)
references
References 13 publications
0
16
0
Order By: Relevance
“…e SATO problem formulated above has a structure with Markov property and can be solved using the DP method like other Markov decision processes. Developed firstly by Richard Bellman in 1952, DP solves a complex optimization problem by recursively splitting it into simpler subproblems with similar features until the subproblems are resoluble, and the global solution is obtained by combining results of subproblems [33]. However, the classic DP is usually impracticable for the curse of dimensionality when applied to specific programs [34].…”
Section: Solution Methodologymentioning
confidence: 99%
“…e SATO problem formulated above has a structure with Markov property and can be solved using the DP method like other Markov decision processes. Developed firstly by Richard Bellman in 1952, DP solves a complex optimization problem by recursively splitting it into simpler subproblems with similar features until the subproblems are resoluble, and the global solution is obtained by combining results of subproblems [33]. However, the classic DP is usually impracticable for the curse of dimensionality when applied to specific programs [34].…”
Section: Solution Methodologymentioning
confidence: 99%
“…Our claim has an evidence from a recently published survey study [18] where researchers preferred the computerized and automated reasoning for decision-making over manually handled approaches which have more chances of human errors. In a recently published work, Banias [103] proposed to give a high priority to test cases linked with requirements which specify end users' health and safety. Test cases of end users' health has more priority than the safety unrelated test cases.…”
Section: Other Tcp Techniquesmentioning
confidence: 99%
“…With the SLR structure, several applicable research questions (RQs) were framed based on the study's goal. Banias [36] proposed a dynamic programming model for handling TCP assessment problems using low memory consumption in pseudo-polynomial time complexity applicable in the assessment. Chi et al [37] presented a relation-based TCP technique called additional greedy method call sequence (AGCS) based on method call sequences.…”
Section: Literature Review On Tcpmentioning
confidence: 99%
“…We conduct a comparison with respect to TCP and PLI models. State-of-the-art TCP models from Pradhan et al [33], Shrivatsan et al [34], and Banias [36] are considered for investigation with the proposed model. Table 4 provides the investigation with respect to different characteristics gathered from experts' intuition and the literature.…”
Section: Comparative Investigation With Existing Modelsmentioning
confidence: 99%