Sciweavers

139 search results - page 8 / 28
» Introduction to Testing Graph Properties
Sort
View
EJC
2007
13 years 8 months ago
Quickly deciding minor-closed parameters in general graphs
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
DATE
2004
IEEE
174views Hardware» more  DATE 2004»
14 years 10 days ago
Graph-Based Functional Test Program Generation for Pipelined Processors
Functional verification is widely acknowledged as a major bottleneck in microprocessor design. While early work on specification driven functional test program generation has prop...
Prabhat Mishra, Nikil Dutt
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
14 years 9 months ago
On proximity oblivious testing
We initiate a systematic study of a special type of property testers. These testers consist of repeating a basic test for a number of times that depends on the proximity parameter...
Oded Goldreich, Dana Ron
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
14 years 3 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
PSTV
1993
123views Hardware» more  PSTV 1993»
13 years 10 months ago
On the Verification of Temporal Properties
We present a new algorithm that can be used for solving the model−checking problem for linear−time temporal logic. This algorithm can be viewed as the combination of two exist...
Patrice Godefroid, Gerard J. Holzmann