4095 search results - page 728 / 819 » How to test a tree |
SIGSOFT
2009
ACM
14 years 8 months ago
2009
ACM
Software engineering researchers have long been interested in where and why bugs occur in code, and in predicting where they might turn up next. Historical bug-occurence data has ...
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
SIGSOFT
2006
ACM
14 years 8 months ago
2006
ACM
Fixing runtime bugs in long running programs using trace based analyses such as dynamic slicing was believed to be prohibitively expensive. In this paper, we present a novel execu...
SIGSOFT
2005
ACM
14 years 8 months ago
2005
ACM
There is an increasing interest in techniques that support measurement and analysis of fielded software systems. One of the main goals of these techniques is to better understand ...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...