5084 search results - page 124 / 1017 » Proving Possibility Properties |
152
click to vote
COMPSAC
2003
IEEE
15 years 10 months ago
2003
IEEE
This paper explores how to characterise security properties of software components, and how to reason about their suitability for a trustworthy compositional contract. Our framewo...
131
click to vote
ICMLA
2009
15 years 3 months ago
2009
Abstract--Many studies have shown the limits of support/confidence framework used in Apriori-like algorithms to mine association rules. One solution to cope with this limitation is...
155
click to vote
COMBINATORICA
2006
15 years 5 months ago
2006
Let T be a fixed tournament on k vertices. Let D(n, T) denote the maximum number of orientations of an n-vertex graph that have no copy of T. We prove that D(n, T) = 2tk-1(n) for ...
151
click to vote
COMBINATORICS
2002
15 years 5 months ago
2002
We prove that the space of possible final configurations for a parking problem is parameterized by the vertices of a regular Bruhat graph associated to a 231-avoiding permutation,...
162
click to vote
SAS
2010
Springer
15 years 3 months ago
2010
Springer
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...