Sciweavers

1399 search results - page 132 / 280
» Verification of Test Suites
Sort
View
ASE
2005
137views more  ASE 2005»
15 years 4 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
2007
114views more  BMCBI 2007»
15 years 4 months ago
Mining and state-space modeling and verification of sub-networks from large-scale biomolecular networks
Background: Biomolecular networks dynamically respond to stimuli and implement cellular function. Understanding these dynamic changes is the key challenge for cell biologists. As ...
Xiaohua Hu, Fang-Xiang Wu
MMSEC
2006
ACM
213views Multimedia» more  MMSEC 2006»
15 years 10 months ago
Parameter optimization for biometric fingerprint recognition using genetic algorithms
In this paper, we suggest an optimization approach for fingerprint authentication using genetic algorithms. Our application was planned so that it can be used without great effort...
Tobias Scheidat, Andreas Engel, Claus Vielhauer
ICSE
2011
IEEE-ACM
14 years 8 months ago
Predictable dynamic deployment of components in embedded systems
—Dynamic reconfiguration – the ability to hot swap a component, or to introduce a new component into the system – is essential to supporting evolutionary change in long-live ...
Ana Petricic
ICST
2010
IEEE
15 years 3 months ago
(Un-)Covering Equivalent Mutants
—Mutation testing measures the adequacy of a test suite by seeding artificial defects (mutations) into a program. If a test suite fails to detect a mutation, it may also fail to...
David Schuler, Andreas Zeller