297 search results - page 54 / 60 » ATS: A Language That Combines Programming with Theorem Provi... |
120
click to vote
HVC
2007
Springer
15 years 3 months ago
2007
Springer
Implementations of computer systems comprise many layers and employ a variety of programming languages. Building such systems requires support of an often complex, accompanying too...
PPDP
2005
Springer
2005
Springer
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
15 years 5 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....
ICFP
2006
ACM
15 years 11 months ago
2006
ACM
Dynamic binding and delimited control are useful together in many settings, including Web applications, database cursors, and mobile code. We examine this pair of language feature...
UM
2009
Springer
15 years 6 months ago
2009
Springer
Collaborative filtering (CF) techniques have proved to be a powerful and popular component of modern recommender systems. Common approaches such as user-based and item-based metho...
106
click to vote
ICALP
1995
Springer
15 years 3 months ago
1995
Springer
An infinite binary sequence x is defined to be (i) strongly useful if there is a computable time bound within which every decidable sequence is Turing reducible to x; and (ii) w...