Trace-Based Memory Aliasing Across Program Versions
暂无分享,去创建一个
Suresh Jagannathan | Ananth Grama | Murali Krishna Ramanathan | A. Grama | S. Jagannathan | M. Ramanathan
[1] A. Orso,et al. Efficient and precise dynamic impact analysis using execute-after sequences , 2005, Proceedings. 27th International Conference on Software Engineering, 2005. ICSE 2005..
[2] M. O. Dayhoff. A model of evolutionary change in protein , 1978 .
[3] Xiangyu Zhang,et al. Matching execution histories of program versions , 2005, ESEC/FSE-13.
[4] Daniel S. Hirschberg,et al. Algorithms for the Longest Common Subsequence Problem , 1977, JACM.
[5] Michael Hind,et al. Pointer analysis: haven't we solved this problem yet? , 2001, PASTE '01.
[6] Alessandro Orso,et al. Leveraging field data for impact analysis and regression testing , 2003, ESEC/FSE-11.
[7] Audris Mockus,et al. Does Code Decay? Assessing the Evidence from Change Management Data , 2001, IEEE Trans. Software Eng..
[8] Harish Patil,et al. Pin: building customized program analysis tools with dynamic instrumentation , 2005, PLDI '05.
[9] Michael Hind,et al. Which pointer analysis should I use? , 2000, ISSTA '00.
[10] William G. Griswold,et al. Dynamically discovering likely program invariants to support program evolution , 1999, Proceedings of the 1999 International Conference on Software Engineering (IEEE Cat. No.99CB37002).
[11] Suresh Jagannathan,et al. Single and loving it: must-alias analysis for higher-order languages , 1998, POPL '98.
[12] Gregg Rothermel,et al. Whole program path-based dynamic impact analysis , 2003, 25th International Conference on Software Engineering, 2003. Proceedings..
[13] Clifford Stein,et al. Introduction to Algorithms, 2nd edition. , 2001 .
[14] S. Henikoff,et al. Amino acid substitution matrices from protein blocks. , 1992, Proceedings of the National Academy of Sciences of the United States of America.
[15] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .