Subsumption of program entities for efficient coverage and monitoring

Proceedings of the Third International Workshop on Software Quality Assurance, SOQUA 2006

Volumn , Issue , 2006, Pages 2-5

  Santelices, Raul ^a   Sinha, Saurabh ^b   Harrold, Mary Jean ^a  

^a Georgia Institute of Technology   (United States)

^b IBM INDIA RESEARCH LAB   (India)

Author keywords

Coverage criteria; Entity hierarchies; Predicate conditions; Subsumption

Indexed keywords

COVERAGE CRITERIA; ENTITY HIERARCHIES;

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; SOFTWARE DESIGN;

COMPUTER PROGRAM LISTINGS;

EID: 34547697574     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1188895.1188899     Document Type: Conference Paper

References (14)

1. H. Agrawal. Dominators, super blocks, and program coverage. In POPL '94: Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, Jan. 1994.
2. H. Agrawal. Efficient coverage testing using global dominator graphs. In PASTE '99: Proceedings of the 1999 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering, Sept. 1999.
3. T. Ball and J. R. Larus. Optimally profiling and tracing programs. In POPL '92: Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, Jan. 1992.
4. A. Bertolino. Unconstrained edges and their application to branch analysis and testing of programs. Journal of Systems and Software, 20(2):125-133, Feb. 1993.
5. L. A. Clarke and D. J. Richardson. Applications of symbolic evaluation. Journal of Systems and Software, 5(1):15-35, Feb. 1985.
6. P. Frankl and E. J. Weyuker. An applicable family of data flow criteria. IEEE Transactions on Software Engineering, 14(10): 1483-1498, Oct. 1988.
7. M. Harder, J. Mallen, and M. D. Ernst. Improving test suites via operational abstraction. In ICSE '03: Proceedings of the 25th IEEE and ACM SIGSOFT International Conference on Software Engineering, May 2003.
8. S. Horwitz, T. Reps, and D. Binkley. Interprocedural slicing using dependence graphs. ACM Transactions on Programming Languages and Systems, 12(1):26-60, Jan. 1990.
9. M. Hutchins, H. Foster, T. Goradia, and T. Ostrand. Experiments of the effectiveness of dataflow- and controlflow-based test adequacy criteria. In ICSE '94: Proceedings of the 16th IEEE and ACM SIGSOFT international conference on Software engineering, May 1994.
10. M. Marré and A. Bertolino. Using spanning sets for coverage testing. IEEE Transactions on Software Engineering, 29(11):974-984, Nov. 2003.
11. E. M. Merlo and G. Antoniol. A static measure of a subset of intra-procedural data flow testing coverage based on node coverage. In CASCON '99: Proceedings of the 1999 IBM conference of the Centre for Advanced Studies on Collaborative research, Nov. 1999.
12. T. Robschink and G. Snelting. Efficient path conditions in dependence graphs. In ICSE '02: Proceedings of the 24th IEEE and ACM SIGSOFT International Conference on Software Engineering, May 2002.
13. G. Rothermel, R. H. Untch, C. Chu, and M. J. Harrold. Prioritizing test cases for regression testing. IEEE Transactions on Software Engineering, 27(10):929-948, Oct. 2001.
14. S. Sukumaran and A. Sreenivas. Identifying test conditions for software maintenance. In CSMR '05: Proceedings of the Ninth European Conference on Software Maintenance and Reengineering, IEEE, Mar. 2005.