632 search results - page 117 / 127 » Combining programming with theorem proving |
ESTIMEDIA
2009
Springer
14 years 2 months ago
2009
Springer
—Multimedia applications are often characterised by implicit temporal constraints but, in many cases, they are not programmed using any specialised real-time API. These “Legacy...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
We study the classic problem of estimating the sum of n variables. The traditional uniform sampling approach requires a linear number of samples to provide any non-trivial guarante...
IFIP
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we propose a formalization of probable innocence, a notion of probabilistic anonymity that is associated to “realistic” protocols such as Crowds. We analyze crit...
PPDP
2005
Springer
2005
Springer
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
14 years 1 months ago
Formal methods have proved to be very useful for analyzing cryptographic protocols. However, most existing techniques apply to the case of abstract encryption schemes and pairing....
RTA
2005
Springer
14 years 1 months ago
2005
Springer
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...