608 search results - page 68 / 122 » Tests, Proofs and Refinements |
STOC
1992
ACM
13 years 12 months ago
1992
ACM
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
CIE
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
ACL2
2006
ACM
14 years 1 months ago
2006
ACM
We introduce the logical story behind file input in ACL2 and discuss the types of theorems that can be proven about filereading operations. We develop a low level library for re...
RTAS
2005
IEEE
14 years 1 months ago
2005
IEEE
—Real-time systems need to use the schedulability test to determine whether or not admitted tasks can meet their deadlines. The utilization based schedulability test is the most ...
SRDS
2003
IEEE
14 years 1 months ago
2003
IEEE
This paper presents our research on devising a dependability assessment method for the upcoming OGSA 3.0 middleware using network level fault injection. We compare existing DCE mi...