Sciweavers

6167 search results - page 1187 / 1234
» Can Refinement be Automated
Sort
View
KBSE
2005
IEEE
14 years 3 months ago
An analysis of rule coverage as a criterion in generating minimal test suites for grammar-based software
The term grammar-based software describes software whose input can be specified by a context-free grammar. This grammar may occur explicitly in the software, in the form of an in...
Mark Hennessy, James F. Power
KBSE
2005
IEEE
14 years 3 months ago
Locating faulty code using failure-inducing chops
Software debugging is the process of locating and correcting faulty code. Prior techniques to locate faulty code either use program analysis techniques such as backward dynamic pr...
Neelam Gupta, Haifeng He, Xiangyu Zhang, Rajiv Gup...
MOBICOM
2005
ACM
14 years 3 months ago
Self-management in chaotic wireless deployments
Over the past few years, wireless networking technologies have made vast forays into our daily lives. Today, one can find 802.11 hardware and other personal wireless technology e...
Aditya Akella, Glenn Judd, Srinivasan Seshan, Pete...
SIGUCCS
2005
ACM
14 years 3 months ago
A case study: implementing novell identity management at Drew University
Starting in 2003, Drew University began a process to replace its manual account management procedures with an automated provisioning system based upon Novell technologies. Over th...
E. Axel Larsson
AADEBUG
2005
Springer
14 years 3 months ago
Experimental evaluation of using dynamic slices for fault location
Dynamic slicing algorithms have been considered to aid in debugging for many years. However, as far as we know, no detailed studies on evaluating the benefits of using dynamic sl...
Xiangyu Zhang, Haifeng He, Neelam Gupta, Rajiv Gup...
« Prev « First page 1187 / 1234 Last » Next »