Fetching the paper…
Reading the bibliography…
To effectively guide the exploration of the code transform space for automated code evolution techniques, we present in this paper the first approach for structurally predicting code transforms at the level of AST nodes using conditional random fields (CRFs).
J. Pearl, “Reverend bayes on inference engines: A distributed hierarchical approach,” in Proceedings of the Second AAAI Conference on Artificial Intelligence , ser. AAAI’82. AAAI Press, 1982, pp. 133–136
1982
Earlier work this paper cites.
D. C. Liu and J. Nocedal, “On the limited memory bfgs method for large scale optimization,” Mathematical Programming , pp. 503–528, Aug 1989
1989
Earlier work this paper cites.
F. V. Jensen and F. Jensen, “Optimal junction trees,” in Proceedings of the Tenth International Conference on Uncertainty in Artificial Intelligence , ser. UAI’94. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 1994, pp. 360–366
1994
Earlier work this paper cites.
J. D. Lafferty, A. McCallum, and F. C. N. Pereira, “Conditional random fields: Probabilistic models for segmenting and labeling sequence data,” in ICML , 2001, pp. 282–289
2001
Earlier work this paper cites.
C. Elkan, “The foundations of cost-sensitive learning,” in Proceedings of the 17th International Joint Conference on Artificial Intelligence - Volume 2 , ser. IJCAI’01. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 2001, pp. 973–978
2001
Earlier work this paper cites.
R. Joshi, G. Nelson, and K. Randall, “Denali: A goal-directed superoptimizer,” SIGPLAN Not. , vol. 37, no. 5, pp. 304–314, May 2002
2002
Earlier work this paper cites.
N. V. Chawla, K. W. Bowyer, L. O. Hall, and W. P. Kegelmeyer, “Smote: synthetic minority over-sampling technique,” Journal of artificial intelligence research , vol. 16, pp. 321–357, 2002
2002
Earlier work this paper cites.
D. Pinto, A. McCallum, X. Wei, and W. B. Croft, “Table extraction using conditional random fields,” in SIGIR , 2003, pp. 235–242
2003
Earlier work this paper cites.
F. Sha and F. Pereira, “Shallow parsing with conditional random fields,” in Proceedings of the 2003 Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics , 2003, pp. 213–220
2003
Earlier work this paper cites.
T. Mens and T. Tourwé, “A survey of software refactoring,” IEEE Trans. Softw. Eng. , vol. 30, no. 2, pp. 126–139, Feb. 2004
2004
Earlier work this paper cites.
B. Settles, “Biomedical named entity recognition using conditional random fields and rich feature sets,” in Proceedings of the International Joint Workshop on Natural Language Processing in Biomedicine and its Applications (NLPBA/BioNLP) . Geneva, Switzerland: COLING, Aug. 28th and 29th 2004, pp. 107–110
2004
Earlier work this paper cites.
X. He, R. S. Zemel, and M. A. Carreira-Perpinan, “Multiscale conditional random fields for image labeling,” in CVPR , 2004
2004
Earlier work this paper cites.
D. M. Tax and R. P. Duin, “Support vector data description,” Machine Learning , vol. 54, no. 1, pp. 45–66, Jan 2004
2004
Earlier work this paper cites.
I. Tsochantaridis, T. Joachims, T. Hofmann, and Y. Altun, “Large margin methods for structured and interdependent output variables,” Journal of machine learning research , vol. 6, no. Sep, pp. 1453–1484, 2005
2005
Earlier work this paper cites.
F. Jousse, R. Gilleron, I. Tellier, and M. Tommasi, “Conditional Random Fields for XML Trees,” in Workshop on Mining and Learning in Graphs , Berlin, Germany, Sep. 2006
2006
Earlier work this paper cites.
G. BakIr, T. Hofmann, B. Schölkopf, A. J. Smola, and B. Taskar, Predicting structured data . MIT press, 2007
2007
Earlier work this paper cites.
B. Fluri, M. Wuersch, M. PInzger, and H. Gall, “Change distilling: Tree differencing for fine-grained source code change extraction,” IEEE Trans. Softw. Eng. , vol. 33, no. 11, pp. 725–743, Nov. 2007
2007
Earlier work this paper cites.
T. Menzies, J. Greenwald, and A. Frank, “Data mining static code attributes to learn defect predictors,” IEEE Transactions on Software Engineering , vol. 33, no. 1, pp. 2–13, 2007
2007
Earlier work this paper cites.
D. Koller and N. Friedman, Probabilistic graphical models: principles and techniques . MIT press, 2009
2009
Earlier work this paper cites.
M. Bruch, M. Monperrus, and M. Mezini, “Learning from examples to improve code completion systems,” in Proceedings of the 7th joint meeting of the European Software Engineering Conference and the ACM Symposium on the Foundations of Software Engineering , 2009
2009
Earlier work this paper cites.
T. Menzies, Z. Milton, B. Turhan, B. Cukic, Y. Jiang, and A. Bener, “Defect prediction from static code features: current results, limitations, new approaches,” Automated Software Engineering , vol. 17, no. 4, pp. 375–407, 2010
2010
Earlier work this paper cites.
J. Andersen and J. L. Lawall, “Generic patch inference,” Automated software engineering , vol. 17, no. 2, pp. 119–148, 2010
2010
Earlier work this paper cites.
N. Meng, M. Kim, and K. S. McKinley, “Systematic editing: Generating program transformations from an example,” in PLDI ’11 . New York, NY, USA: ACM, 2011, pp. 329–342
2011
Earlier work this paper cites.
Z. Yu, H. Hu, C. Bai, K. Cai, and W. E. Wong, “Gui software fault localization using n-gram analysis,” in 2011 IEEE 13th International Symposium on High-Assurance Systems Engineering , 2011, pp. 325–332
2011
Earlier work this paper cites.
E. Murphy-Hill, C. Parnin, and A. P. Black, “How we refactor, and how we know it,” IEEE Transactions on Software Engineering , vol. 38, no. 1, pp. 5–18, 2011
2011
Earlier work this paper cites.
D. Perelman, S. Gulwani, T. Ball, and D. Grossman, “Type-directed completion of partial expressions,” in Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation , 2012, pp. 275–286
2012
Earlier work this paper cites.
C. Sutton and A. McCallum, “An introduction to conditional random fields,” Found. Trends Mach. Learn. , Apr. 2012
2012
Earlier work this paper cites.
C. Le Goues, T. Nguyen, S. Forrest, and W. Weimer, “Genprog: A generic method for automatic software repair,” Ieee transactions on software engineering , vol. 38, no. 1, pp. 54–72, 2012
2012
Earlier work this paper cites.
——, “Lase: locating and applying systematic edits by learning from examples,” in 2013 35th International Conference on Software Engineering (ICSE) . IEEE, 2013, pp. 502–511
2013
Earlier work this paper cites.
R. Dyer, H. A. Nguyen, H. Rajan, and T. N. Nguyen, “Boa: A language and infrastructure for analyzing ultra-large-scale software repositories,” in 2013 35th International Conference on Software Engineering (ICSE) . IEEE, 2013, pp. 422–431
2013
Earlier work this paper cites.
D. Kim, J. Nam, J. Song, and S. Kim, “Automatic patch generation learned from human-written patches,” in Proceedings of the 2013 International Conference on Software Engineering , ser. ICSE ’13. Piscataway, NJ, USA: IEEE Press, 2013, pp. 802–811
2013
Earlier work this paper cites.
——, “Mutation-oriented test data augmentation for gui software fault localization,” Information and Software Technology , vol. 55, no. 12, pp. 2076–2098, 2013
2013
Earlier work this paper cites.
T. Mikolov, K. Chen, G. Corrado, and J. Dean, “Efficient estimation of word representations in vector space,” 2013
2013
Earlier work this paper cites.
H. D. T. Nguyen, D. Qi, A. Roychoudhury, and S. Chandra, “Semfix: Program repair via semantic analysis,” in 2013 35th International Conference on Software Engineering (ICSE) . IEEE, 2013, pp. 772–781
2013
Earlier work this paper cites.
J. Falleri, F. Morandat, X. Blanc, M. Martinez, and M. Monperrus, “Fine-grained and accurate source code differencing,” in ASE , 2014, pp. 313–324
2014
Earlier work this paper cites.
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 2014 International Symposium on Software Testing and Analysis , 2014, pp. 437–440
2014
Earlier work this paper cites.
Y. Qi, X. Mao, Y. Lei, Z. Dai, and C. Wang, “The strength of random search on automated program repair,” in Proceedings of the 36th International Conference on Software Engineering , ser. ICSE 2014. Association for Computing Machinery, 2014, p. 254–265
2014
Earlier work this paper cites.
R. Dyer, H. Rajan, H. A. Nguyen, and T. N. Nguyen, “Mining billions of ast nodes to study actual and potential usage of java language features,” in Proceedings of the 36th International Conference on Software Engineering , 2014, pp. 779–790
2014
Earlier work this paper cites.
J. Galenson, P. Reames, R. Bodik, B. Hartmann, and K. Sen, “Codehint: Dynamic and interactive synthesis of code snippets,” in Proceedings of the 36th International Conference on Software Engineering , 2014, pp. 653–663
2014
Cited alongside, same era.
V. Raychev, M. Vechev, and E. Yahav, “Code completion with statistical language models,” in PLDI , 2014, pp. 419–428
2014
Cited alongside, same era.
V. Raychev, M. Vechev, and A. Krause, “Predicting program properties from big code,” in POPL , 2015, pp. 111–124
2015
Cited alongside, same era.
T. Gvero and V. Kuncak, “Synthesizing java expressions from free-form queries,” in Acm Sigplan Notices , vol. 50, no. 10. ACM, 2015, pp. 416–432
2015
Cited alongside, same era.
R. Pawlak, M. Monperrus, N. Petitprez, C. Noguera, and L. Seinturier, “Spoon: A Library for Implementing Analyses and Transformations of Java Source Code,” Software: Practice and Experience , vol. 46, pp. 1155–1179, 2015
2018
Later among the works it cites.
M. Wen, J. Chen, R. Wu, D. Hao, and S.-C. Cheung, “Context-aware patch generation for better automated program repair,” in 2018 IEEE/ACM 40th International Conference on Software Engineering (ICSE) . IEEE, 2018, pp. 1–11
2018
Later among the works it cites.
G. De la Torre, R. Robbes, and A. Bergel, “Imprecisions diagnostic in source code deltas,” in Proceedings of the 15th International Conference on Mining Software Repositories , 2018, pp. 492–502
2018
Later among the works it cites.
N. Tsantalis, M. Mansouri, L. Eshkevari, D. Mazinanian, and D. Dig, “Accurate and efficient refactoring detection in commit history,” in 2018 IEEE/ACM 40th International Conference on Software Engineering (ICSE) . IEEE, 2018, pp. 483–494
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2015
Cited alongside, same era.
Z. Yu, C. Bai, and K.-Y. Cai, “Does the failing test execute a single or multiple faults? an approach to classifying failing tests,” in Proceedings of the 37th International Conference on Software Engineering - Volume 1 , ser. ICSE ’15. IEEE Press, 2015, p. 924–935
2015
Cited alongside, same era.
H. Oh, H. Yang, and K. Yi, “Learning a strategy for adapting a program analysis via bayesian optimisation,” in ACM SIGPLAN Notices , vol. 50, no. 10. ACM, 2015, pp. 572–588
2015
Cited alongside, same era.
H. Zhong and Z. Su, “An empirical study on real bug fixes,” in 2015 IEEE/ACM 37th IEEE International Conference on Software Engineering , vol. 1. IEEE, 2015, pp. 913–923
2015
Cited alongside, same era.
F. Long and M. Rinard, “Automatic patch generation by learning correct code,” in POPL , 2016, pp. 298–312
2016
Cited alongside, same era.
X. B. D. Le, D. Lo, and C. L. Goues, “History Driven Program Repair,” in Proceedings of the 23rd International Conference on Software Analysis, Evolution, and Reengineering (SANER) , 2016, pp. 213–224
2016
Cited alongside, same era.
Y. Pu, K. Narasimhan, A. Solar-Lezama, and R. Barzilay, “sk_p: a neural program corrector for moocs,” in Companion Proceedings of the 2016 ACM SIGPLAN International Conference on Systems, Programming, Languages and Applications: Software for Humanity . ACM, 2016, pp. 39–40
2016
Cited alongside, same era.
M. Soto, F. Thung, C.-P. Wong, C. Le Goues, and D. Lo, “A deeper look into bug fixes: Patterns, replacements, deletions, and additions,” in Proceedings of the 13th International Conference on Mining Software Repositories , ser. MSR ’16. New York, NY, USA: ACM, 2016, pp. 512–515
2016
Cited alongside, same era.
X. Huang, L. Zhang, B. Wang, F. Li, and Z. Zhang, “Feature clustering based support vector machine recursive feature elimination for gene selection,” Applied Intelligence , vol. 48, pp. 594–607, 2018
2018
Later among the works it cites.
B. F. Darst, K. C. Malecki, and C. D. Engelman, “Using recursive feature elimination in random forest to account for correlated variables in high dimensional data,” BMC genetics , vol. 19, no. 1, pp. 1–6, 2018
2018
Later among the works it cites.
M. Pradel and K. Sen, “Deepbugs: A learning approach to name-based bug detection,” Proc. ACM Program. Lang. , vol. 2, no. OOPSLA, pp. 147:1–147:25, Oct. 2018
2018
Later among the works it cites.
J. He, P. Ivanov, P. Tsankov, V. Raychev, and M. Vechev, “Debin: Predicting debug information in stripped binaries,” in CCS , 2018, pp. 1667–1680
2018
Later among the works it cites.
R. Paletov, P. Tsankov, V. Raychev, and M. Vechev, “Inferring crypto api rules from code changes,” in ACM SIGPLAN Notices , vol. 53, no. 4. ACM, 2018, pp. 450–464
2018
Later among the works it cites.
X. Si, H. Dai, M. Raghothaman, M. Naik, and L. Song, “Learning loop invariants for program verification,” in Proceedings of the 32nd International Conference on Neural Information Processing Systems , ser. NIPS’18. Red Hook, NY, USA: Curran Associates Inc., 2018, p. 7762–7773
2018
Later among the works it cites.
V. Murali, S. Chaudhuri, and C. Jermaine, “Bayesian sketch learning for program synthesis,” in ICLR , 2018
2018
Later among the works it cites.
M. Allamanis, E. T. Barr, P. Devanbu, and C. Sutton, “A survey of machine learning for big code and naturalness,” ACM Computing Surveys (CSUR) , vol. 51, no. 4, p. 81, 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
D. DeFreez, A. V. Thakur, and C. Rubio-González, “Path-based function embedding and its application to specification mining,” in Proceedings of ESEC/FSE , 2018
2018
Later among the works it cites.
M. Allamanis, M. Brockschmidt, and M. Khademi, “Learning to represent programs with graphs,” in ICLR , 2018
2018
Later among the works it cites.
J. Henkel, S. Lahiri, B. Liblit, and T. Reps, “Code vectors: Understanding programs through embedded abstracted symbolic traces,” in Proceedings of ESEC/FSE , 2018
2018
Later among the works it cites.
J. Jiang, Y. Xiong, H. Zhang, Q. Gao, and X. Chen, “Shaping program repair space with existing patches and similar code,” in Proceedings of the 27th ACM SIGSOFT international symposium on software testing and analysis , 2018, pp. 298–309
2018
Later among the works it cites.
M. Tufano, C. Watson, G. Bavota, M. D. Penta, M. White, and D. Poshyvanyk, “An empirical study on learning bug-fixing patches in the wild via neural machine translation,” ACM Transactions on Software Engineering and Methodology (TOSEM) , vol. 28, no. 4, pp. 1–29, 2019
2019
Closest in time.
A. Mesbah, A. Rice, E. Johnston, N. Glorioso, and E. Aftandilian, “Deepdelta: Learning to repair compilation errors,” in ESEC/FSE 2019 . New York, NY, USA: ACM, 2019, pp. 925–936
2019
Closest in time.
E. C. Campos and M. d. A. Maia, “Discovering common bug-fix patterns: A large-scale observational study,” Journal of Software: Evolution and Process , vol. 31, no. 7, p. e2173, 2019
2019
Closest in time.
M. Choetkiertikul, H. K. Dam, T. Tran, T. Pham, A. Ghose, and T. Menzies, “A deep learning model for estimating story points,” IEEE Transactions on Software Engineering , vol. 45, no. 7, pp. 637–656, 2019
2019
Closest in time.
J. Eberhardt, S. Steffen, V. Raychev, and M. Vechev, “Unsupervised learning of api aliasing specifications,” in Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation . ACM, 2019
2019
Closest in time.
J. He, M. Balunović, N. Ambroladze, P. Tsankov, and M. Vechev, “Learning to fuzz from symbolic execution with application to smart contracts,” in Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security , ser. CCS ’19, New York, NY, USA, 2019, p. 531–548
2019
Closest in time.
A. Miltner, S. Gulwani, V. Le, A. Leung, A. Radhakrishna, G. Soares, A. Tiwari, and A. Udupa, “On the fly synthesis of edit suggestions,” Proceedings of the ACM on Programming Languages , vol. 3, no. OOPSLA, pp. 1–29, 2019
2019
Closest in time.
J. Bader, A. Scott, M. Pradel, and S. Chandra, “Getafix: Learning to fix bugs automatically,” Proceedings of the ACM on Programming Languages , vol. 3, no. OOPSLA, pp. 1–27, 2019
2019
Closest in time.
U. Alon, M. Zilberstein, O. Levy, and E. Yahav, “code2vec: Learning distributed representations of code,” Proceedings of the ACM on Programming Languages , vol. 3, no. POPL, pp. 1–29, 2019
2019
Closest in time.
A. Koyuncu, K. Liu, T. F. Bissyandé, D. Kim, J. Klein, M. Monperrus, and Y. Le Traon, “Fixminer: Mining relevant fix patterns for automated program repair,” Empirical Software Engineering , pp. 1–45, 2020
2020
Closest in time.
T. Lutellier, H. V. Pham, L. Pang, Y. Li, M. Wei, and L. Tan, “Coconut: Combining context-aware neural translation models using ensemble for program repair,” in Proceedings of the 29th ACM SIGSOFT International Symposium on Software Testing and Analysis , ser. ISSTA 2020. New York, NY, USA: Association for Computing Machinery, 2020, p. 101–114
2020
Closest in time.
Y. Li, S. Wang, and T. N. Nguyen, “Dlfix: Context-based code transformation learning for automated program repair,” in Proceedings of the ACM/IEEE 42nd International Conference on Software Engineering , ser. ICSE ’20. New York, NY, USA: Association for Computing Machinery, 2020, p. 602–614
2020
Closest in time.
K. Liu, S. Wang, A. Koyuncu, K. Kim, T. F. Bissyandé, D. Kim, P. Wu, J. Klein, X. Mao, and Y. L. Traon, “On the efficiency of test suite based program repair: A systematic assessment of 16 automated repair systems for java programs,” in ICSE 2020 . ACM, 2020, p. 615–627
2020
Closest in time.
C. Watson, M. Tufano, K. Moran, G. Bavota, and D. Poshyvanyk, “On learning meaningful assert statements for unit test cases,” in ICSE , May 2020
2020
Closest in time.
M. Allamanis, E. T. Barr, S. Ducousso, and Z. Gao, “Typilus: Neural type hints,” in Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation , New York, NY, USA, 2020, p. 91–105
2020
Closest in time.
S. Brody, U. Alon, and E. Yahav, “A structural model for contextual code changes,” 2020
2020
Closest in time.
N. Jiang, T. Lutellier, and L. Tan, “Cure: Code-aware neural machine translation for automatic program repair,” in 2021 IEEE/ACM 43rd International Conference on Software Engineering (ICSE) , 2021, pp. 1161–1173
2021
Closest in time.
Q. Zhu, Z. Sun, Y.-a. Xiao, W. Zhang, K. Yuan, Y. Xiong, and L. Zhang, “A syntax-guided edit decoder for neural program repair,” in Proceedings of the 29th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering , ser. ESEC/FSE 2021. New York, NY, USA: Association for Computing Machinery, 2021, p. 341–353
2021
Closest in time.
W. Ni, J. Sunshine, V. Le, S. Gulwani, and T. Barik, “recode: A lightweight find-and-replace interaction in the ide for transforming code by example,” in The 34th Annual ACM Symposium on User Interface Software and Technology , 2021, pp. 258–269
2021
Closest in time.
S. Chakraborty, Y. Ding, M. Allamanis, and B. Ray, “Codit: Code editing with tree-based neural models,” IEEE Transactions on Software Engineering , vol. 48, no. 4, pp. 1385–1399, 2022
2022
Closest in time.