Pargas, R.P., Harrold, M.J., Peck, R.R. Test data generation using genetic algorithms. The Journal of Software Testing, Verification and Reliability, 9. 1999 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Reformulating Software Engineering as a Search Problem - Clarke, Dolado, Harman.. (Correct)
....executed by random testing and thus test generation may be broken down into two phases: use random testing to cover most constructs and then use some other technique to derive tests to cover the remaining constructs. A number of authors have considered the use of metaheuristics in the second phase [28, 29, 43, 54]. Suppose a construct has not been executed during testing. Then the tester may choose some path that contains this construct and try to derive test cases that follow this path. Consider the fragment of code (written in a C style notation) from a program produced to solve the triangle problem, ....
....cant length of time the tester might choose an alternative path. An objective function may be de ned by, given a test input, measuring how close it gets to taking this path (up to the end of the construct being considered) This might be how many predicates it has in common with the intended path [43]. The tness may be measured by instrumenting the code and the test input may be represented by a string of values or a bit string. Suppose, again, that the tester wishes to test the nal then branch of the code in Figure 4. If a test case takes the rst else branch and then the second then ....
[Article contains additional citation context not shown here]
Pargas, R. P., Harrold, M. J., and Peck, R. R. Test-data generation using genetic algorithms. The Journal of Software Testing, Veri cation and Reliability 9 (1999), 263-282.
Reformulating Software Engineering as a Search Problem - Clarke, Jones (Correct)
....executed by random testing and thus test generation may be broken down into two phases: use random testing to cover most constructs and then use some other technique to derive tests to cover the remaining constructs. A number of authors have considered the use of metaheuristics in the second phase [28, 29, 43, 54]. Suppose a construct has not been executed during testing. Then the tester may choose some path that contains this construct and try to derive test cases that follow this path. Consider the fragment of code (written in a C style notation) from a program produced to solve the triangle problem, ....
....length of time the tester might choose an alternative path. An objective function may be defined by, given a test input, measuring how close it gets to taking this path (up to the end of the construct being considered) This might be how many predicates it has in common with the intended path [43]. The fitness may be measured by instrumenting the code and the test input may be represented by a string of values or a bit string. Suppose, again, that the tester wishes to test the final then branch of the code in Figure 4. If a test case takes the first else branch and then the second then ....
[Article contains additional citation context not shown here]
PARGAS, R. P., HARROLD, M. J., AND PECK, R. R. Test-data generation using genetic algorithms. The Journal of Software Testing, Verification and Reliability 9 (1999), 263-282.
Automated Software Testing Using a Metaheuristic Technique.. - Diaz, Tuya, Blanco (2003) (Correct)
No context found.
Pargas, R.P., Harrold, M.J., Peck, R.R. Test data generation using genetic algorithms. The Journal of Software Testing, Verification and Reliability, 9. 1999
Testability Transformation for Ecient - Automated Test Data (Correct)
No context found.
R. Pargas, M. Harrold, and R. Peck. Test-data generation using genetic algorithms. Software Testing, Verification and Reliability, 9(4):263--282, 1999.
Analysis and Visualization of - Predicate Dependence On (Correct)
No context found.
R.P. Pargas, M.J. Harrold, and R.R. Peck, "Test-Data Generation Using Genetic Algorithms," The J. Software Testing, Verification and Reliability, vol. 9, pp. 263-282, 1999.
Metrics Are Fitness Functions Too - Mark Harman John (Correct)
No context found.
R. P. Pargas, M. J. Harrold, and R. R. Peck. Test-data generation using genetic algorithms. The Journal of Software Testing, Verification and Reliability, 9:263--282, 1999.
Mark Harman, Lin Hu, Rob Hierons, Joachim Wegener, Harmen.. - Andre Baresel And (Correct)
No context found.
R.P. Pargas, M.J. Harrold, and R.R. Peck, "Test-Data Generation Using Genetic Algorithms," The J. Software Testing, Verification and Reliability, vol. 9, pp. 263-282, 1999.
Getting Results from - Search--Based Approaches To (Correct)
No context found.
R. P. Pargas, M. J. Harrold, and R. R. Peck. Test-data generation using genetic algorithms. The Journal of Software Testing, Verification and Reliability, 9:263--282, 1999.
Search-based Software Test Data Generation: A Survey - McMinn (2004) (Correct)
No context found.
R. Pargas, M. Harrold, and R. Peck. Test-data generation using genetic algorithms. Software Testing, Verification and Reliability, 9(4):263--282, 1999.
Testability Transformation for Efficient Automated Test.. - McMinn, Binkley, Harman (Correct)
No context found.
R. Pargas, M. Harrold, and R. Peck. Test-data generation using genetic algorithms. Software Testing, Verification and Reliability, 9(4):263--282, 1999.
BINTEST - Binary Search-based Test Case Generation - Beydeda, Gruhn (2003) (Correct)
No context found.
R. P. Pargas, M. J. Harrold, and R. R. Peck. Test-data generation using genetic algorithms. Software Testing, Verification and Reliability, 9(4):263--282, 1999.
Test Case Generation According to the Binary Search Strategy - Beydeda, Gruhn (2003) (Correct)
No context found.
Roy P. Pargas, Mary Jean Harrold, and Robert R. Peck. Test-data generation using genetic algorithms. Software Testing, Verification and Reliability, 9(4):263-- 282, 1999.
Test Data Generation based on Binary Search for Class-level.. - Beydeda, Gruhn (2003) (Correct)
No context found.
R. P. Pargas, M. J. Harrold, and R. R. Peck. Test-data generation using genetic algorithms. Software Testing, Verification and Reliability, 9(4):263--282, 1999.
Genes and Bacteria for Automatic Test Cases.. - Baudry, Fleurey.. (2002) (Correct)
No context found.
R. Pargas, M.J. Harrold, and R. Peck, "Test-Data Generation Using Genetic Algorithms". Journal of Software Testing, Verifications, and Reliability. Vol.9, p. 263-283, 1999.
Evolutionary Testing in the Presence of Loop-Assigned Flags.. - Baresel, Harman (2004) (2 citations) (Correct)
No context found.
R. P. Pargas, M. J. Harrold, and R. R. Peck. Test-data generation using genetic algorithms. The Journal of Software Testing, Verification and Reliability, 9:263--282, 1999.
Test Case Generation According to the Binary Search Strategy - Beydeda, Gruhn (2003) (Correct)
No context found.
Roy P. Pargas, Mary Jean Harrold, and Robert R. Peck. Test-data generation using genetic algorithms. Software Testing, Verification and Reliability, 9(4):263-- 282, 1999.
Getting Results from Search-Based Approaches to Software.. - Harman, Wegener (2004) (Correct)
No context found.
R. P. Pargas, M. J. Harrold, and R. R. Peck. Test-data generation using genetic algorithms. The Journal of Software Testing, Verification and Reliability, 9:263--282, 1999.
Test Data Generation based on Binary Search for Class-level.. - Sami Beydeda Volker (2003) (Correct)
No context found.
R. P. Pargas, M. J. Harrold, and R. R. Peck. Test-data generation using genetic algorithms. Software Testing, Verification and Reliability, 9(4):263--282, 1999.
BINTEST - Binary Search-based Test Case Generation - Beydeda, Gruhn (2003) (Correct)
No context found.
R. P. Pargas, M. J. Harrold, and R. R. Peck. Test-data generation using genetic algorithms. Software Testing, Verification and Reliability, 9(4):263--282, 1999.
Exploring Very Large State Spaces Using - Genetic Algorithms Patrice (2002) (Correct)
No context found.
Roy P. Pargas, Mary Jean Harrold, and Robert Peck. Test-data generation using genetic algorithms. Journal of Software Testing, Verification, and Reliability, 9(4):263--282, 1999.
Metrics Are Fitness Functions Too - Mark Harman John (Correct)
No context found.
R. P. Pargas, M. J. Harrold, and R. R. Peck. Test-data generation using genetic algorithms. The Journal of Software Testing, Verification and Reliability, 9:263--282, 1999.
Testability Transformation - Mark Harman Lin (2004) (Correct)
No context found.
R. P. Pargas, M. J. Harrold, and R. R. Peck. Test-data generation using genetic algorithms. The Journal of Software Testing, Veri cation and Reliability, 9:263-282, 1999.
Evolutionary Testing in the Presence of Loop-Assigned Flags.. - Baresel, Harman (2004) (2 citations) (Correct)
No context found.
R. P. Pargas, M. J. Harrold, and R. R. Peck. Test-data generation using genetic algorithms. The Journal of Software Testing, Verification and Reliability, 9:263--282, 1999.
Exploring Very Large State Spaces Using - Genetic Algorithms Patrice (2002) (Correct)
No context found.
Roy P. Pargas, Mary Jean Harrold, and Robert Peck. Test-data generation using genetic algorithms. Journal of Software Testing, Verification, and Reliability, 9(4):263--282, 1999.
Consistency Techniques for Interprocedural Test Data Generation - Sy, Deville (2003) (1 citation) (Correct)
No context found.
R. P. Pargas, M. J. Harrold, and R. Peck. Test-data generation using genetic algorithms. Software Testing, Verification and Reliability, 9(4):263--282, 1999.
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC