We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a functi...
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
1 Typical enterprise and military software systems consist of millions of lines of code with complicated dependence on library abstractions. Manually debugging these codes imposes ...
Lian Yu, Jun Zhou, Yue Yi, Ping Li, Qianxiang Wang
Statistical debugging uses lightweight instrumentation and statistical models to identify program behaviors that are strongly predictive of failure. However, most software is most...
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...
Akash Lal, Junghee Lim, Marina Polishchuk, Ben Lib...