1226 search results - page 191 / 246 » Proofs, Programs and Abstract Complexity |
APLAS
2006
ACM
15 years 5 months ago
2006
ACM
The abstract domain of polyhedra is sufficiently expressive to be deployed in verification. One consequence of the richness of this domain is that long, possibly infinite, sequen...
CEC
2005
IEEE
15 years 5 months ago
2005
IEEE
AbstractSelf-Assembly is a powerful autopoietic mechanism ubiquitous throughout the natural world. It may be found at the molecular scale and also at astronomical scales. Self-asse...
HPCC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. The Ubiquitous Web requires novel programming paradigms and distributed architectures for the support of advanced services to a multitude of user devices and profiles. I...
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract: The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spect...