233 search results - page 47 / 47 » An Existential Locality Theorem |
JACM
2000
13 years 5 months ago
2000
A crashing network protocol is an asynchronous protocol whose memory does not survive crashes. We show that a crashing network protocol that works over unreliable links can be driv...
ICTAC
2010
Springer
13 years 3 months ago
2010
Springer
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
KAIS
2011
13 years 22 days ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...