Sciweavers

1054 search results - page 202 / 211
» A Formalization of the Turing Test
Sort
View
SOUPS
2010
ACM
15 years 3 months ago
A closer look at recognition-based graphical passwords on mobile devices
Graphical password systems based on the recognition of photographs are candidates to alleviate current over-reliance on alphanumeric passwords and PINs. However, despite being bas...
Paul Dunphy, Andreas P. Heiner, N. Asokan
HASKELL
2007
ACM
15 years 3 months ago
A type-preserving closure conversion in haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By type-checking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
CAV
2006
Springer
165views Hardware» more  CAV 2006»
15 years 3 months ago
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
Sebastian Burckhardt, Rajeev Alur, Milo M. K. Mart...
DSN
2004
IEEE
15 years 3 months ago
Verifying Web Applications Using Bounded Model Checking
The authors describe the use of bounded model checking (BMC) for verifying Web application code. Vulnerable sections of code are patched automatically with runtime guards, allowin...
Yao-Wen Huang, Fang Yu, Christian Hang, Chung-Hung...
ACSAC
2001
IEEE
15 years 3 months ago
Practical Automated Filter Generation to Explicitly Enforce Implicit Input Assumptions
Vulnerabilities in distributed applications are being uncovered and exploited faster than software engineers can patch the security holes. All too often these weaknesses result fr...
Valentin Razmov, Daniel R. Simon