Sciweavers

469 search results - page 73 / 94
» Reasoning About Method Calls in Interface Specifications
Sort
View
JCST
2010
189views more  JCST 2010»
13 years 3 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
SAC
2010
ACM
14 years 3 months ago
Web-based graphical querying of databases through an ontology: the Wonder system
Biological scientists have made large amounts of data available on the Web, which can be accessed by canned or precomputed queries presented via web forms. To satisfy further info...
Diego Calvanese, C. Maria Keet, Werner Nutt, Maria...
CAV
2005
Springer
173views Hardware» more  CAV 2005»
14 years 2 months ago
Building Your Own Software Model Checker Using the Bogor Extensible Model Checking Framework
Model checking has proven to be an effective technology for verification and debugging in hardware and more recently in software domains. We believe that recent trends in both th...
Matthew B. Dwyer, John Hatcliff, Matthew Hoosier, ...
BMCBI
2010
139views more  BMCBI 2010»
13 years 8 months ago
RNAstructure: software for RNA secondary structure prediction and analysis
Background: To understand an RNA sequence's mechanism of action, the structure must be known. Furthermore, target RNA structure is an important consideration in the design of...
Jessica S. Reuter, David H. Mathews
BMCBI
2008
156views more  BMCBI 2008»
13 years 8 months ago
ArrayWiki: an enabling technology for sharing public microarray data repositories and meta-analyses
Background: A survey of microarray databases reveals that most of the repository contents and data models are heterogeneous (i.e., data obtained from different chip manufacturers)...
Todd H. Stokes, J. T. Torrance, Henry Li, May D. W...