Static and dynamic analysis of call chains in java

ABSTRACT

This work presents a parameterized framework for static and dynamic analysis of call chains in Java components. Such analyses have a wide range of uses in tools for software understanding and testing. We also describe a test coverage tool built with these analyses and the use of the tool on a real-world test suite. Our experiments evaluate the exact precision of several instances of the framework and provide a novel approach for estimating the limits of class analysis technology for computing precise call chains.

REFERENCES

• 1: A. Abdurazik and J. Offutt. Using UML collaboration diagrams for static checking and test generation. In Int. Conf. Unified Modeling Language (UML'00), pages 383--395, 2000.
• 2: Glenn Ammons , Thomas Ball , James R. Larus, Exploiting hardware performance counters with flow and context sensitive profiling, Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation, p.85-96, June 16-18, 1997, Las Vegas, Nevada, United States
• 3: L. O. Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, DIKU, University of Copenhagen, 1994.
• 4: David F. Bacon , Peter F. Sweeney, Fast static analysis of C++ virtual function calls, Proceedings of the 11th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, p.324-341, October 06-10, 1996, San Jose, California, United States
• 5: Robert V. Binder, Testing object-oriented systems: models, patterns, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1999
• 6: Rastislav Bodík , Rajiv Gupta , Mary Lou Soffa, Refining data flow information using infeasible paths, Proceedings of the 6th European conference held jointly with the 5th ACM SIGSOFT international symposium on Foundations of software engineering, p.361-377, September 22-25, 1997, Zurich, Switzerland
• 7: L. Briand and Y. Labiche. A UML-based approach to system testing. J. Software and Systems Modeling, 1(1), 2002.
• 8: Falk Fraikin , Thomas Leonhardt, SeDiTeC " Testing Based on Sequence Diagrams, Proceedings of the 17th IEEE international conference on Automated software engineering, p.261, September 23-27, 2002
• 9: Allen Goldberg , T. C. Wang , David Zimmerman, Applications of feasible path analysis to program testing, Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis, p.80-94, August 17-19, 1994, Seattle, Washington, United States [doi>10.1145/186258.186523]
• 10: James Gosling , Bill Joy , Guy Steele , Gilad Bracha, Java Language Specification, Second Edition: The Java Series, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 2000
• 11: David Grove , Craig Chambers, A framework for call graph construction algorithms, ACM Transactions on Programming Languages and Systems (TOPLAS), v.23 n.6, p.685-746, November 2001 [doi>10.1145/506315.506316]
• 12: L. H. Holley and B. Rosen. Qualified data flow problems. IEEE Trans. Software Engineering, 7(1):60--78, Jan. 1981.
• 13: Paul C. Jorgensen , Carl Erickson, Object-oriented integration testing, Communications of the ACM, v.37 n.9, p.30-38, Sept. 1994 [doi>10.1145/182987.182989]
• 14: O. Lhoták and L. Hendren. Scaling Java points-to analysis using Spark. In Int. Conf. Compiler Construction, LNCS 2622, pages 153--169, 2003.
• 15: Donglin Liang , Maikel Pennings , Mary Jean Harrold, Extending and evaluating flow-insenstitive and context-insensitive points-to analyses for Java, Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering, p.73-79, June 2001, Snowbird, Utah, United States [doi>10.1145/379605.379676]
• 16: Thomas J. McCabe , Charles W. Butler, Design complexity measurement and testing, Communications of the ACM, v.32 n.12, p.1415-1425, Dec. 1989 [doi>10.1145/76380.76382]
• 17: Martin P. Robillard , Gail C. Murphy, Concern graphs: finding and describing concerns using structural program dependencies, Proceedings of the 24th International Conference on Software Engineering, May 19-25, 2002, Orlando, Florida [doi>10.1145/581339.581390]
• 18: Atanas Rountev , Scott Kagan , Michael Gibas, Evaluating the imprecision of static analysis, Proceedings of the ACM-SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering, June 07-08, 2004, Washington DC, USA [doi>10.1145/996821.996829]
• 19: Atanas Rountev , Ana Milanova , Barbara G. Ryder, Points-to analysis for Java using annotated constraints, Proceedings of the 16th ACM SIGPLAN conference on Object oriented programming, systems, languages, and applications, p.43-55, October 14-18, 2001, Tampa Bay, FL, USA
• 20: Fragment Class Analysis for Testing of Polymorphism in Java Software, IEEE Transactions on Software Engineering, v.30 n.6, p.372-387, June 2004 [doi>10.1109/TSE.2004.20]
• 21: James Rumbaugh , Ivar Jacobson , Grady Booch, The Unified Modeling Language reference manual, Addison-Wesley Longman Ltd., Essex, UK, 1998
• 22: B. G. Ryder. Dimensions of precision in reference analysis of object-oriented programming languages. In Int. Conf. Compiler Construction, 2003.
• 23: Olin Grigsby Shivers, Control-flow analysis of higher-order languages of taming lambda, Carnegie Mellon University, Pittsburgh, PA, 1991
• 24: Saurabh Sinha , Mary Jean Harrold, Analysis and Testing of Programs with Exception Handling Constructs, IEEE Transactions on Software Engineering, v.26 n.9, p.849-871, September 2000 [doi>10.1109/32.877846]
• 25: A. Souter and L. Pollock. Characterization and automatic identification of type infeasible call chains. Information and Software Technology, 44:721--732, 2002.
• 26: Amie L. Souter , Lori L. Pollock, The Construction of Contextual Def-Use Associations for Object-Oriented Systems, IEEE Transactions on Software Engineering, v.29 n.11, p.1005-1018, November 2003 [doi>10.1109/TSE.2003.1245302]
• 27: M. Streckenbach and G. Snelting. Points-to for Java: A general framework and an empirical comparison. Technical report, U. Passau, Sept. 2000.
• 28: Clemens Szyperski, Component Software: Beyond Object-Oriented Programming, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 2002
• 29: Paolo Tonella , Alessandra Potrich, Reverse Engineering of the Interaction Diagrams from C++ Code, Proceedings of the International Conference on Software Maintenance, p.159, September 22-26, 2003
• 30: Ye Wu , Mei-Hwa Chen , Jeff Offutt, UML-Based Integration Testing for Component-Based Software, Proceedings of the Second International Conference on COTS-Based Software Systems, p.251-260, February 10-13, 2003

INDEX TERMS

Primary Classification:
  D. Software
  D.2 SOFTWARE ENGINEERING
      D.2.5 Testing and Debugging
          Subjects: Testing tools (e.g., data generators, coverage testing)

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

General Terms:
Algorithms, Measurement

Keywords:
call chains, call graph, dynamic analysis, static analysis