Article

Free access

The weak mutation hypothesis

Author:

Brian MarickAuthors Info & Claims

TAV4: Proceedings of the symposium on Testing, analysis, and verification

Pages 190 - 199

https://doi.org/10.1145/120807.120825

Published: 01 October 1991 Publication History

PDF eReader

References

[1]

V. Basili and D. Weiss "A Methodology for collecting valid software engineering data, IEEE Transactions on Software Engineering, vol. SE-10, pp. 728-738, November, 1984.

Digital Library

Google Scholar

[2]

V. Basili and R.W. Selby. "Comparing the Effectiveness of Software Testing Strategies.IEEE Transactions on Software Engineering, vol. SE-13, No. 12, pp. 1278- 1296, December, 1987.

Digital Library

Google Scholar

[3]

Timothy Budd, R.A. DeMillo, R.J. Lipton, and F.G. Sayward. Theoretical and Empirical Studies on Program Mutation to Test the Functional Correctness of Programs. Technical Report GIT-ICS 80/01, Georgia Institute of Technology, 1980.

Crossref

Google Scholar

[4]

R.A. Demillo, R.J. Lipton, and F.G. Sayward, Hints on test data selection: help for the practicing programmer. Computer. vol. 11, no. 4, pp. 34-41, April, 1978.

Digital Library

Google Scholar

[5]

R.A. DeMillo and A.J. Offutt. "Experimental Results of Automatically Generated Adequate Test Sets". Proceedings of the 6th Annual Pacific Northwest Software Quality Conference, Portland, Oregon, September 1988.

Google Scholar

[6]

M.R. Girgis, M.R. Woodward. "An experimental comparison of the error exposing ability of program testing criteria". In Proceeding of the Workshop on Software Te8ting Conference, pp. 64-73, Banff, Canda, 1986.

Google Scholar

[7]

Robert L. Glass. "Persistent Software Errors". Transactions on Software Engineering, vol. SE-7, No. 2, pp. 162-168, March, 1981.

Digital Library

Google Scholar

[8]

M.A. Hennell, D. Hedley, and I.J. Riddell. "Asessing a Class of Software Tools." Proceedings of the 7th International Conference on Software Engineering, pp. 266-277, IEEE Press, 1984.

Digital Library

Google Scholar

[9]

W. E. Howden. "An Evaluation of the Effectiveness of Symbolic Testing". Software - Practice and Experience, vol. 8, no. 47 pp. 381-398, July -August, 1978.

Crossref

Google Scholar

[10]

William Howden. "Applicability of Software Validation Techniques to Scientific Programs.Transactions on Programming Languages and Systems, vol. 2, No. 3, pp. 307-320, July, 1980.

Digital Library

Google Scholar

[11]

W. E. Howden. "Weak Mutation Testing and Completeness of Test Sets". IEEE Transactions on Software Engineering, vol. SE-8, No. 4, pp. 371-379, July, 1982.

Digital Library

Google Scholar

[12]

W.E. Howden. Functional Program Testing and Analysis. New York: McGraw-Hill, 1987.

Digital Library

Google Scholar

[13]

W .L Johnson, E. Soloway, B. Cutler, and S.W. Draper. Bug Catalogue: I. Yale University Technical Report, October, 1983.

Google Scholar

[14]

L. Lauterbach and W. Randall. "Experimental Evaluation of Six Test Techniques". Proceedings of COMPASS 89, Washington, DC, June 1988, pp. 36-41.

Google Scholar

[15]

B. Marick. Two Experiments in Software Testing. Technical Report UIUCDCS-R- 90-1644, University of Illinois, 1990.

Google Scholar

[16]

T. McCabe. "A Complexity Measure". IEEE Transactions on Software Engineering, vol. SE-12, No. 4, December, 1976.

Digital Library

Google Scholar

[17]

L.J. Morell. A Theory of Error-Based Testing.Ph.D, dissertation, University of Maryland,1983.

Digital Library

Google Scholar

[18]

L.J. Morell. "A Theory of Fault- Based Testing". IEEE Transactions on software Engineering, Vol. SE-16, No. 8, August 1990, pp. 844-857.

Digital Library

Google Scholar

[19]

Glenford J. Myers. "A Controlled Experiment in Program Testing and Code Walkthroughs/Inspections. Communication of the ACM, Vol. 21, No. 9, pp. 760- 768, September, 1978.

Digital Library

Google Scholar

[20]

