Sciweavers

989 search results - page 91 / 198
» Pebbling and Proofs of Work
Sort
View
FMCAD
2007
Springer
14 years 2 months ago
Verifying Correctness of Transactional Memories
—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...
Ariel Cohen 0002, John W. O'Leary, Amir Pnueli, Ma...
GECCO
2007
Springer
163views Optimization» more  GECCO 2007»
14 years 2 months ago
Discovering event evidence amid massive, dynamic datasets
Automated event extraction remains a very difficult challenge requiring information analysts to manually identify key events of interest within massive, dynamic data. Many techniq...
Robert M. Patton, Thomas E. Potok
PROVSEC
2007
Springer
14 years 2 months ago
On the Notions of PRP - RKA , KR and KR - RKA for Block Ciphers
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...
Ermaliza Razali, Raphael C.-W. Phan, Marc Joye
VMCAI
2007
Springer
14 years 2 months ago
On Flat Programs with Lists
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 ...
Marius Bozga, Radu Iosif
ETFA
2006
IEEE
14 years 2 months ago
Implementation of an Internet-controlled system under variable delays
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...
Alexandre Seuret, M. Termens-Ballester, A. Toguyen...