Sciweavers

2218 search results - page 296 / 444
» Testing Expressibility Is Hard
Sort
View
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
14 years 1 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
ASPLOS
2008
ACM
13 years 11 months ago
Learning from mistakes: a comprehensive study on real world concurrency bug characteristics
The reality of multi-core hardware has made concurrent programs pervasive. Unfortunately, writing correct concurrent programs is difficult. Addressing this challenge requires adva...
Shan Lu, Soyeon Park, Eunsoo Seo, Yuanyuan Zhou
BMCBI
2007
134views more  BMCBI 2007»
13 years 9 months ago
Benchmarking natural-language parsers for biological applications using dependency graphs
Background: Interest is growing in the application of syntactic parsers to natural language processing problems in biology, but assessing their performance is difficult because di...
Andrew B. Clegg, Adrian J. Shepherd
BMCBI
2008
155views more  BMCBI 2008»
13 years 9 months ago
Extending pathways based on gene lists using InterPro domain signatures
Background: High-throughput technologies like functional screens and gene expression analysis produce extended lists of candidate genes. Gene-Set Enrichment Analysis is a commonly...
Florian Hahne, Alexander Mehrle, Dorit Arlt, Annem...
BMCBI
2007
129views more  BMCBI 2007»
13 years 9 months ago
Integrated network reconstruction, visualization and analysis using YANAsquare
Background: Modeling of metabolic networks includes tasks such as network assembly, network overview, calculation of metabolic fluxes and testing the robustness of the network. Re...
Roland Schwarz, Chunguang Liang, Christoph Kaleta,...