Sciweavers

180 search results - page 6 / 36
» Test Case Prioritization Using Relevant Slices
Sort
View
KBSE
2005
IEEE
14 years 28 days 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...
FAC
2008
100views more  FAC 2008»
13 years 7 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
SPLC
2010
13 years 5 months ago
Stratified Analytic Hierarchy Process: Prioritization and Selection of Software Features
Product line engineering allows for the rapid development of variants of a domain specific application by using a common set of reusable assets often known as core assets. Variabil...
Ebrahim Bagheri, Mohsen Asadi, Dragan Gasevic, Sam...
SIGMOD
2007
ACM
172views Database» more  SIGMOD 2007»
14 years 7 months ago
Auditing disclosure by relevance ranking
Numerous widely publicized cases of theft and misuse of private information underscore the need for audit technology to identify the sources of unauthorized disclosure. We present...
Rakesh Agrawal, Alexandre V. Evfimievski, Jerry Ki...
SIGSOFT
2006
ACM
14 years 8 months ago
Dynamic slicing long running programs through execution fast forwarding
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...
Xiangyu Zhang, Sriraman Tallam, Rajiv Gupta