506 search results - page 45 / 102 » Where Is the Value in a Program Verifier |
112
Voted
TIP
2002
15 years 4 days ago
2002
In this paper, we examine the problem of locating an object in an image when size and rotation are unknown. Previous work has shown that with known geometric parameters, an image r...
174
click to vote
POPL
2012
ACM
13 years 8 months ago
2012
ACM
It is becoming increasingly important for applications to protect sensitive data. With current techniques, the programmer bears the burden of ensuring that the application’s beh...
113
click to vote
CSCLP
2006
Springer
15 years 4 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
109
click to vote
ESORICS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Many protocols rely on audit trails to allow an impartial judge to verify a posteriori some property of a protocol run. However, in current practice the choice of what da...
108
Voted
ICALP
2004
Springer
15 years 5 months ago
2004
Springer
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...