1818 search results - page 255 / 364 » Granularity-Adaptive Proof Presentation |
124
Voted
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a n...
174
Voted
DIM
2006
ACM
15 years 9 months ago
2006
ACM
An emerging approach to the problem of reducing the identity theft is represented by the adoption of biometric authentication systems. Such systems however present however several...
153
Voted
KBSE
2005
IEEE
15 years 9 months ago
2005
IEEE
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...
137
Voted
TPHOL
2005
IEEE
15 years 9 months ago
2005
IEEE
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
150
Voted
PLDI
2003
ACM
15 years 8 months ago
2003
ACM
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...