Sciweavers

1894 search results - page 320 / 379
» A TLA Proof System
Sort
View
116
Voted
IPPS
2007
IEEE
15 years 10 months ago
Enhancing Portability of HPC Applications across High-end Computing Platforms
Fast hardware turnover in supercomputing centers, stimulated by rapid technological progress, results in high heterogeneity among HPC platforms, and necessitates that applications...
Magdalena Slawiñska, Jaroslaw Slawinski, Da...
116
Voted
ISVD
2007
IEEE
15 years 10 months ago
From the Kneser-Poulsen conjecture to ball-polyhedra via Voronoi diagrams
A very fundamental geometric problem on finite systems of spheres was independently phrased by Kneser (1955) and Poulsen (1954). According to their well-known conjecture if a fi...
Károly Bezdek
108
Voted
LICS
2007
IEEE
15 years 10 months ago
Static Name Control for FreshML
FreshML extends ML with constructs for declaring and ting abstract syntax trees that involve names and statically scoped binders. It is impure: name generation is an observable si...
François Pottier
142
Voted
BIRTHDAY
2007
Springer
15 years 10 months ago
The Hydra Battle Revisited
Showing termination of the Battle of Hercules and Hydra is a challenge. We present the battle both as a rewrite system and as an arithmetic while program, provide proofs of their t...
Nachum Dershowitz, Georg Moser
138
Voted
CRYPTO
2007
Springer
145views Cryptology» more  CRYPTO 2007»
15 years 10 months ago
Chernoff-Type Direct Product Theorems
Consider a challenge-response protocol where the probability of a correct response is at least α for a legitimate user and at most β < α for an attacker. One example is a CAP...
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab...