923 search results - page 58 / 185 » Proving the value of formal methods |
163
click to vote
PST
2004
15 years 7 months ago
2004
Abstract-- This work aims at measuring familiarity to contribute to the formalization of trust. Trust has always been bundled with familiarity to become a popular topic in the area...
146
click to vote
ANOR
2008
15 years 6 months ago
2008
We describe a class of problems motivated by numerous real-world applications where there is a collection of objects that have both a cost and a value, but where some of those obj...
147
click to vote
RANDOM
1998
Springer
15 years 10 months ago
1998
Springer
Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower b...
147
click to vote
COMBINATORICS
2002
15 years 6 months ago
2002
Let A3(n, d, w) denote the maximum cardinality of a ternary code with length n, minimum distance d, and constant Hamming weight w. Methods for proving upper and lower bounds on A3...
170
click to vote
SAS
1997
Springer
15 years 10 months ago
1997
Springer
We present a type-based flow analysis for simply typed lambda calculus with booleans, data-structures and recursion. The analysis is exact in the following sense: if the analysis ...