Sciweavers

3889 search results - page 358 / 778
» The Use of Program Dependence Graphs in Software Engineering
Sort
View
POPL
2004
ACM
16 years 6 months ago
Global value numbering using random interpretation
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
Sumit Gulwani, George C. Necula
181
Voted
ECLIPSE
2006
ACM
16 years 7 days ago
XPlainer-Eclipse: explaining XPath within Eclipse
The popularity of XML has motivated the development of novel XML processing tools many of which embed the XPath language for XML querying, transformation, constraint specificatio...
John W. S. Liu, Mariano P. Consens, Flavio Rizzolo
ICPADS
1994
IEEE
15 years 10 months ago
Stochastic Modeling of Scaled Parallel Programs
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...
GECCO
2005
Springer
146views Optimization» more  GECCO 2005»
15 years 11 months ago
An empirical study of the robustness of two module clustering fitness functions
Two of the attractions of search-based software engineering (SBSE) derive from the nature of the fitness functions used to guide the search. These have proved to be highly robust...
Mark Harman, Stephen Swift, Kiarash Mahdavi
ICSM
2007
IEEE
16 years 17 days ago
Mining the Lexicon Used by Programmers during Sofware Evolution
Identifiers represent an important source of information for programmers understanding and maintaining a system. Self-documenting identifiers reduce the time and effort necessa...
Giuliano Antoniol, Yann-Gaël Guéh&eacu...