Sciweavers

2877 search results - page 58 / 576
» The Complexity of Planarity Testing
Sort
View
STOC
2003
ACM
114views Algorithms» more  STOC 2003»
14 years 9 months ago
Testing subgraphs in directed graphs
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
Noga Alon, Asaf Shapira
ITC
2000
IEEE
76views Hardware» more  ITC 2000»
14 years 1 months ago
System issues in boundary-scan board test
Boards have evolved into complex systems and even collections of interacting systems. Test engineers struggle to find out how these systems are initialized and booted because of p...
Kenneth P. Parker
AAAI
1994
13 years 10 months ago
Testing Physical Systems
We present a formal theory of model-based testing, an algorithm for test generation based on it, and outline how testing is implemented by a diagnostic engine. The key to making t...
Peter Struss
COMPSAC
2006
IEEE
14 years 3 months ago
A Framework of Model-Driven Web Application Testing
Web applications have become complex and crucial in many fields. In order to assure their quality, a high demand for systematic methodologies of Web application testing is emergin...
Nuo Li, Qin-qin Ma, Ji Wu, Mao-zhong Jin, Chao Liu...
KBSE
1997
IEEE
14 years 1 months ago
Genetic Algorithms for Dynamic Test Data Generation
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially whe...
Christoph C. Michael, Gary McGraw, Michael Schatz,...