Sciweavers

159 search results - page 12 / 32
» Program COmprehension through Dynamic Analysis
Sort
View
AMC
2007
115views more  AMC 2007»
13 years 7 months ago
Evolutionary programming based on non-uniform mutation
Abstract–A new evolutionary programming algorithm (NEP) using the non-uniform mutation operator instead of Gaussian or Cauchy mutation operators is proposed. NEP has the merits o...
Xinchao Zhao, Xiao-Shan Gao, Ze-Chun Hu
SP
2010
IEEE
190views Security Privacy» more  SP 2010»
13 years 5 months ago
Noninterference through Secure Multi-execution
A program is defined to be noninterferent if its outputs cannot be influenced by inputs at a higher security level than their own. Various researchers have demonstrated how this pr...
Dominique Devriese, Frank Piessens
POPL
2011
ACM
12 years 10 months ago
Dynamic inference of static types for ruby
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
Jong-hoon (David) An, Avik Chaudhuri, Jeffrey S. F...
IWPC
2005
IEEE
14 years 1 months ago
A Qualitative Comparison of Three Aspect Mining Techniques
The fact that crosscutting concerns (aspects) cannot be well modularized in object oriented software is an impediment to program comprehension: the implementation of a concern is ...
Mariano Ceccato, Marius Marin, Kim Mens, Leon Moon...
PLDI
1999
ACM
13 years 12 months ago
Load-Reuse Analysis: Design and Evaluation
Load-reuse analysis finds instructions that repeatedly access the same memory location. This location can be promoted to a register, eliminating redundant loads by reusing the re...
Rastislav Bodík, Rajiv Gupta, Mary Lou Soff...