506 search results - page 10 / 102 » Proving Properties about Lists Using Containers |
CSFW
2002
IEEE
15 years 2 months ago
2002
IEEE
We formalize aspects of the Kerberos 5 authentication protocol in the Multi-Set Rewriting formalism (MSR) on two levels of detail. The more detailed formalization reflects the in...
MOBIHOC
2009
ACM
15 years 10 months ago
2009
ACM
The study in mobile ad-hoc networks (MANET) is facing challenges brought by recent discovery of non-exponential behavior of the inter-contact time distribution of mobile nodes. In...
SAS
1993
Springer
15 years 1 months ago
1993
Springer
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...
117
click to vote
CLIMA
2006
14 years 11 months ago
2006
It is recognised that institutions are potentially powerful means for making agent interactions effective and efficient, but institutions will only really be useful when, as in oth...
82
Voted
STOC
2009
ACM
15 years 4 months ago
2009
ACM
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...