68 search results - page 10 / 14 » Studying program correctness by constructing contracts |
TCC
2009
Springer
14 years 11 months ago
2009
Springer
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
POPL
2007
ACM
14 years 11 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
IPPS
2006
IEEE
14 years 4 months ago
2006
IEEE
For decades now, the notion of “performance” has been synonymous with “speed” (as measured in FLOPS, short for floating-point operations per second). Unfortunately, this ...
ICST
2009
IEEE
14 years 5 months ago
2009
IEEE
It is challenging to test applications and functions for which the correct output for arbitrary input cannot be known in advance, e.g. some computational science or machine learni...
POPL
2010
ACM
14 years 8 months ago
2010
ACM
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...