Sciweavers

2976 search results - page 370 / 596
» On the bounded integer programming
Sort
View
POPL
2009
ACM
16 years 5 months ago
A cost semantics for self-adjusting computation
Self-adjusting computation is an evaluation model in which programs can respond efficiently to small changes to their input data by using a change-propagation mechanism that updat...
Ruy Ley-Wild, Umut A. Acar, Matthew Fluet
IWMM
2007
Springer
118views Hardware» more  IWMM 2007»
15 years 10 months ago
Detecting and eliminating memory leaks using cyclic memory allocation
We present and evaluate a new technique for detecting and eliminating memory leaks in programs with dynamic memory allocation. This technique observes the execution of the program...
Huu Hai Nguyen, Martin C. Rinard
IWMM
2010
Springer
140views Hardware» more  IWMM 2010»
15 years 6 months ago
Parametric inference of memory requirements for garbage collected languages
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
PASTE
2005
ACM
15 years 10 months ago
Generalizing symbolic execution to library classes
Forward symbolic execution is a program analysis technique that allows using symbolic inputs to explore program executions. The traditional applications of this technique have foc...
Sarfraz Khurshid, Yuk Lai Suen
CP
2005
Springer
15 years 10 months ago
Planning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
John N. Hooker