Sciweavers

1816 search results - page 31 / 364
» Trace oblivious computation
Sort
View
ASPDAC
2007
ACM
89views Hardware» more  ASPDAC 2007»
14 years 1 months ago
Trace Compaction using SAT-based Reachability Analysis
In today's designs, when functional verification fails, engineers perform debugging using the provided error traces. Reducing the length of error traces can help the debugging...
Sean Safarpour, Andreas G. Veneris, Hratch Mangass...
ACNS
2006
Springer
148views Cryptology» more  ACNS 2006»
14 years 1 months ago
An Efficient Single-Key Pirates Tracing Scheme Using Cover-Free Families
A cover-free family is a well-studied combinatorial structure that has many applications in computer science and cryptography. In this paper, we propose a new public key traitor t...
Dongvu Tonien, Reihaneh Safavi-Naini
ENTCS
2007
112views more  ENTCS 2007»
13 years 9 months ago
Structure and Properties of Traces for Functional Programs
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support pr...
Olaf Chitil, Yong Luo
FGCS
2006
125views more  FGCS 2006»
13 years 10 months ago
Compressible memory data structures for event-based trace analysis
The article presents a new compressible memory data structure for trace events. Its primary intention is to aid the analysis of huge traces by reducing the memory requirements sig...
Andreas Knüpfer, Wolfgang E. Nagel
SIGCOMM
2003
ACM
14 years 3 months ago
A high-level programming environment for packet trace anonymization and transformation
Packet traces of operational Internet traffic are invaluable to network research, but public sharing of such traces is severely limited by the need to first remove all sensitive...
Ruoming Pang, Vern Paxson