A rigorous approach towards test case generation

Information Sciences

Volumn 178, Issue 21, 2008, Pages 4057-4079

  Ding, Zuohua ^a,b   Zhang, Kao ^a   Hu, Jueliang ^a  

^a ZHEJIANG SCI TECH UNIVERSITY   (China)

^b UNIVERSITY OF SOUTH FLORIDA   (United States)

Author keywords

Concurrent programs; Condition calculation; Sequential programs; Software testing; SYN sequence

Indexed keywords

CHLORINE COMPOUNDS; INFORMATION THEORY; INTERNET PROTOCOLS; LINGUISTICS; TESTING;

COMPLEXITY ANALYSIS; CONCURRENT PROGRAM TESTING; CONCURRENT PROGRAMS; CONDITION CALCULATION; FLOW BASED; FORMAL TESTING METHODS; PROGRAM TESTING; RIGOROUS APPROACH; SEQUENTIAL PROGRAMS; SOFTWARE TESTING; STATE EXPLOSION PROBLEMS; SYN-SEQUENCE; SYSTEMATIC APPROACHES; TEST CASES; TEST-CASE GENERATION; TIME SAVINGS; VOICE OVER DSL;

CONCURRENCY CONTROL;

EID: 49849100192     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2008.06.020     Document Type: Article

References (41)

