Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this ...
In program debugging, finding a failing run is only the first step; what about correcting the fault? Can we automate the second task as well as the first? The AutoFix-E tool au...
Yi Wei, Yu Pei, Carlo A. Furia, Lucas S. Silva, St...
Abstract ? Large enterprise networks consist of thousands of services and applications. The performance and reliability of any particular application may depend on multiple service...
Xu Chen, Ming Zhang, Zhuoqing Morley Mao, Paramvir...
There are several problem areas that must be addressed when applying randomization to unit testing. As yet no general, fully automated solution that works for all units has been p...
James H. Andrews, Susmita Haldar, Yong Lei, Felix ...