4224 search results - page 749 / 845 » Reasoning about Choice |
168
click to vote
ICS
2010
Tsinghua U.
16 years 3 months ago
2010
Tsinghua U.
: Design of secure systems can often be expressed as ensuring that some property is maintained at every step of a distributed computation among mutually-untrusting parties. Special...
178
click to vote
SPAA
2009
ACM
16 years 2 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
135
Voted
UC
2009
Springer
16 years 7 days ago
2009
Springer
In this note we investigate the problem of computing the domain of attraction of a flow on R2 for a given attractor. We consider an operator that takes two inputs, the description...
202
click to vote
CSL
2007
Springer
15 years 12 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
190
Voted
OOPSLA
2007
Springer
15 years 11 months ago
2007
Springer
Java bug finders perform static analysis to find implementation mistakes that can lead to exploits and failures; Java compilers perform static analysis for optimization. If Java...