Sciweavers

164 search results - page 12 / 33
» Combining Algebraic and Model-Based Test Case Generation
Sort
View
DAC
2005
ACM
13 years 9 months ago
VLIW: a case study of parallelism verification
Parallelism in processor architecture and design imposes a verification challenge as the exponential growth in the number of execution combinations becomes unwieldy. In this paper...
Allon Adir, Yaron Arbetman, Bella Dubrov, Yossi Li...
TAICPART
2010
IEEE
158views Education» more  TAICPART 2010»
13 years 5 months ago
Bad Pairs in Software Testing
Abstract. With pairwise testing, the test model is a list of N parameters. Each test case is an N-tuple; the test space is the cross product of the N parameters. A pairwise test is...
Daniel Hoffman, Chien Chang, Gary Bazdell, Brett S...
IEAAIE
2005
Springer
14 years 26 days ago
A Holistic Approach to Test-Driven Model Checking
Abstract. Testing is the most common validation method in the software industry. It entails the execution of the software system in the real environment. Nevertheless, testing is a...
Fevzi Belli, Baris Güldali
DLT
2008
13 years 8 months ago
Hierarchies of Piecewise Testable Languages
The classes of languages which are boolean combinations of languages of the form A a1A a2A . . . A a A , where a1, . . . , a A, k , for a fixed k 0, form a natural hierarchy wit...
Ondrej Klíma, Libor Polák
ICST
2011
IEEE
12 years 11 months ago
It is Not the Length That Matters, It is How You Control It
—The length of test cases is a little investigated topic in search-based test generation for object oriented software, where test cases are sequences of method calls. While intui...
Gordon Fraser, Andrea Arcuri