181 search results - page 36 / 37 » Programming Language Techniques for Cryptographic Proofs |
IFIP
2005
Springer
13 years 10 months ago
2005
Springer
Digital forensic investigators are often faced with the task of manually examining a large number of (photographic) images in order to identify potential evidence. The task can be...
ASPLOS
2006
ACM
13 years 11 months ago
2006
ACM
The sustained push toward smaller and smaller technology sizes has reached a point where device reliability has moved to the forefront of concerns for next-generation designs. Sil...
ALT
1995
Springer
13 years 8 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
JACM
2002
13 years 4 months ago
2002
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
ICS
2009
Tsinghua U.
13 years 12 months ago
2009
Tsinghua U.
Matching regular expressions (regexps) is a very common workload. For example, tokenization, which consists of recognizing words or keywords in a character stream, appears in ever...