Sciweavers

291 search results - page 22 / 59
» Software-Test
Sort
View
SIGMOD
2009
ACM
121views Database» more  SIGMOD 2009»
14 years 10 months ago
Query-aware shrinking test databases
Keeping the test databases as small as possible leads to faster execution of tests and facilitates the task of completing the test cases and evaluating the actual outputs against ...
Claudio de la Riva, Javier Tuya, María Jos&...
ISSTA
1989
ACM
14 years 1 months ago
Estimating the Number of Test Cases Required to Satisfy the All-du-paths Testing Criterion
The all-du-paths software testing criterion is the most discriminating of the data ow testing criteria of Rapps and Weyuker. Unfortunately, in the worst case, the criterion requir...
James M. Bieman, J. Schultz
INFSOF
2006
151views more  INFSOF 2006»
13 years 10 months ago
Prioritized interaction testing for pair-wise coverage with seeding and constraints
Interaction testing is widely used in screening for faults. In software testing, it provides a natural mechanism for testing systems to be deployed on a variety of hardware and so...
Renée C. Bryce, Charles J. Colbourn
FORTEST
2008
13 years 11 months ago
From MC/DC to RC/DC: Formalization and Analysis of Control-Flow Testing Criteria
This paper describes an approach to the formalization of existing criteria used in computer systems software testing and proposes a new Reinforced Condition/Decision Coverage (RC/D...
Sergiy A. Vilkomir, Jonathan P. Bowen
DCC
2006
IEEE
14 years 9 months ago
Roux-type constructions for covering arrays of strengths three and four
A covering array CA(N; t, k, v) is an N ? k array such that every N ? t sub-array contains all t-tuples from v symbols at least once, where t is the strength of the array. Coverin...
Charles J. Colbourn, Sosina Martirosyan, Tran van ...