323 search results - page 37 / 65 » Verify Your Runs |
ICDE
2005
IEEE
14 years 11 months ago
2005
IEEE
Scientific database federations are geographically distributed and network bound. Thus, they could benefit from proxy caching. However, existing caching techniques are not suitabl...
CADE
2008
Springer
14 years 10 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
STOC
2002
ACM
14 years 10 months ago
2002
ACM
The notion of efficient computation is usually identified in cryptography and complexity with (strict) probabilistic polynomial time. However, until recently, in order to obtain c...
ICSE
2009
IEEE-ACM
14 years 4 months ago
2009
IEEE-ACM
It is labor-intensive to manually verify the outputs of a large set of tests that are not equipped with test oracles. Test selection helps to reduce this cost by selecting a small...
LATA
2009
Springer
14 years 4 months ago
2009
Springer
The parameterized pattern matching problem is a kind of pattern matching problem, where a pattern is considered to occur in a text when there exists a renaming bijection on the alp...