Sciweavers

1816 search results - page 295 / 364
» Trace oblivious computation
Sort
View
VISSYM
2007
13 years 11 months ago
Path Visualization for Adjacency Matrices
For displaying a dense graph, an adjacency matrix is superior than a node-link diagram because it is more compact and free of visual clutter. A node-link diagram, however, is far ...
Zeqian Shen, Kwan-Liu Ma
CCS
2008
ACM
13 years 10 months ago
Dependent link padding algorithms for low latency anonymity systems
Low latency anonymity systems are susceptive to traffic analysis attacks. In this paper, we propose a dependent link padding scheme to protect anonymity systems from traffic analy...
Wei Wang 0002, Mehul Motani, Vikram Srinivasan
ISSTA
2010
ACM
13 years 10 months ago
Analysis of invariants for efficient bounded verification
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
Juan P. Galeotti, Nicolás Rosner, Carlos L&...
FMCAD
2008
Springer
13 years 10 months ago
BackSpace: Formal Analysis for Post-Silicon Debug
Post-silicon debug is the problem of determining what's wrong when the fabricated chip of a new design behaves incorrectly. This problem now consumes over half of the overall ...
Flavio M. de Paula, Marcel Gort, Alan J. Hu, Steve...
IMC
2007
ACM
13 years 10 months ago
Usage-based dhcp lease time optimization
The Dynamic Host Configuration Protocol (DHCP) is used to dynamically allocate address space to hosts on a local area network. Despite its widespread usage, few studies exist on ...
Manas Khadilkar, Nick Feamster, Matt Sanders, Russ...