Sciweavers

207 search results - page 6 / 42
» Using Clustering Technique to Restructure Programs
Sort
View
WWW
2008
ACM
14 years 10 months ago
Service-oriented data denormalization for scalable web applications
Many techniques have been proposed to scale web applications. However, the data interdependencies between the database queries and transactions issued by the applications limit th...
Zhou Wei, Dejun Jiang, Guillaume Pierre, Chi-Hung ...
LCTRTS
2007
Springer
14 years 4 months ago
Tetris: a new register pressure control technique for VLIW processors
The run-time performance of VLIW (very long instruction word) microprocessors depends heavily on the effectiveness of its associated optimizing compiler. Typical VLIW compiler pha...
Weifeng Xu, Russell Tessier
SIGSOFT
2008
ACM
14 years 10 months ago
Deriving input syntactic structure from execution
Program input syntactic structure is essential for a wide range of applications such as test case generation, software debugging and network security. However, such important info...
Zhiqiang Lin, Xiangyu Zhang
JSS
2010
91views more  JSS 2010»
13 years 8 months ago
Assessing the impact of global variables on program dependence and dependence clusters
This paper presents results of a study of the effect of global variables on the quantity of dependence in general and on the presence of dependence clusters in particular. The pa...
David Binkley, Mark Harman, Youssef Hassoun, Syed ...
SIGSOFT
1994
ACM
14 years 1 months ago
Speeding up Slicing
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
Thomas W. Reps, Susan Horwitz, Shmuel Sagiv, Genev...