Sciweavers

452 search results - page 51 / 91
» Finding bugs is easy
Sort
View
DAM
2008
140views more  DAM 2008»
13 years 7 months ago
The minimum spanning strong subdigraph problem is fixed parameter tractable
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a ...
Jørgen Bang-Jensen, Anders Yeo
ICSE
2008
IEEE-ACM
14 years 8 months ago
Scalable detection of semantic clones
Several techniques have been developed for identifying similar code fragments in programs. These similar fragments, referred to as code clones, can be used to identify redundant c...
Mark Gabel, Lingxiao Jiang, Zhendong Su
SIGSOFT
2008
ACM
14 years 8 months ago
Profile-guided program simplification for effective testing and analysis
Many testing and analysis techniques have been developed for inhouse use. Although they are effective at discovering defects before a program is deployed, these techniques are oft...
Lingxiao Jiang, Zhendong Su
WWW
2004
ACM
14 years 8 months ago
Securing web application code by static analysis and runtime protection
Security remains a major roadblock to universal acceptance of the Web for many kinds of transactions, especially since the recent sharp increase in remotely exploitable vulnerabil...
Yao-Wen Huang, Fang Yu, Christian Hang, Chung-Hung...
PPPJ
2009
ACM
14 years 2 months ago
Tracking performance across software revisions
Repository-based revision control systems such as CVS, RCS, Subversion, and GIT, are extremely useful tools that enable software developers to concurrently modify source code, man...
Nagy Mostafa, Chandra Krintz