4469 search results - page 289 / 894 » Dynamic Program Slicing |
IWMM
1998
Springer
14 years 16 days ago
1998
Springer
We show that for 8 real and varied C and C++ programs, several conventional dynamic storage allocators provide nearzero fragmentation, once we account for overheads due to impleme...
HOTSWUP
2009
ACM
13 years 6 months ago
2009
ACM
Dynamic software update is a technique by which a running program can be updated with new code and data without interrupting its execution. Often we will want to preserve properti...
JMLR
2012
11 years 10 months ago
2012
We consider the task of devising large-margin based surrogate losses for the learning to rank problem. In this learning to rank setting, the traditional hinge loss for structured ...
GPCE
2007
Springer
14 years 2 months ago
2007
Springer
Programming in an open environment remains challenging because it requires combining modularity, security, concurrency, distribution, and dynamicity. In this paper, we propose an ...
ICSE
2004
IEEE-ACM
14 years 8 months ago
2004
IEEE-ACM
This paper proposes a technique for identifying program properties that indicate errors. The technique generates machine learning models of program properties known to result from...