ACM Home Page
Please provide us with feedback. Feedback
Subsumption of program entities for efficient coverage and monitoring
Full text PdfPdf (263 KB)
Source Foundations of Software Engineering archive
Proceedings of the 3rd international workshop on Software quality assurance table of contents
Portland, Oregon
SESSION: Short paper table of contents
Pages: 2 - 5  
Year of Publication: 2006
ISBN:1-59593-584-3
Authors
Raul Santelices  College of Computing, Georgia Institute of Technology
Saurabh Sinha  IBM India Research Lab
Mary Jean Harrold  College of Computing, Georgia Institute of Technology
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 22,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1188895.1188899
What is a DOI?

ABSTRACT

Program entities such as branches, def-use pairs, and call sequences are used in diverse software-development tasks. Reducing a set of entities to a small representative subset through subsumption saves monitoring overhead, focuses the developer's attention, and provides insights into the complexity of a program. Previous work has solved this problem for entities of the same type, and only for some types. In this paper we introduce a novel and general approach for subsumption of entities of any type based on predicate conditions. We discuss applications of this technique, and address future steps.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
 
4
 
5
 
6
 
7
8
 
9
 
10
 
11
12
 
13
 
14


Collaborative Colleagues:
Raul Santelices: colleagues
Saurabh Sinha: colleagues
Mary Jean Harrold: colleagues