534 search results - page 91 / 107 » Proving Termination of Rewrite Systems Using Bounds |
CC
2007
Springer
13 years 8 months ago
2007
Springer
Mergers are procedures that, with the aid of a short random string, transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one ...
SOSP
2001
ACM
14 years 5 months ago
2001
ACM
As raw system and network performance continues to improve at exponential rates, the utility of many services is increasingly limited by availability rather than performance. A ke...
FIW
2003
13 years 10 months ago
2003
We report on a property-based approach to feature interaction analysis for a client-server email system. The model is based upon Hall’s email model [12] presented at FIW’00 [3]...
ESOP
2009
Springer
14 years 3 months ago
2009
Springer
Tools for analysing secure information flow are almost exclusively based on ideas going back to Denning’s work from the 70’s. This approach embodies an imperfect notion of sec...
DIALM
2010
ACM
13 years 6 months ago
2010
ACM
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...