713 search results - page 108 / 143 » Toward a More Reliable Theory of Software Reliability |
MICRO
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--Parallel programming is hard, because it is impractical to test all possible thread interleavings. One promising approach to improve a multi-threaded program's relia...
129
click to vote
NETWORKS
2011
14 years 2 months ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
TREC
2004
15 years 1 months ago
2004
The quality of an information retrieval system heavily depends on its retrieval function, which returns a similarity measurement between the query and each document in the collect...
CMPB
2007
14 years 11 months ago
2007
We show that it is possible to construct numerical models of eye colour from first principles. Our initial model assumes that the important optical interactions occur only in the a...
ISSTA
2009
ACM
15 years 6 months ago
2009
ACM
Mixed concrete and symbolic execution is an important technique for finding and understanding software bugs, including securityrelevant ones. However, existing symbolic execution...