Sciweavers

1058 search results - page 102 / 212
» It's Doomed; We Can Prove It
Sort
View
JCT
2010
83views more  JCT 2010»
13 years 8 months ago
Families of prudent self-avoiding walks
A self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards a vertex it has already visited. Prudent walks differ from most classes of SAW that ha...
Mireille Bousquet-Mélou
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
14 years 4 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...
DAC
2007
ACM
14 years 11 months ago
On Resolution Proofs for Combinational Equivalence
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...
SAS
2009
Springer
172views Formal Methods» more  SAS 2009»
14 years 10 months ago
Type Analysis for JavaScript
JavaScript is the main scripting language for Web browsers, and it is essential to modern Web applications. Programmers have started using it for writing complex applications, but ...
Anders Møller, Peter Thiemann, Simon Holm J...
CANS
2009
Springer
180views Cryptology» more  CANS 2009»
14 years 4 months ago
RFID Distance Bounding Protocol with Mixed Challenges to Prevent Relay Attacks
RFID systems suffer from different location-based attacks such as distance fraud, mafia fraud and terrorist fraud attacks. Among them mafia fraud attack is the most serious sin...
Chong Hee Kim, Gildas Avoine