Source Code Analysis: A Road Map

ABSTRACT

The automated and semi-automated analysis of source code has remained a topic of intense research for more than thirty years. During this period, algorithms and techniques for source-code analysis have changed, sometimes dramatically. The abilities of the tools that implement them have also expanded to meet new and diverse challenges. This paper surveys current work on source-code analysis. It also provides a road map for future work over the next five-year period and speculates on the development of source-code analysis applications, techniques, and challenges over the next 10, 20, and 50 years.

REFERENCES

• 1: [1] L. O. Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, DIKU, University of Copenhagen, May 1994. (DIKU report 94/19).
• 2: Bernard Botella , Arnaud Gotlieb , Claude Michel, Symbolic execution of floating-point computations: Research Articles, Software Testing, Verification & Reliability, v.16 n.2, p.97-121, June 2006 [doi>10.1002/stvr.v16:2]
• 3: [3] G. Balakrishnan and T. Reps. Analyzing memory accesses in x86 executables. In Proc. of the International Conference on Compiler Construction. Springer-Verlag, New York, NY, 2004.
• 4: [4] T. Ball and S. G. Eick. Visualizing program slices. In A. L. Ambler and T. D. Kimura, editors, Proceedings of the Symposium on Visual Languages, Los Alamitos, CA, USA, Oct. 1994. IEEE Computer Society Press.
• 5: Thomas Ball , James R. Larus, Efficient path profiling, Proceedings of the 29th annual ACM/IEEE international symposium on Microarchitecture, p.46-57, December 02-04, 1996, Paris, France
• 6: Françoise Balmas, Using Dependence Graphs as a Support to Document Programs, Proceedings of the Second IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'02), p.145, October 01-01, 2002
• 7: André Baresel , David Binkley , Mark Harman , Bogdan Korel, Evolutionary testing in the presence of loop-assigned flags: a testability transformation approach, Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis, July 11-14, 2004, Boston, Massachusetts, USA
• 8: Paul Clements , Rick Kazman, Software Architecture in Practices, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 2003
• 9: Keith H. Bennett , Václav T. Rajlich, Software maintenance and evolution: a roadmap, Proceedings of the Conference on The Future of Software Engineering, p.73-87, June 04-11, 2000, Limerick, Ireland [doi>10.1145/336512.336534]
• 10: Antonia Bertolino, Software Testing Research: Achievements, Challenges, Dreams, 2007 Future of Software Engineering, p.85-103, May 23-25, 2007 [doi>10.1109/FOSE.2007.25]
• 11: David Binkley, Semantics Guided Regression Test Cost Reduction, IEEE Transactions on Software Engineering, v.23 n.8, p.498-516, August 1997 [doi>10.1109/32.624306]
• 12: [12] D. Binkley and K. B. Gallagher. Program slicing. In M. Zelkowitz, editor, Advances in Computing, Volume 43. Academic Press, 1996.
• 13: [13] D. Binkley and M. Harman. Results from a large-scale study of performance optimization techniques for source code analyses based on graph reachability algorithms. In IEEE International Workshop on Source Code Analysis and Manipulation (SCAM 2003), Amsterdam, Netherlands, Sept. 2003. IEEE Computer Society Press, Los Alamitos, California, USA.
• 14: David Binkley , Mark Harman, Analysis and Visualization of Predicate Dependence on Formal Parameters and Global Variables, IEEE Transactions on Software Engineering, v.30 n.11, p.715-735, November 2004 [doi>10.1109/TSE.2004.78]
• 15: [15] D. Binkley and M. Harman. A survey of empirical results on program slicing. Advances in Computers, 62, 2004.
• 16: David Binkley , Mark Harman , Jens Krinke, Characterising, Explaining, and Exploiting the Approximate Nature of Static Analysis through Animation, Proceedings of the Sixth IEEE International Workshop on Source Code Analysis and Manipulation, p.43-52, September 27-29, 2006 [doi>10.1109/SCAM.2006.7]
• 17: [17] A. Binstock. Extra-strength code cleaners, January 2006. www.infoworld.com/article/06/01/26/ 74270_05FEcodelint_1.html.
• 18: Bruno Blanchet , Patrick Cousot , Radhia Cousot , Jérome Feret , Laurent Mauborgne , Antoine Miné , David Monniaux , Xavier Rival, A static analyzer for large safety-critical software, Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation, June 09-11, 2003, San Diego, California, USA
• 19: [19] R. Brooks. Towards a theory of comprehension of computer programs, volume 18. ACM Press Journal Man-Machine Studies, 1983.
• 20: [20] G. Canfora, A. Cimitile, and M. Munro. RE²: Reverse engineering and reuse re-engineering. Journal of Software Maintenance : Research and Practice, 6(2), 1994.
• 21: Gerardo CanforaHarman , Massimiliano Di Penta, New Frontiers of Reverse Engineering, 2007 Future of Software Engineering, p.326-341, May 23-25, 2007 [doi>10.1109/FOSE.2007.15]
• 22: [22] B. Carey. Accidental invention points to end of light bulbs, October 2005. www.livescience.com.
• 23: Jong-Deok Choi , Michael Burke , Paul Carini, Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.232-245, March 1993, Charleston, South Carolina, United States [doi>10.1145/158511.158639]
• 24: Holger Cleve , Andreas Zeller, Locating causes of program failures, Proceedings of the 27th international conference on Software engineering, May 15-21, 2005, St. Louis, MO, USA [doi>10.1145/1062455.1062522]
• 25: [25] J. Cobleigh, L. Clarke, and L. Osterweil. Flavers: A finite state verification technique for software systems. IBM Systems Journal - Software Testing and Verification, 41(1), 2002.
• 26: Anthony Cox , Michael L. Collard, Working Session: Textual Views of Source Code to Support Comprehension, Proceedings of the 13th International Workshop on Program Comprehension, p.109-112, May 15-16, 2005 [doi>10.1109/WPC.2005.49]
• 27: [27] J. Cordy, T. Dean, A. Malton, and K. Schneider. Source transformation in software engineering using the TXL transformation system. Information and Software Technology , 44(13), 2002.
• 28: [28] J. Cordy et. al. eds. International Workshop on Program Comprehension. Computer Society Press, St. Louis, MO, 2005.
• 29: [29] Coverity. www.coverity.com, 2006.
• 30: [30] 9th European Conference on Software Maintenance and Reengineering, Manchester, UK, March 2005. IEEE Computer Society.
• 31: Ron Cytron , Jeanne Ferrante , Barry K. Rosen , Mark N. Wegman , F. Kenneth Zadeck, Efficiently computing static single assignment form and the control dependence graph, ACM Transactions on Programming Languages and Systems (TOPLAS), v.13 n.4, p.451-490, Oct. 1991 [doi>10.1145/115372.115320]
• 32: Andrea de Lucia , Anna Rita Fasolino , Malcolm Munro, Understanding Function Behaviors through Program Slicing, Proceedings of the 4th International Workshop on Program Comprehension (WPC '96), p.9, March 29-31, 1996
• 33: Brian Demsky , Michael D. Ernst , Philip J. Guo , Stephen McCamant , Jeff H. Perkins , Martin Rinard, Inference and enforcement of data structure consistency specifications, Proceedings of the 2006 international symposium on Software testing and analysis, July 17-20, 2006, Portland, Maine, USA [doi>10.1145/1146238.1146266]
• 34: Matthew B. Dwyer , John Hatcliff , Robby Robby , Corina S. Pasareanu , Willem Visser, Formal Software Analysis Emerging Trends in Software Model Checking, 2007 Future of Software Engineering, p.120-136, May 23-25, 2007 [doi>10.1109/FOSE.2007.6]
• 35: [35] Edison Design Group. Compiler front ends, 2006.
• 36: Maryam Emami , Rakesh Ghiya , Laurie J. Hendren, Context-sensitive interprocedural points-to analysis in the presence of function pointers, ACM SIGPLAN Notices, v.29 n.6, p.242-256, June 1994
• 37: [37] M. Ernst, J. Perkins, P. Guo, S. McCamant, C. Pacheco, M. Tschantz, and C. Xiao. The Daikon system for dynamic detection of likely invariants. Science of Computer Programming, 2006.
• 38: Manuel Fähndrich , Jeffrey S. Foster , Zhendong Su , Alexander Aiken, Partial online cycle elimination in inclusion constraint graphs, Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation, p.85-96, June 17-19, 1998, Montreal, Quebec, Canada
• 39: Jeanne Ferrante , Karl J. Ottenstein , Joe D. Warren, The program dependence graph and its use in optimization, ACM Transactions on Programming Languages and Systems (TOPLAS), v.9 n.3, p.319-349, July 1987 [doi>10.1145/24039.24041]
• 40: Charles N. Fischer , Richard J. LeBlanc, Jr., Crafting a compiler, Benjamin-Cummings Publishing Co., Inc., Redwood City, CA, 1988
• 41: Robert France , Bernhard Rumpe, Model-driven Development of Complex Software: A Research Roadmap, 2007 Future of Software Engineering, p.37-54, May 23-25, 2007 [doi>10.1109/FOSE.2007.14]
• 42: Keith Brian Gallagher , James R. Lyle, Using Program Slicing in Software Maintenance, IEEE Transactions on Software Engineering, v.17 n.8, p.751-761, August 1991 [doi>10.1109/32.83912]
• 43: Carl A. Gunter, Abstracting dependencies between software configuration items, ACM Transactions on Software Engineering and Methodology (TOSEM), v.9 n.1, p.94-131, Jan. 2000 [doi>10.1145/332740.332743]
• 44: [44] R. Gupta, M. J. Harrold, and M. L. Soffa. An approach to regression testing using slicing. Proc. of the Int. Conf. on Software Maintenance, 1992.
• 45: Rajiv Gupta , Mary Lou Soffa , John Howard, Hybrid slicing: integrating dynamic information with static analysis, ACM Transactions on Software Engineering and Methodology (TOSEM), v.6 n.4, p.370-397, Oct. 1997 [doi>10.1145/261640.261644]
• 46: [46] S. Guyer and C. Lin. Client-driven pointer analysis. In FCRC Static Analysis Symposium, June 2003.
• 47: Brian Hackett , Alex Aiken, How is aliasing used in systems software?, Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering, November 05-11, 2006, Portland, Oregon, USA [doi>10.1145/1181775.1181785]
• 48: Mark Harman, The Current State and Future of Search Based Software Engineering, 2007 Future of Software Engineering, p.342-357, May 23-25, 2007 [doi>10.1109/FOSE.2007.29]
• 49: Mark Harman , David Binkley , Sebastian Danicic, Amorphous program slicing, Journal of Systems and Software, v.68 n.1, p.45-64, 15 October 2003 [doi>10.1016/S0164-1212(02)00135-8]
• 50: Mark Harman , Chris Fox , Robert Hierons , David Binkley , Sebastian Danicic, Program Simplification as a Means of Approximating Undecidable Propositions, Proceedings of the 7th International Workshop on Program Comprehension, p.208, May 05-07, 1999
• 51: M. Harman , N. Gold , R. Hierons , D. Binkley, Code Extraction Algorithms which Unify Slicing and Concept Assignment, Proceedings of the Ninth Working Conference on Reverse Engineering (WCRE'02), p.11, October 29-November 01, 2002
• 52: Mark Harman , Bogdan Korel , Panagioties K. Linos, Guest Editorial: Special Issue on Software Maintenance and Evolution, IEEE Transactions on Software Engineering, v.31 n.10, p.801-803, October 2005 [doi>10.1109/TSE.2005.113]
• 53: Mary Jean Harrold, Testing: a roadmap, Proceedings of the Conference on The Future of Software Engineering, p.61-72, June 04-11, 2000, Limerick, Ireland [doi>10.1145/336512.336532]
• 54: Mats P. E. Heimdahl, Safety and Software Intensive Systems: Challenges Old and New, 2007 Future of Software Engineering, p.137-152, May 23-25, 2007 [doi>10.1109/FOSE.2007.18]
• 55: Dirk Heuzeroth , Thomas Holl , Gustav Högström , Welf Löwe, Automatic Design Pattern Detection, Proceedings of the 11th IEEE International Workshop on Program Comprehension, p.94, May 10-11, 2003
• 56: [56] R. M. Hierons, M. Harman, and S. Danicic. Using program slicing to assist in the detection of equivalent mutants. Software Testing, Verification and Reliability, 9(4), 1999.
• 57: Michael Hind, Pointer analysis: haven't we solved this problem yet?, Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering, p.54-61, June 2001, Snowbird, Utah, United States [doi>10.1145/379605.379665]
• 58: Susan Horwitz, Precise flow-insensitive may-alias analysis is NP-hard, ACM Transactions on Programming Languages and Systems (TOPLAS), v.19 n.1, p.1-6, Jan. 1997 [doi>10.1145/239912.239913]
• 59: Susan Horwitz , Thomas Reps, The use of program dependence graphs in software engineering, Proceedings of the 14th international conference on Software engineering, p.392-411, May 11-15, 1992, Melbourne, Australia [doi>10.1145/143062.143156]
• 60: Susan Horwitz , Thomas Reps , David Binkley, Interprocedural slicing using dependence graphs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.12 n.1, p.26-60, Jan. 1990 [doi>10.1145/77606.77608]
• 61: Valerie Issarny , Mauro Caporuscio , Nikolaos Georgantas, A Perspective on the Future of Middleware-based Software Engineering, 2007 Future of Software Engineering, p.244-258, May 23-25, 2007 [doi>10.1109/FOSE.2007.2]
• 62: Daniel Jackson , Martin Rinard, Software analysis: a roadmap, Proceedings of the Conference on The Future of Software Engineering, p.133-145, June 04-11, 2000, Limerick, Ireland [doi>10.1145/336512.336545]
• 63: Mehdi Jazayeri, Some Trends in Web Application Development, 2007 Future of Software Engineering, p.199-213, May 23-25, 2007 [doi>10.1109/FOSE.2007.26]
• 64: James A. Jones , Mary Jean Harrold, Empirical evaluation of the tarantula automatic fault-localization technique, Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering, November 07-11, 2005, Long Beach, CA, USA [doi>10.1145/1101908.1101949]
• 65: [65] K. K7. www.klocwork.com, 2006.
• 66: Stephen H. Kan, Metrics and Models in Software Quality Engineering, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 2002
• 67: Sarfraz Khurshid , Yuk Lai Suen, Generalizing symbolic execution to library classes, Proceedings of the 6th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering, September 05-06, 2005, Lisbon, Portugal
• 68: [68] P. Koopman. Elements of the self-healing system problem space. In Workshop on Software Architectures for Dependable Systems (WADS), May 2003.
• 69: Bogdan Korel , Jurgen Rilling, Dynamic Program Slicing in Understanding of Program Execution, Proceedings of the 5th International Workshop on Program Comprehension (WPC '97), p.80, May 28-30, 1997
• 70: Arun Lakhotia , Eric Uday Kumar, Abstracting Stack to Detect Obfuscated Calls in Binaries, Proceedings of the Source Code Analysis and Manipulation, Fourth IEEE International Workshop on (SCAM'04), p.17-26, September 15-16, 2004 [doi>10.1109/SCAM.2004.1]
• 71: Arun Lakhotia , Junwei Li , Andrew Walenstein , Yun Yang, Towards a Clone Detection Benchmark Suite and Results Archive, Proceedings of the 11th IEEE International Workshop on Program Comprehension, p.285, May 10-11, 2003
• 72: William Landi , Barbara G. Ryder, Pointer-induced aliasing: a problem taxonomy, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.93-103, January 21-23, 1991, Orlando, Florida, United States [doi>10.1145/99583.99599]
• 73: William Landi , Barbara G. Ryder, A safe approximate algorithm for interprocedural aliasing, Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation, p.235-248, June 15-19, 1992, San Francisco, California, United States
• 74: Dawn Lawrie , Christopher Morrell , Henry Feild , David Binkley, What's in a Name? A Study of Identifiers, Proceedings of the 14th IEEE International Conference on Program Comprehension (ICPC'06), p.3-12, June 14-16, 2006 [doi>10.1109/ICPC.2006.51]
• 75: Donglin Liang , Mary Jean Harrold, Efficient Computation of Parameterized Pointer Information for Interprocedural Analyses, Proceedings of the 8th International Symposium on Static Analysis, p.279-298, July 16-18, 2001
• 76: Chao Liu , Long Fei , Xifeng Yan , Jiawei Han , Samuel P. Midkiff, Statistical Debugging: A Hypothesis Testing-Based Approach, IEEE Transactions on Software Engineering, v.32 n.10, p.831-848, October 2006 [doi>10.1109/TSE.2006.105]
• 77: [77] J. R. Lyle and M. Weiser. Automatic program bug location by program slicing. In 2nd International Conference on Computers and Applications, Peking, 1987. IEEE Computer Society Press, Los Alamitos, California, USA.
• 78: Michael R. Lyu, Software Reliability Engineering: A Roadmap, 2007 Future of Software Engineering, p.153-170, May 23-25, 2007 [doi>10.1109/FOSE.2007.24]
• 79: S. Mancoridis , B. S. Mitchell , Y. Chen , E. R. Gansner, Bunch: A Clustering Tool for the Recovery and Maintenance of Software System Structures, Proceedings of the IEEE International Conference on Software Maintenance, p.50, August 30-September 03, 1999
• 80: Andrian Marcus , Jonathan I. Maletic, Identification of High-Level Concept Clones in Source Code, Proceedings of the 16th IEEE international conference on Automated software engineering, p.107, November 26-29, 2001
• 81: Michael Martin , Benjamin Livshits , Monica S. Lam, Finding application errors and security flaws using PQL: a program query language, Proceedings of the 20th annual ACM SIGPLAN conference on Object oriented programming, systems, languages, and applications, October 16-20, 2005, San Diego, CA, USA
• 82: Phil McMinn, Search-based software test data generation: a survey: Research Articles, Software Testing, Verification & Reliability, v.14 n.2, p.105-156, June 2004 [doi>10.1002/stvr.v14:2]
• 83: Atif M. Memon , Qing Xie, Studying the Fault-Detection Effectiveness of GUI Test Cases for Rapidly Evolving Software, IEEE Transactions on Software Engineering, v.31 n.10, p.884-896, October 2005 [doi>10.1109/TSE.2005.117]
• 84: [84] M. Mendonca and N. Sunderhaft. Mining software engineering data: A survey, 1999.
• 85: Daniel Le Métayer, Program analysis for software engineering: new applications, new requirements, new tools, ACM Computing Surveys (CSUR), v.28 n.4es, Dec. 1996 [doi>10.1145/242224.242435]
• 86: Brian S. Mitchell , Spiros Mancoridis, On the Automatic Modularization of Software Systems Using the Bunch Tool, IEEE Transactions on Software Engineering, v.32 n.3, p.193-208, March 2006 [doi>10.1109/TSE.2006.31]
• 87: Leon Moonen, Generating Robust Parsers using Island Grammars, Proceedings of the Eighth Working Conference on Reverse Engineering (WCRE'01), p.13, October 02-05, 2001
• 88: [88] G. Moore. Cramming more components onto integrated circuits. Electronics Magazine, 1965.
• 89: Robert Muth , Saumya Debray, On the complexity of flow-sensitive dataflow analyses, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.67-80, January 19-21, 2000, Boston, MA, USA [doi>10.1145/325694.325704]
• 90: Henrik Nilsson , Peter Fritzson, Lazy Algorithmic Debugging: Ideas for Practical Implementation, Proceedings of the First International Workshop on Automated and Algorithmic Debugging, p.117-134, May 03-05, 1993
• 91: Jim Q. Ning , Andre Engberts , W. Voytek Kozaczynski, Automated support for legacy code understanding, Communications of the ACM, v.37 n.5, p.50-57, May 1994 [doi>10.1145/175290.175295]
• 92: Sokhom Pheng , Clark Verbrugge, Dynamic Data Structure Analysis for Java Programs, Proceedings of the 14th IEEE International Conference on Program Comprehension (ICPC'06), p.191-201, June 14-16, 2006 [doi>10.1109/ICPC.2006.20]
• 93: [93] H. Pohlheim. Visualization of evolutionary algorithms - set of standard techniques and multidimensional visualization. In W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith, editors, Proceedings of the Genetic and Evolutionary Computation Conference , volume 1, Orlando, Florida, USA, 13-17 July 1999. Morgan Kaufmann.
• 94: Alexander Pretschner , Manfred Broy , Ingolf H. Kruger , Thomas Stauner, Software Engineering for Automotive Systems: A Roadmap, 2007 Future of Software Engineering, p.55-71, May 23-25, 2007 [doi>10.1109/FOSE.2007.22]
• 95: Feng Qian , Laurie Hendren, Towards dynamic interprocedural analysis in JVMs, Proceedings of the 3rd conference on Virtual Machine Research And Technology Symposium, p.11-11, May 06-07, 2004, San Jose, California
• 96: G. Ramalingam, Context-sensitive synchronization-sensitive analysis is undecidable, ACM Transactions on Programming Languages and Systems (TOPLAS), v.22 n.2, p.416-430, March 2000 [doi>10.1145/349214.349241]
• 97: Daniel Ratiu , Florian Deissenboeck, How Programs Represent Reality (and how they don't), Proceedings of the 13th Working Conference on Reverse Engineering (WCRE 2006), p.83-92, October 23-27, 2006 [doi>10.1109/WCRE.2006.32]
• 98: [98] T. Reps. Program analysis via graph reachability. In M. Harman and K. Gallagher, editors, Information and Software Technology Special Issue on Program Slicing, volume 40(11 and 12). Elsevier Science B. V., 1998.
• 99: J. Rilling , S. P. Mudur, On the Use of Metaballs to Visually Map Source Code Structures and Analysis Results onto 3D Space, Proceedings of the Ninth Working Conference on Reverse Engineering (WCRE'02), p.299, October 29-November 01, 2002
• 100: Erik Ruf, Context-insensitive alias analysis reconsidered, ACM SIGPLAN Notices, v.30 n.6, p.13-22, June 1995
• 101: [101] S. Rugaber. Program Comprehension, volume 35(20). Marcel Dekker, Inc. New York, 1995.
• 102: [102] B. Ryder. Dimensions of precision in reference analysis of object-oriented programming languages. In Proc. of the Twelfth International Conference on Compiler Construction , Warsaw, Poland, April 2003.
• 103: David Saff , Michael D. Ernst, Reducing wasted development time via continuous testing, Proceedings of the 14th International Symposium on Software Reliability Engineering, p.281, November 17-21, 2003
• 104: Mooly Sagiv , Thomas Reps , Reinhard Wilhelm, Parametric shape analysis via 3-valued logic, ACM Transactions on Programming Languages and Systems (TOPLAS), v.24 n.3, p.217-298, May 2002 [doi>10.1145/514188.514190]
• 105: Kamran Sartipi , Kostas Kontogiannis, Software architecture recovery based on pattern matching, University of Waterloo, Waterloo, Ont., Canada, 2003
• 106: David A. Schmidt, Structure-preserving binary relations for program abstraction, The essence of computation: complexity, analysis, transformation, Springer-Verlag New York, Inc., New York, NY, 2002
• 107: G. Gordon Schulmeyer , James I. McManus, Handbook of software quality assurance (3rd ed.), Prentice Hall PTR, Upper Saddle River, NJ, 1998
• 108: [108] N. Shahmehri. Generalized algorithmic debugging. PhD Thesis, Department of Computer Science and Information Science, Linköoping University, Sweden, 1991. Available as Linköping Studies in Science and Technology, Dissertations, Number 260.
• 109: [109] J. Silva. Algorithmic debugging strategies. In International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2006), 2006.
• 110: Dag I. K. Sjoberg , Tore Dyba , Magne Jorgensen, The Future of Empirical Methods in Software Engineering Research, 2007 Future of Software Engineering, p.358-378, May 23-25, 2007 [doi>10.1109/FOSE.2007.30]
• 111: Dennis Strein , Hans Kratz , Welf Lowe, Cross-Language Program Analysis and Refactoring, Proceedings of the Sixth IEEE International Workshop on Source Code Analysis and Manipulation, p.207-216, September 27-29, 2006 [doi>10.1109/SCAM.2006.10]
• 112: [112] A. Stuckenholz. Component evolution and versioning state of the art. ACM Press, 2005.
• 113: Axel van Lamsweerde, Formal specification: a roadmap, Proceedings of the Conference on The Future of Software Engineering, p.147-159, June 04-11, 2000, Limerick, Ireland [doi>10.1145/336512.336546]
• 114: Daniel Weise , Roger F. Crew , Michael Ernst , Bjarne Steensgaard, Value dependence graphs: representation without taxation, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.297-310, January 16-19, 1994, Portland, Oregon, United States [doi>10.1145/174675.177907]
• 115: [115] M. Weiser. Program slicing. IEEE Transactions on Software Engineering, 10(4), 1984.
• 116: Robert P. Wilson , Monica S. Lam, Efficient context-sensitive pointer analysis for C programs, ACM SIGPLAN Notices, v.30 n.6, p.1-12, June 1995
• 117: Murray Woodside , Greg Franks , Dorina C. Petriu, The Future of Software Performance Engineering, 2007 Future of Software Engineering, p.171-187, May 23-25, 2007 [doi>10.1109/FOSE.2007.32]
• 118: Hongji Yang , Martin Ward, Successful Evolution of Software Systems, Artech House, Inc., Norwood, MA, 2003
• 119: Andreas Zeller, The Future of Programming Environments: Integration, Synergy, and Assistance, 2007 Future of Software Engineering, p.316-325, May 23-25, 2007 [doi>10.1109/FOSE.2007.31]

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.3 LOGICS AND MEANINGS OF PROGRAMS
      F.3.2 Semantics of Programming Languages
          Subjects: Program analysis

Additional Classification:
  D. Software
  D.2 SOFTWARE ENGINEERING
      D.2.4 Software/Program Verification
      D.2.5 Testing and Debugging

  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.2 Automatic Programming
          Subjects: Program verification

General Terms:
Design, Verification