Sciweavers

2877 search results - page 133 / 576
» The Complexity of Planarity Testing
Sort
View
SIGSOFT
2000
ACM
15 years 8 months ago
Automated systematic testing for constraint-based interactive services
Constraint-based languages can express in a concise way the complex logic of a new generation of interactive services for applications such as banking or stock trading, that must ...
Patrice Godefroid, Lalita Jategaonkar Jagadeesan, ...
DFT
1999
IEEE
75views VLSI» more  DFT 1999»
15 years 8 months ago
A Module Diagnosis and Design-for-Debug Methodology Based on Hierarchical Test Paths
Fault identification capabilities are becoming increasingly important in modern designs, not only in support of design debugging methodologies, but also for the purpose of process...
Yiorgos Makris, Alex Orailoglu
JSS
2008
89views more  JSS 2008»
15 years 4 months ago
A search-based framework for automatic testing of MATLAB/Simulink models
Search-based test-data generation has proved successful for code-level testing but almost no search-based work has been carried out at evels of abstraction. In this paper the appl...
Yuan Zhan, John A. Clark
SIGSOFT
2007
ACM
16 years 5 months ago
Improving test case generation for web applications using automated interface discovery
With the growing complexity of web applications, identifying web interfaces that can be used for testing such applications has become increasingly challenging. Many techniques tha...
William G. J. Halfond, Alessandro Orso
KBSE
2008
IEEE
15 years 10 months ago
Unit Testing of Flash Memory Device Driver through a SAT-Based Model Checker
Flash memory has become virtually indispensable in most mobile devices. In order for mobile devices to successfully provide services to users, it is essential that flash memory b...
Moonzoo Kim, Yunho Kim, Hotae Kim