989 search results - page 91 / 198 » Pebbling and Proofs of Work |
157
click to vote
FMCAD
2007
Springer
16 years 18 days ago
2007
Springer
—We show how to verify the correctness of transactional memory implementations with a model checker. We show how to specify transactional memory in terms of the admissible interc...
151
click to vote
GECCO
2007
Springer
16 years 18 days ago
2007
Springer
Automated event extraction remains a very difficult challenge requiring information analysts to manually identify key events of interest within massive, dynamic data. Many techniq...
137
click to vote
PROVSEC
2007
Springer
16 years 17 days ago
2007
Springer
Security of a modern block cipher is commonly measured in terms of its resistance to known attacks. While the provable security approach to block ciphers dates back to the first C...
182
click to vote
VMCAI
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. In this paper we analyze the complexity of checking safety and termination properties, for a very simple, yet non-trivial, class of programs with singly-linked list data ...
145
click to vote
ETFA
2006
IEEE
16 years 15 days ago
2006
IEEE
Abstract— This work deals with the control and the observation of a remote system using Internet as a communication line. The process consists in a Slave part S, with poor comput...