Abstract

Graphical methods offer the structural icon of the system that facilitates testing the logical progress of the program. A control flow graph describes the sequence in which the instructions of a program will get executed. PDG represents a program as a graph where statements and predicate expressions can be characterized by the nodes. The System Dependence Graph (SDG) is an extension of the Program Dependence Graph (PDG) and represents a program that consists of multiple procedures and involves procedural calls. An assessment of flow graphs & dependence graphs can be performed on the basis of properties like control dependence, data dependence, transitive dependence, flow sensitivity, parameter passing etc.

References

• M. E. Paige, "On partitioning Program Graphs", IEEE Transactions on Software Engineering, vol. se-3, no. 6, pp. 386-393, November 1977.
• Frances E. Allen, "Control Flow Analysis", In Proceedings of a Symposium on Compiler optimization, ACM SIGPLAN Notices, vol. 5, July 1970.
• Shveta Verma, Vinay Arora, "Survey on Graphical Methods for Test Case Generation", International Journal of Mobile & Adhoc Network (IJMAN), vol. 2, issue 2, pp. 257-264, May 2012
• Robert Gold, "Control Flow Graph and Code Coverage", Int. J. Appl. Math. Computer Sci. , vol. 20, no. 4, pp. 739–749,2010.
• M. E. Thesis on "Comparative Analysis of Flow Graph and Dependence Graphs", Shveta Verma, Vinay Arora, Thapar University, Patiala.
• R. Mall, Fundamentals of Software Engineering, Prentice Hall of India.
• P. G. Frankl and E. J. Weyuker, "An Applicable Family of Data Flow Testing Criteria", IEEE Transactions on Software Engineering, vol. 14, no. 10, October 1988.
• HiralalAgrawal, "Dominators, Super Blocks and Program Coverage", In Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming language, 1994.
• G. Xu and A. Rountev, "Regression Test Selection for AspectJ Software", In 29th International Conference on Software Engineering, pp. 65-74, 2007.
• J. Ferrante, J. Worren and K. Ottenstein, "The Program Dependence Graph and its use in optimization", In ACM Transactions on Programming Languages and Systems, vol. 9, no. 3, pp. 319-349, July 1987.
• S. Horwitz, T. Reps and D. Binkley, "Interprocedural slicing using dependence graphs," In ACM Transactions on Programming Languages and Systems, vol. 12, pp. 26-60, January 1990.
• G. Rothermel and M. J. Harrold, "Selecting regression tests for Object-Oriented Software", In Proceedings of International Conference on Software Maintenance, pp. 14-25, IEEE transactions, 1994.
• K. Tewary and M. J. Harrold, "Fault Modeling using the Program Dependence Graph", In Proceedings of 5th International Symposium on Software Reliability Engineering, pp. 126-135, IEEE Transactions, 1994.
• P. E. Livadas andS. Croll, "System Dependence Graphs Based on Parse Treesand their Use in Software Maintenance", IEEE Transactions, 2005.
• L. Larsen and M. J. Harrold, "Slicing object-oriented software", In 18th International Conference on Software Engineering, pp. 495–505, Mar. 1996.
• B. Xu, Z. Chen and H. Yang, "Dynamic slicing object-oriented programs for debugging", In the Proceedings of the Second IEEE International Workshop on Source Code Analysis and Manipulation, pp. 115 – 122, 2002.
• S. Park, "Efficient Dynamic Slicing of Object Oriented Programs", Dept. of R&D, Korea Micro System, pp. 143-721, January2003.
• D. Liang and M. J. Harrold, "Slicing objects using System Dependence Graphs", International Conference on Software Maintenance, pp. 358-367, November 1998.
• TONG Chun Yin under the supervision of Dr. LO Eric Chi Lik and Mr. LUK Ming Hay , " Java System Dependence graph API ", Department of computing, The Hong Kong polytechnic University, 2010, Available at: http://www. comp. polyu. edu. hk/~csllo/teaching/SDGAPI (accessed 25/4/2012).
• D. P. Mohapatra, R. Mall, and R. Kumar, "A node marking dynamic slicing technique for object-oriented programs", In Proceedings of Workshop on Software Development and Architecture, Bangalore, pp. 1 – 15, January 2004.
• J. Zhao, "Applying program dependence analysis toJava software," in Proc. Workshop on Software Engineeringand Database Systems, (Taiwan), pp. 162–169, December 1998.
• Neil Walkinshaw,Marc Roper, Murray Wood, "The Java System Dependence Graph", Proceedings of the Third IEEE International Workshop on Source Code Analysis and Manipulation, 2003.
• Liu Xi, Miao Li, Zhao Dan, Li Wei, "An approach of coarse-grained dynamic slices for Java programs", IEEE 3rd International Conference on Communication Software and Networks, pp. 670 – 674, May 2011.
• E S F Najumudheen, R. Mall, D. Samanta, "A Dependence representation for coverage testing of object-oriented programs", Journal of Object Oriented Technology (JOT), Vol. 9, No. 4, pp. 1-23, 2010.
• C. Hammer, J. Krinkle and G. Snelting, "Information Flow Control for Java based on Path Conditions in Dependence Graphs", In Proceedings of IEEE International Symposium on Secure Software Engineering, Virgina, USA, 2007.
• V. Martena, A. Orso and M. Pezze, "Interclass Testing of object oriented software", In Proceedings of 8th IEEE International Conference on Engineering of Complex Computer Systems, pp. 135-144, 2002.
• E S F Najumudheen, R. Mall, D. Samanta, "A Dependence Graph-based Test Coverage Analysis technique for Object-Oriented programs", In 6th International Conference on Information Technology: New Generations, IEEE, 2009.