Glenford J. Myers. The Art of Software Testing. New York: John Wiley and Sons, 1979.

Digital Library

Google Scholar

[21]

J. Q. Ning. A Knowledge-Based Approach to Automatic Program Analysis. Ph.D. dissertation, University of Illinois, 1989.

Digital Library

Google Scholar

[22]

Simeon Ntafos. "An Evaluation of Required Element Testing Strategies". proceedings of the 7th International Conference on Software Engineering, pp. 250-256, IEEE Press, 1984.

Digital Library

Google Scholar

[23]

A.J. Offutt. Automatic Test Data Generation. Ph.D. dissertation, Department of Information and Computer Science, Georgia Institute of Technology, 1988.

Digital Library

Google Scholar

[24]

A.J. Offutt. "The Coupling Effect: Fact or Fiction. Proceeding of the ACM SIGSOFT 89 Third Symposium on Software Testing, Anaiysis, and Verification, in Software Engineering Notes, Vol. 14, No. 8, December, 1989.

Digital Library

Google Scholar

[25]

Thomas J. Ostrand and Elaine J. Weyuker. Collecting and Categorizing Software Error Data in an Industrial Environment. Journal of Systems and Software, Vol. 4, 1984, pp. 289-300.

Digital Library

Google Scholar

[26]

K. Pearson. On the Theory of Contingency and h Relation to Association and Normal Correlation. London: Draper's Co. Memoirs, Biometric Series No. 1, 1904.

Google Scholar

[27]

C. Rich and R. Waters. The Programmer's Apprentice. New York: ACM Press, 1990.

Crossref

Google Scholar

[28]

Debra J. Richardson and Margaret C. Thompson. The RELAY model of error detection and its application. Proceedings of the ACM SIGSOFT/IEEE Second Workshop on Software Testing, Analysis and Verification, Banff, Canada, July 1988.

Google Scholar

[29]

The Mothra Software Testing Environment. Software Engineering Research Center report SERC-TR-4-P, Purdue University, 1987.

Google Scholar

[30]

J.C. Spohrer, E. Pope, M. Lipman, W. Scak, S. Freiman, D. Littman, L. Johnson, E. Soloway. Bug Catalogue: II, III, IV. Yale University Technical Report YALEU/CSD/RR#386, May 1985.

Google Scholar

[31]

M.R. Woodward, D. Hedley, and M.A. Hennell. "Experience with path analysis and testing of programs". Transaction on Software Engineering, vol. SE-6, No. 3, pp. 278-286, May, 1980.

Digital Library

Google Scholar

[32]

M.R. Woodward and K. Halewood "From Weak to Strong, Dead or Alive? An Analysis of Some Mutation Testing Issues". Proceedings of the ACM SIGSOFT/IEEE Second Workshop on Software Testing, Analysis and verification, Banff, Canada, July 1988.

Google Scholar

Cited By

View all

Du HPalepu VJones JRoychoudhury APaiva AAbreu RStorey M(2024)Ripples of a Mutation — An Empirical Study of Propagation Effects in Mutation TestingProceedings of the IEEE/ACM 46th International Conference on Software Engineering10.1145/3597503.3639179(1-13)Online publication date: 20-May-2024
https://dl.acm.org/doi/10.1145/3597503.3639179
Xue YZhang ZLiu CChen SHuang Z(2024)DeepWeak: Weak Mutation Testing for Deep Learning Systems2024 IEEE 24th International Conference on Software Quality, Reliability and Security (QRS)10.1109/QRS62785.2024.00015(49-60)Online publication date: 1-Jul-2024
https://doi.org/10.1109/QRS62785.2024.00015
Meng YGay GWhalen M(2020)Ensuring the Observability of Structural Test ObligationsIEEE Transactions on Software Engineering10.1109/TSE.2018.286914646:7(748-772)Online publication date: 1-Jul-2020
https://doi.org/10.1109/TSE.2018.2869146
Show More Cited By

Index Terms

The weak mutation hypothesis

Recommendations

Uniform weak tractability

We introduce a new notion of tractability which is called uniform weak tractability. A problem is uniformly weakly tractable if the information complexity n(@e,d) of its d-variate component to be solved to within @e is not exponential in any positive ...
Nontriviality for exponential time w.r.t. weak reducibilities

A set A is nontrivial for the linear exponential time class E=DTIME(2^l^i^n) if A@?E and the sets from E which can be reduced to A are not from a single level DTIME(2^k^n) of the linear exponential hierarchy. Similarly, a set A is nontrivial for the ...
Strong recombination, weak selection, and mutation
GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computation

