Sciweavers

309 search results - page 47 / 62
» Model checking transactional memories
Sort
View
ICDCS
2008
IEEE
14 years 4 months ago
Strong WORM
We introduce a Write-Once Read-Many (WORM) storage system providing strong assurances of data retention and compliant migration, by leveraging trusted secure hardware in close dat...
Radu Sion
KBSE
2007
IEEE
14 years 4 months ago
Sequential circuits for program analysis
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
Fadi A. Zaraket, Adnan Aziz, Sarfraz Khurshid
TIME
2006
IEEE
14 years 3 months ago
In time alone: on the computational power of querying the history
Querying its own history is an important mechanism in the computations, especially those interacting with people or other computations such as transaction processing, electronic d...
Alexei Lisitsa, Igor Potapov
LCPC
2009
Springer
14 years 2 months ago
Fastpath Speculative Parallelization
Abstract. We describe Fastpath, a system for speculative parallelization of sequential programs on conventional multicore processors. Our system distinguishes between the lead thre...
Michael F. Spear, Kirk Kelsey, Tongxin Bai, Luke D...
ACSD
2003
IEEE
103views Hardware» more  ACSD 2003»
14 years 3 months ago
Design Validation of ZCSP with SPIN
— We consider the problem of specifying a model of the Zero Copy Secured Protocol for the purpose of LTL verification with the SPIN Model Checker. ZCSP is based on Direct Memory...
Vincent Beaudenon, Emmanuelle Encrenaz, Jean Lou D...