2877 search results - page 59 / 576 » The Complexity of Planarity Testing |
DATE
2002
IEEE
14 years 2 months ago
2002
IEEE
In this paper, we analyze the use of UML as a starting point to go from design issues to end of production testing of complex embedded systems. The first point is the analysis of ...
DATE
2002
IEEE
14 years 2 months ago
2002
IEEE
This paper develops an improved approach for hierarchical functional test generation for complex chips. In order to deal with the increasing complexity of functional test generati...
ISSTA
2004
ACM
14 years 2 months ago
2004
ACM
We show how model checking and symbolic execution can be used to generate test inputs to achieve structural coverage of code that manipulates complex data structures. We focus on ...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
In this paper we consider two basic questions regarding the query complexity of testing graph properties in the adjacency matrix model. The first question refers to the relation ...
APPROX
2005
Springer
14 years 2 months ago
2005
Springer
A string α ∈ Σn is called p-periodic, if for every i, j ∈ {1, . . . , n}, such that i ≡ j mod p, αi = αj, where αi is the i-th place of α. A string α ∈ Σn is said t...