State generation and automated class testing

Software Testing Verification and Reliability

Volumn 10, Issue 3, 2000, Pages 149-170

  Ball, Thomas ^a   Hoffman, Daniel ^b   Ruskey, Frank ^b   Webber, Richard ^c   White, Lee ^d  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF VICTORIA   (Canada)

^c UNIVERSITY OF MELBOURNE   (Australia)

^d Case Western Reserve University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATIC TESTING; C (PROGRAMMING LANGUAGE); COMBINATORIAL MATHEMATICS; DATA STRUCTURES; DATABASE SYSTEMS; JAVA PROGRAMMING LANGUAGE; OBJECT ORIENTED PROGRAMMING; RESPONSE TIME (COMPUTER SYSTEMS);

CONTAINER CLASSES; EXECUTION TIME; STANDARD TEMPLATE LIBRARY; STATE GENERATION;

COMPUTER SOFTWARE SELECTION AND EVALUATION;

EID: 0034271364     PISSN: 09600833     EISSN: None     Source Type: Journal    
DOI: 10.1002/1099-1689(200009)10:3<149::AID-STVR206>3.0.CO;2-T     Document Type: Article

References (33)

1. McDonald J, Huffman D, Strooper P. Programmatic testing of the Standard Template Library container classes. In Proceedings of IEEE International Conference on Automated Software Engineering 1998; 147-156.
2. JavaSoft. The bug parade. http://java.sun.com/jdc [1999].
3. Cormen T, Leiserson C, Rivest R. Introduction to Algorithms. MIT Press: Cambridge, MA, 1990
4. Clarke L. A system to generate test data and symbolically execute programs. IEEE Transactions on Software Engineering 1976; 2(3): 215-222.
5. Bertolino A, Marré M. Automatic generation of path covers based on the control flow analysis of computer programs. IEEE Transactions on Software Engineering 1994; 20(12): 885-899.
6. Gotlieb A, Botella B, Rueher M. Automatic test data generation using constraint solving techniques. In Proceedings of ACM SIGSOFT International Symposium on Software Testing and Analysis 1998; 53-62.
7. Parasoft. Automatic white-box testing for the Java developer, http://www.parasoft.com/jtest/jtestwp.htm [1998].
8. Rothermel G, Harrold M. A safe, efficient regression test selection technique. ACM Transactions on Software Engineering and Methodology 1997; 6(2): 173-210.
9. Bougé L, Choquet N, Fribourg L, Gaudel M. Test sets generation from algebraic specifications using logic programming. Journal of Systems and Software 1986; 6(4): 343-360.
10. Gannon J, McMullin P, Hamlet R. Data-abstraction, implementation, specification and testing. ACM Transactions on Programming Languages and Systems 1981; 3(3): 211-223.
11. Hughes M, Stotts D. Daistish: systematic algebraic testing for OO programs in the presence of side-effects. In Proceedings of ACM SIGSOFT International Symposium on Software Testing and Analysis 1996; 53-61.
12. Chen HY, Tse TH, Chan FT, Chen TY. In black and white: an integrated approach to class-level testing of object-oriented programs. ACM Transactions on Software Engineering and Methodology 1998; 7(3): 250-295.
13. Dillon L, Ramakrishna Y. Generating oracles from your favorite temporal logic specifications. In Proceedings of the 4th ACM SIGSOFT Symposium on Foundations of Software Engineering 1996; 106-117.
14. Stocks P, Carrington D. A framework for specification-based testing. IEEE Transactions on Software Engineering 1996; 22(11): 777-793.
15. Panzl D. A language for specifying software tests. In Proceedings of the AFIPS National Computer Conference. AFIPS, 1978; 609-619.
16. Huffman D. A CASE study in module testing. In Proceedings of the Conference on Software Maintenance. IEEE Computer Society, 1989; 100-105.
17. Hoffman D, Strooper P. Automated module testing in Prolog. IEEE Transactions on Software Engineering 1991; 17(9): 933-942.
18. Murphy G, Townsend P, Wong P. Experiences with cluster and class testing. Communications of the ACM 1994; 37(9): 39-47.
19. Hoffman DM, Strooper PA. Classbench: A framework for automated class testing. Software-Practice and Experience 1997; 27(5): 573-597.
20. Ostrand T, Balcer M. The category-partition method for specifying and generating functional tests. Communications of the ACM 1988; 31(6): 676-686.
21. Software Research Inc. The TDGEN test data generator. http://www.soft.com/products/index.html [1998].
22. Cobb R, Mills H. Engineering software under statistical quality control. IEEE Software 1990; 7(6): 44-54.
23. Musa J, Iannino A, Okumoto K. Software Reliability Measurement, Prediction, and Application. McGraw-Hill: New York, 1987.
24. Lucas J, van Baronaigien D, Ruskey F. On rotations and the generation of binary trees. Journal of Algorithms 1993; 15(3): 343-366.
25. Kelsen P. Ranking and unranking trees using regular reductions. In Proceedings of the Symposium on Theoretical Aspects of Computer Science, LNCS #1046. 1996; 581-592.
26. Nijenhuis A, Wilf H. Combinatorial Algorithms (2nd edn). Academic Press: New York, 1978.
27. Doong R, Frankl P. The ASTOOT approach to testing object-oriented programs. ACM Transactions on Software Engineering and Methodology 1994; 3(2): 101-130.
28. Knuth D. The Art of Computer Programming, Vol. II. Addison-Wesley: Reading, MA, 1969.
29. Cameron H, Wood D. Insertion reachability, skinny skeletons, and path length in red-black trees. Information Sciences 1994; 77(1-2): 141-152.
30. Ball T, Larus JR. Efficient path profiling. In Proceedings of MICRO 96. 1996; 46-57.
31. Ammons G, Ball T, Larus J. Exploiting hardware performance counters with flow and context sensitive profiling. ACM SIGPLAN Notices 1997; 32(5): 85-96. Proceedings of the SIGPLAN ′97 Conference on Programming Language Design and Implementation.
32. Hedley D, Hennell M. The causes and effects of infeasible paths in computer programs. In Proceedings of the International Conference on Software Engineering. IEEE Computer Society, 1985; 259-266.
33. Woodward M, Hedley D, Hennell M. Experience with path analysis and testing of programs. IEEE Transactions on Software Engineering 1980; 6(3): 278-286.