6800 search results - page 205 / 1360 » Testing with Functions as Specifications |
116
click to vote
QCQC
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...
124
Voted
DISCO
1993
15 years 6 months ago
1993
The fastest known algorithms in classical algebra make use of signature functions. That is, reducing computation with formulae to computing with the integers modulo p, by substitut...
109
click to vote
SIGIR
1992
ACM
15 years 6 months ago
1992
ACM
Our previous research on one-probe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this proble...
123
Voted
ESOP
2009
Springer
15 years 6 months ago
2009
Springer
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
115
Voted
CSL
2004
Springer
15 years 6 months ago
2004
Springer
We consider a scenario where (functional) programs in pre-compiled form are exchanged among untrusted parties. Our contribution is a system of annotations for the code that can be ...