1. K.R. Apt, A static analysis of CSP programs, in: Proceedings of the Workshop Prograni Logic, Pittsburgh, PA, June 1983.
2. P. Ammann, P. Black, A specification-based coverage metric to evaluate test sets, in: Proceedings of the Fourth IEEE International Symposium on High Assurance Systems and Engineering, November 1999, pp. 239-248.
3. Artho C., et al. Combining test case generation and runtime verification. Theoretical and Computer Science 336 2-3 (2005)
4. I.J. Balaban, An optimal algorithm for finding segment intersections, in: Proceedings of the 11th Annual ACM Symposium on Computational Geometry, 1995, pp. 211-219.
5. Böhm C., and Jacopini G. Flow diagram turing machines and languages with only two formation rules. Communications of ACM 9 5 (1966) 366-371
6. Bertolino A., and Marré M. Automatic generation of path covers based on the control flow analysis of computer programs. IEEE Transactions on Software Engineering 20 12 (1994) 885-899
7. Bertolino A., and Marré M. How many paths are needed for branch testing?. Journal of Systems and Software 35 (1996) 95-106
8. Cai K., Gu B., Hu H., and Li Y. Adaptive software testing with fixed-memory feedback. Journal of Systems and Software 80 (2007) 1328-1348
9. R.H. Carver, K.C. Tai, Test sequence generation from formal specifications of distributed programs, in: Proceedings of IEEE 15th International Conference on Distributed Computing Systems, Canada, Vancouver, 1995, pp. 360-367.
10. Clarke L.A. A system to generate test data and symbolically execute programs. IEEE Transactions on Software Engineering SE-2 (1976) 215-222
11. Clarke E.M., Grumberg O., and Peled D. Model Checking (1999), MIT Press
12. De Millo R., and Offutt A. Constraint-based automatic test data generation. IEEE Transactions on Software Engineering 17 9 (1991) 900-910
13. Duran J., and Ntafos S. An evaluation of random testing. IEEE Transactions on Software Engineering SE-10 4 (1984) 438-444
14. Edwards S.A. Tutorial: compiling concurrent languages for sequential processors. ACM Transactions on Design Automation of Electronic Systems 8 2 (2003) 141-187
15. Forgács I., and Bertolino A. Feasible test path selection by principal slicing. ACM SIGSOFT Software Engineering Notes 22 6 (1997) 379-394
16. Gargantini A., and Heitmeyer C. Using model checking to generate tests from requirements specifications. Proceedings of the Seventh European Engineering Conference held jointly with the Seventh ACM SIGSOFT International Symposium on Foundations of Software Engineering (1999), Springer-Verlag 146-162
17. N. Gupta, A.P. Mathur, M.L. Soffa, Automated test data generation using an iterative relaxation method, in: Proceedings of International Symposium on Foundations of Software Engineering (FSE), 1998, pp. 231-244.
18. A. Hartman, Model based test generation tools. .
19. Heimdahl M.P.E., Rayadurgam S., Visser W., George D., and Gao J. Auto-generating test sequences using model checkers: a case study. Lecture Notes in Computer Science 2931 (2003) 42-59
20. Hong H.S., Lee I., Sokolsky O., and Ural H. A temporal logic based theory of test coverage and generation. Lecture Notes in Computer Science 2280 (2002) 327-341
21. Hwang G.H., Tai K.C., and Huang T.L. Reachability testing: an approach to testing concurrent software. International Journal of Software Engineering and Knowledge Engineering 5 4 (1995) 493-510
22. T. Katayama, Z. Furukawa, K. Ushijima, Design and implementation of test-case generation of concurrent programs, in: Proceeding of Fifth Asia-Pacific Software Engineering Conference (APSEC'98), Taipei, 1998, pp. 262-269.
23. Kernighan K.W., and Ritchie D.M. The C Programming Language (1978), Prentice-Hall, Englewood Cliffs, NJ
24. King J.C. Symbolic execution and program testing. Communications of the ACM 19 7 (1976) 385-394
25. P.V. Koppol, K.C. Tai, An incremental approach to structural testing of concurrent programs, in: Proceedings of the ACM International Symposium on Software Testing and Analysis, January 1996, pp. 14-23.
26. Lei Y., and Carver R.H. Reachability testing of concurrent programs. IEEE Transactions on Software Engineering 32 6 (2006) 382-403
27. Lin J., and Yeh P. Automatic test data generation for path testing using GAs. Information Sciences 131 (2001) 47-64
28. Marré M., and Bertolino A. Using spanning sets for coverage testing. IEEE Transactions on Software Engineering 29 11 (2003) 974-984
29. Memon A.M., Pollack M.E., and Soffa M.L. Hierarchical GUI test case generation using automated planning. IEEE Transactions on Software Engineering 27 2 (2001) 144-155
30. Muccini H., Bertolino A., and Inverardi P. Using software architecture for code testing. IEEE Transactions on Software Engineering 30 3 (2004) 160-171
31. Offutt A., Jin Z., and Pan J. The dynamic domain reduction procedure for test data generation. Software-Practice and Experience 29 2 (1999) 167-193
32. K.C. Tai, Reachability testing of asynchronous message-passing programs, in: Proceedings of the Second International Workshop Software Engineering for Parallel and Distributed Systems, 1997, pp. 50-61.
33. Taylor R.N. Complexity of analyzing the synchronization structure of concurrent programs. Acta Informatica 19 1 (1983) 57-84
34. Taylor R.N. A general-purpose algorithm for analyzing concurrent programs. Communications of the ACM 26 (1983) 362-376
35. Taylor R.N., Levine D.L., and Kelly C.D. Structural testing of concurrent programs. IEEE Transactions on Software Engineering 18 3 (1992) 206-215
36. G.J. Tretmans, A.F.E. Belinfante, Automatic testing with formal methods, Technical Report TR-CTIT-99-17, Centre for Telematics and Information Technology, University of Twente, Enschede, 1999. ISSN 1381-3625.
37. Vergilio S.R., Maldonado J.C., Jino M., and Soares I.W. Constraint based structural testing criteria. Journal of Systems and Software 79 (2006) 756-771
38. Weiser M. Program slicing. IEEE Transactions on Software Engineering 19 4 (1984) 352-357
39. Weyuker E.J., and Jeng B. Analyzing partition testing strategies. IEEE Transactions on Software Engineering 17 7 (1991) 703-711
40. Yang R.D., and Chung C.G. Path analysis testing of concurrent programs. Information and Software Technology 34 1 (1992) 43-56
41. Young M., and Taylor R.N. Combining static concurrency analysis with J symbolic execution. IEEE Transactions on Software Engineering 14 10 (1988) 1499-1511