Sciweavers

1033 search results - page 200 / 207
» Using Temporal Language Models for Document Dating
Sort
View
SAC
2010
ACM
14 years 7 months ago
A formal approach to reuse successful traceability practices in SPL projects
Software Product Line (SPL) Engineering has to deal with interrelated, complex models such as feature and architecture models, hence traceability is fundamental to keep them consi...
Angelina Espinoza, Goetz Botterweck, Juan Garbajos...
ADC
2004
Springer
105views Database» more  ADC 2004»
15 years 3 months ago
Do Clarity Scores for Queries Correlate with User Performance?
Recently the concept of a clarity score was introduced in order to measure the ambiguity of a query in relation to the collection in which the query issuer is seeking information ...
Andrew Turpin, William R. Hersh
ASE
2005
137views more  ASE 2005»
14 years 9 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
BMCBI
2008
126views more  BMCBI 2008»
14 years 9 months ago
NITPICK: peak identification for mass spectrometry data
Background: The reliable extraction of features from mass spectra is a fundamental step in the automated analysis of proteomic mass spectrometry (MS) experiments. Results: This co...
Bernhard Y. Renard, Marc Kirchner, Hanno Steen, Ju...
SIGSOFT
2003
ACM
15 years 10 months ago
A strategy for efficiently verifying requirements
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
Ralph D. Jeffords, Constance L. Heitmeyer