We show that there are unimodal fitness functions and genetic algorithm (GA) parameter settings where the GA, when initialized with a random population, will not move close to the fitness peak in a practically useful time period. When the GA is ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

TAV4: Proceedings of the symposium on Testing, analysis, and verification

October 1991

213 pages

ISBN:089791449X

DOI:10.1145/120807

Chairman:
William Howden
Univ. of California, San Diego

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

TAV-4

Sponsor:

SIGSOFT

TAV-4: Symposium on Testing Analysis and Verification

October 8 - 10, 1991

British Columbia, Victoria, Canada

Upcoming Conference

ISSTA '25

Sponsor:
sigsoft

34th ACM SIGSOFT International Symposium on Software Testing and Analysis

June 25 - 28, 2025

Trondheim , Norway

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
Total Citations
View Citations
583
Total Downloads

Downloads (Last 12 months)48
Downloads (Last 6 weeks)5

Reflects downloads up to 17 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Du HPalepu VJones JRoychoudhury APaiva AAbreu RStorey M(2024)Ripples of a Mutation — An Empirical Study of Propagation Effects in Mutation TestingProceedings of the IEEE/ACM 46th International Conference on Software Engineering10.1145/3597503.3639179(1-13)Online publication date: 20-May-2024
https://dl.acm.org/doi/10.1145/3597503.3639179
Xue YZhang ZLiu CChen SHuang Z(2024)DeepWeak: Weak Mutation Testing for Deep Learning Systems2024 IEEE 24th International Conference on Software Quality, Reliability and Security (QRS)10.1109/QRS62785.2024.00015(49-60)Online publication date: 1-Jul-2024
https://doi.org/10.1109/QRS62785.2024.00015
Meng YGay GWhalen M(2020)Ensuring the Observability of Structural Test ObligationsIEEE Transactions on Software Engineering10.1109/TSE.2018.286914646:7(748-772)Online publication date: 1-Jul-2020
https://doi.org/10.1109/TSE.2018.2869146
Abou Assi RTrad CMaalouf MMasri W(2019)Coincidental correctness in the Defects4J benchmarkSoftware Testing, Verification and Reliability10.1002/stvr.169629:3Online publication date: 25-Mar-2019
https://doi.org/10.1002/stvr.1696
Zhang YChen YCheung SXiong YZhang LTip FBodden E(2018)An empirical study on TensorFlow program bugsProceedings of the 27th ACM SIGSOFT International Symposium on Software Testing and Analysis10.1145/3213846.3213866(129-140)Online publication date: 12-Jul-2018
https://dl.acm.org/doi/10.1145/3213846.3213866
Li ZYan LLiu YZhang ZJiang B(2018)MURE: Making Use of MUtations to REfine Spectrum-Based Fault Localization2018 IEEE International Conference on Software Quality, Reliability and Security Companion (QRS-C)10.1109/QRS-C.2018.00024(56-63)Online publication date: Jul-2018
https://doi.org/10.1109/QRS-C.2018.00024
Mateo PUsaola M(2015)Reducing mutation costs through uncovered mutantsSoftware Testing, Verification & Reliability10.1002/stvr.153425:5-7(464-489)Online publication date: 1-Aug-2015
https://dl.acm.org/doi/10.1002/stvr.1534
Masri WAssi R(2014)Prevalence of coincidental correctness and mitigation of its impact on fault localizationACM Transactions on Software Engineering and Methodology10.1145/255993223:1(1-28)Online publication date: 20-Feb-2014
https://dl.acm.org/doi/10.1145/2559932
Nguyen QMadeyski L(2014)Problems of Mutation Testing and Higher Order Mutation TestingAdvanced Computational Methods for Knowledge Engineering10.1007/978-3-319-06569-4_12(157-172)Online publication date: 2014
https://doi.org/10.1007/978-3-319-06569-4_12
Reales Mateo PPolo Usaola MOffutt J(2013)Mutation at the multi-class and system levelsScience of Computer Programming10.1016/j.scico.2012.02.00578:4(364-387)Online publication date: 1-Apr-2013
https://dl.acm.org/doi/10.1016/j.scico.2012.02.005
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Uniform weak tractability

Nontriviality for exponential time w.r.t. weak reducibilities

Strong recombination, weak selection, and mutation