37 search results - page 1 / 8 » Proving the Shalls |
FM
2003
Springer
13 years 9 months ago
2003
Springer
Incomplete, inaccurate, ambiguous, and volatile requirements have plagued the software industry since its inception. The convergence of model-based development and formal methods o...
JCT
2008
13 years 4 months ago
2008
We study packings of graphs with given maximal degree. We shall prove that the (hitherto unproved) Bollob
ISW
2001
Springer
13 years 9 months ago
2001
Springer
We present the adaptation of our model for the validation of key distribution and authentication protocols to address specific needs of protocols for electronic commerce. The two ...
COMBINATORICS
2002
13 years 4 months ago
2002
We shall prove that for all 3 and > 0 there exists a sparse oriented graph of arbitrarily large order with oriented girth and such that any 1/2 + proportion of its arcs induc...
ENDM
2002
13 years 4 months ago
2002
It is well-known that the maximal size of minimally 3-connected graphs of order 7n is 93 -n . In this paper, we shall prove that if G is a minimally 3-connected graph of order n, ...