A new structural coverage criterion for dynamic detection of program invariants

Proceedings - 18th IEEE International Conference on Automated Software Engineering, ASE 2003

Volumn , Issue , 2003, Pages 49-58

  Gupta, Neelam ^a   Heidepriem, Zachary V ^a  

^a University of Arizona   (United States)

Author keywords

Dynamic analysis; Execution traces; Path testing; Program invariants; Test data generation

Indexed keywords

SOFTWARE TESTING; TESTING;

BRANCH-COVERAGE; COVERAGE CRITERIA; DYNAMIC DETECTION; DYNAMICS ANALYSIS; EXECUTION TRACE; PATH TESTING; PROGRAM INVARIANTS; RESEARCH AREAS; TEST CASE; TEST DATA GENERATION;

DYNAMIC ANALYSIS;

EID: 33745195049     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASE.2003.1240294     Document Type: Conference Paper

References (17)

1. R.A. DeMillo and A.J. Offutt, “Constraint-based Automatic Test Data Generation,” IEEE Transactions on Software Engineering, Vol. 17, No. 9, pages 900-910, September 1991.
2. M. D. Ernst, J. Cockrell, W. G. Griswold, and D. Notkin, “Dynamically discovering likely program invariants to support program evolution,” IEEE Transactions on Software Engineering, vol. 27, no. 2, Feb. 2001, pages 1-25.
3. M. D. Ernst. “Dynamically Discovering Likely Program Invariants,” Ph.D. dissertation, University of Washington Department of Computer Science and Engineering, (Seattle, Washington), Aug. 2000.
4. M. T. Goodrich and R. Tamassia. Online supplement to the book”Data Structures and Algorithms in Java, http://java.datastructures.net/source/ch11/Java/PatternMatching-BMmatch.html.
5. A. Gotlieb, B. Botella, and M. Rueher, “Automatic Test Data Generation using Constraint Solving Techniques,” International Symposium on Software Testing and Analysis, 1998.
6. N. Gupta, A. P. Mathur, and M. L. Soffa, “Automated Test Data Generation using An Iterative Relaxation Method” ACM SIGSOFT Sixth International Symposium on Foundations of Software Engineering (FSE-6), pages 231-244, Orlando, Florida, November 1998.
7. N. Gupta, “Generating Test Data for Dynamically Discovering Likely Program Invariants”, in the Proceedings of ICSE 2003 Workshop on Dynamic Analysis (WODA 2003),Portland, Oregon, pages 21-24, May 2003. http://www.cs.nmsu.edu/jcook/woda2003/
8. M. Harder, J. Mellen and M. D. Ernst. 'Improving test suites via operational abstraction,” in Proceedings of the 25th International Conference on Software Engineering, (Portland, Oregon), May 6-8, 2003, pages 60-71.
9. D. Hamlet, “Random Testing,” Encyclopedia of Software Engg., 1994.
10. C. Horstmann, Core Java, Volume 1, Sun Microsystems, page 95-96.
11. http://www.merriampark.com/ld.htm
12. http://www.mkaz.com/math/matrix.html
13. B. Korel, “Automated Software Test Data Generation,” IEEE Transactions on Software Engineering, Vol. 16, No. 8, pages 870-879, August 1990.
14. B. Korel, A Dynamic Approach of Test Data Generation. In Conference on Software Maintenance, pages 311-317, San Diego, CA, November 1990.
15. R. Lafore “Data Structures and Algorithms in Java”, Waite Group Press, 1998, pages 47-48.
16. C. Horstmann, Core Java, Volume 1, pages 95-96, Sun Microsystems.
17. T. Xie and D. Notkin, “Exploiting Synergy Between Testing and Inferred Partial Specifications”, in the Proceedings of ICSE 2003 Workshop on Dynamic Analysis (WODA 2003),Portland, Oregon, pp. 17-20, May 2003.