Learn More
Program slicing is a technique to extract program parts with respect to some special computation. Since Weiser first proposed the notion of slicing in 1979, hundreds of papers have been presented in this area. Tens of variants of slicing have been studied, as well as algorithms to compute them. Different notions of slicing have different properties and(More)
Cluster test selection is a new successful approach to select a subset of the existing test suite in regression testing. In this paper, program slicing is introduced to improve the efficiency and effectiveness of cluster test selection techniques. A static slice is computed on the modified code. The execution profile of each test case is filtered by the(More)
Based on land ecological classification of the source regions of the Yangtze and Yellow Rivers and field investigation, two phases of TM remote sensing data obtained in 1986 and 2000 were compared. From spatial variations and type transformation trends, the spatial changes and evolutional patterns of land ecosystem in the source regions of the two rivers(More)
Data dependences are of critical importance in many software engineering activities. Due to the dynamic allocation mechanism, it is still difficult to extract them precisely for heap locations. This paper firstly proposes two notion of interstatement must aliases and then exploits these aliases in improving data depend-ence analysis for heap locations. We(More)
Program slicing is an important program analysis technique and now has been used in many fields of software engineering. However, most existing program slicing methods focus on static programming languages such as C/C++ and Java, and methods on dynamic languages like Python are rarely seen. Python, a typical dynamic object-oriented language, has been more(More)
Regression testing is an expensive and frequently executed activity, which is often performed in a resource constrained execution environment. As resource-aware test suite optimization problem can be reduced to the 0-1 knapsack problem, which can be efficiently approximated with multiple algorithms. This paper proposes a new resource-aware test suite(More)
For scalability, many side-effect analysis methods choose inclusion-based context-insensitive (IBCI) pointer analysis as their basis. However, such a pointer analysis is known to be imprecise, which often results in over-conservative sideeffect sets. In this paper, we present a lightweight approach that exploits lazy access path resolving to improve the(More)
Rosmarinic acid, which is reported to have adstringent, antibacterial, antiviral and antioxidant activities, is one of the most prominent secondary compounds in Coleus blumei (Lamiaceae). Rosmarinic acid (RA) production in different hybrids of C. blumei was estimated by HPLC. Conditions for HPLC were as follows: column, 150 x 4.6 mm; solvent system,(More)
With the keyword synchronized, Java provides a simple but often over-used synchronization mechanism. Many programmers tend to use a big synchronized section to protect a large block of statements even if many of them are unnecessarily synchronized. Such coarse-gained synchronizations may increase lock contention and thereby decrease the performance of a(More)