Sciweavers

2218 search results - page 146 / 444
» Testing Expressibility Is Hard
Sort
View
EUROSYS
2011
ACM
13 years 22 days ago
Finding complex concurrency bugs in large multi-threaded applications
Parallel software is increasingly necessary to take advantage of multi-core architectures, but it is also prone to concurrency bugs which are particularly hard to avoid, find, an...
Pedro Fonseca, Cheng Li, Rodrigo Rodrigues
DILS
2005
Springer
14 years 2 months ago
Hybrid Integration of Molecular-Biological Annotation Data
: We present a new approach to integrate annotation data from public sources for the expression analysis of genes and proteins. Expression data is materialized in a data warehouse ...
Toralf Kirsten, Hong Hai Do, Christine Körner...
CONEXT
2007
ACM
14 years 1 months ago
A hybrid finite automaton for practical deep packet inspection
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
Michela Becchi, Patrick Crowley
ISMB
2001
13 years 10 months ago
Molecular classification of multiple tumor types
Using gene expression data to classify tumor types is a very promising tool in cancer diagnosis. Previous works show several pairs of tumor types can be successfully distinguished...
Chen-Hsiang Yeang, Sridhar Ramaswamy, Pablo Tamayo...
ISSTA
2012
ACM
11 years 11 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...