Fetching the paper…
Reading the bibliography…
Mutation analysis measures test suite adequacy, the degree to which a test suite detects seeded faults: one test suite is better than another if it detects more mutants.
R. J. Lipton, R. A. DeMillo, and F. Sayward, “Hints on test data selection: Help for the practicing programmer,” IEEE computer , vol. 11, no. 4, pp. 34–41, 1978
1978
Earlier work this paper cites.
A. P. Mathur, “Performance, effectiveness, and reliability issues in software testing,” in Proceedings of the International Computer Software and Applications Conference (COMPSAC) , 1991, pp. 604–605
1991
Earlier work this paper cites.
W. E. Wong and A. P. Mathur, “Reducing the cost of mutation testing: An empirical study,” Journal of Systems and Software , vol. 31, no. 3, pp. 185–196, 1995
1995
Earlier work this paper cites.
A. J. Offutt, A. Lee, G. Rothermel, R. H. Untch, and C. Zapf, “An experimental determination of sufficient mutant operators,” ACM Transactions on Software Engineering and Methodology (TOSEM) , vol. 5, no. 2, pp. 99–118, 1996
1996
Earlier work this paper cites.
D. Kempe, J. Kleinberg, and É. Tardos, “Maximizing the spread of influence through a social network,” in ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2003, pp. 137–146
2003
Earlier work this paper cites.
J. H. Andrews, L. C. Briand, and Y. Labiche, “Is mutation an appropriate tool for testing experiments?” in Proceedings of the International Conference on Software Engineering (ICSE) , 2005, pp. 402–411
2005
Earlier work this paper cites.
A. Krause, A. Singh, and C. Guestrin, “Near-optimal sensor placements in gaussian processes: Theory, efficient algorithms and empirical studies,” Journal of Machine Learning Research (JMLR) , vol. 9, pp. 235–284, 2008
2008
Earlier work this paper cites.
A. Siami Namin, J. H. Andrews, and D. J. Murdoch, “Sufficient mutation operators for measuring test effectiveness,” in Proceedings of the International Conference on Software Engineering (ICSE) , 2008, pp. 351–360
2008
Earlier work this paper cites.
Y. Jia and M. Harman, “Higher order mutation testing,” Information and Software Technology , vol. 51, no. 10, pp. 1379–1393, 2009
2009
Earlier work this paper cites.
L. Zhang, S.-S. Hou, J.-J. Hu, T. Xie, and H. Mei, “Is operator-based mutant selection superior to random mutant selection?” in Proceedings of the International Conference on Software Engineering (ICSE) , 2010, pp. 435–444
2010
Earlier work this paper cites.
A. Hindle, E. T. Barr, Z. Su, M. Gabel, and P. Devanbu, “On the naturalness of software,” in International Conference on Software Engineering (ICSE) . IEEE, 2012, pp. 837–847
2012
Earlier work this paper cites.
F. Bach, “Learning with submodular functions: A convex optimization perspective,” Foundations and Trends in Machine Learning , vol. 6, no. 2-3, pp. 145–373, 2013
2013
Earlier work this paper cites.
G. Kaminski, P. Ammann, and J. Offutt, “Improving logic-based testing,” Journal of Systems and Software , vol. 86, no. 8, pp. 2002–2012, 2013
2013
Cited alongside, same era.
M. Allamanis and C. Sutton, “Mining source code repositories at massive scale using language modeling,” in Proceedings of the Tenth International Workshop on Mining Software Repositories . IEEE Press, 2013, pp. 207–216
2013
Cited alongside, same era.
T. T. Nguyen, A. T. Nguyen, H. A. Nguyen, and T. N. Nguyen, “A statistical semantic language model for source code,” in Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering . ACM, 2013, pp. 532–542
2013
Cited alongside, same era.
R. Just, D. Jalali, L. Inozemtseva, M. D. Ernst, R. Holmes, and G. Fraser, “Are mutants a valid substitute for real faults in software testing?” in Proceedings of the International Symposium on Foundations of Software Engineering (FSE) , 2014, pp. 654–665
2014
Cited alongside, same era.
S. Karaivanov, V. Raychev, and M. T. Vechev, “Phrase-based statistical translation of programming languages,” in Onward! 2014, Proceedings of the 2014 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming & Software , 2014, pp. 173–184. [Online]. Available: http://doi.acm.org/10.1145/2661136.2661148
2014
Later among the works it cites.
A. T. Nguyen, T. T. Nguyen, and T. N. Nguyen, “Migrating code with statistical machine translation,” in Companion Proceedings of the 36th International Conference on Software Engineering . ACM, 2014, pp. 544–547
2014
Later among the works it cites.
J. C. Campbell, A. Hindle, and J. N. Amaral, “Syntax errors just aren’t natural: improving error reporting with language models,” in Proceedings of the 11th Working Conference on Mining Software Repositories . ACM, 2014, pp. 252–261
2014
Later among the works it cites.
——, “Suggesting accurate method and class names,” in Symposium on the Foundations of Software Engineering (FSE) , 2015
2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. Gopinath, C. Jensen, and A. Groce, “Mutations: How close are they to real faults?” in Proceedings of the International Symposium on Software Reliability Engineering (ISSRE) , 2014, pp. 189–200
2014
Cited alongside, same era.
A. Krause and D. Golovin, “Submodular function maximization,” in Tractability: Practical Approaches to Hard Problems , L. Bordeaux, Y. Hamadi, and P. Kohli, Eds. Cambridge University Press, 2014
2014
Cited alongside, same era.
M. Allamanis, E. T. Barr, C. Bird, and C. Sutton, “Learning natural coding conventions,” in Symposium on the Foundations of Software Engineering (FSE) , 2014
2014
Cited alongside, same era.
R. Just, “The Major mutation framework: Efficient and scalable mutation analysis for Java,” in Proceedings of the International Symposium on Software Testing and Analysis (ISSTA) , San Jose, CA, USA, July 23–25 2014, pp. 433–436
2014
Cited alongside, same era.
R. Just, D. Jalali, and M. D. Ernst, “Defects4J: A database of existing faults to enable controlled testing studies for Java programs,” in Proceedings of the International Symposium on Software Testing and Analysis (ISSTA) , San Jose, CA, USA, July 23–25 2014, pp. 437–440
2014
Cited alongside, same era.
C. J. Maddison and D. Tarlow, “Structured generative models of natural source code,” in International Conference on Machine Learning (ICML) , 2014
2014
Cited alongside, same era.
Z. Tu, Z. Su, and P. Devanbu, “On the localness of software,” in Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering . ACM, 2014, pp. 269–280
2014
Cited alongside, same era.
M. Allamanis and C. Sutton, “Mining Idioms from Source Code,” in Symposium on the Foundations of Software Engineering (FSE) , 2014
2014
Cited alongside, same era.
Later among the works it cites.
R. Just and F. Schweiggert, “Higher accuracy and lower run time: efficient mutation analysis using non-redundant mutation operators,” Software Testing, Verification and Reliability (STVR) , vol. 25, no. 5-7, pp. 490–507, 2015
2015
Later among the works it cites.
V. Raychev, M. Vechev, and A. Krause, “Predicting program properties from “big code”,” in Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages . ACM, 2015, pp. 111–124
2015
Later among the works it cites.
M. Allamanis, D. Tarlow, A. D. Gordon, and Y. Wei, “Bimodal modelling of source code and natural language,” in Proceedings of The 32nd International Conference on Machine Learning , 2015, pp. 2123–2132
2015
Later among the works it cites.
R. Gopinath, M. A. Alipour, I. Ahmed, C. Jensen, and A. Groce, “On the limits of mutation reduction strategies,” in Proceedings of the International Conference on Software Engineering (ICSE) , 2016, pp. 511–522
2016
Closest in time.
R. Kurtz, P. Ammann, J. Offutt, M. E. Delamaro, M. Kurtz, and N. Gokce, “Analyzing the validity of selective mutation with dominator mutants,” in Proceedings of the International Symposium on Foundations of Software Engineering (FSE) , 2016 (to appear)
2016
Closest in time.
B. Ray, V. Hellendoorn, Z. Tu, C. Nguyen, S. Godhane, A. Bacchelli, and P. Devanbu, “On the “naturalness” of buggy code,” ICSE , 2016
2016
Closest in time.