Sciweavers

131 search results - page 6 / 27
» The Complexity of Online Memory Checking
Sort
View
HPCA
2009
IEEE
14 years 7 months ago
Fast complete memory consistency verification
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new na...
Yunji Chen, Yi Lv, Weiwu Hu, Tianshi Chen, Haihua ...
DCC
2010
IEEE
13 years 7 months ago
The cost of false alarms in Hellman and rainbow tradeoffs
Abstract Cryptanalytic time memory tradeoff algorithms are generic one-way function inversion techniques that utilize pre-computation. Even though the online time complexity is kno...
Jin Hong
SAC
2009
ACM
13 years 11 months ago
SWOBE - embedding the semantic web languages RDF, SPARQL and SPARUL into java for guaranteeing type safety, for checking the sat
The Semantic Web and its technologies become increasingly important. As more and more Semantic Web applications are being used, developing more stable Semantic Web applications be...
Sven Groppe, Jana Neumann, Volker Linnemann
ICALP
2009
Springer
14 years 7 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
ICST
2008
IEEE
14 years 1 months ago
Pre-testing Flash Device Driver through Model Checking Techniques
Flash memory has become virtually indispensable in most mobile devices, such as mobile phones, digital cameras, mp3 players, etc. In order for mobile devices to successfully provi...
Moonzoo Kim, Yunja Choi, Yunho Kim, Hotae Kim