Sciweavers

1685 search results - page 157 / 337
» Commonality and Variability in Software Engineering
Sort
View
IWPC
2002
IEEE
15 years 8 months ago
Dependence-Cache Slicing: A Program Slicing Method Using Lightweight Dynamic Information
When we try to debug or to comprehend a large program, it is important to separate suspicious program portions from the overall source program. Program slicing is a promising tech...
Tomonori Takada, Fumiaki Ohata, Katsuro Inoue
95
Voted
ICSE
1993
IEEE-ACM
15 years 7 months ago
Rule-Based Approach to Computing Module Cohesion
Stevens, Myers, and Constantine introduced the notion of cohesion, an ordinal scale of seven levels that describes the degree to which the actions performed by a module contribute...
Arun Lakhotia
154
Voted
PEPM
1993
ACM
15 years 7 months ago
Binding-Time Analysis and the Taming of C Pointers
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
Lars Ole Andersen
ICSE
2000
IEEE-ACM
15 years 7 months ago
Light-weight context recovery for efficient and accurate program analyses
To compute accurate information efficiently for programs that use pointer variables, a program analysis must account for the fact that a procedure may access different sets of mem...
Donglin Liang, Mary Jean Harrold
CISSE
2008
Springer
15 years 5 months ago
From Constraints to Resolution Rules Part I : conceptual framework
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
Denis Berthier