Sciweavers

613 search results - page 57 / 123
» Finding and Fixing Faults
Sort
View
LREC
2010
139views Education» more  LREC 2010»
15 years 1 months ago
Automatically Identifying Changes in the Semantic Orientation of Words
The meanings of words are not fixed but in fact undergo change, with new word senses arising and established senses taking on new aspects of meaning or falling out of usage. Two t...
Paul Cook, Suzanne Stevenson
JDA
2006
83views more  JDA 2006»
14 years 11 months ago
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
Takehiro Ito, Xiao Zhou, Takao Nishizeki
JAR
2000
97views more  JAR 2000»
14 years 11 months ago
A Deductive Database Approach to Automated Geometry Theorem Proving and Discovering
We report our effort to build a geometry deductive database, which can be used to find the fixpoint for a geometric configuration. The system can find all the properties of the con...
Shang-Ching Chou, Xiao-Shan Gao, Jing-Zhong Zhang
ISSTA
2012
ACM
13 years 2 months ago
Residual investigation: predictive and precise bug detection
We introduce the concept of “residual investigation” for program analysis. A residual investigation is a dynamic check installed as a result of running a static analysis that ...
Kaituo Li, Christoph Reichenbach, Christoph Csalln...
ESEM
2009
ACM
15 years 3 months ago
Test coverage and post-verification defects: A multiple case study
Test coverage is a promising measure of test effectiveness and development organizations are interested in costeffective levels of coverage that provide sufficient fault removal w...
Audris Mockus, Nachiappan Nagappan, Trung T. Dinh-...