Sciweavers

1175 search results - page 57 / 235
» A scalable method for the generation of small test sets
Sort
View
GECCO
2008
Springer
112views Optimization» more  GECCO 2008»
13 years 9 months ago
Handling dynamic data structures in search based testing
There has been little attention to search based test data generation in the presence of pointer inputs and dynamic data structures, an area in which recent concolic methods have e...
Kiran Lakhotia, Mark Harman, Phil McMinn
ISSTA
2009
ACM
14 years 2 months ago
A formal analysis of requirements-based testing
The aim of requirements-based testing is to generate test cases from a set of requirements for a given system or piece of software. In this paper we propose a formal semantics for...
Charles Pecheur, Franco Raimondi, Guillaume Brat
AIS
2004
Springer
13 years 11 months ago
Timed I/O Test Sequences for Discrete Event Model Verification
Abstract. Model verification examines the correctness of a model implementation with respect to a model specification. While being described from model specification, implementatio...
Ki Jung Hong, Tag Gon Kim
JSS
2002
101views more  JSS 2002»
13 years 7 months ago
Software requirements validation via task analysis
As a baseline for software development, a correct and complete requirements definition is one foundation of software quality. Previously, a novel approach to static testing of sof...
Hong Zhu, Lingzi Jin, Dan Diaper, Ganghong Bai
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
14 years 8 months ago
Scalable look-ahead linear regression trees
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
David S. Vogel, Ognian Asparouhov, Tobias Scheffer