This thesis presented a framework of the possible combi-nation of approaches for low-level program slicing-based-dependence analysis and high-level concept assignment. Three combination techniques, concept extension, con-cept abbreviation and concept refinement, are presented and empirical studied to address the problem of program maintenance. The ten C subject programs are studied and more than 600 concept bindings are identified. Dependence based metrics are defined to evaluate three techniques that provides evidence of both advantages and disadvantages
The notion of a program slice, originally introduced by Mark Weiser, is useful in program debugging,...
Finding parallelism that exists in a software program depends a great deal on determining the depend...
This paper made two main contributions: it defined system dependence graphs (SDGs), which extended p...
This thesis addresses dependence based concept assignment using slicing based de-pendence analysis o...
Decomposition slice graph and concept lattice are two program representation used to abstract the de...
The notion of control dependence underlies many program analysis and transformation techniques. Desp...
Data dependences, which relate statements that compute data value to statements that use those valu...
CodeSurfer, GrammaTech’s program analysis, understanding, and inspection system for ANSI C, is based...
Program slicing is a commonly used approach for understanding and detecting the impact of changes to...
Program slicing is useful for assisting with software-maintenance tasks, such as program understandi...
This study explores the relationship between program slices and faults. The aim is to investigate wh...
Dependence clusters are (maximal) collections of mutually dependent source code entities according t...
Dependence relationships among the statements of a program are important to understand for various s...
Mark Weiser introduced program slicing: creating a subprogram defined by a set of variables and a sp...
While dependency analysis is foundational to much program analysis, many techniques have limited sca...
The notion of a program slice, originally introduced by Mark Weiser, is useful in program debugging,...
Finding parallelism that exists in a software program depends a great deal on determining the depend...
This paper made two main contributions: it defined system dependence graphs (SDGs), which extended p...
This thesis addresses dependence based concept assignment using slicing based de-pendence analysis o...
Decomposition slice graph and concept lattice are two program representation used to abstract the de...
The notion of control dependence underlies many program analysis and transformation techniques. Desp...
Data dependences, which relate statements that compute data value to statements that use those valu...
CodeSurfer, GrammaTech’s program analysis, understanding, and inspection system for ANSI C, is based...
Program slicing is a commonly used approach for understanding and detecting the impact of changes to...
Program slicing is useful for assisting with software-maintenance tasks, such as program understandi...
This study explores the relationship between program slices and faults. The aim is to investigate wh...
Dependence clusters are (maximal) collections of mutually dependent source code entities according t...
Dependence relationships among the statements of a program are important to understand for various s...
Mark Weiser introduced program slicing: creating a subprogram defined by a set of variables and a sp...
While dependency analysis is foundational to much program analysis, many techniques have limited sca...
The notion of a program slice, originally introduced by Mark Weiser, is useful in program debugging,...
Finding parallelism that exists in a software program depends a great deal on determining the depend...
This paper made two main contributions: it defined system dependence graphs (SDGs), which extended p...