We propose an efficient method for computing dynamic slices of programs. Our method is based on construction of data dependence edges of program dependence graph at run-time. We introduce the concept of compact dynamic dependence graphs (CDDGs) of programs. We show computation of dynamic slices usin
A program slicing method using lightweight dynamic information
β Scribed by Tomonori Takada; Katsuro Inoue; Fumiaki Ohata; Yoshiyuki Ashida
- Publisher
- John Wiley and Sons
- Year
- 2006
- Tongue
- English
- Weight
- 257 KB
- Volume
- 89
- Category
- Article
- ISSN
- 8756-663X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
surface is smaller than that of the flat surface. That is because the Brewster angle between ground and snow is 50Β°. The 50Β°angle in snow corresponds to 35Β°in air by Snell's law. However, at the higher frequency of 36.5 GHz in Figure 4, volume scattering becomes important and obscures the Brewster-a
Abstract~We are interested in deciding if a given nonmmociative polynomial h is an identity for a variety of nonauociative algebras. We present an algorithm for constructing a certain homomorphic image of a free nonMsoclative algebra which is suflident to answer the question. The algorithm resembles