Sciweavers

250 search results - page 27 / 50
» Static Probabilistic Timing Analysis for Multi-path Programs
Sort
View
92
Voted
JLP
2007
98views more  JLP 2007»
14 years 10 months ago
Tempus fugit: How to plug it
Secret or private information may be leaked to an external attacker through the timing behaviour of the system running the untrusted code. After introducing a formalisation of thi...
Alessandra Di Pierro, Chris Hankin, Igor Siveroni,...
117
Voted
ICALP
1994
Springer
15 years 3 months ago
Simple Fast Parallel Hashing
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
Joseph Gil, Yossi Matias
109
Voted
TACAS
2012
Springer
263views Algorithms» more  TACAS 2012»
13 years 6 months ago
Reachability under Contextual Locking
Abstract. The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of...
Rohit Chadha, P. Madhusudan, Mahesh Viswanathan
SE
2008
15 years 9 days ago
Eliminating Trust From Application Programs By Way Of Software Architecture
: In many of today's application programs, security functionality is inseparably intertwined with the actual mission-purpose logic. As a result, the trusted code base is unnec...
Michael Franz
ICCAD
2006
IEEE
101views Hardware» more  ICCAD 2006»
15 years 7 months ago
Guaranteeing performance yield in high-level synthesis
Meeting timing constraint is one of the most important issues for modern design automation tools. This situation is exacerbated with the existence of process variation. Current hi...
Wei-Lun Hung, Xiaoxia Wu, Yuan Xie