Sciweavers

1912 search results - page 381 / 383
» On the evaluation of argumentation formalisms
Sort
View
SIGIR
2011
ACM
12 years 10 months ago
Find it if you can: a game for modeling different types of web search success using interaction data
A better understanding of strategies and behavior of successful searchers is crucial for improving the experience of all searchers. However, research of search behavior has been s...
Mikhail Ageev, Qi Guo, Dmitry Lagun, Eugene Agicht...
IACR
2011
132views more  IACR 2011»
12 years 7 months ago
Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
Abstract. Tampering attacks are cryptanalytic attacks on the implementation of cryptographic algorithms (e.g., smart cards), where an adversary introduces faults with the hope that...
Sebastian Faust, Krzysztof Pietrzak, Daniele Ventu...
POPL
2012
ACM
12 years 2 months ago
Programming with binders and indexed data-types
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
Andrew Cave, Brigitte Pientka
POPL
2012
ACM
12 years 2 months ago
Playing in the grey area of proofs
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
Krystof Hoder, Laura Kovács, Andrei Voronko...
ISSTA
2012
ACM
11 years 9 months ago
ViewPoints: differential string analysis for discovering client- and server-side input validation inconsistencies
Since web applications are easily accessible, and often store a large amount of sensitive user information, they are a common target for attackers. In particular, attacks that foc...
Muath Alkhalaf, Shauvik Roy Choudhary, Mattia Fazz...