Software testing: A graph theoretic approach

International Journal of Information and Communication Technology

Volumn 1, Issue 1, 2007, Pages 14-25

  Bhattacherjee, Vandana ^a   Suri, Deepti ^b   Mahanti, Prabhat Kumar ^c  

^a BIRLA INSTITUTE OF TECHNOLOGY   (India)

^b MILWAUKEE SCHOOL OF ENGINEERING   (United States)

^c UNIVERSITY OF NEW BRUNSWICK   (Canada)

Author keywords

Algorithm; Graph; Path coverage; Regular expressions; Software testing

Indexed keywords

ALGORITHMS; GRAPH THEORY;

CONTROL FLOWS; GRAPH; GRAPH THEORETIC APPROACH; PATH COVERAGE; REGULAR EXPRESSIONS; TEST CASE;

SOFTWARE TESTING;

EID: 67649504653     PISSN: 14666642     EISSN: 17418070     Source Type: Journal    
DOI: 10.1504/IJICT.2007.013274     Document Type: Article

References (34)

1. Aitken, A.C. (1956) Determinants and Matrices, Edinburgh: Oliver and Boyd Ltd.
2. Baker, A.L., Howatt, J.W. and Bieman, J.M. (1986) Criteria for finite set of paths that characterize control flow, Proceedings of 19th Annual Hawaii International Conference on System Sciences, pp.158-163.
3. Beck, K. (1999) Extreme Programming Explained, Addison-Wesley.
4. Beizer, B. (1990) Software Testing Techniques, 2nd edition, Van Nostrand-Reinhold.
5. Belli, F. (2001) Finite state testing of graphical user interfaces, Proceedings of the International Symposium on Software Reliability Engineering (ISSRE).
6. Belli, F. and Dreyer, J. (1997) Program segmentation for controlling test coverage, Proceedings of the International Symposium on Software Reliability Engineering (ISSRE).
7. Belli, F. and Grosspietsch, K.E. (1991) Specification of fault-tolerant system issues by predicate/transition nets and regular expressions-approach and case study, IEEE Transactions on Software Engineering, Vol. 17, No. 6.
8. Binder, R.V. (1999) Testing Object-Oriented Systems, Addison-Wesley.
9. Bhattacherjee, V., Suri, D. and Mahanti, P.K. (2004) Application of regular matrix theory to software testing, 13th. International Conference on Intelligent and Adaptive Systems and Software Engineering (IASSE 04) at Nice France.
10. Chaar, J.K., Halliday, M.J., Bhandari, I.S. and Chillarege, R. (1993) In-process evaluation for software inspection and test, IEEE Transactions on Software Engineering, Vol. 19, No. 11.
11. Clarke, L.A., Podgurski, A., Richardson, D.J. and Seil, S.J. (1989) A formal evaluation of data flow path selection criteria, IEEE Transactions on Software Engineering, Vol. 15, No. 11.
12. Denney, R. (1991) Test case generation from prolog-based specifications, IEEE Software, Vol. 8, No. 2, pp.49-57.
13. Deo, N. (1984) Graph Theory with Applications to Engineering and Computer Science, New Delhi: Prentice Hall of India Pvt. Ltd.
14. Fenton, N.E., Whitty, R.W. and Kaposi, A.A. (1974) A generalised mathematical theory of structural programming, Theoretical Computer Science, Vol. 9, pp.232-255.
15. Frankl, P.G. and Weyuker, E.J. (1993) Provable improvements on branch testing, IEEE Transactions on Software Engineering, Vol. 19, No. 10.
16. Freedman, R.S. (1991) Testability of software components, IEEE Transactions on Software Engineering, SE-17, Vol. 6, pp.553-564.
17. Fujiwara, S., Bochmann, G.V., Khendek, F., Amalou, M. and Ghedamsi, A. (1991) Test selection based on finite state models, IEEE Transactions on Software Engineering, Vol. 17, No. 6.
18. Gossens, S. (2002) Enhancing system validation with behavioural types, Proceedings of High-Assurance System Engineering Symposium (HASE, IEEE).
19. Gourley, J. (1975) A mathematical framework for the investigation of testing, IEEE Transactions on Computers, Vol. 24, No. 5.
20. Hetzel, W. (1984) The Complete Guide to Software Testing, QED Information Sciences.
21. Hopcroft, J.E. and Ullman, J.D. (1987) Introduction to Automata Theory, Languages and Computation, New Delhi: Narosa Publishing House.
22. Hopcroft, J.E., Motwani R. and Ullman, J.D. (2001) Introduction to Automata Theory, Languages and Computation, Pearson Education.
23. Howden, W.E. (1983) Methodology for the generation of program test data, IEEE Transactions on Software Engineering, Vol. 9, No. 6.
24. Johnson, C.W. and Telford, A.J. (1996) Extending the application of formal methods to analyse human error and system failure during accident investigations, IEEE Transactions on Software Engineering, Vol. 11, No. 6.
25. Kosaraju, S. (1974) Analysis of structured programs, Journal of Computer System Science, Vol. 9, pp.232-255.
26. Lámmel, R. and Harm, J. (2001) Test case characterization by regular path expressions, Proceedings of Formal Approaches to Testing of Software (FATES).
27. Lewis, W.E. (2000) Software Testing and Continuous Quality Improvement, Auerbach Publishers.
28. McCabe, T. (1976) A software complexity measure, IEEE Transactions on Software Engineering, Vol. 2, No. 12, pp.308-320.
29. Miller, K.W., Morell, L.J., Noonan, R.E., Park, S.K., Nicol, D.M., Murrill, B.W. and Voas, M. (1992) Estimating the probability of failure when testing reveals no failures, IEEE Transactions on Software Engineering, Vol. 18, No. 1.
30. Paige, M.R. (1975) Program graphs, an algebra and their implication for programming, IEEE Transactions on Software Engineering, Vol. 1, No. 3, pp.286-291.
31. Pressman, R.S. (2001) Software Engineering: A Practitioners Approach, New Delhi: Tata McGraw-Hill Publishing Company Limited.
32. Saroch, V. (1993) Labelled graphs and matrices: automaton to real, PhD Thesis, Jawaharlal Nehru University, New Delhi.
33. Tai, K. and Lei, Y. (2002) A test generation strategy for pairwise testing, IEEE Transactions on Software Engineering, Vol. 28, No. 1.
34. Zhu, H., Hall, P.A.V. and May, J.H.R. (1997) Software unit test coverage and adequacy, ACM Computing Surveys, Vol. 29, No. 4.