Subsumption of Program Entities for Efficient Coverage and Monitoring


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

Related research categories:
(1) Testing
(2) Program Analysis
(3) Data Flow
(4) Instrumentation

Go To Publications